What is iHEED?

Topology management is essential for prolonging the lifetime of a sensor network. In [1,2], we presented the HEED (Hybrid, Energy-Efficient, Distributed) clustering algorithm for sensor networks. In HEED, a node autonomously and probabilistically elects to become a cluster head based on its residual energy and its communication cost in its neighborhood. HEED clusters the network in a constant number of iterations, elects cluster heads that are well-distributed in the network, and incurs low message and communication overhead.

HEED is implemented in nesC for TinyOS, and evaluated on Mica2 and Mica2Dot sensor motes. Its code extends the Multihop routing module in TinyOS to cluster the network prior to building the routing tree. In addition, the Surge application, which collects sensors readings at the base station, is modified such that data is aggregated along the routing tree as it is forwarded. The energy consumption is computed using a credit-point system in which a node starts with an initial number of points which are reduced as the node transmits packets, receives packets, senses the environment, and processes data. The clustered multi-hop routing and data aggregation application is referred to as iHEED, and its evaluation on Mica2 and Mica2Dot motes is given in [3].

iHEED code for TinyOS: Click [Here]

Related Publications

[1] Ossama Younis and Sonia Fahmy, "Distributed Clustering in Ad-hoc Sensor Networks: A Hybrid, Energy-Efficient Approach," In Proceedings of IEEE INFOCOM, volume 1, pp. 629-640, March 2004. [PDF] [Postscript] [Presentation slides in Powerpoint]

[2] Ossama Younis and Sonia Fahmy, "HEED: A Hybrid, Energy-Efficient, Distributed Clustering Approach for Ad-hoc Sensor Networks," IEEE Transactions on Mobile Computing, volume 3, issue 4, pp. 366-379, Oct-Dec 2004. [PDF] [Postscript]

[3] Ossama Younis and Sonia Fahmy, "An Experimental Study of Routing and Data Aggregation in Sensor Networks," In Proceedings of the International Workshop on Localized Communication and Topology Protocols for Ad hoc Networks (LOCAN), held in conjunction with The 2nd IEEE International Conference on Mobile Ad Hoc and Sensor Systems (MASS-2005), November 2005. [PDF] [Postscript]

[4] Ossama Younis, Sonia Fahmy, and Paolo Santi, "Robust Communications for Sensor Networks in Hostile Environments," In Proceedings of the 12th IEEE International Workshop on Quality of Service (IWQoS), pp. 10-19, June 2004. [PDF] [Postscript] [Presentation slides in Powerpoint]

[5] Ossama Younis and Sonia Fahmy, "A Framework for Distributed Time Synchronization in Multi-hop Sensor Networks," In Proceedings of the Second IEEE International Conference on Sensor and Ad Hoc Communications and Networks (SECON), September 2005. [PDF] [Postscript]

Copyright Statement

All new code in this distribution is Copyright 2005 by the Purdue Research Foundation of Purdue University. All rights reserved. Redistribution and use in source and binary forms are permitted provided that this entire copyright notice is duplicated in all such copies, and that any documentation, announcements, and other materials related to such distribution and use acknowledge that the software was developed at Purdue University, West Lafayette, IN. No charge may be made for copies, derivations, or distributions of this material without the express written consent of the copyright holder. Neither the name of the University nor the name of the author may be used to endorse or promote products derived from this material without specific prior written permission. THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR ANY PARTICULAR PURPOSE.


Please contact: Ossama Younis younis@ece.arizona.edu for any questions or problems with the code.

Created by: Ossama Younis
Last updated by: Sonia Fahmy
September 1st, 2005