Review of Reducing Routing Overhead in Mobile Ad-Hoc Networks by a Neighbor Coverage-Based Algorithm

Mobile ad-hoc networks (MANETs) is collection of nodes, there exist frequent link breakages which show the way to frequent path failures and route discoveries. Broadcasting is a basic and useful data distribution device, in a route discovery. In that, we propose a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. Where a movable node blindly rebroadcasts the first received route request packets except it has a route to the destination, and thus it causes the broadcast tempest difficulty. In order of effectively take advantage of the neighbor coverage knowledge, we suggest a rebroadcast delay to determine the rebroadcast order, and then we can obtain the precise additional coverage ratio by sensing neighbor coverage knowledge. We also identify a connectivity factor to give the node density adaptation. By combine the additional coverage ratio and connectivity factor, we put a sensible rebroadcast probability. Our propose system combines the compensation of the neighbor coverage knowledge and the probabilistic mechanism, which can appreciably reduce the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.