An Energy-Efficient Clustering Mechanism Considering Overlap Avoidance in Wireless Sensor Networks 


Vol. 33,  No. 5, pp. 253-259, May  2008


PDF
  Abstract

Because a sensor node in wireless sensor networks is battery operated and energy constrained, reducing energy consumption of each node is one of important issues. The clustering technique can make network topology be hierarchical and reduce energy consumption of each sensor node. In this paper, we propose an efficient clustering mechanism considering overlap avoidance in wireless sensor networks. The proposed method consists of three parts. The first is to elect cluster heads considering each node's energy. Then clusters are formed by using signal strength in the second phase. Finally we can reduce the cluster overlap problem derived from two or more clusters. In addition, this paper includes performance evaluation of our algorithm. Simulation results show that network lifetime was extended up to 75 percents than LEACH and overlapped clusters are decreased down to nearly zero percents.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

H. Choi, Y. Jung, Y. Baek, "An Energy-Efficient Clustering Mechanism Considering Overlap Avoidance in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 5, pp. 253-259, 2008. DOI: .

[ACM Style]

Hoon Choi, Yeonsu Jung, and Yunju Baek. 2008. An Energy-Efficient Clustering Mechanism Considering Overlap Avoidance in Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 33, 5, (2008), 253-259. DOI: .

[KICS Style]

Hoon Choi, Yeonsu Jung, Yunju Baek, "An Energy-Efficient Clustering Mechanism Considering Overlap Avoidance in Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 33, no. 5, pp. 253-259, 5. 2008.