This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets
April 2010 (vol. 21 no. 4)
pp. 562-576
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.

[1] F. Kamoun, "Design Considerations for Large Computer Communication Networks," PhD dissertation, Univ. of California, Apr. 1976.
[2] J. Hagouel, "Issues in Routing for Large and Dynamic Networks," PhD dissertation, Columbia Univ., May 1983.
[3] P.F. Tsuchiya, "The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks," ACM SIGCOMM Computer Comm. Rev., vol. 18, no. 4, pp. 35-42, Aug. 1988.
[4] S. Kumar, C. Alaettinoglu, and D. Estrin, "Scalable Object-Tracking through Unattended Techniques (SCOUT)," Proc. Eighth IEEE Int'l Conf. Network Protocols (ICNP '00), pp. 253-262, Nov. 2000.
[5] S. Bandyopadhyay and E.J. Coyle, "An Energy Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks," Proc. IEEE INFOCOM '03, pp. 1713-1723, Mar./Apr. 2003.
[6] S. Du, A. Khan, S. PalChaudhuri, A. Post, A.K. Saha, P. Druschel, D.B. Johnson, and R. Riedi, "Self-Organizing Hierarchical Routing for Scalable Ad Hoc Networking," Technical Report TR04-433, Rice Univ., Mar. 2004.
[7] K. Iwanicki and M. van Steen, "Using Area Hierarchy for Multi-Resolution Storage and Search in Large Wireless Sensor Networks," Proc. IEEE Int'l Conf. Comm. (ICC '09), June 2009.
[8] X. Li, Y.J. Kim, R. Govindan, and W. Hong, "Multi-Dimensional Range Queries in Sensor Networks," Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 63-75, Nov. 2003.
[9] C. Sharp, S. Schaffert, A. Woo, N. Sastry, C. Karlof, S. Sastry, and D. Culler, "Design and Implementation of a Sensor Network System for Vehicle Tracking and Autonomous Interception," Proc. Second European Workshop Wireless Sensor Networks (EWSN '05), pp. 93-107, Jan. 2005.
[10] I.F. Akyildiz and I.H. Kasimoglu, "Wireless Sensor and Actor Networks: Research Challenges," Ad Hoc Networks, vol. 2, no. 4, pp. 351-367, Oct. 2004.
[11] K. Whitehouse, G. Tolle, J. Taneja, C. Sharp, S. Kim, J. Jeong, J. Hui, P. Dutta, and D. Culler, "Marionette: Using RPC for Interactive Development and Debugging of Wireless Embedded Networks," Proc. Fifth Int'l Conf. Information Processing in Sensor Networks (IPSN '06), pp. 416-423, Apr. 2006.
[12] K. Iwanicki and M. van Steen, "Towards a Versatile Problem Diagnosis Infrastructure for Large Wireless Sensor Networks," Proc. Second Int'l Workshop Pervasive Systems (PerSys '07), pp. 845-855, Nov. 2007.
[13] D. Ganesan, B. Greenstein, D. Perelyubskiy, D. Estrin, and J. Heidemann, "An Evaluation of Multi-Resolution Storage for Sensor Networks," Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 89-102, Nov. 2003.
[14] D. Ganesan, B. Greenstein, D. Estrin, J. Heidemann, and R. Govindan, "Multiresolution Storage and Search in Sensor Networks," ACM Trans. Storage, vol. 1, no. 3, pp. 277-315, Aug. 2005.
[15] A. Kansal, J. Hsu, S. Zahedi, and M.B. Srivastava, "Power Management in Energy Harvesting Sensor Networks," ACM Trans. Embedded Computing Systems, vol. 6, no. 4, p. 32, Sept. 2007.
[16] K. Iwanicki and M. van Steen, "The PL-Gossip Algorithm," Technical Report IR-CS-034, Vrije Univ., http://www.few.vu.nl~iwanicki/, Mar. 2007.
[17] A. Demers, D. Greene, C. Hauser, W. Irish, J. Larson, S. Shenker, H. Sturgis, D. Swinehart, and D. Terry, "Epidemic Algorithms for Replicated Database Maintenance," Proc. Sixth Ann. ACM Symp. Principles of Distributed Computing (PODC '87), pp. 1-12, Aug. 1987.
[18] R. van Renesse, "Power-Aware Epidemics," Proc. 21st IEEE Int'l Symp. Reliable Distributed Systems (SRDS '02), pp. 358-361, Oct. 2002.
[19] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2001.
[20] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, "Energy-Efficient Communication Protocols for Wireless Microsensor Networks," Proc. 33rd Hawaii Int'l Conf. System Sciences, vol. 8, Aug. 2000.
[21] A. Manjeshwar and D.P. Agrawal, "TEEN: A Routing Protocol for Enhanced Efficiency in Wireless Sensor Networks," Proc. 15th IEEE Int'l Parallel and Distributed Processing Symp. (IPDPS '01 Workshops), Apr. 2001.
[22] M. Ye, C. Li, G. Chen, and J. Wu, "EECS: An Energy Efficient Clustering Scheme in Wireless Sensor Networks," Proc. 24th IEEE Int'l Performance, Computing, and Comm. Conf. (IPCCC '05), pp. 535-540, Apr. 2005.
[23] N. Shacham and J. Westcott, "Future Directions in Packet Radio Architectures and Protocols," Proc. IEEE, vol. 75, no. 1, pp. 83-99, Jan. 1987.
[24] B. Chen and R. Morris, "$L^{+}$ : Scalable Landmark Routing and Address Lookup for Multi-Hop Wireless Networks," Technical Report MIT-LCS-TR-837, Mass. Inst. of Tech nology, Mar. 2002.
[25] L. Subramanian and R.H. Katz, "An Architecture for Building Self-Configurable Systems," Proc. ACM MobiHoc '00, pp. 63-73, Aug. 2000.
[26] S.-Y. Ni, Y.-C. Tseng, Y.-S. Chen, and J.-P. Sheu, "The Broadcast Storm Problem in a Mobile Ad Hoc Network," Proc. ACM MobiCom '99, pp. 151-162, Aug. 1999.
[27] P. Levis, N. Patel, D. Culler, and S. Shenker, "Trickle: A Self-Regulating Algorithm for Code Propagation and Maintenance in Wireless Sensor Networks," Proc. First USENIX Symp. Networked Systems Design and Implementation (NSDI '04), pp. 15-28, Mar. 2004.
[28] K. Iwanicki and M. van Steen, "Multi-Hop Cluster Hierarchy Maintenance in Wireless Sensor Networks: A Case for Gossip-Based Protocols," Proc. Sixth European Conf. Wireless Sensor Networks (EWSN '09), pp. 102-117, Feb. 2009.
[29] K. Iwanicki and M. van Steen, "On Hierarchical Routing in Wireless Sensor Networks," Proc. Eighth ACM/IEEE Int'l Conf. Information Processing in Sensor Networks (IPSN '09), pp. 133-144, Apr. 2009.
[30] D. Thaler and C.V. Ravishankar, "Distributed Top-Down Hierarchy Construction," Proc. IEEE INFOCOM '98, pp. 693-701, Mar./Apr. 1998.
[31] J. Polastre, J. Hui, P. Levis, J. Zhao, D. Culler, S. Shenker, and I. Stoica, "A Unifying Link Abstraction for Wireless Sensor Networks," Proc. Third ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '05), pp. 76-89, Nov. 2005.
[32] K. Iwanicki, A. Gaba, and M. van Steen, "KonTest: A Wireless Sensor Network Testbed at Vrije Universiteit Amsterdam," Technical Report IR-CS-045, Vrije Univ., http://www.few.vu.nl~iwanicki/, Aug. 2008.
[33] B. Leong, B. Liskov, and R. Morris, "Geographic Routing without Planarization," Proc. Third USENIX Symp. Networked Systems Design and Implementation (NSDI '06), pp. 339-352, May 2006.
[34] J. Newsome and D. Song, "GEM: Graph EMbedding for Routing and Data-Centric Storage in Sensor Networks without Geographic Information," Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 76-88, Nov. 2003.
[35] Y. Mao, F. Wang, L. Qiu, S.S. Lam, and J.M. Smith, "S4: Small State and Small Stretch Routing Protocol for Large Wireless Sensor Networks," Proc. Fourth USENIX Symp. Networked Systems Design and Implementation (NSDI '07), pp. 101-114, Apr. 2007.
[36] A. Woo, T. Tong, and D. Culler, "Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks," Proc. First ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '03), pp. 14-27, Nov. 2003.
[37] J. Polastre, J. Hill, and D. Culler, "Versatile Low Power Media Access for Wireless Sensor Networks," Proc. Second ACM Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), pp. 95-107, Nov. 2004.
[38] T. Melodia, M.C. Vuran, and D. Pompili, "The State of the Art in Cross-Layer Design for Wireless Sensor Networks," Proc. Second EuroNGI Workshop Wireless and Mobility, pp. 78-92, July 2005.
[39] P. Dutta, D. Culler, and S. Shenker, "Procrastination Might Lead to a Longer and More Useful Life," Proc. Sixth ACM Workshop Hot Topics in Networks (HotNets-VI), Nov. 2007.

Index Terms:
Hierarchical routing, area hierarchy, gossiping, gossip-based algorithms, self-organization, wireless sensor networks.
Citation:
Konrad Iwanicki, Maarten van Steen, "Gossip-Based Self-Management of a Recursive Area Hierarchy for Large Wireless SensorNets," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 4, pp. 562-576, April 2010, doi:10.1109/TPDS.2009.89
Usage of this product signifies your acceptance of the Terms of Use.