Energy-Aware Gossip Routing for Mobile Ad Hoc Networks

Broadcasting is a communication model for a node to emit the packets via wireless channels to its neighbor nodes. In mobile ad hoc networks (MANETs), it is commonly implemented through flooding to find routes, send alarm signals and page a particular host. Conventional on-demand route discovery for ad hoc routing protocols, such as AODV, extensively use blind flooding which could result in a high number of redundant retransmissions, leading to serious contention and collisions, referred to as the broadcast storm problem. A gossip-based approach is proposed to alleviate this problem, in which each node forwards a message with some probability. This approach combines gossiping with AODV (denoted as AODV+G) and exhibits a significant performance improvement in simulations. In this paper, we improve the gossip-based approach by considering the remaining energy of nodes in the gossip mechanism (denoted as AODV+GE) to improve the lifetime of entire network and the packet delivery ratio. Through mathematical inference and simulations we show that AODV+GE outperform AODV+G in terms of the lifetime of whole network, average node energy consumption, and packet delivery ratio.