{"title":"扫描覆盖问题的一种路由调度算法","authors":"Zhiyin Chen, S. Wu, Xudong Zhu, Xiaofeng Gao, Jian Gu, Guihai Chen","doi":"10.1109/ICDCS.2015.91","DOIUrl":null,"url":null,"abstract":"In order to decrease the sweep cycle and the number of mobile sensors required, we propose a route scheduling problem in this paper which is the first to consider the effect of sensing range. We prove that the Distance-Sensitive-Route Scheduling(DSRS) problem is NP-hard, and consider two different scenarios: the single kissing-point case and the general case. For different cases, We propose three corresponding approximation algorithms ROSE, G-ROSE, D-ROSE.","PeriodicalId":129182,"journal":{"name":"2015 IEEE 35th International Conference on Distributed Computing Systems","volume":"66 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"A Route Scheduling Algorithm for the Sweep Coverage Problem\",\"authors\":\"Zhiyin Chen, S. Wu, Xudong Zhu, Xiaofeng Gao, Jian Gu, Guihai Chen\",\"doi\":\"10.1109/ICDCS.2015.91\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to decrease the sweep cycle and the number of mobile sensors required, we propose a route scheduling problem in this paper which is the first to consider the effect of sensing range. We prove that the Distance-Sensitive-Route Scheduling(DSRS) problem is NP-hard, and consider two different scenarios: the single kissing-point case and the general case. For different cases, We propose three corresponding approximation algorithms ROSE, G-ROSE, D-ROSE.\",\"PeriodicalId\":129182,\"journal\":{\"name\":\"2015 IEEE 35th International Conference on Distributed Computing Systems\",\"volume\":\"66 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-07-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 35th International Conference on Distributed Computing Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICDCS.2015.91\",\"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 IEEE 35th International Conference on Distributed Computing Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDCS.2015.91","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Route Scheduling Algorithm for the Sweep Coverage Problem
In order to decrease the sweep cycle and the number of mobile sensors required, we propose a route scheduling problem in this paper which is the first to consider the effect of sensing range. We prove that the Distance-Sensitive-Route Scheduling(DSRS) problem is NP-hard, and consider two different scenarios: the single kissing-point case and the general case. For different cases, We propose three corresponding approximation algorithms ROSE, G-ROSE, D-ROSE.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
