Adaptive Handover Management in High-Mobility Networks for Smart Cities
Bibliographic record
Abstract
The seamless handover of mobile devices is critical for maximizing the potential of smart city applications, which demand uninterrupted connectivity, ultra-low latency, and performance in diverse environments. Fifth-generation (5G) and beyond-5G networks offer advancements in massive connectivity and ultra-low latency by leveraging advanced technologies like millimeter wave, massive machine-type communication, non-orthogonal multiple access, and beam forming. However, challenges persist in ensuring smooth handovers in dense deployments, especially in higher frequency bands and with increased user mobility. This paper presents an adaptive handover management scheme that utilizes reinforcement learning to optimize handover decisions in dynamic environments. The system selects the best target cell from the available neighbor cell list by predicting key performance indicators, such as reference signal received power and the signal–interference–noise ratio, while considering the fixed time-to-trigger and hysteresis margin values. It dynamically adjusts handover thresholds by incorporating an offset based on real-time network conditions and user mobility patterns. This adaptive approach minimizes handover failures and the ping-pong effect. Compared to the baseline LIM2 model, the proposed system demonstrates a 15% improvement in handover success rate, a 3% improvement in user throughput, and an approximately 6 sec reduction in the latency at 200 km/h speed in high-mobility scenarios.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".