A Robust Clustering Scheme for Vehicular Communication Networks
Bibliographic record
Abstract
Clustering, as a technique for grouping nodes in geographical proximity together, in vehicular communication networks, is a key technique to enhance network robustness and scalability despite challenges such as mobility and routing. This paper presents a robust clustering scheme based on cluster head backup list algorithm for unmanned aerial vehicles (UAVs)-assisted vehicular communication network, where multiple UAVs act as communication base stations for a vehicular network. To tackle the high mobility issues in vehicular communications, instead of allowing direct communication between all vehicles to the UAV, clustering methods will potentially be efficient in overcoming delay limitations, excessive power consumption and resource issues. Using the clustering technique, neighboring vehicles are grouped into clusters with a specific vehicle selected as the cluster head (CH) in each cluster. The selected CH connects directly to the UAV through an infrastructure-to-vehicle (I2V) link, subsequently establishing vehicle-to-vehicle (V2V) communications with vehicles in the same cluster. To increase cluster connectivity period, the proposed clustering scheme is developed based on considering the vehicle behavior for efficient selection of CHs and providing a CH backup list to maintain the stability of the cluster structure. Numerical evaluations show that the proposed system outperforms benchmark schemes in terms of clustering stability and reliability. It is also shown that the performance of the proposed scheme is not much affected by the increase in the number of vehicles. This indicates that the proposed scheme can be efficient in dense vehicular networks where resource constraints pose significant challenges.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".