Please use this identifier to cite or link to this item:
https://dspace.univ-ouargla.dz/jspui/handle/123456789/20901
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | BENMAHDI, Bouchra Meriem | - |
dc.contributor.author | LEHSAINI, Mohamed | - |
dc.date.accessioned | 2019-06-20T08:58:48Z | - |
dc.date.available | 2019-06-20T08:58:48Z | - |
dc.date.issued | 2019-03-05 | - |
dc.identifier.uri | http://dspace.univ-ouargla.dz/jspui/handle/123456789/20901 | - |
dc.description | Le 2eme Conference Internationale sur intelligence Artificielle et les Technologies Information ICAIIT 2019 | en_US |
dc.description.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. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Université Kasdi Merbah Ouargla | en_US |
dc.relation.ispartofseries | 2019; | - |
dc.subject | K-Means method | en_US |
dc.subject | Silhouette method | en_US |
dc.subject | Dynamic clustering | en_US |
dc.subject | clustering | en_US |
dc.title | A Conditional Distributed K-means Cluster-based Routing Scheme for Wireless Sensor Networks | en_US |
dc.type | Article | en_US |
Appears in Collections: | 2. Faculté des nouvelles technologies de l’information et de la communication |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Bouchra Meriem BENMAHDI.pdf | 1,25 MB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.