A Seamless Mobility Management Protocol in 5G Locator Identificator Split Dense Small Cells
Bibliographic record
Abstract
Network densification with Small Cells (SCs) has emerged as a key technique to increase the 5G network capacity. However, in a densified network, fast mobile nodes will experience frequent handovers with a high signaling load, handover latency, and packet loss, due to the short cell radius. Indeed, Distributed Mobility Management (DMM) protocols aim to solve the shortcomings of centralized mobility management solutions such as poor scalability and non-optimal routing. However, when the cell residence time is short, DMM protocols might suffer from increased costs and limited performance. This paper proposes a localized mobility management protocol in 5G dense SCs, based on the locator identifier separation protocol, local mobility anchoring, and fast handovers concepts. The proposed scheme divides a local domain into several location service areas, each controlled by a local anchor. We provide the analytical models of several handover metrics, namely the average total signaling cost, the data delivery cost, the handover latency, and the packet loss. Numerical and simulation results show significant cost savings, up to 30 percent in signaling overhead, up to 53 percent of packet loss, and up to 90 percent of processing load reduction at the core of the network compared to the existing lisp mobile node protocol.
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.000 | 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.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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".