Optimization Coverage Control Algorithm Based on Square Monitoring Area in Wireless Sensor Networks

Zeyu Sun, Ben Yan, Mengluo Ji, Huihui Wang
{"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}
引用次数: 3

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
无线传感器网络中基于方形监控区域的优化覆盖控制算法
在目标区域的k覆盖过程中,无线传感器网络容易产生大量冗余节点,消耗网络中大量节点能量,并且受到环境因素的制约。基于以上不足,本文提出了一种基于规则域的优化连通覆盖算法(优化覆盖控制算法,OCCA)。该算法利用双平方将目标节点置于内平方区域,并建立传感器节点与目标节点的关联模型。对于整个覆盖区域,通过期望值计算最小传感器节点数。仿真结果表明,该算法能够以较低的成本有效地完成对目标区域的覆盖。从而验证了该算法的有效性。该算法减少了网络资源的分配,更好地评价了网络的覆盖性能和连接性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Research on the Evaluation of Product Quality Perceived Value Based on Text Mining and Fuzzy Comprehensive Evaluation A New Pre-copy Strategy for Live Migration of Virtual Machines Hbase Based Surveillance Video Processing, Storage and Retrieval Mutual Information-Based Feature Selection and Ensemble Learning for Classification Implicit Correlation Intensity Mining Based on the Monte Carlo Method with Attenuation
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1