A Model of Retransmission Mechanism in Wireless Ad Hoc Networks

In mobile Adhoc Networks (MANETs), due to high mobility of nodes there exist link breakages which lead to frequent path failures and route discoveries. The overhead of a route discovery cannot be neglected. 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. In this project, a neighbor coverage based probabilistic rebroadcast protocol is used for reducing routing overhead in MANETs. In order to exploit the neighbor coverage knowledge, a novel rebroadcast delay is used to determine the rebroadcast order, and obtain the more accurate additional coverage ratio by sensing neighbor coverage knowledge. And also a connectivity factor is defined to provide the node density adaptation. By combining the additional coverage ratio and connectivity factor, we set a reasonable rebroadcast probability. In proposed system to reduce the routing overhead in mobile adhoc networks’ adaptive hybrid routing protocol is used. By implementing this methodology, we can increase the group packet delivery ratio and also reduce the latency of the nodes in adhoc network nodes.