T-LEACH: The method of threshold-based cluster head replacement for wireless sensor networks

In wireless sensor networks, power is the most essential resource because each sensor node has limited batteries. Many kinds of existing clustering protocols have been developed to balance and maximize lifetime of the sensor nodes in wireless sensor networks. These protocols select cluster heads periodically, and they considered only ‘How can we select cluster heads energy-efficiently?’ or ‘What is the best selection of cluster heads?’ without considering energy-efficient period of the cluster heads replacement. Unnecessary head selection may dissipate limited battery power of the entire sensor networks. In this paper, we present T-LEACH, which is a threshold-based cluster head replacement scheme for clustering protocols of wireless sensor networks. T-LEACH minimizes the number of cluster head selection by using threshold of residual energy. Reducing the amount of head selection and replacement cost, the lifetime of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that T-LEACH outperformed LEACH in terms of balancing energy consumption and network lifetime.

[1]  Ossama Younis,et al.  Distributed clustering in ad-hoc sensor networks: a hybrid, energy-efficient approach , 2004, IEEE INFOCOM 2004.

[2]  Wendi Heinzelman,et al.  Energy-efficient communication protocol for wireless microsensor networks , 2000, Proceedings of the 33rd Annual Hawaii International Conference on System Sciences.

[3]  Ibrahim Korpeoglu,et al.  Power efficient data gathering and aggregation in wireless sensor networks , 2003, SGMD.

[4]  Ossama Younis,et al.  HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks , 2004, IEEE Transactions on Mobile Computing.

[5]  Adrian Perrig,et al.  ACE: An Emergent Algorithm for Highly Uniform Cluster Formation , 2004, EWSN.

[6]  Michael D. Dettinger,et al.  Meteorology and Hydrology in Yosemite National Park: A Sensor Network Application , 2003, IPSN.

[7]  Hsiao-Hwa Chen,et al.  SHORT: Shortest Hop Routing Tree for Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[8]  Loren Schwiebert,et al.  Introduction to Wireless Sensor Networking , 2005, Handbook of Sensor Networks.

[9]  A. Manjeshwar,et al.  TEEN: a routing protocol for enhanced efficiency in wireless sensor networks , 2001, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001.

[10]  Wendi B. Heinzelman,et al.  Application-specific protocol architectures for wireless networks , 2000 .

[11]  D.P. Agrawal,et al.  APTEEN: a hybrid protocol for efficient routing and comprehensive information retrieval in wireless , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[12]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[13]  Cauligi S. Raghavendra,et al.  PEGASIS: Power-efficient gathering in sensor information systems , 2002, Proceedings, IEEE Aerospace Conference.

[14]  Ivan Stojmenovic,et al.  Topology Construction and Maintenance in Wireless Sensor Networks , 2005, Handbook of Sensor Networks.

[15]  Dirk Timmermann,et al.  Low energy adaptive clustering hierarchy with deterministic cluster-head selection , 2002, 4th International Workshop on Mobile and Wireless Communications Network.

[16]  Jie Wu,et al.  An energy-efficient unequal clustering mechanism for wireless sensor networks , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..