A new level based clustering scheme for wireless sensor networks

  • Authors:
  • F. Tashtarian;M. Tolou Honary;M. Mazinani;A. T. Haghighat;J. Chitizadeh

  • Affiliations:
  • Dept. of Computer and Information Technology, Islamic Azad University, Qazvin, Iran;Computer and Communication Research Center, Mashhad, Iran;Computer and Communication Research Center, Mashhad, Iran;Dept. of Computer and Information Technology, Islamic Azad University, Qazvin, Iran;Dept. of Electrical Engineering, Ferdowsi University, Mashhad, Iran

  • Venue:
  • AICCSA '08 Proceedings of the 2008 IEEE/ACS International Conference on Computer Systems and Applications
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

in this paper, we investigate a clustering protocol for single hop wireless sensor networks that employs a competitive scheme for cluster head selection. The proposed algorithm is named EECS-M that is a modified version to the well known protocol EECS where some of the nodes become volunteers to be cluster heads with an equal probability. In the competition phase in contrast to EECS using a fixed competition range for any volunteer node, we assign a variable competition range to it that is related to its distance to base station. The volunteer nodes compete in their competition ranges and every one with more residual energy would become cluster head. Our objective is to balance the energy consumption of the cluster heads all over the network. Simulation results show the more balanced energy consumption and longer lifetime.