Authors: Chi Wan Sung; Kenneth W. Shum; Wing Ho Yuen
Addresses: Department of Electronic Engineering, City University of Hong Kong, Tat Chee Ave, Kowloon, Hong Kong. ' Institute of Network Coding, The Chinese University of Hong Kong, Shatin, Hong Kong. ' Rutgers, The State University of New Jersey, Technology Centre of New Jersey, 671 Route 1 South, North Brunswick, NJ 08902-3390, USA
Abstract: We consider content distribution in a one-dimensional vehicular ad hoc network. 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 derive closed-form expressions for the average per-node throughput, under both discrete and continuous velocity distributions for the vehicles. Our result shows that the average per-node throughput can be expressed as a linear function of the densities of different classes of nodes in the highway. This result implies that the average per-node throughput scales linearly with vehicle arrival rate, and the average system throughput scales quadratically with vehicle arrival rate. Besides, system throughput reduces when overall mobility increases.
Keywords: vehicular ad hoc networks; VANETs; throughput; fountain codes; mobility; vehicle communications.
International Journal of Systems, Control and Communications, 2012 Vol.4 No.3, pp.150 - 163
Published online: 21 Aug 2012 *Full-text access for editors Access for subscribers Purchase this article Comment on this article