Energy-Efficient Resource Allocation in LEO-Assisted UAV Architecture for Internet of Things

Qingtian Wang, Xinjiang Xia, Tao Chen*, Siyu Chen, Yue Wang, Zexu Li, Jingyi Wang

*Corresponding author for this work

Research output: Contribution to journalArticleScientificpeer-review

Abstract

The integration of Unmanned Aerial Vehicles (UAVs) and Low Earth Orbit (LEO) satellites has become attractive for Internet of Things (IoT) task processing, as it can overcome obstacles in terrestrial network coverage, such as those in oceans or desert areas. However, it lacks a collaborative approach for allocating the communication and computing resources among UAVs and LEO satellites and optimizing the hovering point of UAVs to prolong their endurance. In this paper, we investigate energy-efficient resource allocation in LEO-assisted UAV networks for the Internet of Things. A novel optimization algorithm, that Jointly IoT tasks' Offloading decision, UAVs' Region selection, Hovering point chosen, and Communication and Computing resource allocation (ORHCC), is proposed to optimize UAV trajectories and hovering points, enhancing endurance and minimizing energy consumption. In particular, the UAVs' region selection and IoT tasks offloading are under the Dueling Deep Q-Network (DuDQN) framework, the Hovering point chosen and Communication and Computing resource allocation via the convex solution. The results show that the proposed ORHCC reduces 12.5% and 20.76% energy consumption compared with the PPO and greedy baseline, respectively.

Original languageEnglish
Pages (from-to)9614-9626
Number of pages13
JournalIEEE Internet of Things Journal
Volume12
Issue number8
DOIs
Publication statusPublished - 15 Apr 2025
MoE publication typeA1 Journal article-refereed

Keywords

  • AI native
  • Energy Efficiency
  • LEO
  • Resource Allocation
  • UAV

Fingerprint

Dive into the research topics of 'Energy-Efficient Resource Allocation in LEO-Assisted UAV Architecture for Internet of Things'. Together they form a unique fingerprint.

Cite this