Mobility and Location-Aware Stable Clustering Scheme for UAV Networks
Bibliographic record
Abstract
In Unmanned Aerial Vehicle (UAV) networks, mobility of the UAV and the corresponding network dynamics cause frequent network adaptation. One key challenge caused by this in Flying Ad-hoc Network (FANET) is how to maintain the link stability such that both the packet loss rate and network latency can be reduced. Clustering of UAVs could effectively improve the performance of large-scale UAV swarm. However, the use of conventional clustering schemes in dynamic and high mobility FANET will lead to more link outages. Besides, frequent updates of cluster structure would cause the instability of network topology and the increase of control overhead and latency. To solve this problem, we propose a location-based $k$ -means UAV clustering algorithms by incorporating the mobility and relative location of the UAVs to enhance the performance and reliability of the UAV network with limited resource. The objective of the proposed Mobility and Location-aware Stable Clustering (MLSC) mechanism is to enhance the stability and accuracy of the network by reducing unnecessary overheads and network latency through incorporating several design factors with minimum resource constraints. Furthermore, we derive the relationship between the maximum coverage probability of Cluster Head (CH) and cluster size to find the optimal cluster size to minimize the network overhead. Our simulation results show that the proposed MLSC scheme significantly reduces the network overheads, and also improves packet delivery ratio and network latency as compared to the conventional clustering methods.
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.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".