Characterizing Urban Vehicle-to-Vehicle Communications for Reliable Safety Applications
Bibliographic record
Abstract
The IEEE 802.11p-based dedicated short range communication (DSRC) is essential to enhance driving safety and improve road efficiency by enabling rapid cooperative message exchanging. However, there is a lack of good understanding on the DSRC performance in urban environments for vehicle-to-vehicle (V2V) communications, which impedes its reliable and efficient application. In this paper, we first conduct intensive data analytics on V2V performance, based on a large amount of real-world DSRC communications trace collected in Shanghai city, and obtain several key insights as follows. First, among many context factors, the non-line-of-sight (NLoS) link condition is the major factor degrading V2V performance. Second, the durations of line-of-sight (LoS) and NLoS transmission conditions follow power law distributions, which indicate that the probability of experiencing long LoS/NLoS conditions both could be high. Third, the packet inter-reception (PIR) time distribution follows an exponential distribution in the LoS conditions but a power law in the NLoS conditions, which means that the consecutive packet reception failures rarely appear in the LoS conditions but can constantly appear in the NLoS conditions. Based on these findings, we propose a context-aware reliable beaconing scheme, called CoBe, to enhance the broadcast reliability for safety applications. The CoBe is a fully distributed scheme, in which a vehicle first detects the link condition with each of its neighbors by machine learning algorithms, then exchanges such link condition information with its neighbors, and finally selects the minimal number of helper vehicles to rebroadcast its beacons to those neighbors in bad link condition. To analyze and evaluate the CoBe performance, a two-state Markov chain is devised to model beaconing behaviors. The extensive trace-driven simulations are conducted to demonstrate the efficacy of CoBe.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 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".