Vector method based coverage hole recovery in Wireless Sensor Networks

P. Sahoo, J. Tsai, Hong-Lin Ke
{"title":"Vector method based coverage hole recovery in Wireless Sensor Networks","authors":"P. Sahoo, J. Tsai, Hong-Lin Ke","doi":"10.1109/COMSNETS.2010.5432001","DOIUrl":null,"url":null,"abstract":"In Wireless Sensor Networks (WSN), sensors form the network dynamically without help of any infrastructure. The accidental death of the nodes due to technical failures or death due to power exhaustion may disturb the existing coverage and connectivity of the network. In this paper, distributed coverage hole recovery algorithms for the wireless sensor networks are designed that use the vector methods to decide the magnitude and direction of the mobile nodes. In the post deployment scenario, coverage holes of the network are repaired by moving the nodes in a self organized manner. To minimize the energy consumption of the nodes due to mobility, algorithms are designed in such a way that the mobility is limited within only one-hop of the nodes and highest coverage (k-coverage) of a node is not increased after its mobility. Performance evaluation of the proposed algorithms show that cent percent of coverage recovery could be possible by moving the nodes within their communication range. Besides, the average mobility distance of the nodes is very small to recover the coverage holes by our algorithms.","PeriodicalId":369006,"journal":{"name":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"32","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/COMSNETS.2010.5432001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 32

Abstract

In Wireless Sensor Networks (WSN), sensors form the network dynamically without help of any infrastructure. The accidental death of the nodes due to technical failures or death due to power exhaustion may disturb the existing coverage and connectivity of the network. In this paper, distributed coverage hole recovery algorithms for the wireless sensor networks are designed that use the vector methods to decide the magnitude and direction of the mobile nodes. In the post deployment scenario, coverage holes of the network are repaired by moving the nodes in a self organized manner. To minimize the energy consumption of the nodes due to mobility, algorithms are designed in such a way that the mobility is limited within only one-hop of the nodes and highest coverage (k-coverage) of a node is not increased after its mobility. Performance evaluation of the proposed algorithms show that cent percent of coverage recovery could be possible by moving the nodes within their communication range. Besides, the average mobility distance of the nodes is very small to recover the coverage holes by our algorithms.
基于矢量法的无线传感器网络覆盖孔恢复
在无线传感器网络(WSN)中,传感器动态地组成网络,而不需要任何基础设施的帮助。由于技术故障导致节点意外死亡或因电量耗尽导致节点死亡,可能会影响网络的现有覆盖和连通性。本文设计了无线传感器网络的分布式覆盖孔恢复算法,该算法采用矢量法确定移动节点的大小和方向。后部署场景下,通过自组织移动节点修复网络覆盖漏洞。为了最大限度地减少节点因移动性而造成的能量消耗,算法的设计使移动性仅限制在节点的一跳范围内,并且节点的最高覆盖(k-coverage)在其移动性之后不增加。对所提算法的性能评估表明,通过在其通信范围内移动节点,可以实现100%的覆盖恢复。此外,节点的平均移动距离很小,我们的算法无法恢复覆盖漏洞。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信