{"title":"在不可靠的无线传感器网络中,以最小的远程数据传输成本最大化网络吞吐量","authors":"Xu Xu, W. Liang, X. Jia, Wenzheng Xu","doi":"10.1145/2491288.2491315","DOIUrl":null,"url":null,"abstract":"In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum.","PeriodicalId":234414,"journal":{"name":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","volume":"48 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks\",\"authors\":\"Xu Xu, W. Liang, X. Jia, Wenzheng Xu\",\"doi\":\"10.1145/2491288.2491315\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum.\",\"PeriodicalId\":234414,\"journal\":{\"name\":\"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing\",\"volume\":\"48 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-07-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2491288.2491315\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2491288.2491315","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Maximizing network throughput with minimal remote data transfer cost in unreliable wireless sensor networks
In this paper we consider the use of a link-unreliable wireless sensor network for remote monitoring, where the monitoring center is geographically located far away from the region of the deployed sensor network. The sensing data is transferred to the monitoring center by the third party communication service, which incurs service cost. We first formulate a novel optimization problem of maximizing the network throughput with minimal service cost, which is shown to be NP-hard. We then develop approximation algorithms. We finally evaluate the performance of the proposed algorithms by simulations. Experimental results demonstrate that the solutions delivered by proposed algorithms are fractional to the optimum.