Information Flow in One-Dimensional Vehicular Ad Hoc Networks
Chi Wan Sung, Kenneth W. Shum, Wing Ho Yuen

TL;DR
This paper analyzes content distribution in vehicular networks, demonstrating linear scalability with user count and showing that increased vehicle speed reduces overall system throughput.
Contribution
It introduces a model for vehicular content distribution using fountain codes and analyzes the impact of mobility on throughput, revealing key scalability and mobility effects.
Findings
System throughput increases linearly with number of vehicles.
Higher vehicle speeds decrease system throughput.
Mobility negatively impacts data dissemination efficiency.
Abstract
We consider content distribution in vehicular ad hoc networks. We assume that a file is encoded using fountain code, and the encoded message is cached at infostations. Vehicles are allowed to download data packets from infostations, which are placed along a highway. In addition, two vehicles can exchange packets with each other when they are in proximity. As long as a vehicle has received enough packets from infostations or from other vehicles, the original file can be recovered. In this work, we show that system throughput increases linearly with number of users, meaning that the system exhibits linear scalability. Furthermore, we analyze the effect of mobility on system throughput by considering both discrete and continuous velocity distributions for the vehicles. In both cases, system throughput is shown to decrease when the average speed of all vehicles increases. In other words,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMobile Ad Hoc Networks · Opportunistic and Delay-Tolerant Networks · Caching and Content Delivery
