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

  • Authors:
  • Jiman Hong;Joongjin Kook;Sangjun Lee;Dongseop Kwon;Sangho Yi

  • Affiliations:
  • School of Computing, Soongsil University, Seoul, South Korea 156-743;School of Computing, Soongsil University, Seoul, South Korea 156-743;School of Computing, Soongsil University, Seoul, South Korea 156-743;Department of Computer Software, Myongji University, Yongin, South Korea 449-728;School of Computer Engineering, Seoul National University, Seoul, South Korea 151-744

  • Venue:
  • Information Systems Frontiers
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.