{"title":"最小化接入点部署中的位置不确定性","authors":"P. Zhuang, Qingguo Wang, Yi Shang, Hongchi Shi","doi":"10.1109/ISWPC.2007.342670","DOIUrl":null,"url":null,"abstract":"In recent years, wireless sensor networks have been applied to several applications of data gathering and target localization across large geographical areas. In this paper, based on a representative sensor network system for lost hiker localization in wilderness areas, we study the problem of sensor/access-point deployment in constrained environments with the goal of minimizing localization uncertainty. We first present theoretical analysis of the problems for different problem attributes. Then we propose an efficient two-phase algorithm to find the access point placement with four different heuristics. In addition, we present experimental results to compare the performance of different heuristics and one heuristic namely divide-merge is shown to outperform all others and achieves solutions very close to the optimal","PeriodicalId":403213,"journal":{"name":"2007 2nd International Symposium on Wireless Pervasive Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Minimizing Location Uncertainty in Deployment of Access Points\",\"authors\":\"P. Zhuang, Qingguo Wang, Yi Shang, Hongchi Shi\",\"doi\":\"10.1109/ISWPC.2007.342670\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In recent years, wireless sensor networks have been applied to several applications of data gathering and target localization across large geographical areas. In this paper, based on a representative sensor network system for lost hiker localization in wilderness areas, we study the problem of sensor/access-point deployment in constrained environments with the goal of minimizing localization uncertainty. We first present theoretical analysis of the problems for different problem attributes. Then we propose an efficient two-phase algorithm to find the access point placement with four different heuristics. In addition, we present experimental results to compare the performance of different heuristics and one heuristic namely divide-merge is shown to outperform all others and achieves solutions very close to the optimal\",\"PeriodicalId\":403213,\"journal\":{\"name\":\"2007 2nd International Symposium on Wireless Pervasive Computing\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-04-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2007 2nd International Symposium on Wireless Pervasive Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISWPC.2007.342670\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2007 2nd International Symposium on Wireless Pervasive Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWPC.2007.342670","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Minimizing Location Uncertainty in Deployment of Access Points
In recent years, wireless sensor networks have been applied to several applications of data gathering and target localization across large geographical areas. In this paper, based on a representative sensor network system for lost hiker localization in wilderness areas, we study the problem of sensor/access-point deployment in constrained environments with the goal of minimizing localization uncertainty. We first present theoretical analysis of the problems for different problem attributes. Then we propose an efficient two-phase algorithm to find the access point placement with four different heuristics. In addition, we present experimental results to compare the performance of different heuristics and one heuristic namely divide-merge is shown to outperform all others and achieves solutions very close to the optimal