GOS-AODV: A Gossip-based Sleep Ad Hoc on Demand Distance Vector Routing Protocol

Sabitha S and M.P. Sebastian (India)


Ad hoc networks, percolation theory, flooding, routing, gossiping, sleep.


Many ad hoc routing protocols use flooding as the basic mechanism to propagate control messages. Flooding is inefficient because of the unnecessary message forwarding and additional overheads. The gossip based approach is proposed as an alternative to the flooding. Most of these protocols are not energy efficient due to the idle stage energy consumption. By randomly keeping the nodes in sleep mode for some small interval of time, the energy consumption can be reduced. We propose an enhancement to the AODV routing protocol by incorporating gossip based sleep probability for the nodes. In this approach, each node forward a message with some gossip probability p to reduce the overhead and randomly decide to go sleep stage for some time with gossip-sleep probability 1-p or to awake stage with probability p, to reduce the energy consumption. Simulations show that almost every node gets the message with gossip probability p between 0.65 and 0.7, and gossip-sleep probability 1-p between 0.35 and 0.3, respectively. Adding gossip based approach to AODV improves the performance and reduces the energy consumption.

Important Links:

Go Back