Efficient Route Planning Using Temporal Reliance of Link Quality for Highway IoV Traffic Environment
Bibliographic record
Abstract
Intermittently connected vehicular networks, terrain of the highway, and high mobility of the vehicles are the main critical constraints of highway IoV (Internet of Vehicles) traffic environment. These cause GPS outage problem and the existence of short-lived wireless mobile links that reduce the performance of designed routing approaches. Nevertheless, geographic routing has attracted a lot of attention from researchers as a potential means of accurate and efficient information delivery. Various distance-based routing protocols have been proposed in the literature, with an emphasis on restricting the forwarding area to the next forwarding vehicle. Many of these protocols have issues with significant one-hop link disconnection, long end-to-end delays, and low throughput even at normal vehicle speeds in high-vehicular-density environments due to frequently interrupted wireless links. In this paper, an efficient geocast routing (EGR) approach for highway IoV–traffic environment considering the shadowing fading condition is proposed. In EGR, a geometrical localization for GPS outage problem and a temporal link quality estimation model considering underlying vehicular movement have been proposed. Geocast routing to select a next forwarding vehicle from forward region by utilizing temporal link quality is proposed for four different scenarios. To evaluate the effectiveness and scalability of EGR, a comparative performance evaluation based on simulations has been performed. It is clear from the analysis of the results that EGR performs better than state-of-the-art approaches in highway traffic environment in terms of handling the problem of wireless communication link breakage and throughput, as well as ensuring the faster delivery of the messages.
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.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| 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".