With the development of the vehicular communications technology, roadside units (RSUs) placement problem has recently received considerable attentions in vehicular ad hoc networks (VANETs). This paper addresses the roadside units (RSUs) placement problem for traffic flow coverage requirement number in vehicular ad hoc networks (VANETs). Given a set of road segments, some traffic flows and a coverage requirement number n, the problem is how to find the optimal placement of RSUs, such that each traffic flow is covered by at least n RSUs. We first investigate full RSUs placement problem, which place all the RSUs on the given road segments totally. We prove that this problem is NP-hard. Then, we propose a greedy algorithm to solve the problem and theoretical analysis is given. We also study incremental RSUs placement problem, which place the partial RSUs based on the deployed RSUs on the given road segments. Based on the proposed greedy algorithm, we also propose a algorithm to solve the incremental RSUs placement problem. Extensive simulations have been conducted to show the performance of our proposed algorithms is superior to the other algorithms.
Roadside Units Placement for Traffic Flows Coverage Requirement in Vehicular Networks
01.09.2018
286820 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Hybrid Roadside Devices Placement for Advertisement Disseminations in Vehicular CPS
Springer Verlag | 2017
|Optimal Connectivity-Based Deployment of Roadside Units for Vehicular Networks in Urban Areas
Transportation Research Record | 2016
|