{"title":"通过将传感器和基站放置在最佳位置来最大限度地减少特定任务移动传感器网络的能耗:遗传算法方法","authors":"Hicham Ouchitachen, Abdellatif Hair, N. Idrissi","doi":"10.1109/WINCOM.2015.7381325","DOIUrl":null,"url":null,"abstract":"Motivated by recent developments in Wireless Sensor Neworks (WSNs), we present in this paper two new algorithms, namely Sensors Genetic Algorithm (SGA) and Base station Genetic Algorithm (BGA). We developed SGA and BGA in order to contribute to solve the energy constraint in a critical sensor network, where each sensor satisfies its own missions depending on its locations. The first algorithm (SGA) aims at equilibrating the mission and communication cost by placing each sensor in the best position relatively to the degree of mission satisfaction and the quality of communication between all nodes. The second algorithm (BGA) locates the Base Station (BS) with respect of available resources in the network. The comparison of our algorithms to other techniques displays that SGA and BGA are efficients in terms of convergence to the appropriate solutions of the complicated optimization problem posed in this case.","PeriodicalId":389513,"journal":{"name":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Minimizing energy consumption in mission-specific mobile sensor networks by placing sensors and base station in the best locations: Genetic algorithms approach\",\"authors\":\"Hicham Ouchitachen, Abdellatif Hair, N. Idrissi\",\"doi\":\"10.1109/WINCOM.2015.7381325\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by recent developments in Wireless Sensor Neworks (WSNs), we present in this paper two new algorithms, namely Sensors Genetic Algorithm (SGA) and Base station Genetic Algorithm (BGA). We developed SGA and BGA in order to contribute to solve the energy constraint in a critical sensor network, where each sensor satisfies its own missions depending on its locations. The first algorithm (SGA) aims at equilibrating the mission and communication cost by placing each sensor in the best position relatively to the degree of mission satisfaction and the quality of communication between all nodes. The second algorithm (BGA) locates the Base Station (BS) with respect of available resources in the network. The comparison of our algorithms to other techniques displays that SGA and BGA are efficients in terms of convergence to the appropriate solutions of the complicated optimization problem posed in this case.\",\"PeriodicalId\":389513,\"journal\":{\"name\":\"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WINCOM.2015.7381325\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Wireless Networks and Mobile Communications (WINCOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WINCOM.2015.7381325","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimizing energy consumption in mission-specific mobile sensor networks by placing sensors and base station in the best locations: Genetic algorithms approach
Motivated by recent developments in Wireless Sensor Neworks (WSNs), we present in this paper two new algorithms, namely Sensors Genetic Algorithm (SGA) and Base station Genetic Algorithm (BGA). We developed SGA and BGA in order to contribute to solve the energy constraint in a critical sensor network, where each sensor satisfies its own missions depending on its locations. The first algorithm (SGA) aims at equilibrating the mission and communication cost by placing each sensor in the best position relatively to the degree of mission satisfaction and the quality of communication between all nodes. The second algorithm (BGA) locates the Base Station (BS) with respect of available resources in the network. The comparison of our algorithms to other techniques displays that SGA and BGA are efficients in terms of convergence to the appropriate solutions of the complicated optimization problem posed in this case.