Aminu Mohammed, Mohamed Ould-Khaoua, Lewis M. Mackenzie, Colin Perkins, and Jamal-Deen Abdulai
Proceedings of the 5th International Wireless Communication and Mobile Computing Conference, Leipzig, Germany, June 2009.
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.