Performance Modeling of Efficient and Dynamic Broadcasting Algorithm in MANETs Routing Protocols

Abstract

A MANET (Mobile Adhoc NETwork) is an autonomous system consisting of a set of mobile hosts that are free to move without the need for a wired backbone or a fixed base station. Conventional on-demand route discovery for Adhoc routing protocols extensively use simple flooding, which could potentially lead to high channel contention, causing redundant retransmissions and thus excessive packet collisions in the network. Broadcasting is an essential building block of any MANET, so it is imperative to utilize the most efficient broadcast methods possible, to ensure a reliable network. This paper proposes a new AODV-Efficient and dynamic probabilistic broadcasting approach which is quite efficient and dynamic in nature and solves the broadcast storm problem in AODV. The simulation is done on Global Mobile Simulator (GloMoSim). Average end-to-end delay and routing overhead are considered as main performance evaluation metrics. The results show that this proposed algorithm has better performance over the conventional AODV protocol having implemented with blind flooding and even with fixed probabilistic flooding approaches and also improves the performance of on demand routing protocols of MANETs by reducing the communication overhead incurred during the route discovery process on AODV protocol.