• Siriki damodhar
• Prof. Kuda Nageswara Rao

Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast and multicast protocols. To discover an effective and an efficient routing protocol for transmit information from source to destination across whole network topology. This is a main issue in networking research.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 project 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 broadcasting increases the routing overhead, packet delay, which negativity affects the throughput due to the excessive use of the redundant Route REQuest message. In addition, the network is susceptible to so-called broadcast storm problem. Therefore, developing a new routing protocol, which is able to relieve the unnecessary Route REQuest messages while boosting the performance of the network, is required. In this article, a novel routing protocol for mobile ad hoc network, called scalable neighbor-based mobile routing, is proposed. The broadcasting in this protocol is governed by the inverse relation between the number of neighbors and the probability of the rebroadcasted Route REQuest messages.. 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. To discover the route better than broadcasting methodology rebroadcast can done with the help of neighbour knowledge methods. In order to effectively exploit the neighbour coverage knowledge, we propose a novel rebroadcast delay to determine the rebroadcast order, and then we can obtain the more accurate additional coverage ratio by sensing neighbour coverage knowledge. We also define a connectivity factor to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. This approach can significantly decrease the number of retransmissions so as to reduce the routing overhead and also improve the routing performance.

Mobile ad hoc networks, neighbour coverage, network connectivity, probabilistic rebroadcast, routing overhead, Routing protocol, broadcasting techniques, NCPR

"An implementation on node discovery of suggestion based routing protocol for mobile ad hoc network", International Journal of Emerging Technologies and Innovative Research (www.jetir.org), ISSN:2349-5162, Vol.5, Issue 12, page no.302-309, December-2018, Available :http://www.jetir.org/papers/JETIR1812345.pdf

"An implementation on node discovery of suggestion based routing protocol for mobile ad hoc network", International Journal of Emerging Technologies and Innovative Research (www.jetir.org | UGC and issn Approved), ISSN:2349-5162, Vol.5, Issue 12, page no. pp302-309, December-2018, Available at : http://www.jetir.org/papers/JETIR1812345.pdf