{"title":"无线传感器网络中基于方形监控区域的优化覆盖控制算法","authors":"Zeyu Sun, Ben Yan, Mengluo Ji, Huihui Wang","doi":"10.1109/IIKI.2016.82","DOIUrl":null,"url":null,"abstract":"In the k-coverage process of the target area, the wireless sensor network is easy to generate a great number of redundant nodes, consume a great deal of nodes energy in the network and is restricted by environmental factors. Based on the above deficiencies, this paper puts forward an optimization connected coverage algorithm based on rule area (optimization coverage control algorithm, OCCA). By using the double squares, this algorithm puts target nodes into the inner square area and establishes the correlation model by the sensor nodes and target nodes. As for the whole coverage area, the minimum number of sensor nodes is calculated through the expected value. The simulation shows that this algorithm can effectively complete the coverage of the target area at a low cost. Thus the effectiveness of the algorithm is verified. By using the algorithm, the allocation of network resources is reduced and the covering and connecting performance of the network can be better evaluated.","PeriodicalId":371106,"journal":{"name":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Optimization Coverage Control Algorithm Based on Square Monitoring Area in Wireless Sensor Networks\",\"authors\":\"Zeyu Sun, Ben Yan, Mengluo Ji, Huihui Wang\",\"doi\":\"10.1109/IIKI.2016.82\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the k-coverage process of the target area, the wireless sensor network is easy to generate a great number of redundant nodes, consume a great deal of nodes energy in the network and is restricted by environmental factors. Based on the above deficiencies, this paper puts forward an optimization connected coverage algorithm based on rule area (optimization coverage control algorithm, OCCA). By using the double squares, this algorithm puts target nodes into the inner square area and establishes the correlation model by the sensor nodes and target nodes. As for the whole coverage area, the minimum number of sensor nodes is calculated through the expected value. The simulation shows that this algorithm can effectively complete the coverage of the target area at a low cost. Thus the effectiveness of the algorithm is verified. By using the algorithm, the allocation of network resources is reduced and the covering and connecting performance of the network can be better evaluated.\",\"PeriodicalId\":371106,\"journal\":{\"name\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IIKI.2016.82\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 International Conference on Identification, Information and Knowledge in the Internet of Things (IIKI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIKI.2016.82","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Optimization Coverage Control Algorithm Based on Square Monitoring Area in Wireless Sensor Networks
In the k-coverage process of the target area, the wireless sensor network is easy to generate a great number of redundant nodes, consume a great deal of nodes energy in the network and is restricted by environmental factors. Based on the above deficiencies, this paper puts forward an optimization connected coverage algorithm based on rule area (optimization coverage control algorithm, OCCA). By using the double squares, this algorithm puts target nodes into the inner square area and establishes the correlation model by the sensor nodes and target nodes. As for the whole coverage area, the minimum number of sensor nodes is calculated through the expected value. The simulation shows that this algorithm can effectively complete the coverage of the target area at a low cost. Thus the effectiveness of the algorithm is verified. By using the algorithm, the allocation of network resources is reduced and the covering and connecting performance of the network can be better evaluated.