Skip to main content

Automatic Decentralized Clustering for Wireless Sensor Networks


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



Corresponding author

Correspondence to Chih-Yu Wen.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Wen, C., Sethares, W.A. Automatic Decentralized Clustering for Wireless Sensor Networks. J Wireless Com Network 2005, 248089 (2005).

Download citation


  • wireless sensor networks
  • clustering algorithm
  • random waiting timer