An Analysis of Fixed Probabilistic Route Discovery Mechanism using on-demand routing protocols

An ad hoc wireless network consists of set of mobile nodes connected without any central administration. Path finding processes in on-demand route discovery methods in mobile ad hoc networks (MANETs) use flooding. Source mobile node simply broadcast route request (RREQ) packet to its neighbour node and once again the neighbour node rebroadcast RREQ packet to its neighbour until unless route to a particular destination is found. The excessive RREQ packet can lead collision problem and consume more bandwidth in the network and decrease network performance. This paper examined the fixed probabilistic (FP) based broadcast method using existing on demand routing protocols such as on demand distance vector routing protocols (AODV) and dynamic source routing protocol (DSR). The author used NS-2 simulator for the evaluation of FP-AODV and FP-DSR with traditional AODV[1] and DSR[2] routing protocols using various parameters such as collision rate, routing overhead, network connectivity and throughput. The simulation result shows significant improvement in FP-AODV and FP-DSR.