A performance comparison of smart probabilistic broadcasting of ad hoc distance vector (AODV).

Broadcast is a common operation used in Mobile Ad hoc Networks (MANETs) for many services, such as, rout discovery and sending an information messages. The direct method to perform broadcast is simple flooding, which it can dramatically affect the performance of MANET. Recently, a probabilistic approach to flooding has been proposed as one of most important suggested solutions to solve the broadcast storm problem, which leads to the collision, contention and duplicated messages. This paper proposed new probabilistic method to improve the performance of existing on-demand routing protocol by reduced the RREQ overhead during rout discovery operation. The simulation results show that the combination of AODV and a suitable probabilistic rout discovery can reduce the average end- to- end delay as well as overhead and still achieving low normalized routing load, comparing with AODV which used fixed probability and blind flooding

[1]  Muneer O. Bani Yassein,et al.  Performance Analysis of Adjusted Probabilistic Broadcasting in Mobile Ad Hoc Networks , 2006, Int. J. Wirel. Inf. Networks.

[2]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, Wirel. Networks.

[3]  J. Cartigny,et al.  Border Node Retransmission Based Probabilistic Broadcast Protocols in Ad-Hoc Networks , 2003 .

[4]  André Schiper,et al.  Probabilistic broadcast for flooding in wireless mobile ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[5]  Yu-Chee Tseng,et al.  Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc network , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[6]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[7]  Mohamed Ould-Khaoua,et al.  Adjusted probabilistic route discovery in mobile ad hoc networks , 2009, Comput. Electr. Eng..

[8]  M. O. Khaoua,et al.  Improving the Performance of Probabilistic Flooding in MANETs , 2005 .

[9]  M. Ould-Khaoua,et al.  Neighbour coverage: A dynamic probabilistic route discovery for mobile ad hoc networks , 2008, 2008 International Symposium on Performance Evaluation of Computer and Telecommunication Systems.

[10]  Yu-Chee Tseng,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 2002, Wirel. Networks.

[11]  David A. Maltz,et al.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007, RFC.

[12]  D. Jhonson The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007 .

[13]  Dharma P. Agrawal,et al.  Dynamic probabilistic broadcasting in MANETs , 2005, J. Parallel Distributed Comput..

[14]  Dharma P. Agrawal,et al.  Analysis of leveled probabilistic routing in mobile ad hoc networks , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[15]  Yu-Chee Tseng,et al.  Adaptive Approaches to Relieving Broadcast Storms in a Wireless Multihop Mobile Ad Hoc Network , 2003, IEEE Trans. Computers.

[16]  Aminu Mohammed,et al.  An Efficient Counter-Based Broadcast Scheme for Mobile Ad Hoc Networks , 2007, EPEW.

[17]  T. Nandagopal,et al.  The Broadcast Storm Problem in a Mobile Ad Hoc Network , 1999, MobiCom 1999.

[18]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[19]  Mahesh K. Marina,et al.  Query Localization Techniques for On-Demand Routing Protocols in Ad Hoc Networks , 2002, Wirel. Networks.

[20]  Zygmunt J. Haas,et al.  The performance of query control schemes for the zone routing protocol , 1998, SIGCOMM '98.