An Optimum User Association Algorithm in Heterogeneous 5G Networks Using Standard Deviation of the Load
Bibliographic record
Abstract
Fifth-generation (5G) wireless networks and beyond will be heterogeneous in nature, with a mixture of macro and micro radio cells. In this scenario where high power macro base stations (MBS) coexist with low power micro base stations (mBS), it is challenging to ensure optimal usage of radio resources to serve users with a multitude of quality of service (QoS) requirements. Typical signal to interference and noise ratio (SINR)-based user allocation protocols unfairly assign more users to the high power MBS, starving mBS. There have been many attempts in the literature to forcefully assign users to mBS with limited success. In this paper, we take a different approach using second order statistics of user data, which is a better indicator of traffic fluctuations. We propose a new algorithm for user association to the appropriate base station (BS) by utilizing the standard deviation of the overall network load. This is done through an exhaustive search of the best user equipment (UE)–BS combinations that provide a global minimum to the standard deviation. This would correspond to the optimum number of UEs assigned to every BS, either macro or micro. We have also derived new expressions for coverage probability and network energy efficiency for analytical performance evaluation. Simulation results prove the validity of our proposed methods to balance the network load, improve data rate, average energy efficiency, and coverage probability with superior performance compared with other algorithms.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 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.001 | 0.001 |
| 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".