Performance Analysis of Unmanned Aerial Vehicle-Assisted and Federated Learning-Based 6G Cellular Vehicle-to-Everything Communication Networks
Bibliographic record
Abstract
The paradigm of cellular vehicle-to-everything (C-V2X) communications assisted by unmanned aerial vehicles (UAVs) is poised to revolutionize the future of sixth-generation (6G) intelligent transportation systems, as outlined by the international mobile telecommunication (IMT)-2030 vision. This integration of UAV-assisted C-V2X communications is set to enhance mobility and connectivity, creating a smarter and reliable autonomous transportation landscape. The UAV-assisted C-V2X networks enable hyper-reliable and low-latency vehicular communications for 6G applications including augmented reality, immersive reality and virtual reality, real-time holographic mapping support, and futuristic infotainment services. This paper presents a Markov chain model to study a third-generation partnership project (3GPP)-specified C-V2X network communicating with a flying UAV for task offloading in a Federated Learning (FL) environment. We evaluate the impact of various factors such as model update frequency, queue backlog, and UAV energy consumption on different types of communication latency. Additionally, we examine the end-to-end latency in the FL environment against the latency in conventional data offloading. This is achieved by considering cooperative perception messages (CPMs) that are triggered by random events and basic safety messages (BSMs) that are periodically transmitted. Simulation results demonstrate that optimizing the transmission intervals results in a lower average delay. Also, for both scenarios, the optimal policy aims to optimize the available UAV energy consumption, minimize the cumulative queuing backlog, and maximize the UAV’s available battery power utilization. We also find that the queuing delay can be controlled by adjusting the optimal policy and the value function in the relative value iteration (RVI). Moreover, the communication latency in an FL environment is comparable to that in the gross data offloading environment based on Kullback–Leibler (KL) divergence.
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.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| 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".