Issue No. 04 - April (2010 vol. 21)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2009.89
Konrad Iwanicki , Vrije Universiteit Amsterdam, Amsterdam
Maarten van Steen , Vrije Universiteit Amsterdam, Amsterdam
A recursive multihop area hierarchy has a number of applications in wireless sensor networks, the most common being scalable point-to-point routing, so-called hierarchical routing. In this paper, we consider the problem of maintaining a recursive multihop area hierarchy in large sensor networks. We present a gossip-based protocol, dubbed PL-Gossip, in which nodes, by using local-only operations and by periodically gossiping with their neighbors, collaboratively maintain such a hierarchy. Since the hierarchy is a complex distributed structure, PL-Gossip introduces special mechanisms for internode coordination and consistency enforcement. Yet, these mechanisms are seamlessly integrated within the basic gossiping framework. Through simulations and experiments with an actual embedded protocol implementation, we demonstrate that PL-Gossip maintains the hierarchy in a manner that addresses all the peculiarities of sensor networks. More specifically, it offers excellent opportunities for aggressive energy saving and facilitates provisioning energy harvesting infrastructure. In addition, it bootstraps and recovers the hierarchy after failures relatively fast while also being robust to message loss. Finally, it can seamlessly operate on real sensor node hardware in realistic deployment scenarios and can outperform existing state-of-the-art hierarchy maintenance protocols.
Hierarchical routing, area hierarchy, gossiping, gossip-based algorithms, self-organization, wireless sensor networks.
K. Iwanicki and M. van Steen, "Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets," in IEEE Transactions on Parallel & Distributed Systems, vol. 21, no. , pp. 562-576, 2009.