{"title":"Maximum data gathering through speed control of path-constrained mobile sink in WSN","authors":"Dr. Naween Kumar, D. Dash","doi":"10.1109/ISED.2017.8303933","DOIUrl":null,"url":null,"abstract":"Recently, mobile sink based data gathering has been getting popularity among researchers in Wireless Sensor Networks (WSNs. As, sink mobility achieves prolonged network lifetime of the network by distributing load among the sensors. In certain applications, a mobile sink has to be moved along a given fixed path. But, due to fixed path and relatively slower speed of mobile sink, data gathering is delayed. Which can be reduced through optimizing the motion of the mobile sink. In this paper, our focus is to find the speed-schedule of the path-constrained mobile sink along a fixed path such that, the mobile sink will collect maximum data from the network within a given time. We refer the proposed problem as maximum data gathering motion planning of a mobile sink within a fixed time deadline (MDMPMS). We propose a deterministic polynomial time algorithm for the problem. Furthermore, we evaluate the performance of the proposed algorithm using simulation in MATLAB.","PeriodicalId":147019,"journal":{"name":"2017 7th International Symposium on Embedded Computing and System Design (ISED)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 7th International Symposium on Embedded Computing and System Design (ISED)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISED.2017.8303933","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8
Abstract
Recently, mobile sink based data gathering has been getting popularity among researchers in Wireless Sensor Networks (WSNs. As, sink mobility achieves prolonged network lifetime of the network by distributing load among the sensors. In certain applications, a mobile sink has to be moved along a given fixed path. But, due to fixed path and relatively slower speed of mobile sink, data gathering is delayed. Which can be reduced through optimizing the motion of the mobile sink. In this paper, our focus is to find the speed-schedule of the path-constrained mobile sink along a fixed path such that, the mobile sink will collect maximum data from the network within a given time. We refer the proposed problem as maximum data gathering motion planning of a mobile sink within a fixed time deadline (MDMPMS). We propose a deterministic polynomial time algorithm for the problem. Furthermore, we evaluate the performance of the proposed algorithm using simulation in MATLAB.