Optimal RSUs placement with delay bounded message dissemination in vehicular networks

Research output: Journal Publications and Reviews (RGC: 21, 22, 62)21_Publication in refereed journalpeer-review

8 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)1276-1299
Journal / PublicationJournal of Combinatorial Optimization
Volume33
Issue number4
Online published1 Jun 2016
Publication statusPublished - May 2017
Externally publishedYes

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.

Research Area(s)

  • RSUs placement, Transmission delay, Urban area, VANETs