Energy-Efficient Clustering Algorithm in Wireless Sensor Networks

  • DaeHwan Kim
  • SangHak Lee
  • We Duke Cho
Conference paper

DOI: 10.1007/11802167_108

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4096)
Cite this paper as:
Kim D., Lee S., Cho W.D. (2006) Energy-Efficient Clustering Algorithm in Wireless Sensor Networks. In: Sha E., Han SK., Xu CZ., Kim MH., Yang L.T., Xiao B. (eds) Embedded and Ubiquitous Computing. EUC 2006. Lecture Notes in Computer Science, vol 4096. Springer, Berlin, Heidelberg

Abstract

Wireless sensor networks is a key technology for new ways of interaction between computers and the physical environment. However, the energy constrained and limited computing resources of the sensor nodes present major challenges in gathering data. Since sensor nodes are densely deployed, redundant data may occur. While cluster-based data gathering is efficient at energy and bandwidth, it’s difficult to cluster network efficiently. In this work, a new distributed clustering algorithm for ubiquitous sensor network is presented. Clustering is based on the distance between nodes and the number in a cluster for wireless sensor networks. Simulation results show that the proposed algorithm balances the energy dissipation over the whole network thus increase the amount of data delivery to the sink.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • DaeHwan Kim
    • 1
    • 2
  • SangHak Lee
    • 1
  • We Duke Cho
    • 2
  1. 1.Intelligent IT System CenterKorea Electronics Technology InstituteGyeonggi-doSouth Korea
  2. 2.Department of Electrical and Computer EngineeringAjou UniversitySuwonSouth Korea

Personalised recommendations