Hybrid Radio Resource Management for Time-Varying 5G Heterogeneous Wireless Access Network
Bibliographic record
Abstract
In this paper, we explore radio resource management for a time-varying 5G heterogeneous wireless access network that includes multi-RATs such as 5G new radio (NR) and long-term evolution (LTE). To cope with the practical challenges of a centralized approach such as signalling overhead and computational complexity, we decomposed the process of radio resource management into three parts, 1) RAT selection, 2) optimal radio resource allocation, and 3) congestion control. RAT selection is performed by each user device with network assistance, whereas the problem of radio resource allocation and congestion control is formulated as a stochastic optimization problem. Maintaining network stability, the average throughput utility is maximized subject to admission control and resource allocation. By using Lyapunov optimization, this utility maximization problem is decomposed into two subproblems. Radio resource allocation policy implemented at the central controller node allocates resources at each time slot using the Lagrange dual method, whereas the process of congestion control is carried out at user end based on throughput adaptation according to its current channel conditions. The theoretical and simulation results evaluate the performance of our proposed approach under the assumption of network stability. Simulation results related to individual users throughput and queue length, and performance comparison of equal power and adaptive power allocation techniques, are presented to depict the effectiveness of our proposed scheme. Furthermore, our proposed RAT selection scheme performs better than the traditional centralized and distributive mechanisms.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 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.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".