Proposal and analysis of adaptive mobility management in ip-based mobile networks
Bibliographic record
Abstract
Efficient mobility management is one of the major challenges for next-generation mobile systems. Indeed, a mobile node (MN) within an access network may cause excessive signaling traffic and service disruption due to frequent handoffs. The two latter effects need to be minimized to support quality of service (QoS) requirements of emerging multimedia applications. In this paper, we propose a new adaptive micromobility management scheme designed to track efficiently the mobility of nodes so as to minimize both handoff latency and total signaling cost while ensuring the MN's QoS requirements. We introduce the concept of residing area. Accordingly, the micromobility domain is divided into virtual residing areas where the MN limits its signaling exchanges within this local region instead of communicating with the relatively far away root of the domain at each handoff occurrence. A key distinguishing feature of our solution is its adaptive nature since the virtual residing areas are constructed according to the current network state and the QoS constraints. To evaluate the efficiency of our proposal, we compare our scheme with existing solutions using both analytical and simulation approaches for the 2-D random walk model as well as real mobility patterns. Numerical and simulation results show that our proposed scheme can significantly reduce registration updates and link usage costs and provide low handoff latency and packet loss rate under various 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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".