Distributed Coordinate-Free Hole Recovery

Xiaoyun Li, D. Hunter
{"title":"Distributed Coordinate-Free Hole Recovery","authors":"Xiaoyun Li, D. Hunter","doi":"10.1109/ICCW.2008.41","DOIUrl":null,"url":null,"abstract":"This paper proposes a distributed coordinate-free non-triangulated hole recovery algorithm for sensor networks called 3MeSH-DR (triangular mesh distributed hole recovery), which recovers coverage holes with the minimum number of redundant nodes using only connectivity information. If this hole cannot be triangulated by edges between pairs of nodes closer that 2 units from each other, the boundary of the hole is detected accurately with the minimum number of edges. It is shown to be error-free by thousands of simulations with different random topologies and node densities. Because of its high reliability and modest requirements for computing power and memory, 3MeSH-DR is an efficient solution for hole detection and recovery without location information in real sensor network applications.","PeriodicalId":360127,"journal":{"name":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","volume":"3 6","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"21","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC Workshops - 2008 IEEE International Conference on Communications Workshops","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2008.41","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 21

Abstract

This paper proposes a distributed coordinate-free non-triangulated hole recovery algorithm for sensor networks called 3MeSH-DR (triangular mesh distributed hole recovery), which recovers coverage holes with the minimum number of redundant nodes using only connectivity information. If this hole cannot be triangulated by edges between pairs of nodes closer that 2 units from each other, the boundary of the hole is detected accurately with the minimum number of edges. It is shown to be error-free by thousands of simulations with different random topologies and node densities. Because of its high reliability and modest requirements for computing power and memory, 3MeSH-DR is an efficient solution for hole detection and recovery without location information in real sensor network applications.
分布式无坐标孔恢复
本文提出了一种基于传感器网络的分布式无坐标非三角网格孔恢复算法3MeSH-DR(三角形网格分布式孔恢复),该算法仅利用连通性信息以最小冗余节点数恢复覆盖孔。如果不能用距离小于2个单位的节点对之间的边进行三角剖分,则用最少的边数准确检测出孔的边界。在不同的随机拓扑结构和节点密度下进行了数千次模拟,结果表明该方法是无误差的。由于3MeSH-DR的高可靠性和对计算能力和内存的适度要求,在实际传感器网络应用中,3MeSH-DR是一种无位置信息的孔检测和恢复的有效解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信