Optimization Algorithm for AoI-Based UAV-Assisted Data Collection

IF 2.3 4区 计算机科学 Q1 Engineering
Xiaoya Zhou, Qi Zhu
{"title":"Optimization Algorithm for AoI-Based UAV-Assisted Data Collection","authors":"Xiaoya Zhou, Qi Zhu","doi":"10.1155/2024/6691579","DOIUrl":null,"url":null,"abstract":"Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%.","PeriodicalId":54327,"journal":{"name":"International Journal of Distributed Sensor Networks","volume":null,"pages":null},"PeriodicalIF":2.3000,"publicationDate":"2024-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Distributed Sensor Networks","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1155/2024/6691579","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

Regarding the issue of information freshness in systems that aid in data collection using unmanned aerial vehicles (UAVs), a data collection algorithm that is based on freshness and UAV assistance is proposed. Under the limitations of wireless sensor node communication distance and UAV parameters, the optimization problem of minimizing the average spatial correlation age of information (SCAoI) of all nodes in the area is set up. This problem is solved by optimizing the number of clusters, UAV flight trajectories, and the order of data collection from cluster member nodes. The maximum communication distance of the nodes is used as the cluster formation radius, and the maximum-minimum distance clustering algorithm is used to cluster the nodes in the region to obtain the minimum number of clusters. After it has been proven that the trajectory optimization problem in this study is NP-hard, the ant colony algorithm is applied to obtain the minimum flight time and the corresponding trajectory. By using the greedy algorithm to determine the member nodes in the sequence of data collection for a cluster, the instantaneous SCAoI of the UAV arriving at the cluster head is solved. Simulation results show that the proposed algorithm in this paper can effectively improve the freshness of data and reduce the average SCAoI of the system compared with the algorithm in the comparative literature, reducing the average SCAoI by about 61%.
基于 AoI 的无人机辅助数据采集优化算法
针对使用无人飞行器(UAV)辅助数据收集系统中的信息新鲜度问题,提出了一种基于新鲜度和无人飞行器辅助的数据收集算法。在无线传感器节点通信距离和无人飞行器参数的限制下,设置了一个优化问题,即最小化区域内所有节点的平均信息空间相关年龄(SCAoI)。该问题通过优化集群数量、无人机飞行轨迹和集群成员节点的数据收集顺序来解决。以节点的最大通信距离作为簇的形成半径,采用最大-最小距离聚类算法对区域内的节点进行聚类,以获得最小的簇数。在证明本研究中的轨迹优化问题为 NP-hard(NP-hard)问题后,应用蚁群算法来获得最短飞行时间和相应的轨迹。通过使用贪婪算法确定簇的数据采集序列中的成员节点,求解无人机到达簇头的瞬时 SCAoI。仿真结果表明,与对比文献中的算法相比,本文提出的算法能有效提高数据的新鲜度,降低系统的平均 SCAoI,平均 SCAoI 降低了约 61%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Distributed Sensor Networks
International Journal of Distributed Sensor Networks Computer Science-Computer Networks and Communications
CiteScore
6.00
自引率
4.30%
发文量
94
审稿时长
11 weeks
期刊介绍: International Journal of Distributed Sensor Networks (IJDSN) is a JCR ranked, peer-reviewed, open access journal that focuses on applied research and applications of sensor networks. The goal of this journal is to provide a forum for the publication of important research contributions in developing high performance computing solutions to problems arising from the complexities of these sensor network systems. Articles highlight advances in uses of sensor network systems for solving computational tasks in manufacturing, engineering and environmental systems.
×
引用
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学术官方微信