अमूर्त

Performance Analysis of Neighbor Coverage Probabilistic Rebroadcast Method Using Mobile Ad Hoc Networks

P.Siva kumar , S.Venkadesh Kumar

Recently, Mobile Ad-hoc Networks (MANETs) provides high mobility of nodes, there exist frequent link breakages which lead to frequent path failures and route discoveries and however it cannot be neglect the route discovery overhead. In a route discovery, broadcasting is a fundamental and effective data dissemination mechanism, where a mobile node blindly rebroadcasts the first received route request packets unless it has a route to the destination, and thus it causes the broadcast storm problem. This system uses a neighbor coverage-based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. To facilitate effectively exploit the neighbor coverage knowledge and the system use novel rebroadcast delay to determine the rebroadcast order, then obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. The system needs to define a connectivity factor to provide the node density adaptation. A reasonable rebroadcast probability is the combination of both additional coverage ratio and connectivity factor. The most important advantage of the system is to combine the neighbor coverage knowledge and probabilistic mechanism, which can significantly decrease the number of retransmissions, such as to reduce the routing overhead, and can also improve the routing performance.