Wireless sensor networks have emerged recently as an effective way of monitoring remote or inhospitable physical environments. One of the major challenges in devising such networks is how to organize a large amount of sensor nodes without the coordination of any centralized access point. Clustering can not only conserve limited system resource, but also serve as an effective self-organization tool. In this paper, we present a distributed clustering algorithm based on adaptive backoff strategy. By adaptively adjusting the wakeup rate of the exponential distribution, a node with higher residual energy is more likely to be elected clusterhead. We also take advantage of the contention-based channel access method to ensure that clusterheads are well scattered. Simulation experiments illustrate that our algorithm is able to significantly prolong network life compared with the conventional approach. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Cao, Y., He, C., & Wang, J. (2005). A backoff-based energy efficient clustering algorithm for wireless sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3794 LNCS, pp. 907–916). https://doi.org/10.1007/11599463_88
Mendeley helps you to discover research relevant for your work.