{"title":"基于遗传算法的无线传感器网络覆盖保持技术","authors":"Di Xin","doi":"10.1109/ICCIT.2010.5711172","DOIUrl":null,"url":null,"abstract":"Coverage is one of the basic characteristics for wireless sensor networks. In this paper, we investigate the coverage preserving cluster head election technique. Sensors are optimally scheduled in different statuses between different rounds by genetic algorithm. A set of simulations is carried out. The simulation results show that, using the optimal schedule generated by genetic algorithm, our method can preserve the coverage performance better than LEACH.","PeriodicalId":131337,"journal":{"name":"5th International Conference on Computer Sciences and Convergence Information Technology","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Coverage-preserving techniques based-on genetic algorithm for wireless sensor networks\",\"authors\":\"Di Xin\",\"doi\":\"10.1109/ICCIT.2010.5711172\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coverage is one of the basic characteristics for wireless sensor networks. In this paper, we investigate the coverage preserving cluster head election technique. Sensors are optimally scheduled in different statuses between different rounds by genetic algorithm. A set of simulations is carried out. The simulation results show that, using the optimal schedule generated by genetic algorithm, our method can preserve the coverage performance better than LEACH.\",\"PeriodicalId\":131337,\"journal\":{\"name\":\"5th International Conference on Computer Sciences and Convergence Information Technology\",\"volume\":\"5 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"5th International Conference on Computer Sciences and Convergence Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCIT.2010.5711172\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th International Conference on Computer Sciences and Convergence Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIT.2010.5711172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Coverage-preserving techniques based-on genetic algorithm for wireless sensor networks
Coverage is one of the basic characteristics for wireless sensor networks. In this paper, we investigate the coverage preserving cluster head election technique. Sensors are optimally scheduled in different statuses between different rounds by genetic algorithm. A set of simulations is carried out. The simulation results show that, using the optimal schedule generated by genetic algorithm, our method can preserve the coverage performance better than LEACH.