Abstract
As an auxiliary facility, roadside units (RSUs) can well improve the shortcomings incurred by ad hoc networks and promote network performance in a vehicular ad hoc network (VANET). However, deploying a large number of RSUs will lead to high installation and maintenance costs. Therefore, trying to find the best locations is a key issue when deploying RSUs with the set delay and budget. In this paper, we study the delay-bounded and cost-limited RSU deployment (DBCL) problem in urban VANET. We prove it is non-deterministic polynomial-time hard (NP-hard), and a binary differential evolution scheme is proposed to maximize the number of roads covered by deploying RSUs. Opposite-based learning is introduced to initialize the first generation, and a binary differential mutation operator is designed to obtain binary coding. A random variable is added to the traditional crossover operator to increase population diversity. Also, a greedy-based individual reparation and promotion algorithm is adopted to repair infeasible solutions violating given constraints, and to gain optimal feasible solutions with the compromise of given limits. Moreover, after selection, a solution promotion algorithm is executed to promote the best solution found in generation. Simulation is performed on analog trajectories sets, and results show that our proposed algorithm has a higher road coverage ratio and lower packet loss compared with other schemes.
Highlights
As an emerging technology, the vehicular ad hoc network (VANET) plays a significant role in the transportation area, and gives hope to address some severe problems that have troubled us for many years in our society, such as higher incidences of traffic accidents, serious traffic jams, etc
The rest of this paper is organized as follows: We review some previous studies in Section 2; in Section 3, we formulate the DBCL problem and give a 0–1 covering the matrix-solving algorithm; a binary differential evolution algorithm is shown in Section 4; Section 5 gives simulation results of the proposed algorithm; and in Section 6, we conclude this paper
We investigate how roadside units (RSUs) can be deployed in urban VANET
Summary
The vehicular ad hoc network (VANET) plays a significant role in the transportation area, and gives hope to address some severe problems that have troubled us for many years in our society, such as higher incidences of traffic accidents, serious traffic jams, etc To realize these goals, data should be efficiently transmitted among vehicles, infrastructures, and upper-layer systems [1,2]. Since VANET has some of the typical shortcomings of ad hoc networks, such as quickly changing topology, fast speed, fleeting connectivity, etc., V2V communications may have poor performance in the collection or dissemination of raw sensory data generated by vehicles This further adds some challenges for the implementation of delay-sensitive applications in VANET. A binary differential evolution algorithm is shown in Section 4; Section 5 gives simulation results of the proposed algorithm; and in Section 6, we conclude this paper
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
