Please use this identifier to cite or link to this item: https://dspace.univ-ouargla.dz/jspui/handle/123456789/20901
Title: A Conditional Distributed K-means Cluster-based Routing Scheme for Wireless Sensor Networks
Authors: BENMAHDI, Bouchra Meriem
LEHSAINI, Mohamed
Keywords: K-Means method
Silhouette method
Dynamic clustering
clustering
Issue Date: 5-Mar-2019
Publisher: Université Kasdi Merbah Ouargla
Series/Report no.: 2019;
Abstract: The main issue in Wireless Sensor Networks (WSNs) is the energy optimization. Clustering routing approach is a promising solution and so much used, which can prolong the network lifetime. In this paper, we aim to improve the dynamic clustering. The proposed solution uses Silhouette method for de- termining the optimal number of clusters and K-Means approach for the process of forming clusters. The process of determining the number of clusters is triggered when the percentage of alive nodes decreases under a fixed threshold (5%). Simulation results show that our proposal significantly improves network lifetime compared with Distributed K Means routing scheme and LEACH protocol especially when the number of nodes increases.
Description: Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019
URI: http://dspace.univ-ouargla.dz/jspui/handle/123456789/20901
Appears in Collections:2. Faculté des nouvelles technologies de l’information et de la communication

Files in This Item:
File Description SizeFormat 
Bouchra Meriem BENMAHDI.pdf1,25 MBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.