A NEIGHBOUR COVERAGE PROTOCOL FOR REDUCING ROUTING OVERHEAD IN MOBILE AD HOC NETWORKS?

Mobile ad hoc network is a wireless network without any infrastructure less network and self-managed networks. The mobile nodes are connected with links and data packets are transferred from node to another node and vice versa. A simple flooding approach is used by the mobile node if the destination is not within the hop region. If the data packet is not transferred within a particular time, rebroadcast of data packet is done and which leads to overhead in Manet. In this paper we propose a neighbor coverage probabilistic rebroadcast protocol for reducing routing overhead in Manet. In order to find the neighbor coverage nodes, we propose a novel rebroadcast delay to determine the common neighbors. We also define a rebroadcast probability which is the combination of additional coverage ratio and connectivity factor. The both approaches are defined to reduce the number of retransmissions so as to reduce the routing overhead, collision rate and improve the packet delivery ratio.