Relay-Assisted Wireless Sensor Networks Using KNN-DBSCAN Static Clustering

Wireless sensor networks (WSNs) play a vital role in modern applications such as healthcare, smart cities, and environmental monitoring. However, their potential is often limited by energy constraints, which reduce the lifetime of the network and the data collection capabilities. To address this challenge, we propose KDL, a novel hybrid clustering algorithm that combines K-Nearest Neighbor (KNN) and Density-Based Spatial Clustering (DBSCAN) to optimize energy efficiency in WSNs. KDL first uses KNN to analyze internode distances and determine optimal clustering parameters, which guide DBSCAN in forming robust clusters. After clustering, KNN reassigns noise points to appropriate clusters, improving coverage. Next, an energy-aware cluster head (CH) selection mechanism, inspired by LEACH but enhanced with node energy levels and cluster centroid distances, ensures balanced energy consumption. In addition, a relay-assisted communication strategy optimizes data transmission by strategically placing relay nodes between the CH and the base station. Through extensive simulations, KDL shows significant performance improvements over existing approaches, substantially enhancing network lifetime while maintaining energy efficiency. These advancements position KDL as a promising solution for real-world energy-efficient WSN deployments.

Authors

Institutions

Publication Details

Journal
IEEE Access
Published
2025-01-01
DOI
https://doi.org/10.1109/access.2025.3590790
Primary Topic
Energy Efficient Wireless Sensor Networks
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Relay-Assisted Wireless Sensor Networks Using KNN-DBSCAN Static Clustering

Tansal Güçlüoğlu, Tamer Dağ, Thierry Taning Longla
IEEE Access
Energy Efficient Wireless Sensor Networks
article

Relay-Assisted Wireless Sensor Networks Using KNN-DBSCAN Static Clustering

Tansal Güçlüoğlu, Tamer Dağ, Thierry Taning Longla
article en

Abstract

Wireless sensor networks (WSNs) play a vital role in modern applications such as healthcare, smart cities, and environmental monitoring. However, their potential is often limited by energy constraints, which reduce the lifetime of the network and the data collection capabilities. To address this challenge, we propose KDL, a novel hybrid clustering algorithm that combines K-Nearest Neighbor (KNN) and Density-Based Spatial Clustering (DBSCAN) to optimize energy efficiency in WSNs. KDL first uses KNN to analyze internode distances and determine optimal clustering parameters, which guide DBSCAN in forming robust clusters. After clustering, KNN reassigns noise points to appropriate clusters, improving coverage. Next, an energy-aware cluster head (CH) selection mechanism, inspired by LEACH but enhanced with node energy levels and cluster centroid distances, ensures balanced energy consumption. In addition, a relay-assisted communication strategy optimizes data transmission by strategically placing relay nodes between the CH and the base station. Through extensive simulations, KDL shows significant performance improvements over existing approaches, substantially enhancing network lifetime while maintaining energy efficiency. These advancements position KDL as a promising solution for real-world energy-efficient WSN deployments.

IEEE AccessVol. 13
American University of the Middle East (KW), Yıldız Technical University (TR)
Affordable and clean energy
Openalex Percentile: Top 81%
Energy Efficient Wireless Sensor Networks
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.