Arjun sankar.J, Ramar.C.K, Venkatesan.N
In mobile ad hoc networks (MANETs), the network topology changes frequently and unpredictably due to the arbitrary mobility of nodes. One of the fundamental challenges of MANETs is the design of dynamic routing protocols with good performance and less overhead. Neighbor Coverage-based Probabilistic Rebroadcast protocol (NCPR) is proposed for reducing routing overhead in MANETs. Due to large mobility of nodes in mobile ad hoc networks, NCPR algorithm used to decrease the number of retransmissions so that the routing overhead is reduced and can also improve the routing performance. Connectivity factor is defined to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor reasonable rebroadcast probability is set. Simulation results show that the proposed protocol generates less rebroadcast traffic than the flooding as well as increase the packet delivery ratio and decrease the average end-to-end delay.