Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm

Yusor Rafid Bahar Al-Mayouf, Nor Fadzilah Abdullah, Mahamod Ismail, Salih M. Al-Qaraawi, Omar Adil Mahdi, Suleman Khan

Research output: Contribution to journalArticle

10 Citations (Scopus)

Abstract

Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV.

Original languageEnglish
Article number265
JournalEurasip Journal on Wireless Communications and Networking
Volume2016
Issue number1
DOIs
Publication statusPublished - 1 Dec 2016

Fingerprint

Vehicular ad hoc networks
Routing algorithms
Communication
Data communication systems
Communication systems
Throughput
Topology

Keywords

  • Communication overhead
  • Mobility
  • Routing
  • Traffic management
  • VANETs

ASJC Scopus subject areas

  • Signal Processing
  • Computer Science Applications
  • Computer Networks and Communications

Cite this

Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm. / Al-Mayouf, Yusor Rafid Bahar; Abdullah, Nor Fadzilah; Ismail, Mahamod; Al-Qaraawi, Salih M.; Mahdi, Omar Adil; Khan, Suleman.

In: Eurasip Journal on Wireless Communications and Networking, Vol. 2016, No. 1, 265, 01.12.2016.

Research output: Contribution to journalArticle

Al-Mayouf, Yusor Rafid Bahar ; Abdullah, Nor Fadzilah ; Ismail, Mahamod ; Al-Qaraawi, Salih M. ; Mahdi, Omar Adil ; Khan, Suleman. / Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm. In: Eurasip Journal on Wireless Communications and Networking. 2016 ; Vol. 2016, No. 1.
@article{12e046da51c840a79181697881261652,
title = "Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm",
abstract = "Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV.",
keywords = "Communication overhead, Mobility, Routing, Traffic management, VANETs",
author = "Al-Mayouf, {Yusor Rafid Bahar} and Abdullah, {Nor Fadzilah} and Mahamod Ismail and Al-Qaraawi, {Salih M.} and Mahdi, {Omar Adil} and Suleman Khan",
year = "2016",
month = "12",
day = "1",
doi = "10.1186/s13638-016-0760-8",
language = "English",
volume = "2016",
journal = "Eurasip Journal on Wireless Communications and Networking",
issn = "1687-1472",
publisher = "Springer Publishing Company",
number = "1",

}

TY - JOUR

T1 - Evaluation of efficient vehicular ad hoc networks based on a maximum distance routing algorithm

AU - Al-Mayouf, Yusor Rafid Bahar

AU - Abdullah, Nor Fadzilah

AU - Ismail, Mahamod

AU - Al-Qaraawi, Salih M.

AU - Mahdi, Omar Adil

AU - Khan, Suleman

PY - 2016/12/1

Y1 - 2016/12/1

N2 - Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV.

AB - Traffic management at road intersections is a complex requirement that has been an important topic of research and discussion. Solutions have been primarily focused on using vehicular ad hoc networks (VANETs). Key issues in VANETs are high mobility, restriction of road setup, frequent topology variations, failed network links, and timely communication of data, which make the routing of packets to a particular destination problematic. To address these issues, a new dependable routing algorithm is proposed, which utilizes a wireless communication system between vehicles in urban vehicular networks. This routing is position-based, known as the maximum distance on-demand routing algorithm (MDORA). It aims to find an optimal route on a hop-by-hop basis based on the maximum distance toward the destination from the sender and sufficient communication lifetime, which guarantee the completion of the data transmission process. Moreover, communication overhead is minimized by finding the next hop and forwarding the packet directly to it without the need to discover the whole route first. A comparison is performed between MDORA and ad hoc on-demand distance vector (AODV) protocol in terms of throughput, packet delivery ratio, delay, and communication overhead. The outcome of the proposed algorithm is better than that of AODV.

KW - Communication overhead

KW - Mobility

KW - Routing

KW - Traffic management

KW - VANETs

UR - http://www.scopus.com/inward/record.url?scp=84995739747&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84995739747&partnerID=8YFLogxK

U2 - 10.1186/s13638-016-0760-8

DO - 10.1186/s13638-016-0760-8

M3 - Article

AN - SCOPUS:84995739747

VL - 2016

JO - Eurasip Journal on Wireless Communications and Networking

JF - Eurasip Journal on Wireless Communications and Networking

SN - 1687-1472

IS - 1

M1 - 265

ER -