<XML><RECORDS><RECORD><REFERENCE_TYPE>0</REFERENCE_TYPE><REFNUM>9251</REFNUM><AUTHORS><AUTHOR>Abdulai,J.</AUTHOR><AUTHOR>Ould-Khaoua,M.</AUTHOR><AUTHOR>Mackenzie,L.M.</AUTHOR><AUTHOR>Mohammed,A.</AUTHOR></AUTHORS><YEAR>2010</YEAR><TITLE>A Dynamic Probabilistic Route Discovery for Mobile Ad Hoc Networks</TITLE><PLACE_PUBLISHED>International Journal of Communication Networks and Distributed Systems, Volume 4(1)</PLACE_PUBLISHED><PUBLISHER>N/A</PUBLISHER><PAGES>108 - 130</PAGES><LABEL>Abdulai:2010:9251</LABEL><KEYWORDS><KEYWORD>flooding; forwarding probability; mobile ad hoc networks;MANETs; reactive routing; routing overhead; simulation; broadcast storm</KEYWORD></KEYWORDS<ABSTRACT>Blind flooding has been extensively used 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 the 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 considerably reduced if measures are taken during the dissemination of RREQ packets. We propose a generic probabilistic method for route discovery that dynamically computes the forwarding probability at a given node and can significantly reduce the overhead associated with the dissemination of RREQs. Our analysis reveals that equipping a routing protocol with the proposed probabilistic route discovery can result in a significant reduction of routing control overhead while achieving good throughput</ABSTRACT><URL>www.inderscience.com</URL></RECORD></RECORDS></XML>