Skip to main content
  • Research Article
  • Open access
  • Published:

Automatic Decentralized Clustering for Wireless Sensor Networks

Abstract

We propose a decentralized algorithm for organizing an ad hoc sensor network into clusters. Each sensor uses a random waiting timer and local criteria to determine whether to form a new cluster or to join a current cluster. The algorithm operates without a centralized controller, it operates asynchronously, and does not require that the location of the sensors be known a priori. Simplified models are used to estimate the number of clusters formed, and the energy requirements of the algorithm are investigated. The performance of the algorithm is described analytically and via simulation.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chih-Yu Wen.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Wen, CY., Sethares, W.A. Automatic Decentralized Clustering for Wireless Sensor Networks. J Wireless Com Network 2005, 248089 (2005). https://doi.org/10.1155/WCN.2005.686

Download citation

  • Received:

  • Revised:

  • Published:

  • DOI: https://doi.org/10.1155/WCN.2005.686

Keywords