Abstract

In mobile ad hoc networks as the nodes are mobile in nature, there is a chance for link breakage. This will lead to frequent path discovery and data packet loss. The mobile nature of the nodes will decrease the performance of mobile ad hoc networks. The overhead incurred for path discovery is not negligible. This will result in high routing overhead and less packet delivery ratio. In this paper, the work proposes a new protocol which exploits the neighbor node information with a rebroadcasting timer and rebroadcasting probability. The approach combines the merits of neighbor knowledge and probabilistic methodology. This will reduce the frequent transmission of route request and route reply. Whenever the link is broken the node will buffer the data packet till the link is re-established or new route is discovered. The network manager will wait till the timer expires for the re-establishment of broken link; else it will forward the packet through new route with a probability

Paper Details