Improving the Performance of Routing Protocol Using Neighbor Coverage Based Probabilistic Rebroadcast in Mobile Ad Hoc Network

Abstract

Mobile Ad Hoc Networks provides important control and route establishment functionality for a number of unicast an d 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. Broadcasting is important in MANET for routing infor mation discovery, protocols such as ad hoc on demand distance vector (AODV), dynamic source routing (DSR), and location aided routing use broadcasting to establish routes. Broadcasting in MANETs poses more challenging problems because of the variable and unpredictable characteristics of its medium as well as the fluctuation of the signal strength and propagation with respect to time and environment such as bandwidth congestion, channel contention problem, and packet collision problem. To overcome the se and reducing routing overhead we did study about neighbor coverage based probabilistic rebroadcast protocol in MANETs. In order to effectively exploit the neighbor coverage knowledge, we also discuss a connectivity factor to provide the node density ada ptation. Our approach combines the advantages of the neighbor coverage knowledge and the probabilistic mechanism, which can significantly, optimizes the routing mechanism in comparison to the AODV protocol. We just complete our dissertation work by compari ng AODV protocol with the new concept of rebroadcasting is NCPR in point of many performance metrics. The performance results and comparisons are done by using NS - 2 simulator.