A dynamic probabilistic route discovery for mobile ad hoc networks

Jamal Deen Abdulai, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Aminu Mohammed

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Blind flooding has been extensively used in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus, excessive packet collisions in the network. Such a phenomenon induces what is known as the broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput.

Original languageEnglish
Pages (from-to)108-130
Number of pages23
JournalInternational Journal of Communication Networks and Distributed Systems
Volume4
Issue number1
DOIs
Publication statusPublished - 2010

Fingerprint

Mobile ad hoc networks
Routing protocols
Telecommunication networks
Throughput

Keywords

  • Broadcast storm
  • Flooding
  • Forwarding probability
  • MANETs
  • Mobile ad hoc networks
  • Reactive routing
  • Route discovery
  • Routing overhead
  • Simulation

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

A dynamic probabilistic route discovery for mobile ad hoc networks. / Abdulai, Jamal Deen; Ould-Khaoua, Mohamed; Mackenzie, Lewis M.; Mohammed, Aminu.

In: International Journal of Communication Networks and Distributed Systems, Vol. 4, No. 1, 2010, p. 108-130.

Research output: Contribution to journalArticle

@article{f51e52be175e42648571727ac33fe626,
title = "A dynamic probabilistic route discovery for mobile ad hoc networks",
abstract = "Blind flooding has been extensively used in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus, excessive packet collisions in the network. Such a phenomenon induces what is known as the broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput.",
keywords = "Broadcast storm, Flooding, Forwarding probability, MANETs, Mobile ad hoc networks, Reactive routing, Route discovery, Routing overhead, Simulation",
author = "Abdulai, {Jamal Deen} and Mohamed Ould-Khaoua and Mackenzie, {Lewis M.} and Aminu Mohammed",
year = "2010",
doi = "10.1504/IJCNDS.2010.02974",
language = "English",
volume = "4",
pages = "108--130",
journal = "International Journal of Communication Networks and Distributed Systems",
issn = "1754-3916",
publisher = "Inderscience Publishers",
number = "1",

}

TY - JOUR

T1 - A dynamic probabilistic route discovery for mobile ad hoc networks

AU - Abdulai, Jamal Deen

AU - Ould-Khaoua, Mohamed

AU - Mackenzie, Lewis M.

AU - Mohammed, Aminu

PY - 2010

Y1 - 2010

N2 - Blind flooding has been extensively used in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus, excessive packet collisions in the network. Such a phenomenon induces what is known as the broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput.

AB - Blind flooding has been extensively used in ad hoc routing protocols for on-demand route discovery, where a mobile node blindly rebroadcasts received route request (RREQ) packets until a route to a particular destination is established. This can potentially lead to high channel contention, causing redundant retransmissions and thus, excessive packet collisions in the network. Such a phenomenon induces what is known as the broadcast storm problem, which has been shown to greatly increase the network communication overhead and end-to-end delay. In this paper, we show that the deleterious impact of such a problem can be considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput.

KW - Broadcast storm

KW - Flooding

KW - Forwarding probability

KW - MANETs

KW - Mobile ad hoc networks

KW - Reactive routing

KW - Route discovery

KW - Routing overhead

KW - Simulation

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

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

U2 - 10.1504/IJCNDS.2010.02974

DO - 10.1504/IJCNDS.2010.02974

M3 - Article

VL - 4

SP - 108

EP - 130

JO - International Journal of Communication Networks and Distributed Systems

JF - International Journal of Communication Networks and Distributed Systems

SN - 1754-3916

IS - 1

ER -