Integrated Robotic Aerial Base Stations Deployment and Backhaul Design in 6G Multihop Networks
Bibliographic record
Abstract
To overcome the limited endurance of traditional unmanned aerial vehicles (UAVs), we propose a network of robotic aerial base stations (RABSs) that can energy-efficiently anchor into tall urban landforms, such as lampposts. This approach enables the creation of a hyper-flexible wireless multi-hop network, designed to support green, densified, and dynamic network requirements, thereby ensuring reliable long-term coverage for the whole observed region. The proposed network infrastructure can concurrently address the backhaul link capacity bottleneck and support access link traffic demand in the millimeter-wave (mmWave) frequency band. Specifically, the RABSs grasping locations, resource blocks (RBs) assignment, and route flow control are simultaneously optimized to maximize the served traffic demands. The group of RABSs capitalizes on the fact that traffic distribution varies considerably across both time and space within a given geographical area. Hence, they are able to relocate to suitable locations, i.e., ‘follow’ the traffic demand as it unfolds to increase the overall network efficiency. To tackle the curse of dimensionality of the proposed mixed-integer problem, we propose a greedy algorithm to obtain a competitive solution with low computational complexity. A wide set of numerical investigations reveals that RABSs could improve the served traffic demand. For instance, compared to networks with randomly deployed fixed small cells, the proposed mode serves at most 65% more traffic demand.
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 distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| 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.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".