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 dusters formed, and the energy requirements of the algorithm are investigated. The performance of the algorithm is described analytically and via simulation.
Author supplied keywords
Cite
CITATION STYLE
Wen, C. Y., & Sethares, W. A. (2005). Automatic decentralized clustering for wireless sensor networks. Eurasip Journal on Wireless Communications and Networking. https://doi.org/10.1155/WCN.2005.686
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.