Radio resource coordination and scheduling scheme in ultra-dense cloud-based small cell networks
Bibliographic record
Abstract
In a 5G ultra-dense network, dynamic network topology and traffic patterns lead to excessive system overhead and complex radio resource conflicts. The cloud radio access network and the fog computing have the advantages of high computation capabilities and low transmission delays. Therefore, by taking full advantage of these two characteristics, this study proposes a novel radio resource coordination and scheduling scheme in an ultra-dense cloud-based small cell network. Interference among small cells (or remote radio heads) can be avoided by implementing centralized cooperative processing in the base band unit pool in advance. Resource sharing in coordination and transfer depend on fog computing to relieve the overloaded cloud processing platform and reduce transmission delays, thereby maximizing resource utilization and minimizing system overhead when the network topology and number of users change dynamically. The simulation shows that the proposed scheme can increase the system throughput by 20% compared with the clustering-based algorithm; it can also increase system throughput by 33% compared with the graph coloring algorithm, decrease the signaling overhead by about 50%, and improve network’s quality of service.
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.001 | 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.001 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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".