抽象的な

A NEIGHBOR COVERAGE BASED ROUTING BY GOOD NODE DETECTION IN MANET?S

J.Priyanka Sheela, Mr.S. Sundar Raj

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. With the help of the GNDA algorithm, the trust node will be selected to transmit the data by detecting selfish nodes. This approach can significantly decrease the number of retransmissions so as to reduce the routing overhead, and can also improve the routing performance.