Localization Prediction in Vehicular Ad Hoc Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Localization systems play a major role in many applications for vehicular ad hoc networks (VANETs). One of the most interesting problems to be solved in vehicular networks is how to provide anywhere and anytime highly accurate and reliable localization information. Unique characteristics of VANETs such as mobility constraints, driver's behavior, and the highspeed displacement nature of vehicles cause rapid and constant changes in network topology, leading to dissemination of outdated localization information. To circumvent this problem, an alternative is the use of predicted future locations of vehicles. The main idea of this approach is to use the localization prediction as an extension of a data fusion localization system. In such an approach, a future position of a vehicle is predicted for a given future time and used to take advantage of a future time-space window of a vectorial trajectory rather than a static localization point. In this paper, we discuss this subject by studying and analyzing the use of localization prediction as natural way to improve VANET applications. We survey proposed approaches for localization, target tracking, and time series prediction techniques that can be used to estimate the future position of a vehicle. We also highlight their advantages and disadvantages through an analytical discussion visualizing its potential application scenarios in VANETs. We present a set of experiments that show the results of such techniques when applied to a realistic VANET scenario <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1</sup> .
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.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| 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 it