Energy Efficient Neighbor Coverage Protocol for Reducing Rebroadcast in MANET

Abstract

Abstract Wireless networks adapt easily to changes and offers flexibility in the configuration of the network. In MANET, each node will change its location dynamically and configure itself according to the environment. An effective mechanism for route discovery in such networks is broadcasting, but routing overhead associated with broadcasting can be large in high dynamic networks. To reduce this routing overhead in MANETs, a neighbor coverage based probabilistic rebroadcast protocol is used. To determine the rebroadcast order, a novel rebroadcast delay is used and it obtains the more accurate additional coverage ratio by sensing neighbor coverage knowledge. The rebroadcast probability is calculated by merging the additional coverage ratio and connectivity factor. In the proposed method Energy Efficient Neighbor Coverage Protocol(EENCP) is introduced. In this, the node does not forward RREQ unless there is sufficient energy (battery lifetime), and until the node density in its surrounding exceeds a particular threshold. These two parameters are defined taking into consideration various statistics. EENCP analyzes these two parameters, when implementing routing discovery, and avoiding the unnecessary information sending efficiently and avoid unnecessary information transfer.