Accès ouvert · CC BY

New Hierarchical Routing Protocol Based on K-Means Clustering with Exploiting Free Time Slot for Wireless Sensor Networks

Article scientifique 2022 Sciences mathématiques et statistiques Anglais

Résumé

The operation time of LEACH protocol is divided into several frames. Each frame consists of a number of equal time slots where the selection of cluster heads and the re-establishment of clusters are periodic. Each member of the cluster exploits its own time slot to transmit the data, then it turns off its radio to reduce energy consumption. Here, the clusters generated are not uniformly distributed and the time slots of the dead member nodes are not allocated. We propose an improved version, which is based simultaneously on the integration of the clustering approach K-Means and the exploitation of the free time slot in favor of cluster head in the transmission phase. The results show that the proposed protocol allowed us to achieve increased throughput, improved reliability of the packet delivery ratio, low routing load and an effective reduction in energy consumption for low node density in WSNs.

Citer ce document

Echoukairi, H., Idrissi, A., & Omary, F. (2022). New Hierarchical Routing Protocol Based on K-Means Clustering with Exploiting Free Time Slot for Wireless Sensor Networks. International Journal of Interactive Mobile Technologies (iJIM). https://doi.org/10.3991/ijim.v16i08.29863

Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)

Accès au document

Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter

Voir l'article sur le site de la revue

Licence et provenance

Licence : CC BY

Notice moissonnée depuis OpenAlex le 06/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →

Statistiques

Consultations (hors robots) : 15

Téléchargements (hors robots) : 0

Méthode de comptage