无线传感器网络中最优无人机群辅助清扫覆盖的信息时代

IF 4.4 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Li Li, Hongbin Chen
{"title":"无线传感器网络中最优无人机群辅助清扫覆盖的信息时代","authors":"Li Li,&nbsp;Hongbin Chen","doi":"10.1016/j.adhoc.2024.103675","DOIUrl":null,"url":null,"abstract":"<div><div>For sweep coverage in wireless sensor networks (WSNs), the freshness of data directly affects the efficiency of task execution, and time is needed to continuously cover points of interest (POIs) to ensure obtaining all the data. However, existing studies ignored both. The outdated data and missing data may lead to decision-making errors, resulting in significant losses. To address this issue, this paper proposes a simultaneous sweep mode and a batch sweep mode of Unmanned Aerial Vehicle (UAV) swarm to achieve sweep coverage in WSNs, considering the freshness of data and the continuous coverage time of POIs, where the age of information (AoI) is adopted to measure the freshness of data. The target is to minimize the average AoI of POIs under the continuous coverage time constraint and the constraints of UAV swarm. Firstly, the POIs are clustered to obtain the best sweep points. Then, the UAV swarm sweep coverage (USSC) algorithm is designed for the two sweep modes. Finally, various simulations are conducted to verify the performance of the USSC algorithm. Simulation results show that the USSC algorithm can effectively minimize the average AoI compared to baseline algorithms. <em>The script of the proposed algorithm can be found from:</em> <span><span>https://github.com/lilibeat/USSC</span><svg><path></path></svg></span><em>.</em></div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4000,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Age of information optimal UAV swarm-assisted sweep coverage in wireless sensor networks\",\"authors\":\"Li Li,&nbsp;Hongbin Chen\",\"doi\":\"10.1016/j.adhoc.2024.103675\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>For sweep coverage in wireless sensor networks (WSNs), the freshness of data directly affects the efficiency of task execution, and time is needed to continuously cover points of interest (POIs) to ensure obtaining all the data. However, existing studies ignored both. The outdated data and missing data may lead to decision-making errors, resulting in significant losses. To address this issue, this paper proposes a simultaneous sweep mode and a batch sweep mode of Unmanned Aerial Vehicle (UAV) swarm to achieve sweep coverage in WSNs, considering the freshness of data and the continuous coverage time of POIs, where the age of information (AoI) is adopted to measure the freshness of data. The target is to minimize the average AoI of POIs under the continuous coverage time constraint and the constraints of UAV swarm. Firstly, the POIs are clustered to obtain the best sweep points. Then, the UAV swarm sweep coverage (USSC) algorithm is designed for the two sweep modes. Finally, various simulations are conducted to verify the performance of the USSC algorithm. Simulation results show that the USSC algorithm can effectively minimize the average AoI compared to baseline algorithms. <em>The script of the proposed algorithm can be found from:</em> <span><span>https://github.com/lilibeat/USSC</span><svg><path></path></svg></span><em>.</em></div></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":4.4000,\"publicationDate\":\"2024-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Ad Hoc Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1570870524002865\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Ad Hoc Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1570870524002865","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

对于无线传感器网络(WSN)中的清扫覆盖而言,数据的新鲜度直接影响任务执行的效率,而持续覆盖兴趣点(POI)以确保获得所有数据则需要时间。然而,现有研究忽略了这两方面。过期数据和缺失数据可能会导致决策失误,造成重大损失。针对这一问题,本文提出了无人机(UAV)蜂群实现 WSN 扫掠覆盖的同步扫掠模式和批量扫掠模式,考虑了数据的新鲜度和 POIs 的连续覆盖时间,其中采用信息年龄(AoI)来衡量数据的新鲜度。目标是在连续覆盖时间约束和无人机群约束下,最小化 POI 的平均 AoI。首先,对 POI 进行聚类,以获得最佳清扫点。然后,针对两种清扫模式设计了无人机群清扫覆盖(USSC)算法。最后,通过各种仿真验证了 USSC 算法的性能。仿真结果表明,与基线算法相比,USSC 算法能有效地最小化平均 AoI。建议算法的脚本可从以下网址找到:https://github.com/lilibeat/USSC。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Age of information optimal UAV swarm-assisted sweep coverage in wireless sensor networks
For sweep coverage in wireless sensor networks (WSNs), the freshness of data directly affects the efficiency of task execution, and time is needed to continuously cover points of interest (POIs) to ensure obtaining all the data. However, existing studies ignored both. The outdated data and missing data may lead to decision-making errors, resulting in significant losses. To address this issue, this paper proposes a simultaneous sweep mode and a batch sweep mode of Unmanned Aerial Vehicle (UAV) swarm to achieve sweep coverage in WSNs, considering the freshness of data and the continuous coverage time of POIs, where the age of information (AoI) is adopted to measure the freshness of data. The target is to minimize the average AoI of POIs under the continuous coverage time constraint and the constraints of UAV swarm. Firstly, the POIs are clustered to obtain the best sweep points. Then, the UAV swarm sweep coverage (USSC) algorithm is designed for the two sweep modes. Finally, various simulations are conducted to verify the performance of the USSC algorithm. Simulation results show that the USSC algorithm can effectively minimize the average AoI compared to baseline algorithms. The script of the proposed algorithm can be found from: https://github.com/lilibeat/USSC.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Ad Hoc Networks
Ad Hoc Networks 工程技术-电信学
CiteScore
10.20
自引率
4.20%
发文量
131
审稿时长
4.8 months
期刊介绍: The Ad Hoc Networks is an international and archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in ad hoc and sensor networking areas. The Ad Hoc Networks considers original, high quality and unpublished contributions addressing all aspects of ad hoc and sensor networks. Specific areas of interest include, but are not limited to: Mobile and Wireless Ad Hoc Networks Sensor Networks Wireless Local and Personal Area Networks Home Networks Ad Hoc Networks of Autonomous Intelligent Systems Novel Architectures for Ad Hoc and Sensor Networks Self-organizing Network Architectures and Protocols Transport Layer Protocols Routing protocols (unicast, multicast, geocast, etc.) Media Access Control Techniques Error Control Schemes Power-Aware, Low-Power and Energy-Efficient Designs Synchronization and Scheduling Issues Mobility Management Mobility-Tolerant Communication Protocols Location Tracking and Location-based Services Resource and Information Management Security and Fault-Tolerance Issues Hardware and Software Platforms, Systems, and Testbeds Experimental and Prototype Results Quality-of-Service Issues Cross-Layer Interactions Scalability Issues Performance Analysis and Simulation of Protocols.
×
引用
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学术官方微信