Energy-Distance-Function-Based Improved K-Means for Clustering Routing Algorithm

In wireless sensor networks (WSNs), conventional clustering routing algorithms often lead to uneven distribution of cluster heads (CHs), resulting in imbalanced and high-energy consumption. Addressing these challenges, this study introduces a novel algorithm, termed the energy distance function-base...

Full description

Saved in:
Bibliographic Details
Published in:IEEE internet of things journal Vol. 11; no. 22; pp. 36763 - 36774
Main Authors: Zhou, Lin, Zhang, Meng, Wei, Qian, Jin, Yong, Wang, Saidi, Yan, Jiayuan
Format: Journal Article
Language:English
Published: Piscataway IEEE 15.11.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Adaptation models
Adaptive algorithms
Algorithms
Cluster analysis
Cluster head (CH) selection
Clustering
Clustering algorithms
Distance factor
Energy consumption
energy distance function
Energy distribution
Energy efficiency
Internet of Things
K-means clustering
Nodes
Residual energy
Routing
Vector quantization
wireless sensor network (WSN)
Wireless sensor networks
ISSN:2327-4662, 2327-4662
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In wireless sensor networks (WSNs), conventional clustering routing algorithms often lead to uneven distribution of cluster heads (CHs), resulting in imbalanced and high-energy consumption. Addressing these challenges, this study introduces a novel algorithm, termed the energy distance function-based improved K-means algorithm (EDFIKM). This algorithm synthesizes the principles of the low-energy adaptive clustering hierarchy (LEACH) with the K-means clustering methodology. Key to this approach is the formulation of an adaptive weighted energy distance function that accounts for nodes' residual energy, their proximity to cluster centers, and dynamic weights for energy and distance factors. This function strategically mitigates the randomness in CH selection. Incorporating this function into the K-means clustering process achieves a more uniform distribution of CHs and an equitable allocation of nodes across clusters. Importantly, this contributes to a balanced energy load and a reduction in overall network energy consumption. Simulation studies validate that the EDFIKM algorithm efficiently lowers network energy demands and extends the network lifespan, without adding to the time complexity.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2024.3427395