A Neighbor Coverage based Probabilistic Rebroadcast for Reducing Routing Overhead in Mobile Ad hoc Networks

Mobile ad hoc networks consist of a collection of mobile nodes which can move freely. These nodes can be dynamically self- organized into arbitrary topology networks without a fixed infrastructure. Due to high mobility of nodes in mobile ad hoc networks, there exist frequent link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. We propose neighbor coverage based probabilistic rebroadcast protocol for reducing routing overhead in MANETs. In order to effectively exploit the neighbor 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 neighbor coverage knowledge.