基于拍卖的风险感知机器人传感器网络最优并发响应节点选择

J. McCausland, R. Abielmona, R. Falcon, A. Crétu, E. Petriu
{"title":"基于拍卖的风险感知机器人传感器网络最优并发响应节点选择","authors":"J. McCausland, R. Abielmona, R. Falcon, A. Crétu, E. Petriu","doi":"10.1109/ROSE.2013.6698432","DOIUrl":null,"url":null,"abstract":"In this paper, an auction-based node selection technique is considered for a risk-aware Robotic Sensor Network (RSN) applied to Critical Infrastructure Protection (CIP). The goal of this risk-aware RSN is to maintain a secure perimeter around the CIP, which is best maintained by detecting high-risk network events and mitigate them through a response involving the most suitable robotic nodes. These robotic nodes can operate without the use of a centralized system and select amongst themselves the nodes with the best fitness to risk mitigation plan. The robot node that is first aware of a high-risk event becomes an auctioneer. The risk mitigation task is advertised to the entire network. Each robotic node is responsible for calculating their bid metric (i.e. availability metric) for the risk mitigation task. We employ fuzzy logic in the process of the bid calculation, which incorporates the battery level, distance to the event, and redundant coverage to produce an appropriate bid value. The auctioneer only considers the top bidders. The nature of this system is to permit simultaneous mitigation plans to execute on a single RSN by effectively segmenting the network into discrete autonomous groups. Each autonomous group will utilize an evolutionary multi-objective algorithm - the Non-Dominated Sorting Genetic Algorithm (NSGA-II) - to optimize the segment's topology to mitigate the risk. A chromosome length is determined by the number of bids received, but the NSGA-II explored to separate solution spaces to achieve optimal Pareto results. The NSGA-II will seek optimal node positions and determine the optimal set of robotic nodes to utilize of the bids received. The NSGA-II will produce a set of optimized responses for each network segment for a security operator to pick the most suitable response.","PeriodicalId":187001,"journal":{"name":"2013 IEEE International Symposium on Robotic and Sensors Environments (ROSE)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Auction-based node selection of optimal and concurrent responses for a risk-aware robotic sensor network\",\"authors\":\"J. McCausland, R. Abielmona, R. Falcon, A. Crétu, E. Petriu\",\"doi\":\"10.1109/ROSE.2013.6698432\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, an auction-based node selection technique is considered for a risk-aware Robotic Sensor Network (RSN) applied to Critical Infrastructure Protection (CIP). The goal of this risk-aware RSN is to maintain a secure perimeter around the CIP, which is best maintained by detecting high-risk network events and mitigate them through a response involving the most suitable robotic nodes. These robotic nodes can operate without the use of a centralized system and select amongst themselves the nodes with the best fitness to risk mitigation plan. The robot node that is first aware of a high-risk event becomes an auctioneer. The risk mitigation task is advertised to the entire network. Each robotic node is responsible for calculating their bid metric (i.e. availability metric) for the risk mitigation task. We employ fuzzy logic in the process of the bid calculation, which incorporates the battery level, distance to the event, and redundant coverage to produce an appropriate bid value. The auctioneer only considers the top bidders. The nature of this system is to permit simultaneous mitigation plans to execute on a single RSN by effectively segmenting the network into discrete autonomous groups. Each autonomous group will utilize an evolutionary multi-objective algorithm - the Non-Dominated Sorting Genetic Algorithm (NSGA-II) - to optimize the segment's topology to mitigate the risk. A chromosome length is determined by the number of bids received, but the NSGA-II explored to separate solution spaces to achieve optimal Pareto results. The NSGA-II will seek optimal node positions and determine the optimal set of robotic nodes to utilize of the bids received. The NSGA-II will produce a set of optimized responses for each network segment for a security operator to pick the most suitable response.\",\"PeriodicalId\":187001,\"journal\":{\"name\":\"2013 IEEE International Symposium on Robotic and Sensors Environments (ROSE)\",\"volume\":\"29 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Symposium on Robotic and Sensors Environments (ROSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ROSE.2013.6698432\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Symposium on Robotic and Sensors Environments (ROSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ROSE.2013.6698432","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

本文考虑了一种基于拍卖的节点选择技术,用于关键基础设施保护(CIP)的风险感知机器人传感器网络(RSN)。这种具有风险意识的RSN的目标是维护CIP周围的安全边界,最好通过检测高风险网络事件并通过涉及最合适的机器人节点的响应来减轻它们来维护CIP。这些机器人节点可以在不使用集中式系统的情况下运行,并在它们之间选择最适合风险缓解计划的节点。首先意识到高风险事件的机器人节点成为拍卖师。将风险缓解任务通告到整个网络。每个机器人节点负责计算风险缓解任务的投标指标(即可用性指标)。我们在投标计算过程中采用模糊逻辑,将电池电量、到事件的距离和冗余覆盖率结合起来,以产生合适的投标值。拍卖师只考虑出价最高的人。该系统的本质是通过将网络有效地分割成离散的自治组,允许在单个RSN上同时执行缓解计划。每个自治组将利用一种进化多目标算法——非支配排序遗传算法(NSGA-II)——来优化路段的拓扑结构,以降低风险。染色体长度由收到的投标数决定,但NSGA-II探索了分离的解决方案空间,以实现最优的帕累托结果。NSGA-II将寻求最佳节点位置,并确定机器人节点的最佳集合,以利用收到的投标。NSGA-II将为每个网络段生成一组优化响应,供安全运营商选择最合适的响应。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Auction-based node selection of optimal and concurrent responses for a risk-aware robotic sensor network
In this paper, an auction-based node selection technique is considered for a risk-aware Robotic Sensor Network (RSN) applied to Critical Infrastructure Protection (CIP). The goal of this risk-aware RSN is to maintain a secure perimeter around the CIP, which is best maintained by detecting high-risk network events and mitigate them through a response involving the most suitable robotic nodes. These robotic nodes can operate without the use of a centralized system and select amongst themselves the nodes with the best fitness to risk mitigation plan. The robot node that is first aware of a high-risk event becomes an auctioneer. The risk mitigation task is advertised to the entire network. Each robotic node is responsible for calculating their bid metric (i.e. availability metric) for the risk mitigation task. We employ fuzzy logic in the process of the bid calculation, which incorporates the battery level, distance to the event, and redundant coverage to produce an appropriate bid value. The auctioneer only considers the top bidders. The nature of this system is to permit simultaneous mitigation plans to execute on a single RSN by effectively segmenting the network into discrete autonomous groups. Each autonomous group will utilize an evolutionary multi-objective algorithm - the Non-Dominated Sorting Genetic Algorithm (NSGA-II) - to optimize the segment's topology to mitigate the risk. A chromosome length is determined by the number of bids received, but the NSGA-II explored to separate solution spaces to achieve optimal Pareto results. The NSGA-II will seek optimal node positions and determine the optimal set of robotic nodes to utilize of the bids received. The NSGA-II will produce a set of optimized responses for each network segment for a security operator to pick the most suitable response.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improving visual SLAM accuracy through deliberate camera oscillations Auction-based node selection of optimal and concurrent responses for a risk-aware robotic sensor network Multi-segment continuum robot shape estimation using passive cable displacement A new trajectory-based path planning approach for differential drive vehicles Automatic human brain MRI volumetric analysis technique using EM-algorithm
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1