A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Steiner tree problem with minimum number of Steiner points and bounded edge-length
Information Processing Letters
Multicast operation of the ad-hoc on-demand distance vector routing protocol
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
A 1.598 approximation algorithm for the Steiner problem in graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Improved Steiner tree approximation in graphs
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Smooth is better than sharp: a random mobility model for simulation of wireless networks
MSWIM '01 Proceedings of the 4th ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Approximations for Steiner Trees with Minimum Number of Steiner Points
Journal of Global Optimization
The Euclidean Bottleneck Steiner Tree and Steiner Tree with Minimum Number of Steiner Points
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
Modeling mobility for vehicular ad-hoc networks
Proceedings of the 1st ACM international workshop on Vehicular ad hoc networks
An evaluation of inter-vehicle ad hoc networks based on realistic vehicular traces
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Data aggregation and roadside unit placement for a vanet traffic information system
Proceedings of the fifth ACM international workshop on VehiculAr Inter-NETworking
Service Scheduling of Vehicle-Roadside Data Access
Mobile Networks and Applications
| Hi-index | 0.00 |
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.