A Novel Genetic Trajectory Planning Algorithm With Variable Population Size for Multi-UAV-Assisted Mobile Edge Computing System
<p dir="ltr">This paper presents a multi-unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system, where multiple UAVs (variable number of UAVs) are deployed to serve Internet of Things devices (IoTDs). We aim to minimize the sum of hovering and flying energies of UA...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , |
| منشور في: |
2021
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | <p dir="ltr">This paper presents a multi-unmanned aerial vehicle (UAV)-assisted mobile edge computing (MEC) system, where multiple UAVs (variable number of UAVs) are deployed to serve Internet of Things devices (IoTDs). We aim to minimize the sum of hovering and flying energies of UAVs by optimizing the trajectories of UAVs. The problem is very complicated as we have to consider the deployment of stop points (SPs), the association between UAVs and SPs, and the order of SPs for UAVs. To solve the problem, this paper proposed a novel genetic trajectory planning algorithm with variable population size (GTPA-VP), which consists of two phases. In the first phase, a genetic algorithm (GA) with a variable population size is used to update the deployment of SPs. Accordingly, a multi-chrome GA is adopted to find the association between UAVs and SPs, an optimal number of UAVs, and the optimal order of SPs for UAVs. The effectiveness of the proposed GTPA-VP is demonstrated through several experiments on a set of ten instances with up to 200 IoTDs. It is evident from the experimental results that the proposed GTPA-VP outperforms the benchmark algorithms in terms of the energy consumption of the system.</p><h2>Other Information</h2><p dir="ltr">Published in: IEEE Access<br>License: <a href="https://creativecommons.org/licenses/by/4.0/" rel="noreferrer" target="_blank">https://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1109/access.2021.3111318" target="_blank">https://dx.doi.org/10.1109/access.2021.3111318</a></p> |
|---|