面向大规模物联网环境下协同数据采集的多库预置无人机群轨迹优化方案

IF 4.8 3区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
Saugata Roy , Nabajyoti Mazumdar , Rajendra Pamula
{"title":"面向大规模物联网环境下协同数据采集的多库预置无人机群轨迹优化方案","authors":"Saugata Roy ,&nbsp;Nabajyoti Mazumdar ,&nbsp;Rajendra Pamula","doi":"10.1016/j.adhoc.2025.103974","DOIUrl":null,"url":null,"abstract":"<div><div>Due to autonomous flying ability and high manoeuvrability, unmanned aerial vehicle (UAV) assisted sensory data acquisition is becoming prevalent in outdoor IoT applications. However, UAV’s limited onboard power source results in a restricted flight time, necessitating the use of a multi-UAV platform to ensure uninterrupted service in a large-scale network. Nonetheless, very few studies have considered the use of multiple UAVs from distinct depots to improve network coverage with an optimal UAV swarm. This article investigates a multi-depot, energy-constrained vehicle routing problem (MDEVRP) where a fleet of UAVs is dispatched from different depots to collect sensory data from the ground nodes, provided that UAVs never run out of energy. Our objective is to discover an optimal set of UAVs with detailed hovering and travelling plans, which is an NP-hard problem. To solve such a computationally hard problem, we first leverage the variable dimensional particle swarm optimization (VD-PSO) algorithm that jointly optimizes the number of UAVs deployed, their depots, and association with the hovering locations. Then, minimal cost UAV trajectories are established, which preserves data freshness at the UAV depots. Simulation results manifest the dominance of the proposed scheme over the related state-of-the-art protocols.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":"178 ","pages":"Article 103974"},"PeriodicalIF":4.8000,"publicationDate":"2025-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A multi-depot provisioned UAV swarm trajectory optimization scheme for collaborative data acquisition in a large-scale IoT environment\",\"authors\":\"Saugata Roy ,&nbsp;Nabajyoti Mazumdar ,&nbsp;Rajendra Pamula\",\"doi\":\"10.1016/j.adhoc.2025.103974\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Due to autonomous flying ability and high manoeuvrability, unmanned aerial vehicle (UAV) assisted sensory data acquisition is becoming prevalent in outdoor IoT applications. However, UAV’s limited onboard power source results in a restricted flight time, necessitating the use of a multi-UAV platform to ensure uninterrupted service in a large-scale network. Nonetheless, very few studies have considered the use of multiple UAVs from distinct depots to improve network coverage with an optimal UAV swarm. This article investigates a multi-depot, energy-constrained vehicle routing problem (MDEVRP) where a fleet of UAVs is dispatched from different depots to collect sensory data from the ground nodes, provided that UAVs never run out of energy. Our objective is to discover an optimal set of UAVs with detailed hovering and travelling plans, which is an NP-hard problem. To solve such a computationally hard problem, we first leverage the variable dimensional particle swarm optimization (VD-PSO) algorithm that jointly optimizes the number of UAVs deployed, their depots, and association with the hovering locations. Then, minimal cost UAV trajectories are established, which preserves data freshness at the UAV depots. Simulation results manifest the dominance of the proposed scheme over the related state-of-the-art protocols.</div></div>\",\"PeriodicalId\":55555,\"journal\":{\"name\":\"Ad Hoc Networks\",\"volume\":\"178 \",\"pages\":\"Article 103974\"},\"PeriodicalIF\":4.8000,\"publicationDate\":\"2025-07-17\",\"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/S1570870525002227\",\"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/S1570870525002227","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

由于自主飞行能力和高机动性,无人机(UAV)辅助传感数据采集在室外物联网应用中变得越来越普遍。然而,无人机有限的机载电源导致有限的飞行时间,需要使用多无人机平台来确保大规模网络中的不间断服务。然而,很少有研究考虑使用来自不同仓库的多架无人机,以优化无人机群来提高网络覆盖。本文研究了一个多仓库、能量约束的车辆路由问题(MDEVRP),在该问题中,假设无人机永远不会耗尽能量,从不同的仓库派遣一组无人机从地面节点收集传感器数据。我们的目标是找到一组具有详细悬停和飞行计划的最优无人机,这是一个np困难问题。为了解决这样一个计算困难的问题,我们首先利用变维粒子群优化(VD-PSO)算法,该算法联合优化部署的无人机数量、它们的仓库以及与悬停位置的关联。然后,建立最小成本的无人机轨迹,以保持无人机仓库数据的新鲜度。仿真结果表明,所提出的方案优于相关的最新协议。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A multi-depot provisioned UAV swarm trajectory optimization scheme for collaborative data acquisition in a large-scale IoT environment
Due to autonomous flying ability and high manoeuvrability, unmanned aerial vehicle (UAV) assisted sensory data acquisition is becoming prevalent in outdoor IoT applications. However, UAV’s limited onboard power source results in a restricted flight time, necessitating the use of a multi-UAV platform to ensure uninterrupted service in a large-scale network. Nonetheless, very few studies have considered the use of multiple UAVs from distinct depots to improve network coverage with an optimal UAV swarm. This article investigates a multi-depot, energy-constrained vehicle routing problem (MDEVRP) where a fleet of UAVs is dispatched from different depots to collect sensory data from the ground nodes, provided that UAVs never run out of energy. Our objective is to discover an optimal set of UAVs with detailed hovering and travelling plans, which is an NP-hard problem. To solve such a computationally hard problem, we first leverage the variable dimensional particle swarm optimization (VD-PSO) algorithm that jointly optimizes the number of UAVs deployed, their depots, and association with the hovering locations. Then, minimal cost UAV trajectories are established, which preserves data freshness at the UAV depots. Simulation results manifest the dominance of the proposed scheme over the related state-of-the-art protocols.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
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学术文献互助群
群 号:604180095
Book学术官方微信