Probabilistic counter-Based route discovery for mobile Ad hoc networks

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

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

18 Citations (Scopus)

Abstract

Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This phenomenon has been shown to greatly increase the network communication overhead and end to end delay. This paper proposes a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation results reveal that equipping AODV routing protocol with the proposed probabilistic counter-based route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput.

Original languageEnglish
Title of host publicationProceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
Pages1335-1339
Number of pages5
DOIs
Publication statusPublished - 2009
Event2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 - Leipzig, Germany
Duration: Jun 21 2009Jun 24 2009

Other

Other2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009
CountryGermany
CityLeipzig
Period6/21/096/24/09

Fingerprint

Mobile ad hoc networks
Routing protocols
Telecommunication networks
Throughput

Keywords

  • ANETs
  • Broadcast storm
  • Flooding
  • Reactive routing
  • Route discovery
  • Simulation

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications
  • Software

Cite this

Mohammed, A., Ould-Khaoua, M., Mackenzie, L. M., Perkins, C., & Abdulai, J. D. (2009). Probabilistic counter-Based route discovery for mobile Ad hoc networks. In Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009 (pp. 1335-1339) https://doi.org/10.1145/1582379.1582672

Probabilistic counter-Based route discovery for mobile Ad hoc networks. / Mohammed, Aminu; Ould-Khaoua, Mohamed; Mackenzie, Lewis M.; Perkins, Colin; Abdulai, Jamal Deen.

Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. p. 1335-1339.

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

Mohammed, A, Ould-Khaoua, M, Mackenzie, LM, Perkins, C & Abdulai, JD 2009, Probabilistic counter-Based route discovery for mobile Ad hoc networks. in Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. pp. 1335-1339, 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009, Leipzig, Germany, 6/21/09. https://doi.org/10.1145/1582379.1582672
Mohammed A, Ould-Khaoua M, Mackenzie LM, Perkins C, Abdulai JD. Probabilistic counter-Based route discovery for mobile Ad hoc networks. In Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. p. 1335-1339 https://doi.org/10.1145/1582379.1582672
Mohammed, Aminu ; Ould-Khaoua, Mohamed ; Mackenzie, Lewis M. ; Perkins, Colin ; Abdulai, Jamal Deen. / Probabilistic counter-Based route discovery for mobile Ad hoc networks. Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009. 2009. pp. 1335-1339
@inproceedings{ff3247491da943a39db33a219734c038,
title = "Probabilistic counter-Based route discovery for mobile Ad hoc networks",
abstract = "Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This phenomenon has been shown to greatly increase the network communication overhead and end to end delay. This paper proposes a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation results reveal that equipping AODV routing protocol with the proposed probabilistic counter-based route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput.",
keywords = "ANETs, Broadcast storm, Flooding, Reactive routing, Route discovery, Simulation",
author = "Aminu Mohammed and Mohamed Ould-Khaoua and Mackenzie, {Lewis M.} and Colin Perkins and Abdulai, {Jamal Deen}",
year = "2009",
doi = "10.1145/1582379.1582672",
language = "English",
isbn = "9781605585697",
pages = "1335--1339",
booktitle = "Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009",

}

TY - GEN

T1 - Probabilistic counter-Based route discovery for mobile Ad hoc networks

AU - Mohammed, Aminu

AU - Ould-Khaoua, Mohamed

AU - Mackenzie, Lewis M.

AU - Perkins, Colin

AU - Abdulai, Jamal Deen

PY - 2009

Y1 - 2009

N2 - Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This phenomenon has been shown to greatly increase the network communication overhead and end to end delay. This paper proposes a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation results reveal that equipping AODV routing protocol with the proposed probabilistic counter-based route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput.

AB - Conventional on-demand route discovery for ad hoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. This phenomenon has been shown to greatly increase the network communication overhead and end to end delay. This paper proposes a new probabilistic counter-based method that can significantly reduce the number of RREQ packets transmitted during route discovery operation. Our simulation results reveal that equipping AODV routing protocol with the proposed probabilistic counter-based route discovery method can result in significant performance improvements in terms of routing overhead, MAC collisions and end-to-end delay while still achieving a good throughput.

KW - ANETs

KW - Broadcast storm

KW - Flooding

KW - Reactive routing

KW - Route discovery

KW - Simulation

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

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

U2 - 10.1145/1582379.1582672

DO - 10.1145/1582379.1582672

M3 - Conference contribution

SN - 9781605585697

SP - 1335

EP - 1339

BT - Proceedings of the 2009 ACM International Wireless Communications and Mobile Computing Conference, IWCMC 2009

ER -