Saved in:
Bibliographic Details
Main Authors: Zhu, Botao, Bedeer, Ebrahim, Nguyen, Ha H., Barton, Robert, Henry, Jerome
Format: Preprint
Published: 2024
Subjects:
Online Access:https://arxiv.org/abs/2403.15700
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910379542577152
author Zhu, Botao
Bedeer, Ebrahim
Nguyen, Ha H.
Barton, Robert
Henry, Jerome
author_facet Zhu, Botao
Bedeer, Ebrahim
Nguyen, Ha H.
Barton, Robert
Henry, Jerome
contents Energy load balancing is an essential issue in designing wireless sensor networks (WSNs). Clustering techniques are utilized as energy-efficient methods to balance the network energy and prolong its lifetime. In this paper, we propose an improved soft-k-means (IS-k-means) clustering algorithm to balance the energy consumption of nodes in WSNs. First, we use the idea of ``clustering by fast search and find of density peaks'' (CFSFDP) and kernel density estimation (KDE) to improve the selection of the initial cluster centers of the soft k-means clustering algorithm. Then, we utilize the flexibility of the soft-k-means and reassign member nodes considering their membership probabilities at the boundary of clusters to balance the number of nodes per cluster. Furthermore, the concept of multi-cluster heads is employed to balance the energy consumption within clusters. {Extensive simulation results under different network scenarios demonstrate that for small-scale WSNs with single-hop transmission}, the proposed algorithm can postpone the first node death, the half of nodes death, and the last node death on average when compared to various clustering algorithms from the literature.
format Preprint
id arxiv_https___arxiv_org_abs_2403_15700
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Improved Soft-k-Means Clustering Algorithm for Balancing Energy Consumption in Wireless Sensor Networks
Zhu, Botao
Bedeer, Ebrahim
Nguyen, Ha H.
Barton, Robert
Henry, Jerome
Systems and Control
Energy load balancing is an essential issue in designing wireless sensor networks (WSNs). Clustering techniques are utilized as energy-efficient methods to balance the network energy and prolong its lifetime. In this paper, we propose an improved soft-k-means (IS-k-means) clustering algorithm to balance the energy consumption of nodes in WSNs. First, we use the idea of ``clustering by fast search and find of density peaks'' (CFSFDP) and kernel density estimation (KDE) to improve the selection of the initial cluster centers of the soft k-means clustering algorithm. Then, we utilize the flexibility of the soft-k-means and reassign member nodes considering their membership probabilities at the boundary of clusters to balance the number of nodes per cluster. Furthermore, the concept of multi-cluster heads is employed to balance the energy consumption within clusters. {Extensive simulation results under different network scenarios demonstrate that for small-scale WSNs with single-hop transmission}, the proposed algorithm can postpone the first node death, the half of nodes death, and the last node death on average when compared to various clustering algorithms from the literature.
title Improved Soft-k-Means Clustering Algorithm for Balancing Energy Consumption in Wireless Sensor Networks
topic Systems and Control
url https://arxiv.org/abs/2403.15700