Performance Analysis of Neighbour Coverage Probabilistic Rebroadcast to Reduce the Routing Overhead Over Ad-hoc On Demand Distance Vector Protocol

MOBILE ad hoc networks (MANETs) consist of a collection of mobile nodes which can move freely. These nodes can be dynamically self-organized into arbitrary topology networks without a fixed infrastructure. One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good performance and less overhead. Many routing protocols, such as Ad hoc On-demand Distance Vector Routing (AODV) [1] and Dynamic Source Routing (DSR) [2], have been proposed for MANETs. The above two protocols are on demand routing protocols, and they could improve the scalability of MANETs by limiting the routing overhead when a new route is requested [3]. However, due to node mobility in MANETs, frequent link breakages may lead to frequent path failures and route discoveries, which could increase the overhead of routing protocols and reduce the packet delivery ratio and increasing the end-to-end delay [4]. Thus, reducing the routing overhead in route discovery is an essential problem. Existing routing protocol for MANETS has a problem that they used broadcasting which induces excessive redundant retransmissions of RREQ packet and causes the broadcast storm problem, which leads to a considerable number of packet collisions, especially in dense networks. Because of this routing overhead of network increases which leads to broadcast storm problem. Therefore the proposed system try to reduce this routing overhead.