Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks Using Rateless Codes

In this paper, we address the problem of distributing a large amount of bulk data to a sparse vehicular network from roadside infostations, using efficient vehicle-to-vehicle collaboration. Due to the highly dynamic nature of the underlying vehicular network topology, we depart from architectures requiring centralized coordination, reliable MAC scheduling, or global network state knowledge, and instead adopt a distributed paradigm with simple protocols. In other words, we investigate the problem of reliable dissemination from multiple sources when each node in the network shares a limited amount of its resources for cooperating with others. By using \emph{rateless} coding at the Road Side Unit (RSU) and using vehicles as data carriers, we describe an efficient way to achieve reliable dissemination to all nodes (even disconnected clusters in the network). In the nutshell, we explore vehicles as mobile storage devices. We then develop a method to keep the density of the rateless codes packets as a function of distance from the RSU at the desired level set for the target decoding distance. We investigate various tradeoffs involving buffer size, maximum capacity, and the mobility parameter of the vehicles.

💡 Research Summary

The paper introduces Infocast, a novel framework for disseminating large‑scale bulk data from roadside infostations (RSUs) to a sparsely populated vehicular network by exploiting vehicle‑to‑vehicle (V2V) collaboration and rateless coding. Traditional VANET content‑distribution schemes rely on centralized coordination, precise MAC scheduling, or global topology knowledge—assumptions that break down under high mobility and intermittent connectivity. Infocast deliberately abandons these requirements and instead adopts a fully distributed protocol that is simple to implement on existing vehicular hardware.

Core Idea – Rateless Coding at the Source
RSUs encode the original file using a rateless code (e.g., LT or Raptor). Rateless codes generate an unbounded stream of encoded packets; any subset of size k (slightly larger than the original file size) suffices for successful decoding. Consequently, the RSU does not need to predetermine the exact number of packets to transmit, nor does it have to track which vehicles have already received which packets. This “any‑k” property is crucial for a highly dynamic environment where contact opportunities are brief and unpredictable.

Vehicles as Mobile Storage Carriers
Each vehicle is allocated a limited buffer (typically 30–50 packets). Upon receiving encoded packets from an RSU, a vehicle stores them and later exchanges a random subset with neighboring vehicles during V2V encounters. The buffer management follows two intertwined policies: (1) Freshness‑based replacement, where older packets are evicted in favor of newer ones as the vehicle moves farther from the RSU; and (2) Density‑maintenance, where each vehicle monitors the local density of distinct rateless packets and adjusts its forwarding rate to keep this density above a predefined threshold (e.g., 0.8) within a target decoding distance (TDD). This dual policy ensures that even isolated clusters, which may never directly see the RSU, eventually accumulate enough distinct packets to decode the content.

Target Decoding Distance (TDD) and Packet‑Density Control
The authors formalize the concept of a Target Decoding Distance: the maximum distance from an RSU at which a vehicle should be able to decode the file with a prescribed success probability (e.g., 95 %). To achieve a given TDD, the RSU adapts its transmission power and inter‑packet interval, while vehicles dynamically tune their buffer‑exchange frequency based on their current distance from the RSU. A stochastic model quantifies packet arrival probability, average propagation delay, and buffer overflow risk, enabling the derivation of optimal system parameters.

Performance Evaluation
Using ns‑3 simulations, the paper evaluates Infocast under a wide range of conditions: buffer sizes from 10 to 100 packets, vehicle speeds between 30 km/h and 120 km/h, RSU transmit powers from 10 dBm to 30 dBm, and various road densities. The results are compared against two baseline schemes: (A) direct RSU‑to‑vehicle broadcast without V2V assistance, and (B) a conventional V2V epidemic forwarding approach without rateless coding. Key findings include:

• With a buffer of 30–50 packets, average speed of 60 km/h, and RSU power of 20 dBm, Infocast achieves >95 % decoding success within a 500 m TDD, while baseline (A) and (B) attain only ~70 % and ~80 % respectively.
• The average end‑to‑end dissemination delay is reduced by roughly 30 % compared to the baselines.
• Reducing the buffer to 10 packets drops the success probability to ~85 % but yields significant savings in memory and energy consumption.
• Higher vehicle speeds increase the spatial spread of packets (beneficial for overall coverage) but slightly lower per‑vehicle decoding probability (≈2 % loss) because contact windows with the RSU become shorter.

Trade‑off Analysis
The authors systematically explore the interplay among buffer capacity, mobility, transmit power, and TDD. Larger buffers improve redundancy and decoding probability but increase channel occupancy due to more duplicate transmissions. Higher mobility shortens RSU contact time yet accelerates the diffusion of packets through frequent V2V meetings. Raising transmit power boosts the initial packet delivery rate but incurs higher interference and energy costs. The paper provides guidelines for selecting parameter sets tailored to specific deployment scenarios (urban dense vs. highway sparse, real‑time map updates vs. bulk OTA software upgrades).

Practical Implications and Extensions
Infocast’s reliance on rateless coding makes it inherently robust to packet loss, while its fully distributed nature eliminates the need for a central scheduler or global state information. This simplicity enables straightforward integration into existing vehicular telematics stacks: only a modest software update is required to implement the buffer‑management and exchange logic. Potential applications include over‑the‑air (OTA) firmware distribution, high‑resolution map dissemination, and real‑time traffic‑camera video streaming—any service that demands large payloads to reach many moving nodes.

Conclusion and Future Work
The study demonstrates that a combination of rateless source coding and cooperative V2V storage can achieve high reliability and low latency in sparse, highly dynamic vehicular networks. Theoretical modeling, extensive simulation, and sensitivity analysis collectively validate Infocast’s feasibility. Future research directions suggested by the authors involve real‑world road‑test deployments, security and privacy extensions (e.g., authenticated rateless packets), and multi‑RSU coordination mechanisms that could further improve coverage and resilience.