Region-Based Location-Service-Management Protocol for VANETs
Bibliographic record
Abstract
The efficiency by which a node of a vehicular ad hoc network (VANET) can route messages to destinations heavily depends on the VANET's ability to keep track of the locations of its nodes (vehicles). Current location-management schemes lack scalability and, hence, are proven unable to work in large-scale networks. Therefore, location management in VANETs remains a major challenge. In this paper, we propose a new region-based location-service-management protocol (RLSMP) that uses mobility patterns as means to synthesize node movement and, thus, can be used in large VANET applications. The protocol attempts to relax the scalability issue suffered by other protocols by employing message aggregation in location updating and in querying. Furthermore, due to the protocol's intrinsic locality awareness, it achieves minimum control overhead. To evaluate the efficiency of the protocol, we study its performance analytically and by using simulation for a 2-D random-walk model, as well as on real mobility patterns. The performance of the protocol is compared with that of other prominent location-management protocols.
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.003 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 0.001 |
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".