多传感器区域覆盖的自适应定位算法

A. Gallais, J. Carle
{"title":"多传感器区域覆盖的自适应定位算法","authors":"A. Gallais, J. Carle","doi":"10.1109/AINA.2007.30","DOIUrl":null,"url":null,"abstract":"Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of the redundancy induced by the random deployment of nodes. Some nodes are active while others are in sleep mode, thus using less energy. Such a dynamic topology should not impact the monitoring activity. Area coverage protocols aim at turning off redundant sensor nodes while ensuring full coverage of the area by the remaining active nodes. Providing k-area coverage therefore means that every physical point of the monitored field is sensed by at least fc sensor devices. Connectivity of the active nodes subset must also be provided so that monitoring reports can reach the sink stations. Existing solutions hardly address these two issues as a unified one. In this paper, we propose a localized algorithm for multiple sensor area coverage able to build connected active nodes sets. We also show that a simple feature of the protocol, called the coverage evaluation scheme, can be enhanced to handle various k-area coverage problem definitions. Experimental results show that our coverage scheme is resistant to collisions of messages as k-area-coverage of the deployment area and connectivity of the active nodes set can still be ensured.","PeriodicalId":361109,"journal":{"name":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"17","resultStr":"{\"title\":\"An Adaptive Localized Algorithm for Multiple Sensor Area Coverage\",\"authors\":\"A. Gallais, J. Carle\",\"doi\":\"10.1109/AINA.2007.30\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of the redundancy induced by the random deployment of nodes. Some nodes are active while others are in sleep mode, thus using less energy. Such a dynamic topology should not impact the monitoring activity. Area coverage protocols aim at turning off redundant sensor nodes while ensuring full coverage of the area by the remaining active nodes. Providing k-area coverage therefore means that every physical point of the monitored field is sensed by at least fc sensor devices. Connectivity of the active nodes subset must also be provided so that monitoring reports can reach the sink stations. Existing solutions hardly address these two issues as a unified one. In this paper, we propose a localized algorithm for multiple sensor area coverage able to build connected active nodes sets. We also show that a simple feature of the protocol, called the coverage evaluation scheme, can be enhanced to handle various k-area coverage problem definitions. Experimental results show that our coverage scheme is resistant to collisions of messages as k-area-coverage of the deployment area and connectivity of the active nodes set can still be ensured.\",\"PeriodicalId\":361109,\"journal\":{\"name\":\"21st International Conference on Advanced Information Networking and Applications (AINA '07)\",\"volume\":\"73 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-05-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"17\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"21st International Conference on Advanced Information Networking and Applications (AINA '07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINA.2007.30\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"21st International Conference on Advanced Information Networking and Applications (AINA '07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINA.2007.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 17

摘要

无线传感器网络由数百个设备组成,部署在一个遥远或敏感的领域进行监测。通过利用节点随机部署带来的冗余来平衡能耗。一些节点处于活动状态,而另一些节点处于睡眠模式,因此使用较少的能量。这种动态拓扑不应该影响监视活动。区域覆盖协议旨在关闭冗余传感器节点,同时确保剩余活动节点对该区域的完全覆盖。因此,提供k区域覆盖意味着被监测场的每个物理点都被至少fc传感器设备感测到。还必须提供活动节点子集的连通性,以便监测报告能够到达接收站。现有的解决办法很难把这两个问题作为一个统一的问题来解决。在本文中,我们提出了一种多传感器区域覆盖的局部算法,能够建立连接的活动节点集。我们还展示了该协议的一个简单特征,称为覆盖评估方案,可以增强以处理各种k-area覆盖问题定义。实验结果表明,该覆盖方案在保证部署区域的k-area覆盖和活动节点集的连通性的前提下,具有较好的抗消息冲突能力。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Adaptive Localized Algorithm for Multiple Sensor Area Coverage
Wireless sensor networks are made up of hundreds of devices deployed over a distant or sensitive field to be monitored. Energy consumption is balanced by taking advantage of the redundancy induced by the random deployment of nodes. Some nodes are active while others are in sleep mode, thus using less energy. Such a dynamic topology should not impact the monitoring activity. Area coverage protocols aim at turning off redundant sensor nodes while ensuring full coverage of the area by the remaining active nodes. Providing k-area coverage therefore means that every physical point of the monitored field is sensed by at least fc sensor devices. Connectivity of the active nodes subset must also be provided so that monitoring reports can reach the sink stations. Existing solutions hardly address these two issues as a unified one. In this paper, we propose a localized algorithm for multiple sensor area coverage able to build connected active nodes sets. We also show that a simple feature of the protocol, called the coverage evaluation scheme, can be enhanced to handle various k-area coverage problem definitions. Experimental results show that our coverage scheme is resistant to collisions of messages as k-area-coverage of the deployment area and connectivity of the active nodes set can still be ensured.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信