BusCache: V2V-Based Infrastructure-Free Content Dissemination System for the Internet of Vehicles
DOI: 10.1109/ACCESS.2024.3374881
archive: archived pipeline: cataloged verified
Get this paper ↗ (DOI — opens at the source; we link to it, we don't host it)
Summary
This paper addresses the challenge of efficient content dissemination in the Internet of Vehicles (IoV), where high node mobility and volatile network topologies hinder reliable peer-to-peer (P2P) file sharing. Traditional unstructured P2P systems often rely on flooding the network with beacon messages to locate content, which consumes significant bandwidth and increases latency. To overcome these limitations, the authors propose BusCache, an infrastructure-free, traffic-aware content delivery system that leverages public transport buses as stable trackers within the overlay network. By exploiting the predictable trajectories, schedules, and speeds of buses, BusCache aims to reduce end-to-end delay and bandwidth consumption while maintaining network consistency without relying on roadside infrastructure. The BusCache architecture employs a two-layer structure consisting of high-tier tracker nodes (buses) and low-tier content consumer vehicles. The system introduces three core mechanisms: a clustering strategy, a peer selection mechanism, and a policy-based content selection algorithm. Vehicles register with nearby buses, which aggregate tracking information and facilitate content discovery without global flooding. To manage network stability, the system forms clusters of vehicles based on trajectory similarity. Within each cluster, a "super peer" is elected to handle data transfer between the bus and other peers. The selection of the super peer is determined by a weighted metric ($W_{Pi}$) that evaluates connectivity level, average velocity, average distance, and trajectory similarity among peers. This clustering approach reduces the frequency of status updates required to maintain routing paths, thereby conserving network resources. Additionally, the peer selection mechanism considers factors such as velocity, destination, and traffic conditions to identify the most appropriate peers for content delivery, while the content selection algorithm prioritizes scarce content pieces that are available in only a few vehicles. Simulation results demonstrate that BusCache significantly outperforms state-of-the-art approaches in terms of content lookup time and dissemination efficiency. By replacing network-wide flooding with targeted requests to bus trackers, the system effectively reduces bandwidth overhead and latency. The clustering strategy proves effective in maintaining stable overlay connections despite the high churn rate typical of IoV environments. The use of buses as backbone nodes allows for more predictable data routing and reduces the complexity of managing dynamic peer connections. The significance of this work lies in its novel application of public transport infrastructure as a stabilizing element for vehicular P2P networks. BusCache provides a scalable solution for large-scale file sharing in IoV, enhancing the Quality of Experience (QoE) for services such as multimedia entertainment and safety alerts. By minimizing reliance on infrastructure and optimizing peer interactions through trajectory-aware clustering, the system offers a robust framework for content dissemination in highly dynamic vehicular networks. This approach contributes to the broader field of IoV by demonstrating how predictable urban traffic patterns can be leveraged to solve fundamental challenges in wireless ad-hoc networking.
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.
| Stage | Outcome | Tool | Model | Prompt | Attempts | Completed |
|---|---|---|---|---|---|---|
| discover | success | DOAJ | — | — | 1 | 2026-06-24 |
| archive | success | unpaywall | — | — | 1 | 2026-06-26 |
| extract | success | cached | — | — | 2 | 2026-06-26 |
| clean | success | clean | — | — | 1 | 2026-06-25 |
| chunk | success | chunk | — | — | 1 | 2026-06-25 |
| embed | success | embed | Qwen/Qwen3-Embedding-8B | — | 1 | 2026-06-25 |
| promote | success | — | — | — | 1 | 2026-06-24 |
| summarize | success | llm | qwen3.6-27b-prismaquant | summ-v5 | 1 | 2026-06-26 |
| tag | success | vector_similarity | — | — | 6 | 2026-06-25 |
| verify | success | — | — | — | 1 | 2026-06-26 |
Summary generated by qwen3.6-27b-prismaquant on 2026-06-26; verification: verified.
Topics
Ranked by relevance to this paper. Hover a topic for its definition.