Sciweavers

Share
IWCMC
2009
ACM

Probabilistic counter-based route discovery for mobile ad hoc networks

9 years 4 months ago
Probabilistic counter-based route discovery for mobile ad hoc networks
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. Categories and Subject Descriptors C.2.2 [Computer-Communication Networks]: Network Protocols – routing protocols General Terms Measurement, Performance. Keywords Broadcast storm, floodi...
Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mack
Added 28 May 2010
Updated 28 May 2010
Type Conference
Year 2009
Where IWCMC
Authors Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Colin Perkins, Jamal-Deen Abdulai
Comments (0)
books