Optimizing Cell Association and Stability in Integrated Aerial-to-Ground Next-Generation Consumer Wireless Networks
Bibliographic record
Abstract
Unmanned aerial vehicles (UAVs) offer advantages in serving as aerial small cells (ASCs) to support public safety terrestrial cells (PSTCs) while providing pervasive coverage during disasters. To ensure reliable communications for long-term evolution-based public safety (PS-LTE) users, it is crucial to obtain an accurate understanding of network performance for practical cell association design and network stability. This comprehension is vital for the practical design of cell associations and for maintaining network stability in next-generation consumer wireless networks. For this purpose, we first employ a flexible biased cell association (FBCA) policy that optimally selects the bias factor where a PS-LTE user (PUE) connects to the eNodeB (eNB) giving the maximum power for the received signal. Then, we present a resource allocation and subframe-type selection by formulating stochastic optimization programming to resolve system stability issues in the coexisting PS-LTE andLTE-based high-speed railway (LTE-R) networks and PS-LTE and UAV networks. In addition to this, we employ the Lyapunov optimization technique to seek an optimal almost blank subframe (ABS) algorithm with dynamic delay-aware resource allocation (ADDRA) to resolve the problem of network stability. Using ADDRA, the PS-LTE eNodeB (PSeNB), the aerial eNodeBs (AeNBs), and the LTE-R eNodeBs (ReNBs) obtain up-to-date queues of attached users and accordingly compute a matrix for scheduling resources based on channel state information (CSI) feedback. The simulation results of the UAV-assisted networks using FBCA and ADDRA in coexisting PS-LTE/LTE-R and PS-LTE/UAV networks demonstrate a significant improvement when compared with other state-of-the-art techniques.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 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".