<XML><RECORDS><RECORD><REFERENCE_TYPE>3</REFERENCE_TYPE><REFNUM>8897</REFNUM><AUTHORS><AUTHOR>Abdulai,J.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Mackenzie,L.M.</AUTHOR><AUTHOR>Aminu,M.</AUTHOR></AUTHORS><YEAR>2008</YEAR><TITLE>Neighbour Coverage: A Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks</TITLE><PLACE_PUBLISHED>International Symposium on Performance Evaluation of Computer and Telecommunication Systems, (SPECTS' 2008)</PLACE_PUBLISHED><PUBLISHER>IEEE</PUBLISHER><PAGES>165 - 172</PAGES><LABEL>Abdulai:2008:8897</LABEL><KEYWORDS><KEYWORD>Collision</KEYWORD></KEYWORDS<ABSTRACT>Blind flooding is extensively use in ad hoc routing protocols for on-demand route discovery, 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 a generic probabilistic method for route discovery, that is simple to implement and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping AODV with probabilistic route discovery can result in significant reduction of routing control overhead while achieving good throughput.</ABSTRACT><URL>http://atc.udg.edu/SPECTS2008/</URL></RECORD></RECORDS></XML>