EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Enhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm

Abdulla Juwaied iD, Lidia Jackowska-Strumillo iD, Artur Sierszeń iD

Sensors · 09.02.2025 · 25 (4) · 1029

DOI: 10.3390/s25041029 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Sensors, online erschienen am 09.02.2025. Verfasst von Abdulla Juwaied und 2 weiteren Autor:innen. Beteiligte Einrichtung: Institute of Applied Computer Science, Lodz University of Technology, ul. Stefanowskiego 18, 90-537 Lodz, Poland. Die Arbeit wurde bisher 30-mal zitiert (Crossref) und nennt 47 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Lodz University of Technology, statutory funds of the Institute of Applied Computer Science, Lodz University of Technology, Poland.

AbstractSchlagwörterBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Wireless Sensor Networks are formed by tiny, self-contained, battery-powered computers with radio links that can sense their surroundings for events of interest and store and process the sensed data. Sensor nodes wirelessly communicate with each other to relay information to a central base station. Energy consumption is the most critical parameter in Wireless Sensor Networks (WSNs). Network lifespan is directly influenced by the energy consumption of the sensor nodes. All sensors in the network send and receive data from the base station (BS) using different routing protocols and algorithms. These routing protocols use two main types of clustering: hierarchical clustering and flat clustering. Consequently, effective clustering within Wireless Sensor Network (WSN) protocols is essential for establishing secure connections among nodes, ensuring a stable network lifetime. This paper introduces a novel approach to improve energy efficiency, reduce the length of network connections, and increase network lifetime in heterogeneous Wireless Sensor Networks by employing the K-Nearest Neighbours (KNN) algorithm to optimise node selection and clustering mechanisms for four protocols: Low-Energy Adaptive Clustering Hierarchy (LEACH), Stable Election Protocol (SEP), Threshold-sensitive Energy Efficient sensor Network (TEEN), and Distributed Energy-efficient Clustering (DEC). Simulation results obtained using MATLAB (R2024b) demonstrate the efficacy of the proposed K-Nearest Neighbours algorithm, revealing that the modified protocols achieve shorter distances between cluster heads and nodes, reduced energy consumption, and improved network lifetime compared to the original protocols. The proposed KNN-based approach enhances the network’s operational efficiency and security, offering a robust solution for energy management in WSNs.

Schlagwörter

Stichwörter der Autor:innen

DECKNNLEACHSEPTEENcluster head positionclusteringenergy consumptionsensors

Autor:innen und Institutionen

  • Institute of Applied Computer Science, Lodz University of Technology, ul. Stefanowskiego 18, 90-537 Lodz, Poland.

ORCID-Profile: Abdulla Juwaied, Lidia Jackowska-Strumillo, Artur Sierszeń

Förderung

  • Lodz University of Technology
  • statutory funds of the Institute of Applied Computer Science, Lodz University of Technology, Poland

Zitieren

APA

Juwaied, A., Jackowska-Strumillo, L., & Sierszeń, A. (2025). Enhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm. Sensors, 25(4), 1029. https://doi.org/10.3390/s25041029

Vancouver

Juwaied A, Jackowska-Strumillo L, Sierszeń A. Enhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm. Sensors. 2025;25(4):1029. doi:10.3390/s25041029

BibTeX
@article{Juwaied2025,
  author = {Juwaied, Abdulla and Jackowska-Strumillo, Lidia and Sierszeń, Artur},
  title = {Enhancing Clustering Efficiency in Heterogeneous Wireless Sensor Network Protocols Using the K-Nearest Neighbours Algorithm},
  journal = {Sensors},
  year = {2025},
  volume = {25},
  number = {4},
  pages = {1029},
  doi = {10.3390/s25041029}
}
Kostenlos starten →