Energy-efficient roadside unit scheduling for maintaining connectivity in vehicle ad-hoc network

Vehicle Ad-hoc Network (VANET) is a type of mobile ad-hoc networks with highly dynamic topology. To address its frequent network partition issue, recently a special kind of infrastructure called the Roadside Unit (RSU) is proposed to be deployed along the road to improve the VANET connectivity. In this paper, we study the energy saving problem in RSU scheduling. Given a set of deployed RSUs, our objective is to find the optimal schedule of turning them on and off within a given time period so that the overall energy consumption of RSUs in the system is minimized while the network connectivity is still maintained. We divide this problem into two subproblems called the snapshot scheduling problem and the snapshot selection problem. The snapshot scheduling problem decides the minimum number of active RSUs needed for a snapshot of the VANET at a given time point, while the snapshot selection problem decides a sequence of time points on which the snapshot must be updated. By addressing these two subproblems, we present a complete solution for our energy-efficient RSU scheduling. We present our theoretical analysis and experimental results to show that our algorithms can achieve a significant energy saving while still maintaining the VANET connectivity.

[1]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[2]  Jing Zhao,et al.  Service Scheduling of Vehicle-Roadside Data Access , 2010, Mob. Networks Appl..

[3]  Lusheng Wang,et al.  The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points , 2001, COCOON.

[4]  Guohui Lin,et al.  Steiner Tree Problem with Minimum Number of Steiner Points and Bounded Edge-Length , 1999, Inf. Process. Lett..

[5]  Hans Jürgen Prömel,et al.  A 1.598 approximation algorithm for the Steiner problem in graphs , 1999, SODA '99.

[6]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[7]  Lusheng Wang,et al.  Approximations for Steiner Trees with Minimum Number of Steiner Points , 2000, Theor. Comput. Sci..

[8]  Thomas R. Gross,et al.  An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces , 2006, MobiHoc '06.

[9]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[10]  Dhawal Balkrishna Moghe,et al.  Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking , 1998, MobiCom 1998.

[11]  Alex Zelikovsky,et al.  Improved Steiner tree approximation in graphs , 2000, SODA '00.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[14]  Piotr Berman,et al.  Improved approximations for the Steiner tree problem , 1992, SODA '92.

[15]  Amit Kumar Saha,et al.  Modeling mobility for vehicular ad-hoc networks , 2004, VANET '04.

[16]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[17]  Christian Wewetzer,et al.  Data aggregation and roadside unit placement for a vanet traffic information system , 2008, VANET '08.

[18]  Christian Bettstetter,et al.  Smooth is better than sharp: a random mobility model for simulation of wireless networks , 2001, MSWIM '01.