Improving probabilistic route discovery in Mobile Ad hoc Networks

J. Abdulai, M. Ould-Khaoua, L. M. Mackenzie

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

26 Citations (Scopus)

Abstract

Conventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, 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 two new probabilistic methods for on-demand route discovery, that is simple to implement and can significantly reduce the overhead involved in the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant performance improvements on all the standard metrics.

Original languageEnglish
Title of host publicationProceedings - Conference on Local Computer Networks, LCN
Pages739-746
Number of pages8
DOIs
Publication statusPublished - 2007
Event32nd IEEE Conference on Local Computer Networks, LCN 2007 - Dublin, Ireland
Duration: Oct 15 2007Oct 18 2007

Other

Other32nd IEEE Conference on Local Computer Networks, LCN 2007
CountryIreland
CityDublin
Period10/15/0710/18/07

Fingerprint

Mobile ad hoc networks
Telecommunication networks

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Abdulai, J., Ould-Khaoua, M., & Mackenzie, L. M. (2007). Improving probabilistic route discovery in Mobile Ad hoc Networks. In Proceedings - Conference on Local Computer Networks, LCN (pp. 739-746). [4367910] https://doi.org/10.1109/LCN.2007.79

Improving probabilistic route discovery in Mobile Ad hoc Networks. / Abdulai, J.; Ould-Khaoua, M.; Mackenzie, L. M.

Proceedings - Conference on Local Computer Networks, LCN. 2007. p. 739-746 4367910.

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

Abdulai, J, Ould-Khaoua, M & Mackenzie, LM 2007, Improving probabilistic route discovery in Mobile Ad hoc Networks. in Proceedings - Conference on Local Computer Networks, LCN., 4367910, pp. 739-746, 32nd IEEE Conference on Local Computer Networks, LCN 2007, Dublin, Ireland, 10/15/07. https://doi.org/10.1109/LCN.2007.79
Abdulai J, Ould-Khaoua M, Mackenzie LM. Improving probabilistic route discovery in Mobile Ad hoc Networks. In Proceedings - Conference on Local Computer Networks, LCN. 2007. p. 739-746. 4367910 https://doi.org/10.1109/LCN.2007.79
Abdulai, J. ; Ould-Khaoua, M. ; Mackenzie, L. M. / Improving probabilistic route discovery in Mobile Ad hoc Networks. Proceedings - Conference on Local Computer Networks, LCN. 2007. pp. 739-746
@inproceedings{2134b15d066e427796850dac26e436f3,
title = "Improving probabilistic route discovery in Mobile Ad hoc Networks",
abstract = "Conventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, 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 two new probabilistic methods for on-demand route discovery, that is simple to implement and can significantly reduce the overhead involved in the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant performance improvements on all the standard metrics.",
keywords = "Collision, Flooding, Forwarding probability, MANETs, Network connectivity, Overhead, Reactive routing, Simulation",
author = "J. Abdulai and M. Ould-Khaoua and Mackenzie, {L. M.}",
year = "2007",
doi = "10.1109/LCN.2007.79",
language = "English",
isbn = "0769530001",
pages = "739--746",
booktitle = "Proceedings - Conference on Local Computer Networks, LCN",

}

TY - GEN

T1 - Improving probabilistic route discovery in Mobile Ad hoc Networks

AU - Abdulai, J.

AU - Ould-Khaoua, M.

AU - Mackenzie, L. M.

PY - 2007

Y1 - 2007

N2 - Conventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, 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 two new probabilistic methods for on-demand route discovery, that is simple to implement and can significantly reduce the overhead involved in the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant performance improvements on all the standard metrics.

AB - Conventional on-demand route discovery methods in Mobile Ad hoc Networks (MANET) employ blind flooding, 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 two new probabilistic methods for on-demand route discovery, that is simple to implement and can significantly reduce the overhead involved in the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant performance improvements on all the standard metrics.

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=47249119661&partnerID=8YFLogxK

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

U2 - 10.1109/LCN.2007.79

DO - 10.1109/LCN.2007.79

M3 - Conference contribution

SN - 0769530001

SN - 9780769530000

SP - 739

EP - 746

BT - Proceedings - Conference on Local Computer Networks, LCN

ER -