Bio-Inspired Routing Algorithms Survey for Vehicular Ad-hoc Networks - Archive ouverte HAL Access content directly
Journal Articles IEEE Transactions on Surveys and Tutorials Year : 2015

Bio-Inspired Routing Algorithms Survey for Vehicular Ad-hoc Networks

S. Bitam
  • Function : Author
A Mellouk
  • Function : Author
CIR
S. Zeadally
  • Function : Author

Abstract

Vehicular Ad hoc NETworks (VANETs) play a key role in the design and development of Intelligent Transportation Systems (ITS) that aim to improve road safety and transportation productivity. VANETs cover vehicle-to-vehicle and vehicle-to-roadside communications. One of the most important challenges of this type of network is the timely and reliable dissemination of messages among vehicular nodes that enable drivers to take appropriate decisions to improve road safety. In the past decade, many routing protocols for VANETs that can support reliability and safety requirements have been proposed. These protocols suffer from several limitations, including complexity, lack of scalability to large scale networks, routing overheads, etc. To address these limitations, various bio-inspired approaches have been proposed to route packets among vehicular nodes in an optimized manner. We survey recent proposed bio-inspired routing algorithms for the VANET environment. In particular, we identify the key features, strengths, and weaknesses of these algorithms and compare them by using various criteria. Moreover, we propose a unified formal model of the bio-inspired multimodular approaches applied to VANET routing. We highlight main future research directions in this area.
Not file

Dates and versions

hal-01567505 , version 1 (24-07-2017)

Identifiers

  • HAL Id : hal-01567505 , version 1

Cite

S. Bitam, A Mellouk, S. Zeadally. Bio-Inspired Routing Algorithms Survey for Vehicular Ad-hoc Networks. IEEE Transactions on Surveys and Tutorials, 2015, 17 (2), pp.843-867. ⟨hal-01567505⟩

Collections

LISSI UPEC
98 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More