基于VoI的AUV辅助水声传感器网络信息采集

Ruiyang Duan, Jun Du, Junming Ren, Chunxiao Jiang, Yong Ren, A. Benslimane
{"title":"基于VoI的AUV辅助水声传感器网络信息采集","authors":"Ruiyang Duan, Jun Du, Junming Ren, Chunxiao Jiang, Yong Ren, A. Benslimane","doi":"10.1109/ICC40277.2020.9149149","DOIUrl":null,"url":null,"abstract":"This paper considers value based information collection for underwater acoustic sensor networks (UWASNs). In the considered system, the sensor nodes collect, store and update monitoring information with an initial value related to associated events. The value of information (VoI), however, decays with time. An autonomous underwater vehicle (AUV) is dispatched to retrieve data from the sensor nodes through acoustic communication. Our objective is to find the optimal traversal path for the AUV to maximize the VoI of the whole network. To achieve this goal, we first establish a realistic model for characterizing the behaviors of AUV and sensor nodes as well as the challenging environment, based on which the expression of the total VoI is derived. Then, we formulate the problem as a combinatorial optimization problem. We provide an optimal solution for this problem based on the branch and bound (BB) method, in which the lower bound (LB) and upper bound (UB) calculation strategies are specifically designed. A near-optimal heuristic algorithm based on the ant colony method is also adopted for further reducing computation complexity. Finally, simulations validate the effectiveness of the proposed algorithms.","PeriodicalId":106560,"journal":{"name":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"VoI Based Information Collection for AUV Assisted Underwater Acoustic Sensor Networks\",\"authors\":\"Ruiyang Duan, Jun Du, Junming Ren, Chunxiao Jiang, Yong Ren, A. Benslimane\",\"doi\":\"10.1109/ICC40277.2020.9149149\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers value based information collection for underwater acoustic sensor networks (UWASNs). In the considered system, the sensor nodes collect, store and update monitoring information with an initial value related to associated events. The value of information (VoI), however, decays with time. An autonomous underwater vehicle (AUV) is dispatched to retrieve data from the sensor nodes through acoustic communication. Our objective is to find the optimal traversal path for the AUV to maximize the VoI of the whole network. To achieve this goal, we first establish a realistic model for characterizing the behaviors of AUV and sensor nodes as well as the challenging environment, based on which the expression of the total VoI is derived. Then, we formulate the problem as a combinatorial optimization problem. We provide an optimal solution for this problem based on the branch and bound (BB) method, in which the lower bound (LB) and upper bound (UB) calculation strategies are specifically designed. A near-optimal heuristic algorithm based on the ant colony method is also adopted for further reducing computation complexity. Finally, simulations validate the effectiveness of the proposed algorithms.\",\"PeriodicalId\":106560,\"journal\":{\"name\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICC40277.2020.9149149\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICC 2020 - 2020 IEEE International Conference on Communications (ICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICC40277.2020.9149149","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

研究了基于值的水声传感器网络信息采集方法。在考虑的系统中,传感器节点收集、存储和更新具有与关联事件相关的初始值的监视信息。然而,信息的价值(VoI)随着时间的推移而衰减。派出自主水下航行器(AUV)通过声学通信从传感器节点检索数据。我们的目标是为AUV找到最优的遍历路径,以最大化整个网络的VoI。为了实现这一目标,我们首先建立了一个真实的模型来表征AUV和传感器节点的行为以及具有挑战性的环境,并在此基础上推导了总VoI的表达式。然后,我们将该问题表述为一个组合优化问题。我们基于分支界(BB)方法给出了该问题的最优解,其中专门设计了下界(LB)和上界(UB)的计算策略。为了进一步降低计算复杂度,采用了一种基于蚁群方法的近最优启发式算法。最后,通过仿真验证了算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
VoI Based Information Collection for AUV Assisted Underwater Acoustic Sensor Networks
This paper considers value based information collection for underwater acoustic sensor networks (UWASNs). In the considered system, the sensor nodes collect, store and update monitoring information with an initial value related to associated events. The value of information (VoI), however, decays with time. An autonomous underwater vehicle (AUV) is dispatched to retrieve data from the sensor nodes through acoustic communication. Our objective is to find the optimal traversal path for the AUV to maximize the VoI of the whole network. To achieve this goal, we first establish a realistic model for characterizing the behaviors of AUV and sensor nodes as well as the challenging environment, based on which the expression of the total VoI is derived. Then, we formulate the problem as a combinatorial optimization problem. We provide an optimal solution for this problem based on the branch and bound (BB) method, in which the lower bound (LB) and upper bound (UB) calculation strategies are specifically designed. A near-optimal heuristic algorithm based on the ant colony method is also adopted for further reducing computation complexity. Finally, simulations validate the effectiveness of the proposed algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信