Cloud Assisted Resource Management for Hyper-Dense Small Cell Networks
Bibliographic record
Abstract
Hyper-dense deployment of small cells and reuse of available spectrum resources within a wireless cellular network are two promising techniques that can enhance network capacity to satisfy the ever increasing demand for high volumes of mobile data traffic. With the use of these techniques in a network, the network is prone to severe co-channel interference (CCI), due to short distances between the densely deployed small cells. Therefore, to avoid degradation of the network capacity, it is necessary to manage CCI by jointly allocating resources of the small cells. Further, the resource allocation scheme should minimize the computational burden for low-cost small cell base stations (BSs), be able to adapt to time-varying network load conditions, and reduce signaling overhead in the small cell backhauls with limited capacity. To this end, in this paper we present a resource allocation scheme which operates on two time-scales and utilizes cloud computing to determine resource allocation decisions. The resource allocation decisions are made at the cloud in a slow time-scale, and are further optimized at the BSs in a fast time-scale in order to adapt the decisions to fast varying wireless channel conditions. Achievable network capacity enhancements using the proposed scheme are demonstrated through simulation results.
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.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 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".