Intercell Interference Coordination for UAV Enabled URLLC With Perfect/Imperfect CSI Using Cognitive Radio
Bibliographic record
Abstract
Ultra-reliable and low latency communications (URLLC) will be the backbone of the upcoming sixth-generation (6G) systems and will facilitate mission-critical scenarios. A design accounting for stringent reliability and latency requirements for URLLC systems poses a challenge for both industry and academia. Recently, unmanned aerial vehicles (UAV) have emerged as a potential candidate to support communications in futuristic wireless systems due to providing favourable channel gains thanks to Line-of-Sight (LoS) communications. However, usage of UAV in cellular infrastructure increases interference in aerial and terrestrial user equipment (UE) limiting the performance gain of UAV-assisted cellular systems. To resolve these issues, we propose low-complexity algorithms for intercell interference coordination (ICIC) using cognitive radio when single and multi-UAVs are deployed in a cellular environment to facilitate URLLC services. Moreover, we model BS-to-UAV (B2U) interference in downlink communication, whereas in uplink we model UAV-to-BS (U2B), UAV-to-UAV (U2U), and UE-to-UAV (UE2U) interference under perfect/imperfect channel state information (CSI). Results demonstrate that the proposed perfect ICIC accounts for fairness among UAV especially in downlink communications compared to conventional ICIC algorithms. Furthermore, in general, the proposed UAV-sensing assisted ICIC and perfect ICIC algorithms yield better performance when compared to conventional ICIC for both uplink and downlink for the single and multi-UAV frameworks.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.000 | 0.001 |
| 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".