Resource Allocation for Ultra-Dense Networks: A Survey, Some Research Issues and Challenges
Bibliographic record
Abstract
Driven by the explosive data traffic and new quality of service requirement of mobile users, the communication industry has been experiencing a new evolution by means of network infrastructure densification. With the increase of the density as well as the variety of access points (APs), the network benefits from proximal transmissions and increased spatial reuse of system resources, thus introducing a new paradigm named ultra-dense networks (UDNs). Since the limited available resources are shared by ubiquitous APs in UDNs, the demand for efficient resource allocation schemes becomes even more compelling. However, the large scale of UDNs impedes the exploration of effective resource allocation approaches particularly on the computational complexity and significance overhead or feedback. In this paper, we provide a survey-style introduction to resource allocation approaches in UDNs. Specifically, we first present some common scenarios of UDNs with the relevant special issues. Second, we provide a taxonomy to classify the resource allocation methods in the existing literatures. Then, to alleviate the main difficulties of UDNs, some prevailing and feasible solutions are elaborated. Next, we present some emerging technologies thriving UDNs with special RA features discussed. Additionally, the challenges and open research directions are outlined in this field.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".