A Nonuniform Clustering Routing Algorithm Based on an Improved K-means Algorithm

In a large-scale wireless sensor network (WSN), densely distributed sensor nodes process a large amount of data. The aggregation of data in a network can consume a great amount of energy. To balance and reduce the energy consumption of nodes in a WSN and extend the network life, this paper proposes...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Computers, materials & continua Jg. 64; H. 3; S. 1725 - 1739
Hauptverfasser: Tang, Xinliang, Zhang, Man, Yu, Pingping, Liu, Wei, Cao, Ning, Xu, Yunfeng
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Henderson Tech Science Press 01.01.2020
Schlagworte:
Algorithms
Clustering
Computer simulation
Distributed sensor systems
Energy consumption
Nodes
Wireless sensor networks
ISSN:1546-2226, 1546-2218, 1546-2226
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:In a large-scale wireless sensor network (WSN), densely distributed sensor nodes process a large amount of data. The aggregation of data in a network can consume a great amount of energy. To balance and reduce the energy consumption of nodes in a WSN and extend the network life, this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm. The algorithm uses a clustering method to form and optimize clusters, and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN. To ensure that the cluster head (CH) selection in the network is fair and that the location of the selected CH is not concentrated within a certain range, we chose the appropriate CH competition radius. Simulation results show that, compared with LEACH, LEACH-C, and the DEEC clustering algorithm, this algorithm can effectively balance the energy consumption of the CH and extend the network life.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1546-2226
1546-2218
1546-2226
DOI:10.32604/cmc.2020.010272