{"title":"无线传感器网络最小暴露问题的气泡启发算法","authors":"Yuning Song, Liang Liu, Huadong Ma","doi":"10.1109/WCNC.2012.6214148","DOIUrl":null,"url":null,"abstract":"Exposure problem, which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. In this paper, we exploit a cellular computing model in the physarum for solving the minimal exposure problem. We first use the road-network among all points of interesting (PoIs) in the monitoring filed to formulate the minimal exposure problem, and then convert it into the Steiner tree problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new heuristic algorithm, named as the physarum optimization, to solve the Steiner tree problem with low complexity and high parallelism. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure.","PeriodicalId":329194,"journal":{"name":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"A physarum-inspired algorithm for minimal exposure problem in wireless sensor networks\",\"authors\":\"Yuning Song, Liang Liu, Huadong Ma\",\"doi\":\"10.1109/WCNC.2012.6214148\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Exposure problem, which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. In this paper, we exploit a cellular computing model in the physarum for solving the minimal exposure problem. We first use the road-network among all points of interesting (PoIs) in the monitoring filed to formulate the minimal exposure problem, and then convert it into the Steiner tree problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new heuristic algorithm, named as the physarum optimization, to solve the Steiner tree problem with low complexity and high parallelism. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure.\",\"PeriodicalId\":329194,\"journal\":{\"name\":\"2012 IEEE Wireless Communications and Networking Conference (WCNC)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Wireless Communications and Networking Conference (WCNC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCNC.2012.6214148\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Wireless Communications and Networking Conference (WCNC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCNC.2012.6214148","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A physarum-inspired algorithm for minimal exposure problem in wireless sensor networks
Exposure problem, which corresponds to the quality of coverage, is a fundamental problem in wireless sensor networks. In this paper, we exploit a cellular computing model in the physarum for solving the minimal exposure problem. We first use the road-network among all points of interesting (PoIs) in the monitoring filed to formulate the minimal exposure problem, and then convert it into the Steiner tree problem by discretizing the monitoring field to a large-scale weighted grid. Inspired by the path-finding capability of physarum, we develop a new heuristic algorithm, named as the physarum optimization, to solve the Steiner tree problem with low complexity and high parallelism. Extensive simulations demonstrate that our proposed models and algorithm are effective for finding the road-network with minimal exposure.