{"title":"A Variable Length Genetic Algorithm approach to Optimize Data Collection using Mobile Sink in Wireless Sensor Networks","authors":"Raj Anwit","doi":"10.1109/SPIN.2018.8474259","DOIUrl":null,"url":null,"abstract":"Data collection using mobile sink (MS) in wireless sensor network (WSN) is an efficient approach to collect data from sensor nodes (SNs). There are several advantages of using a MS like, it helps to alleviate the sink hole problem, balances energy consumption of the network, enhances network lifetime etc. The MS has to go through the WSN and collect data from SNs by stopping at some predefined locations from where SNs are in its vicinity. Finding the number of such locations is a fundamental problem in the path design of a MS. In this paper, we present a novel variable length gentic algorithm (VLGA) to find a solution to the problem. The algorithm finds the optimal number and location of sojourn points which are used to design the tour of the MS. The algorithm is simulated extensively and compared with the TSP algorithm. The results obtained shows better performance of VLGA over TSP algorithm in terms of path length and data collection time of the MS.","PeriodicalId":184596,"journal":{"name":"2018 5th International Conference on Signal Processing and Integrated Networks (SPIN)","volume":"26 4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 5th International Conference on Signal Processing and Integrated Networks (SPIN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SPIN.2018.8474259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7
Abstract
Data collection using mobile sink (MS) in wireless sensor network (WSN) is an efficient approach to collect data from sensor nodes (SNs). There are several advantages of using a MS like, it helps to alleviate the sink hole problem, balances energy consumption of the network, enhances network lifetime etc. The MS has to go through the WSN and collect data from SNs by stopping at some predefined locations from where SNs are in its vicinity. Finding the number of such locations is a fundamental problem in the path design of a MS. In this paper, we present a novel variable length gentic algorithm (VLGA) to find a solution to the problem. The algorithm finds the optimal number and location of sojourn points which are used to design the tour of the MS. The algorithm is simulated extensively and compared with the TSP algorithm. The results obtained shows better performance of VLGA over TSP algorithm in terms of path length and data collection time of the MS.