Dynamic Head Election Method For Energy-Efficient Cluster Reconfiguration In Wireless Sensor Networks 


Vol. 30,  No. 11, pp. 1064-1072, Nov.  2005


PDF
  Abstract

For the efficient operation of sensor networks, it is very important to design sensor networks for sensors to utilize their energies in very effective ways. Cluster-based routing schemes such as LEACH can achieve their energy efficiencies by delivering data between cluster heads and sensor nodes. In those cluster-based schemes, cluster reconfiguration algorithm is one of the most critical issues to achieve longer operation lifetime of sensor networks. In this paper, we propose a new energy efficient cluster reconfiguration algorithm. Proposed method does not require any location or energy information of sensors, and can configure clusters with fair cluster regions such that all the sensors in a sensor network can utilize their energies equally. The performances of the proposed scheme have been compared with LEACH and LEACH-C.

  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]

Y. Jo, H. Lee, B. Roh, S. Yoo, "Dynamic Head Election Method For Energy-Efficient Cluster Reconfiguration In Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 11, pp. 1064-1072, 2005. DOI: .

[ACM Style]

Yong-hyun Jo, Hyang-tack Lee, Byeong-hee Roh, and S.W. Yoo. 2005. Dynamic Head Election Method For Energy-Efficient Cluster Reconfiguration In Wireless Sensor Networks. The Journal of Korean Institute of Communications and Information Sciences, 30, 11, (2005), 1064-1072. DOI: .

[KICS Style]

Yong-hyun Jo, Hyang-tack Lee, Byeong-hee Roh, S.W. Yoo, "Dynamic Head Election Method For Energy-Efficient Cluster Reconfiguration In Wireless Sensor Networks," The Journal of Korean Institute of Communications and Information Sciences, vol. 30, no. 11, pp. 1064-1072, 11. 2005.