Review on Performance Analysis of Probabilistic Route Discovery for Wireless Mobile Ad hoc Networks
Publication Date : 19/02/2016
Mobile wireless ad hoc networks (MANETs) have become of increasing interest in view of their promise to extend connectivity beyond traditional fixed infrastructure networks. In MANETs, the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment. To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding whereby a route request packet (RREQ) originating from a source node is blindly disseminated to the rest of the network nodes. This can lead to excessive redundant retransmissions, causing high channel contention and packet collisions in the network, a phenomenon called a broadcast storm. To reduce the deleterious impact of flooding RREQ packets, without sacrificing performance gains through the use of probabilistic broadcast methods, where an intermediate node rebroadcasts RREQ packets based on some suitable forwarding probability rather than in the traditional deterministic manner. In this study the the performance of the routing protocols Ad hoc On demand Distance Vector (AODV) and Dynamic Source Routing (DSR) augmented with probabilistic route discovery, taking into account parameters such as network density, network traffic and nodal mobility. The results reveal encouraging benefits in overall routing control overhead but also show that network operating conditions have a critical impact on the optimality of the forwarding probabilities.
No. of Downloads :