Radio resource allocation for wireless heterogeneous networks
Bibliographic record
Abstract
By deploying small cells (i.e., femtocells) within the same service area of regular macrocells, a much higher area spectral efficiency, better indoor coverage, and significant mobile data offloading can be achieved at low cost.Because femtocells reuse the radio spectrum already assigned to macrocells in an uncoordinated fashion, new cell boundaries are created and the signal interference situation becomes far more unpredictable than in conventional networks.In this heterogeneous network setting, adaptive power allocation and dynamic spectrum access are needed to ensure a harmonized coexistence of network entities with diverse design specifications.Since femtocells are deployed by end users without any network planning, autonomous solutions are desirable to effectively control the severe intra-tier and cross-tier interferences.In this study, we develop and evaluate distributed radio resource allocation algorithms for wireless heterogeneous networks employing code-division multiple access (CDMA) and orthogonal frequency-division multiple access (OFDMA).Requiring no central coordination, the devised solutions robustly protect the ongoing operation of all existing macrocell users, while optimally exploiting the residual network capacity for femtocells.In CDMA-based networks, we propose a dynamic pricing scheme combined with femtocell user admission control to indirectly manage the cross-tier interference.The proposed joint power and admission control algorithms can be locally executed at each link to offer a maximum utility to individual users.For the total network utility maximization, we develop joint Pareto-optimal power control and signal-to-interference-plus-noise ratio (SINR) assignment algorithms that can fairly share radio resources among users.Upon applying convex optimization methods, the minimum SINRs prescribed by macrocell users are effectively enforced, whereas the sum network utility is globally maximized.In OFDMA-based networks, to resolve the highly nonconvex and combinatorial problem of joint power and subchannel allocation, we propose a dynamic spectrum management scheme that alternatively optimizes the powers and assigns the subchannels.With the adopted successive convex approximation approach, the total throughput of all femtocells is maximized whilst the macrocell network capacity is always protected.In cognitive femtocells where femtocell users opportunistically access the spectrum licensed to macrocells, we apply Lagrangian duality to devise jointly optimal power and subchannel allocation algorithms.The distributed solutions are shown to achieve their global optimality with low complexity.
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.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 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".