Optimizing Content Dissemination for Real-Time Traffic Management in Large-Scale Internet of Vehicle Systems
Bibliographic record
Abstract
As an application of “smart transport” for Internet of Things, Internet of Vehicle (IoV) has emerged as a new research field based on vehicular ad hoc networks (VANETs). With the development of smart vehicles and the integration of sensors, applications of traffic management and road safety in large-scale IoV systems have drawn great attentions. By sensing events occurred on roads, vehicles can broadcast messages to inform others about traffic jams or accidents. However, the store-carry-and-forward transmission pattern may cause a large transmission delay, making the implementation of large-scale traffic management difficult. In this paper, we put forward a feasible solution to minimize the response time for traffic management service, by enabling real-time content dissemination based on heterogeneous network access in IoV systems. We first design a crowdsensing-based system model for large-scale IoV systems. Then, a cluster-based optimization framework is investigated to provide timely responses for traffic management. Specifically, we estimate the message transmission delay by stochastic theory, which can provide a guideline for the next-hop relay selection in our delay-sensitive routing scheme. Furthermore, network performances are evaluated based on two city-road maps, and performance metrics, containing average delivery delay, average delivery ratio, average communication cost, and access ratio, demonstrate the superiority of our system. Finally, we conclude our work and discuss the further work.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| 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".