A Hybrid User Mobility Prediction Approach for Handover Management in Mobile Networks
Bibliographic record
Abstract
Mobile networks are expected to face major problems such as low network capacity, high latency, and limited resources but are expected to provide seamless connectivity in the foreseeable future. It is crucial to deliver an adequate level of performance for network services and to ensure an acceptable quality of services for mobile users. Intelligent mobility management is a promising solution to deal with the aforementioned issues. In this context, modeling user mobility behaviour is of great importance in order to extract valuable information about user behaviours and to meet their demands. In this paper, we propose a hybrid user mobility prediction approach for handover management in mobile networks. First, we extract user mobility patterns using a mobility model based on statistical models and deep learning algorithms. We deploy a vector autoregression (VAR) model and a gated recurrent unit (GRU) to predict the future trajectory of a user. We then reduce the number of unnecessary handover signaling messages and optimize the handover procedure using the obtained prediction results. We deploy mobility data generated from real users to conduct our experiments. The simulation results show that the proposed VAR-GRU mobility model has the lowest prediction error in comparison with existing methods. Moreover, we investigate the handover processing and transmission costs for predictive and non-predictive scenarios. It is shown that the handover-related costs effectively decrease when we obtain a prediction in the network. For vertical handover, processing cost and transmission cost improve, respectively, by 57.14% and 28.01%.
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.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".