具有容错和最小能量消耗的无线传感器节点的最优布局

S. Chaudhry, V. Hung, R. Guha
{"title":"具有容错和最小能量消耗的无线传感器节点的最优布局","authors":"S. Chaudhry, V. Hung, R. Guha","doi":"10.1109/MOBHOC.2006.278621","DOIUrl":null,"url":null,"abstract":"In this paper, an evolutionary algorithm is presented to develop a solution for the variable radii sensor placement optimization problem. Sensor nodes are placed in a sensor field such that maximum coverage of the target region is achieved. Coverage is defined in terms of monitoring points of interest. In point coverage, it is desired to place the sensor nodes such that certain target points in the area to be monitored are efficiently covered. The sensors are assumed to have varying communication and sensing radii within specified ranges. To attain a certain degree of fault tolerance, the network is required to have k-connectivity. Therein, the challenge lies in finding a solution that provides the optimal choice and arrangement of sensor nodes with a minimized overall energy consumption. Our devised algorithm places the sensors to form an energy-efficient and fault tolerant network that provides coverage of the given query points","PeriodicalId":345003,"journal":{"name":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","volume":"76 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-10-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":"{\"title\":\"Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption\",\"authors\":\"S. Chaudhry, V. Hung, R. Guha\",\"doi\":\"10.1109/MOBHOC.2006.278621\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an evolutionary algorithm is presented to develop a solution for the variable radii sensor placement optimization problem. Sensor nodes are placed in a sensor field such that maximum coverage of the target region is achieved. Coverage is defined in terms of monitoring points of interest. In point coverage, it is desired to place the sensor nodes such that certain target points in the area to be monitored are efficiently covered. The sensors are assumed to have varying communication and sensing radii within specified ranges. To attain a certain degree of fault tolerance, the network is required to have k-connectivity. Therein, the challenge lies in finding a solution that provides the optimal choice and arrangement of sensor nodes with a minimized overall energy consumption. Our devised algorithm places the sensors to form an energy-efficient and fault tolerant network that provides coverage of the given query points\",\"PeriodicalId\":345003,\"journal\":{\"name\":\"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems\",\"volume\":\"76 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-10-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"14\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MOBHOC.2006.278621\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MOBHOC.2006.278621","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

摘要

本文提出了一种进化算法来求解变半径传感器布置优化问题。传感器节点被放置在传感器域中,以便实现对目标区域的最大覆盖。覆盖范围是根据感兴趣的监测点来定义的。在点覆盖中,希望传感器节点的放置能够有效地覆盖待监测区域中的某些目标点。假定传感器在指定范围内具有不同的通信和传感半径。为了达到一定程度的容错,要求网络具有k-连通性。其中,挑战在于找到一种解决方案,以最小的总能耗提供传感器节点的最佳选择和安排。我们设计的算法将传感器放置在一个节能和容错的网络中,提供给定查询点的覆盖
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal Placement of Wireless Sensor Nodes with Fault Tolerance and Minimal Energy Consumption
In this paper, an evolutionary algorithm is presented to develop a solution for the variable radii sensor placement optimization problem. Sensor nodes are placed in a sensor field such that maximum coverage of the target region is achieved. Coverage is defined in terms of monitoring points of interest. In point coverage, it is desired to place the sensor nodes such that certain target points in the area to be monitored are efficiently covered. The sensors are assumed to have varying communication and sensing radii within specified ranges. To attain a certain degree of fault tolerance, the network is required to have k-connectivity. Therein, the challenge lies in finding a solution that provides the optimal choice and arrangement of sensor nodes with a minimized overall energy consumption. Our devised algorithm places the sensors to form an energy-efficient and fault tolerant network that provides coverage of the given query points
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信