Cluster size optimization in sensor networks with decentralized cluster-based protocols

  • Authors:
  • Navid Amini;Alireza Vahdatpour;Wenyao Xu;Mario Gerla;Majid Sarrafzadeh

  • Affiliations:
  • Computer Science Department, University of California, Los Angeles, United States;Computer Science Department, University of California, Los Angeles, United States;Computer Science Department, University of California, Los Angeles, United States;Computer Science Department, University of California, Los Angeles, United States;Computer Science Department, University of California, Los Angeles, United States

  • Venue:
  • Computer Communications
  • Year:
  • 2012

Quantified Score

Hi-index 0.24

Visualization

Abstract

Network lifetime and energy-efficiency are viewed as the dominating considerations in designing cluster-based communication protocols for wireless sensor networks. This paper analytically provides the optimal cluster size that minimizes the total energy expenditure in such networks, where all sensors communicate data through their elected cluster heads to the base station in a decentralized fashion. LEACH, LEACH-Coverage, and DBS comprise three cluster-based protocols investigated in this paper that do not require any centralized support from a certain node. The analytical outcomes are given in the form of closed-form expressions for various widely-used network configurations. Extensive simulations on different networks are used to confirm the expectations based on the analytical results. To obtain a thorough understanding of the results, cluster number variability problem is identified and inspected from the energy consumption point of view.