混合传感器网络中覆盖漏洞估计与增强覆盖

Aniruddha Ghosh
{"title":"混合传感器网络中覆盖漏洞估计与增强覆盖","authors":"Aniruddha Ghosh","doi":"10.1109/LCN.2004.53","DOIUrl":null,"url":null,"abstract":"Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. In this paper, we present a method to deterministically estimate the exact amount of coverage holes under random deployment using Voronoi diagrams and use the static nodes to collaborate and estimate the number of additional mobile nodes needed to be deployed and relocated to optimal positions to maximize coverage. We follow a two-step deployment process in a mixed sensor network and we argue by simulation and analysis that our collaborative coverage enhancing algorithm (COVEN) can achieve a tradeoff between the cost of deployment and percentage of area covered.","PeriodicalId":366183,"journal":{"name":"29th Annual IEEE International Conference on Local Computer Networks","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"165","resultStr":"{\"title\":\"Estimating coverage holes and enhancing coverage in mixed sensor networks\",\"authors\":\"Aniruddha Ghosh\",\"doi\":\"10.1109/LCN.2004.53\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. In this paper, we present a method to deterministically estimate the exact amount of coverage holes under random deployment using Voronoi diagrams and use the static nodes to collaborate and estimate the number of additional mobile nodes needed to be deployed and relocated to optimal positions to maximize coverage. We follow a two-step deployment process in a mixed sensor network and we argue by simulation and analysis that our collaborative coverage enhancing algorithm (COVEN) can achieve a tradeoff between the cost of deployment and percentage of area covered.\",\"PeriodicalId\":366183,\"journal\":{\"name\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-11-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"165\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"29th Annual IEEE International Conference on Local Computer Networks\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/LCN.2004.53\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"29th Annual IEEE International Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2004.53","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 165

摘要

区域覆盖是自组织无线传感器网络中最基本的问题之一,因为它直接关系到传感领域资源的优化。在保持较低部署成本的同时最大限度地覆盖区域一直是一个挑战,特别是当监测区域未知且可能危险时。在本文中,我们提出了一种使用Voronoi图来确定估计随机部署下覆盖孔的确切数量的方法,并使用静态节点进行协作并估计需要部署和重新定位到最佳位置以最大化覆盖的额外移动节点的数量。我们在混合传感器网络中遵循两步部署过程,并通过模拟和分析证明,我们的协作覆盖增强算法(COVEN)可以在部署成本和覆盖面积百分比之间实现权衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Estimating coverage holes and enhancing coverage in mixed sensor networks
Area coverage is one of the most fundamental problems in ad hoc wireless sensor networks because it directly relates to optimization of resources in a sensing field. Maximizing the coverage area while maintaining a lower cost of deployment has always been a challenge, especially when the monitoring region is unknown and possibly hazardous. In this paper, we present a method to deterministically estimate the exact amount of coverage holes under random deployment using Voronoi diagrams and use the static nodes to collaborate and estimate the number of additional mobile nodes needed to be deployed and relocated to optimal positions to maximize coverage. We follow a two-step deployment process in a mixed sensor network and we argue by simulation and analysis that our collaborative coverage enhancing algorithm (COVEN) can achieve a tradeoff between the cost of deployment and percentage of area covered.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信