• 中国计算机学会会刊
  • 中国科技核心期刊
  • 中文核心期刊

J4 ›› 2012, Vol. 34 ›› Issue (1): 1-10.

• 论文 •     Next Articles

An Optimized RSU Scheduling Scheme for the Connectivity Problem in the HighlyPartitioned VANET

ZOU Feng1,ZHONG  Jiaofei2,WU Weili2,DU Dingzhu2,Lee Junghoon3   

  1. (1.Real Time Resolutions Inc.,Dallas 75235,USA;
    2.Department of Computer Science,University of Texas at Dallas,Dallas 75080,USA;
    3.Department of Computer Science and Statistics,Jeju National University,Jeju 690756,Korea)
  • Received:2011-05-20 Revised:2011-10-26 Online:2012-01-25 Published:2012-01-25

Abstract:

Vehicle Adhoc Network (VANET) is a mobile adhoc network with the feature of highly dynamic topology. Recently, a special type of infrastructure called Roadside Unit (RSU) has been proposed to deal with the frequent network partitioning issue of VANET, which is deployed along the road to improve the VANET connectivity. In this paper, we mainly focus on how to save energy in the RSU scheduling problem. Our objective is to find the optimal scheduling to turn on or turn off the deployed RSUs within the system during a given time period, so that the overall energy consumption of these RSUs is minimized while the network connectivity is maintained. In order to solve this problem, we divide it into two subproblems, namely the snapshot scheduling problem and the snapshot selection problem. The former problem decides the minimum number of active RSUs required in a VANET snapshot at a given time point, while the latter problem decides the sequence of time points at which the snapshot must be updated. By solving these two subproblems, we present a complete solution to our RSU scheduling problem. Theoretical analysis and experimental results confirm the efficiency of our algorithms, which achieve significant improvement in energy saving while maintaining the VANET connectivity.

Key words: vehicle adhoc network;RSU scheduling;optimization;energy saving