Deep-Reinforcement-Learning-Based Computation Offloading for Servicing Dynamic Demand in Multi-UAV-Assisted IoT Network

In wireless networks, meeting the performance requirements of all tasks solely with Internet of Things (IoT) devices is challenging due to their limited computational power and battery capacity. Given their flexibility and mobility, the application of unmanned aerial vehicles (UAVs) in the context o...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE internet of things journal Ročník 11; číslo 10; s. 17249 - 17263
Hlavní autoři: Lin, Na, Bai, Lu, Hawbani, Ammar, Guan, Yunchong, Mao, Chaojin, Liu, Zhi, Zhao, Liang
Médium: Journal Article
Jazyk:angličtina
japonština
Vydáno: Piscataway IEEE 15.05.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:2327-4662, 2327-4662
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:In wireless networks, meeting the performance requirements of all tasks solely with Internet of Things (IoT) devices is challenging due to their limited computational power and battery capacity. Given their flexibility and mobility, the application of unmanned aerial vehicles (UAVs) in the context of mobile edge computing (MEC) has garnered significant interest within the sector. However, UAVs also face constraints in terms of resources like storage and computational power. Therefore, it is vital to develop effective UAV assistance solutions to provide long-term demands of in-network services. The dynamic scheduling and computation offloading of UAVs is the subject of this article. Specifically, we propose a deep deterministic policy gradient algorithm based on a greedy (DDPGG) strategy to jointly optimize dynamic scheduling, device association, and task allocation of UAVs, with the goal of minimizing the weighted sum of total system energy consumption and time delay. The problem is formulated as a nonlinear programming problem involving mixed integers. The simulation results demonstrate that the DDPGG algorithm we have proposed exhibits a higher level of performance in comparison to its competitors.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2024.3356725