Spectral partitioning and fuzzy C-means based clustering algorithm for wireless sensor networks

0Citations
Citations of this article
12Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In wireless sensor networks (WSNs), sensor nodes are usually powered by battery and thus have very limited energy. Saving energy is an important goal in designing a WSN. It is known that clustering is an effective method to prolong network lifetime. However, how to cluster sensor nodes cooperatively and achieve an optimal number of clusters in a WSN still remains an open issue. In this paper, we first propose an analytical model to determine the optimal number of clusters in a wireless sensor network. We then propose a centralized cluster algorithm based on the spectral partitioning method. The advantage of the method is that the partitioned subgraphs have an approximately equal number of vertices while minimizing the number of edges between the two subgraphs. Then, we present a distributed clustering algorithm based on fuzzy C-means method and the selection strategy of cooperative nodes and cluster heads based on fuzzy logic. Finally, simulation results show that the proposed algorithms outperform the hybrid energy-efficient distributed clustering algorithm in terms of energy cost and network lifetime.

Cite

CITATION STYLE

APA

Hu, J., Guo, S., Liu, D., & Yang, Y. (2017). Spectral partitioning and fuzzy C-means based 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. 10251 LNCS, pp. 161–174). Springer Verlag. https://doi.org/10.1007/978-3-319-60033-8_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free