{"title":"一种基于遗传算法的无线传感器网络多跳路由方案","authors":"M. Benmahdi, M. Lehsaini","doi":"10.1109/EDiS49545.2020.9296444","DOIUrl":null,"url":null,"abstract":"Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these networks are generally composed of a large number of energy-constrained sensors which are expected to run autonomously for long times and it may be cost-prohibitive to replace exhausted batteries of these sensors or even impossible in harsh environments. In this paper, we propose a novel routing protocol using genetic algorithm approach and K-means method to prolong network lifetime in WSNs. We involve k-means method to create clusters wherein cluster-heads are elected based on distance, residual energy and the occurrence of nodes state as cluster-head (CH). Moreover, we use genetic algorithm approach to establish CH-to-CH paths from a source node to the base station. The clustering process is performed if all members of a cluster are dead and the path constructing process will be triggered if a node changes status i.e. a member node becomes a CH. Simulation results demonstrate that our proposal provides better performance in terms of network lifetime and energy consumption compared to other routing protocols.","PeriodicalId":119426,"journal":{"name":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A GA-based Multihop Routing Scheme using K-Means Clustering approach for Wireless Sensor Networks\",\"authors\":\"M. Benmahdi, M. Lehsaini\",\"doi\":\"10.1109/EDiS49545.2020.9296444\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these networks are generally composed of a large number of energy-constrained sensors which are expected to run autonomously for long times and it may be cost-prohibitive to replace exhausted batteries of these sensors or even impossible in harsh environments. In this paper, we propose a novel routing protocol using genetic algorithm approach and K-means method to prolong network lifetime in WSNs. We involve k-means method to create clusters wherein cluster-heads are elected based on distance, residual energy and the occurrence of nodes state as cluster-head (CH). Moreover, we use genetic algorithm approach to establish CH-to-CH paths from a source node to the base station. The clustering process is performed if all members of a cluster are dead and the path constructing process will be triggered if a node changes status i.e. a member node becomes a CH. Simulation results demonstrate that our proposal provides better performance in terms of network lifetime and energy consumption compared to other routing protocols.\",\"PeriodicalId\":119426,\"journal\":{\"name\":\"2020 Second International Conference on Embedded & Distributed Systems (EDiS)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-11-03\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 Second International Conference on Embedded & Distributed Systems (EDiS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EDiS49545.2020.9296444\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 Second International Conference on Embedded & Distributed Systems (EDiS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EDiS49545.2020.9296444","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A GA-based Multihop Routing Scheme using K-Means Clustering approach for Wireless Sensor Networks
Energy efficiency is a very challenging issue in wire-less sensor networks (WSNs) since these networks are generally composed of a large number of energy-constrained sensors which are expected to run autonomously for long times and it may be cost-prohibitive to replace exhausted batteries of these sensors or even impossible in harsh environments. In this paper, we propose a novel routing protocol using genetic algorithm approach and K-means method to prolong network lifetime in WSNs. We involve k-means method to create clusters wherein cluster-heads are elected based on distance, residual energy and the occurrence of nodes state as cluster-head (CH). Moreover, we use genetic algorithm approach to establish CH-to-CH paths from a source node to the base station. The clustering process is performed if all members of a cluster are dead and the path constructing process will be triggered if a node changes status i.e. a member node becomes a CH. Simulation results demonstrate that our proposal provides better performance in terms of network lifetime and energy consumption compared to other routing protocols.