Search

Flooding is an obligatory message dissemination technique for network-wide broadcast within mobile ad hoc networks (MANETs). The conventional blind flooding algorithm causes broadcast storm problem, a high number of unnecessary packet rebroadcasts - thus resulting in high contention and packet collisions. This leads to significant network performance degradation. Because of the highly dynamic and mobile characteristics of MANETs, an appropriate probabilistic broadcast protocol can attain higher throughput, significant reduction in the number of rebroadcast messages without sacrificing the reachability. This paper proposes a new probabilistic approach that dynamically fine-tunes the rebroadcasting probability for routing request packets (RREQs). We assess the performance of the proposed approach by evaluating it against the ad-hoc on demand distance vector (AODV) routing protocol (which follows blind flooding approach), fixed probabilistic approach and the existing dynamic probabilistic approaches. The simulation results reveal thatthe proposed approach demonstrates better performance than the existing approaches. [ABSTRACT FROM AUTHOR]