- Research Article
- Open Access
Automatic Decentralized Clustering for Wireless Sensor Networks
EURASIP Journal on Wireless Communications and Networking volume 2005, Article number: 248089 (2005)
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.
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.
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
- wireless sensor networks
- clustering algorithm
- random waiting timer