This paper presents a Distributed, Efficient Clustering Approach (DECA) for ad hoc and sensor networks. DECA can provide robustness against moderate node mobility and at the same time render energy-efficiency. The identified clusterheads cover the whole network and each node in the network can determine its cluster and only one cluster. The algorithm terminates in deterministic time without iterations, and each node transmits only one message during the algorithm. We prove analytically the correctness and complexity of the algorithm, and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Li, J. H., Yu, M., & Levy, R. (2005). A distributed efficient clustering approach for ad hoc and sensor networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3794 LNCS, pp. 937–949). https://doi.org/10.1007/11599463_91
Mendeley helps you to discover research relevant for your work.