GOS-AODV: a gossip-based sleep ad hoc on demand distance vector routing protocol

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.

[1]  Elizabeth M. Belding-Royer,et al.  AODV routing protocol implementation design , 2004, 24th International Conference on Distributed Computing Systems Workshops, 2004. Proceedings..

[2]  David Tipper,et al.  Gossip-based sleep protocol (GSP) for energy efficient routing in wireless ad hoc networks , 2004, 2004 IEEE Wireless Communications and Networking Conference (IEEE Cat. No.04TH8733).

[3]  G. Mazzini,et al.  An analytical model of the route acquisition process in AODV protocol , 2005, 2005 International Conference on Wireless Networks, Communications and Mobile Computing.

[4]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[5]  Zhongmin Shi,et al.  Adaptive gossip-based routing algorithm , 2004, IEEE International Conference on Performance, Computing, and Communications, 2004.

[6]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[7]  Xiang-Yang Li,et al.  Regional Gossip Routing for Wireless Ad Hoc Networks , 2003, Mob. Networks Appl..

[8]  Joseph Y. Halpern,et al.  Gossip-based ad hoc routing , 2002, IEEE/ACM Transactions on Networking.

[9]  Ranveer Chandra,et al.  Anonymous Gossip: improving multicast reliability in mobile ad-hoc networks , 2001, Proceedings 21st International Conference on Distributed Computing Systems.

[10]  Deborah Estrin,et al.  Geography-informed energy conservation for Ad Hoc routing , 2001, MobiCom '01.