Joint position optimization, user association, and resource allocation for load balancing in UAV-assisted wireless networks
Bibliographic record
Abstract
Unbalanced traffic distribution in cellular networks results in congestion and degrades spectrum efficiency. To tackle this problem, we propose an Unmanned Aerial Vehicle (UAV)-assisted wireless network in which the UAV acts as an aerial relay to divert some traffic from the overloaded cell to its adjacent underloaded cell. To fully exploit its potential, we jointly optimize the UAV position, user association, spectrum allocation, and power allocation to maximize the sum-log-rate of all users in two adjacent cells. To tackle the complicated joint optimization problem, we first design a genetic-based algorithm to optimize the UAV position. Then, we simplify the problem by theoretical analysis and devise a low-complexity algorithm according to the branch-and-bound method, so as to obtain the optimal user association and spectrum allocation schemes. We further propose an iterative power allocation algorithm based on the sequential convex approximation theory. The simulation results indicate that the proposed UAV-assisted wireless network is superior to the terrestrial network in both utility and throughput, and the proposed algorithms can substantially improve the network performance in comparison with the other schemes.
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.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 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".