Melola Discovery

← Melola Discovery

Akses terbuka Jurnal SINTA 1

A k-nearest neighbors algorithm for enhanced clustering in wireless sensor network protocols

International Journal of Reconfigurable and Embedded Systems (IJRES) · Vol. 14 No. 3 (2025) · hlm. 605–613

DOI
10.11591/ijres.v14.i3.pp605-613
ISSN
2722-2608, 2089-4864
Terbit
2025-11-01
Penerbit
Institute of Advanced Engineering and Science
Bahasa
eng
Lisensi
creativecommons.org/licenses/by-sa/4.0

Abstrak

Wireless sensor networks (WSNs) are small, autonomous, battery-powered nodes capable of sensing, storing, and processing data, while communicating wirelessly with a central base station (BS). Optimizing energy consumption is a major challenge to extend the lifetime of these networks. In this study, we propose an innovative approach combining the k-nearest neighbors (KNN) algorithm with hierarchical and flat routing protocols to improve node selection and clustering in three key protocols: low-energy adaptive clustering hierarchy (LEACH), threshold-sensitive energy efficient sensor network protocol (TEEN), and hybrid energy-efficient distributed clustering (HEED). Concretely, KNN is used to rank nodes based on their spatial and energy proximity, thus optimizing the choice of cluster heads (CHs) and reducing long and costly connections. Simulations show a reduction in the inter-CH distance, a decrease in overall energy consumption, and an extension of the network lifetime compared to conventional versions of the protocols. These improvements not only help increase operational efficiency, but also enhance communications stability and security, providing a robust and sustainable solution for critical WSN applications.

Kata kunci

Jaringan kolaborasi para penulis

11 penulis · 28 tautan kepenulisan bersama · 15 lintas organisasi

Arahkan kursor atau ketuk sebuah nama untuk menyorot rekan penulisnya. Klik dua kali untuk membuka halaman penulis.

  • University of Hassan II Casablanca
  • Mohammed V University
  • Université Ibn Zohr
  • Chouaib Doukkali University
  • Université Ibn-Tofail
  • Afiliasi tidak diketahui
  • Organisasi berbeda
  • Organisasi sama
  • Afiliasi tidak diketahui
  • Garis lebih tebal = lebih banyak artikel bersama · lingkaran lebih besar = lebih banyak artikel
Tampilkan sebagai tabel
Rekan penulisOrganisasiArtikel bersama
Abderrahim MaizateUniversity of Hassan II Casablanca12
Issam El MeghrouniUniversity of Hassan II Casablanca3
Mohammed KoundiAfiliasi tidak diketahui3
Najib El KamounChouaib Doukkali University2
Mohamed KoundiUniversité Ibn-Tofail2
Said HarchiAfiliasi tidak diketahui1

Afiliasi berasal dari OpenAlex; metadata OAI-PMH jurnal tidak memuatnya. Penulis tanpa ID OpenAlex dicocokkan berdasarkan nama, sehingga dua orang bisa tergabung atau satu orang bisa terpisah.

Sumber metadata: OAI-PMH (metadata jurnal) http://ijres.iaescore.com/index.php/IJRES/oai, pertama di-harvest 8 Nov 2026, terakhir terlihat 16 Nov 2026.
Metadata asli (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">A k-nearest neighbors algorithm for enhanced clustering in wireless sensor network protocols</dc:title>
	<dc:creator>Hilmani, Adil</dc:creator>
	<dc:creator>Sabri, Yassine</dc:creator>
	<dc:creator>Maizate, Abderrahim</dc:creator>
	<dc:creator>Aouad, Siham</dc:creator>
	<dc:creator>Ayoub, Fouad</dc:creator>
	<dc:subject xml:lang="en-US">Efficient clustering; Energy efficiency; K-nearest neighbors algorithm; Power consumption; Routing protocol; Wireless sensor network</dc:subject>
	<dc:description xml:lang="en-US">Wireless sensor networks (WSNs) are small, autonomous, battery-powered nodes capable of sensing, storing, and processing data, while communicating wirelessly with a central base station (BS). Optimizing energy consumption is a major challenge to extend the lifetime of these networks. In this study, we propose an innovative approach combining the k-nearest neighbors (KNN) algorithm with hierarchical and flat routing protocols to improve node selection and clustering in three key protocols: low-energy adaptive clustering hierarchy (LEACH), threshold-sensitive energy efficient sensor network protocol (TEEN), and hybrid energy-efficient distributed clustering (HEED). Concretely, KNN is used to rank nodes based on their spatial and energy proximity, thus optimizing the choice of cluster heads (CHs) and reducing long and costly connections. Simulations show a reduction in the inter-CH distance, a decrease in overall energy consumption, and an extension of the network lifetime compared to conventional versions of the protocols. These improvements not only help increase operational efficiency, but also enhance communications stability and security, providing a robust and sustainable solution for critical WSN applications.</dc:description>
	<dc:publisher xml:lang="en-US">Institute of Advanced Engineering and Science</dc:publisher>
	<dc:contributor xml:lang="en-US"></dc:contributor>
	<dc:date>2025-11-01</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:type xml:lang="en-US"></dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://ijres.iaescore.com/index.php/IJRES/article/view/21580</dc:identifier>
	<dc:identifier>10.11591/ijres.v14.i3.pp605-613</dc:identifier>
	<dc:source xml:lang="en-US">International Journal of Reconfigurable and Embedded Systems (IJRES); Vol 14, No 3: November 2025; 605-613</dc:source>
	<dc:source>2722-2608</dc:source>
	<dc:source>2089-4864</dc:source>
	<dc:source>10.11591/ijres.v14.i3</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://ijres.iaescore.com/index.php/IJRES/article/view/21580/pdf</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2025 Adil Hilmani, Yassine Sabri, Abderrahim Maizate, Siham Aouad, Fouad Ayoub</dc:rights>
	<dc:rights xml:lang="en-US">http://creativecommons.org/licenses/by-sa/4.0</dc:rights>
</oai_dc:dc>