Efficient routing for safety applications in vehicular networks.
archive: archived pipeline: cataloged verified
Get this paper ↗ (full text — opens at the source; we link to it, we don't host it)
Summary
This paper addresses the challenge of efficient routing in vehicular ad hoc networks (VANETs), specifically for safety-critical applications. The authors identify that traditional routing protocols are ineffective in this environment due to high node mobility and intermittent connectivity, which render proactive and reactive path establishment useless. While flooding-based approaches like epidemic routing ensure message delivery, they generate excessive channel contention and waste resources. The research aims to design a routing protocol that balances low transmission overhead with high reliability and low latency, tailored to the unique characteristics of vehicular networks. To solve this, the authors propose "Spray and Wait" and "Spray and Focus" routing schemes. These mobility-assisted protocols operate in two phases: a spray phase, where a source distributes a bounded number of message copies ($L$) to distinct relay vehicles, and a wait or focus phase, where relays carry the messages toward the destination. The paper provides analytical derivations to determine the optimal number of copies ($L$) required to meet specific delay constraints, showing that $L$ depends primarily on the total number of nodes ($M$) rather than network size or transmission range. Because $M$ is often unknown in VANETs, the authors develop an online algorithm to estimate $M$ using inter-meeting time statistics, correcting for node coupling effects. Additionally, they introduce a Time-Variant Community (TVC) mobility model to capture realistic human-driven vehicle movement patterns. The study evaluates these schemes through theoretical analysis and discrete-event simulations, comparing them against epidemic routing, randomized flooding, and utility-based flooding. Results demonstrate that Spray and Wait significantly outperforms flooding-based methods by generating an order of magnitude fewer transmissions while achieving comparable or better delivery delays. Under high traffic loads, Spray and Wait maintains low contention and superior delay performance, whereas epidemic routing suffers from severe delays and low delivery ratios. The analysis further reveals that the protocol is highly scalable; as the number of nodes increases, the percentage of nodes required to act as relays to maintain performance decreases. The "Spray and Focus" variant, which uses utility-based timers to route copies more intelligently after the spray phase, offers additional performance gains in scenarios with localized mobility. The significance of this work lies in providing a practical, efficient routing framework for VANETs that supports real-time safety applications without overwhelming the wireless channel. By decoupling transmission count from network size and offering methods to adapt to unknown network parameters, the proposed spraying schemes offer a robust solution for intermittently connected, high-mobility environments. The findings suggest that bounded-copy strategies are superior to flooding for vehicular networks, enabling reliable communication with minimal resource consumption.
Key finding
Spray and Wait routing reduces total transmissions by an order of magnitude compared to epidemic routing while achieving delivery delays 1.4 to 3.3 times faster across varying traffic loads and connectivity levels.
Methodology
modeling
Provenance
The full processing record for this entry. Every stage of this paper's journey through the pipeline is logged — what ran, with which tool and model, how many attempts it took, and when it last completed. Discovered via bulk_ingest_rosap on 2026-05-23 (6 acquisition events logged).
| Stage | Outcome | Tool | Model | Prompt | Attempts | Completed |
|---|---|---|---|---|---|---|
| discover | success | rosap | — | — | 2 | 2026-05-23 |
| archive | success | — | — | — | 1 | 2026-05-23 |
| extract | success | cached | — | — | 2 | 2026-06-10 |
| clean | success | — | — | — | 1 | 2026-06-01 |
| chunk | success | — | — | — | 1 | 2026-06-01 |
| embed | success | — | — | — | 1 | 2026-06-02 |
| enrich | success | — | — | — | 1 | 2026-05-23 |
| promote | success | — | — | — | 1 | 2026-05-23 |
| summarize | success | llm | qwen3.6-27b-prismaquant | summ-v5 | 3 | 2026-06-10 |
| tag | success | vector_similarity | — | — | 24 | 2026-06-11 |
| verify | success | — | — | — | 2 | 2026-06-10 |
Summary generated by qwen3.6-27b-prismaquant on 2026-06-10; verification: verified.
Topics
Ranked by relevance to this paper. Hover a topic for its definition.