EEMC: An energy-efficient multi-level clustering algorithm for large-scale wireless sensor networks

  • Authors:

  • Yan Jin;Ling Wang;Yoohwan Kim;Xiaozong Yang

  • Affiliations:

  • Harbin Institute of Technology, School of Computer Science, Harbin 150001, China;Harbin Institute of Technology, School of Computer Science, Harbin 150001, China;University of Nevada, School of Computer Science, Las Vegas, NV 89119, United States;Harbin Institute of Technology, School of Computer Science, Harbin 150001, China

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

Wireless sensor networks can be used to collect environmental data from the interested area using multi-hop communication. As sensor networks have limited and non-rechargeable energy resources, energy efficiency is a very important issue in designing the topology, which affects the lifetime of sensor networks greatly. In this paper, the energy consumption is modeled and compared under the flat scheme and the clustering scheme, respectively. Motivated by the analysis, we propose an energy-efficient multi-level clustering algorithm called EEMC, which is designed to achieve minimum energy consumption in sensor networks. The cluster head election scheme is also considered in EEMC. EEMC terminates in O(loglogN) iterations given N nodes. When the path loss exponent is 2, EEMC also achieves minimum latency. We focus on the case where sink node is remotely located and sensor nodes are stationary. Simulation results demonstrate that our proposed algorithm is effective in prolonging the network lifetime of a large-scale network, as well as low latency and moderate overhead across the network.