Design of low-latency communication network for power system automation based on 5G technology
Bibliographic record
Abstract
With the construction and development of new power system, grid business presents high reliability, high security protection, high flexibility, massive access level characteristics, 5G as the frontier technology of wireless network access, with high speed, wide connectivity, low latency features and advantages, and diversified grid business communication needs are highly compatible.Based on the characteristics of 5G communication technology, this paper analyzes its practicality in the power system.The main two protocols of the current autonomous network routing protocol for power system are proposed, and the inter-cluster routing optimization of OLSR is carried out by using AO algorithm.Simulate the predation behavior of skyhawk, develop the search strategy in the optimization process of AO algorithm, and construct the mathematical model of AO optimization algorithm.A quasi-inverse solution is used on the basis of the inverse solution to further increase the population diversity and convergence speed of the AO algorithm, while an adaptive weight factor strategy is used to balance the global search and local exploration capabilities of the AO algorithm.Simulation experiments are utilized to investigate the performance of the IAO algorithm as well as the PDR and delay in the mobile scenario of the power system.Comparing the PDR of the three protocols at different expected delivery distances, IOLSR still maintains a delivery rate of about 28% at a distance of 350m-500m.The optimized IOLSR shows further reduction in delay compared to OLSR in most of the cases with an average delay of 10829.43ns.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".