Performance Analysis of Probabilistic Routing Algorithms in Mobile Ad Hoc Networks Using a New Smart Algorithm

(*) Corresponding author

Authors' affiliations

DOI's assignment:
the author of the article can submit here a request for assignment of a DOI number to this resource!
Cost of the service: euros 10,00 (for a DOI)


Flooding and Ad hoc on Demand Distance Vector routing algorithms (AODV) are common algorithms in Mobile Ad hoc Networks (MANETs). Flooding can dramatically affect the performance of MANET, but probabilistic approach to flooding has been proposed recently to solve the flooding storm problem. This problem leads to contention, collision and duplicated messages. This paper will propose a new smart probabilistic method to improve the performance of existing flooding protocol by increasing the throughput and decreasing the average end-to-end delay. Simulation results show that combination of flooding and a suitable smart probabilistic optimization method can reduce the average end-to-end delay and increase throughput.
In this paper, this method is also used for AODV algorithm. Results indicate that AODV will be enhanced while nodes send message probabilistically. More ever, using proposed optimization algorithm improves this algorithm as well as flooding, but enhancement occurs in different probabilities.

Copyright © 2013 Praise Worthy Prize - All rights reserved.


MANET; Flooding; AODV; Smart Probabilistic Optimization

Full Text:



R. Rajabioun,” Cuckoo Optimization Algorithm”, Contests lists available at Science Direct Applied Soft Computing, journal home,2011.

S. Y.Ni, Y,C.Chen,and J,.p. sheu, ”Adaptive approaches to relieving broadcast storms in wireless multiple mobile ad hoc networks,” Proceeding of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp.152-162,August 1999.

S.Y.-C Tesing, S.-y.Ni, and E.Y Shih,” Adaptive approaches to relieving broadcast storms in a wireless multihop mobile ad hoc networks,” proceeding of IEEE Transportation on Computers,vol.52,pp.545-557,may 2003.

B.Williams and T.Camp,”Comparison of broadcasting techniques for mobile ad hoc networks,”proceeding of the 3th ACM international symposium on mobile ad hoc network and computing,MOBIHOC,PP.194-205,june 2002.

Y.Sasson, D. Cavin and A.Schiper,”probabilistic broadcast for flooding in wireless mobile ad hoc net works, ”Proceeding of IEEE Wireless Communications and networking Conference(WCNC), March 2003.

D. B. West, Introduction to Graph Theory,2thed: Prentice Hall, Upper Saddle River,NJ,2001PP.116-118.

B. William and T. Camp,” Comparison of broadcasting techniques for mobile ad hoc networks ,”Proceeding of third ACM international symposium on Mobile ad hoc networking and computing, MOBIHOC,pp.194-205,june 2002.

D. Stauffer and A.Aharony,International To Percolation Theory,Taylor and Francis 2 ed,1994.

W.peng and X. C .Lu,”On the reduction of broadcast redundancy in mobile ad hoc networks,” Proceeding of the ACM Symposium on Mobile and Ad hoc Networking and computing (MobiHoc’00),pp.129-130,August,2000.

M. Bani-Yassein, M.Ould-Khaoua, L. M. Mackenzei, and S.Papanastasiou,”Performance Analysis of Adjusted Probabilistic Broadcasting in Mobile Ad Hoc Networks,”International Journal of Wireless Information Networks,vol.13,pp.127-140,April, 2006.

J.Cartigny and D.Simplot,”Border node retransmission based probabilistic broadcast protocols in ad-hoc networks,” Telecommunication Systems,vol.22,pp.189-204,2003.

Perkins. C. E, Royer. E., ad hoc on demand distance vector routing processing of IEEE WMCSA 1999.


  • There are currently no refbacks.

Please send any question about this web site to
Copyright © 2005-2024 Praise Worthy Prize