Optimal RSUs placement with delay bounded message dissemination in vehicular networks

Chunyan Liu, Hejiao Huang (), Hongwei Du and Xiaohua Jia
Additional contact information
Chunyan Liu: Harbin Institute of Technology Shenzhen Graduate School
Hejiao Huang: Harbin Institute of Technology Shenzhen Graduate School
Hongwei Du: Harbin Institute of Technology Shenzhen Graduate School
Xiaohua Jia: Harbin Institute of Technology Shenzhen Graduate School

Journal of Combinatorial Optimization, 2017, vol. 33, issue 4, No 7, 1276-1299

Abstract: Abstract In order to transfer emergency messages from the accident site to the control center as soon as possible, the Roadside Units (RSUs) act as the most important roles in vehicular ad hoc networks (VANETs). However, we always hope to deploy the minimum number of RSUs because of the low market penetration of VANET-enabled vehicles and the deployment cost of RSUs. This paper presents a transmission delay analysis in urban areas with IID vehicles, and then reveal the relationship between the transmission time and message dissemination distance. According to the analysis, the optimal RSUs deployment problem is formulated. We propose three heuristic greedy strategies as code methods of genetic algorithms to solve the optimal RSUs placement problem with delay bound. Simulation results show that the solutions are efficient and the time complexity is lower than those existing algorithms.

Keywords: RSUs placement; Transmission delay; VANETs; Urban area (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-016-0034-8 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:33:y:2017:i:4:d:10.1007_s10878-016-0034-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-016-0034-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().