Adaptive gossip-based energy conservation for wireless ad hoc routing

Recently, we have proposed to employ gossiping to place nodes in an ad hoc network in an energy saving sleep state via a gossip-based sleep protocol (GSP). A gossiping node employs a random variable (p) to decide whether or not to enter a sleep mode. Our observation is that in a well connected ad hoc network there are usually many paths existing between a source and a destination, so a percentage (1 - p) of the nodes may be in an energy conserving sleep mode without losing network connectivity. In this paper, we extend the GSP to a non-uniform deployed network, where the node density is not a network-wide constant. The value of p for every node is determined by its local information without incurring much overhead.