Neighbour coverage

A dynamic probabilistic route discovery for mobile ad hoc networks

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

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Blind flooding is extensively use 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 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 reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.

Original languageEnglish
Title of host publicationInternational Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008
Pages165-172
Number of pages8
Publication statusPublished - 2008
EventInternational Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008 - Edinburgh, United Kingdom
Duration: Jun 16 2008Jun 19 2008

Other

OtherInternational Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008
CountryUnited Kingdom
CityEdinburgh
Period6/16/086/19/08

Fingerprint

Mobile ad hoc networks
Routing protocols
Telecommunication networks
Throughput

Keywords

  • Collision
  • Flooding
  • Forwarding probability
  • Manets
  • Network connectivity
  • Overhead
  • Reactive routing
  • Simulation

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Abdulai, J. D., Ould-Khaoua, M., MacKenzie, L. M., & Mohammed, A. (2008). Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks. In International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008 (pp. 165-172)

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

International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008. 2008. p. 165-172.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abdulai, JD, Ould-Khaoua, M, MacKenzie, LM & Mohammed, A 2008, Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks. in International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008. pp. 165-172, International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008, Edinburgh, United Kingdom, 6/16/08.
Abdulai JD, Ould-Khaoua M, MacKenzie LM, Mohammed A. Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks. In International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008. 2008. p. 165-172
Abdulai, Jamal Deen ; Ould-Khaoua, Mohamed ; MacKenzie, Lewis M. ; Mohammed, Aminu. / Neighbour coverage : A dynamic probabilistic route discovery for mobile ad hoc networks. International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008. 2008. pp. 165-172
@inproceedings{e448d57bc481417cb2ecd516da3ee246,
title = "Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks",
abstract = "Blind flooding is extensively use 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 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 reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.",
keywords = "Collision, Flooding, Forwarding probability, Manets, Network connectivity, Overhead, Reactive routing, Simulation",
author = "Abdulai, {Jamal Deen} and Mohamed Ould-Khaoua and MacKenzie, {Lewis M.} and Aminu Mohammed",
year = "2008",
language = "English",
isbn = "9781622763566",
pages = "165--172",
booktitle = "International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008",

}

TY - GEN

T1 - Neighbour coverage

T2 - 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 - 2008

Y1 - 2008

N2 - Blind flooding is extensively use 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 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 reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.

AB - Blind flooding is extensively use 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 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 reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.

KW - Collision

KW - Flooding

KW - Forwarding probability

KW - Manets

KW - Network connectivity

KW - Overhead

KW - Reactive routing

KW - Simulation

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

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

M3 - Conference contribution

SN - 9781622763566

SP - 165

EP - 172

BT - International Symposium on Performance Evaluation of Computer and Telecommunication Systems 2008, SPECTS 2008, Part of the 2008 Summer Simulation Multiconference, SummerSim 2008

ER -