Next Article in Journal
A Wireless Swing Angle Measurement Scheme Using Attitude Heading Reference System Sensing Units Based on Microelectromechanical Devices
Next Article in Special Issue
Analyzing Comprehensive QoS with Security Constraints for Services Composition Applications in Wireless Sensor Networks
Previous Article in Journal
Micro-Raman Spectroscopy for Monitoring Changes in Periodontal Ligaments and Gingival Crevicular Fluid
Previous Article in Special Issue
Dual-Tree Complex Wavelet Transform and Image Block Residual-Based Multi-Focus Image Fusion in Visual Sensor Networks
Open AccessArticle

BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks

by 1,2, 1,* and 1
1
Computer School, Wuhan University, Luo-Jia-Shan Road 16, Wuhan 430072, China
2
College of Computer Science and Technology, Wuhan University of Science and Technology, Heping Road 947, Wuhan 430081, China
*
Author to whom correspondence should be addressed.
Sensors 2014, 14(12), 22564-22594; https://doi.org/10.3390/s141222564
Received: 10 October 2014 / Revised: 21 November 2014 / Accepted: 21 November 2014 / Published: 27 November 2014
(This article belongs to the Special Issue Sensor Computing for Mobile Security and Big Data Analytics)
In vehicular ad hoc networks, roadside units (RSUs) placement has been proposed to improve the the overall network performance in many ITS applications. This paper addresses the budget constrained and delay-bounded placement problem (BCDP) for roadside units in vehicular ad hoc networks. There are two types of RSUs: cable connected RSU (c-RSU) and wireless RSU (w-RSU). c-RSUs are interconnected through wired lines, and they form the backbone of VANETs, while w-RSUs connect to other RSUs through wireless communication and serve as an economical extension of the coverage of c-RSUs. The delay-bounded coverage range and deployment cost of these two cases are totally different. We are given a budget constraint and a delay bound, the problem is how to find the optimal candidate sites with the maximal delay-bounded coverage to place RSUs such that a message from any c-RSU in the region can be disseminated to the more vehicles within the given budget constraint and delay bound. We first prove that the BCDP problem is NP-hard. Then we propose several algorithms to solve the BCDP problem. Simulation results show the heuristic algorithms can significantly improve the coverage range and reduce the total deployment cost, compared with other heuristic methods. View Full-Text
Keywords: roadside unit; facility placement; delay bound; vehicular sensor networks roadside unit; facility placement; delay bound; vehicular sensor networks
Show Figures

Graphical abstract

MDPI and ACS Style

Li, P.; Huang, C.; Liu, Q. BCDP: Budget Constrained and Delay-Bounded Placement for Hybrid Roadside Units in Vehicular Ad Hoc Networks. Sensors 2014, 14, 22564-22594.

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop