Probabilistic counter-based route discovery for mobile ad hoc networks

Mohammed, A., Ould-Khaoua, M., Mackenzie, L.M., Perkins, C. and Abdulai, J.D. (2009) Probabilistic counter-based route discovery for mobile ad hoc networks. In: Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly: Leipzig, Germany. Association for Computing Machinery: New York, USA, pp. 1335-1339. ISBN 9781605585697 (doi: 10.1145/1582379.1582672)

Full text not currently available from Enlighten.

Publisher's URL:


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.

Item Type:Book Sections
Keywords:Broadcast storm, flooding, MANETs, reactive routing, route discovery, simulation
Glasgow Author(s) Enlighten ID:Mackenzie, Dr Lewis and Perkins, Dr Colin
Authors: Mohammed, A., Ould-Khaoua, M., Mackenzie, L.M., Perkins, C., and Abdulai, J.D.
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
College/School:College of Science and Engineering > School of Computing Science
Publisher:Association for Computing Machinery

University Staff: Request a correction | Enlighten Editors: Update this record