title: BCDP: Budget constrained and delay-bounded placement for hybrid roadside units in vehicular ad hoc networks.
abstract: 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.
authors.affiliation: Computer School, Wuhan University, Luo-Jia-Shan Road 16, Wuhan 430072, China. lip@whu.edu.cn.
authors.forename: Peng
authors.initials: P
authors.lastname: Li
authors.affiliation: Computer School, Wuhan University, Luo-Jia-Shan Road 16, Wuhan 430072, China. huangch@whu.edu.cn.
authors.forename: Chuanhe
authors.initials: C
authors.lastname: Huang
authors.affiliation: Computer School, Wuhan University, Luo-Jia-Shan Road 16, Wuhan 430072, China. qinliu@whu.edu.cn.
authors.forename: Qin
authors.initials: Q
authors.lastname: Liu