Intelligent Clustering and Adaptive Energy Management in Wireless Sensor Networks with KDE-Based Deployment

Wireless sensor networks (WSNs) are widely used in IoT, environmental monitoring, and industrial systems, but ensuring energy efficiency, extended network lifetime, and reliable communication under real-world constraints remains challenging. This work proposes a novel clustering framework that integrates kernel density estimation (KDE)-based adaptive node deployment, silhouette-optimized K-means clustering, Bayesian cluster head (CH) selection with Gaussian noise-based energy uncertainty modeling, energy-efficient coverage control, and carrier sense multiple access with collision avoidance-based data transmission. Unlike conventional approaches that rely on fixed clustering and uniform deployments, our framework supports terrain-aware node placement and dynamic CH selection based on residual energy and distance under imperfect sensing conditions. Simulation results demonstrate significant improvements in performance, including over 35% extension in network lifetime and higher coverage retention under energy constraints, compared to baseline methods such as LEACH and K-LEACH. While detailed metrics vary per run due to adaptive parameters and stochastic node behavior, these outcomes validate the scalability, robustness, and practical relevance of the proposed method for real-world WSN deployments.

Authors

Institutions

Publication Details

Journal
Sensors
Published
2025-04-19
DOI
https://doi.org/10.3390/s25082588
Citations
4
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
5.95
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Intelligent Clustering and Adaptive Energy Management in Wireless Sensor Networks with KDE-Based Deployment

Mainak Kundu, Ria Kanjilal, Ismail Uysal
4 citations
Sensors
Energy Efficient Wireless Sensor Networks
5.95
article

Intelligent Clustering and Adaptive Energy Management in Wireless Sensor Networks with KDE-Based Deployment

Mainak Kundu, Ria Kanjilal, Ismail Uysal
article en
4 citations

Abstract

Wireless sensor networks (WSNs) are widely used in IoT, environmental monitoring, and industrial systems, but ensuring energy efficiency, extended network lifetime, and reliable communication under real-world constraints remains challenging. This work proposes a novel clustering framework that integrates kernel density estimation (KDE)-based adaptive node deployment, silhouette-optimized K-means clustering, Bayesian cluster head (CH) selection with Gaussian noise-based energy uncertainty modeling, energy-efficient coverage control, and carrier sense multiple access with collision avoidance-based data transmission. Unlike conventional approaches that rely on fixed clustering and uniform deployments, our framework supports terrain-aware node placement and dynamic CH selection based on residual energy and distance under imperfect sensing conditions. Simulation results demonstrate significant improvements in performance, including over 35% extension in network lifetime and higher coverage retention under energy constraints, compared to baseline methods such as LEACH and K-LEACH. While detailed metrics vary per run due to adaptive parameters and stochastic node behavior, these outcomes validate the scalability, robustness, and practical relevance of the proposed method for real-world WSN deployments.

SensorsVol. 25(8)
California Polytechnic State University (US), University of South Florida (US)
Affordable and clean energy
Openalex Percentile: Top 4%
Energy Efficient Wireless Sensor Networks
5.95
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.