Computation Throughput Maximization for UAV-Enabled MEC with Binary Computation Offloading

Mobile edge computing (MEC) has been considered to provide computation services near the edge of mobile networks, while the unmanned aerial vehicle (UAV) is becoming an important integrated component to extend service coverage. In this paper, we consider a UAV-enabled MEC with binary computation off...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE International Conference on Communications (2003) S. 4348 - 4353
Hauptverfasser: Xu, Changyuan, Zhan, Cheng, Liao, Jingrui, Gong, Jue
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 16.05.2022
Schlagworte:
Approximation algorithms
Autonomous aerial vehicles
Benchmark testing
binary computation offloading
Computational modeling
mobile-edge computing (MEC)
penalty successive convex approximation (P-SCA)
Simulation
Throughput
Trajectory
unmanned aerial vehicle (UAV)
ISSN:1938-1883
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Mobile edge computing (MEC) has been considered to provide computation services near the edge of mobile networks, while the unmanned aerial vehicle (UAV) is becoming an important integrated component to extend service coverage. In this paper, we consider a UAV-enabled MEC with binary computation offloading, where a UAV serves as an aerial edge server and each task of devices is either executing locally or offloading to the aerial edge server as a whole. To provide fairness among different ground devices, we aim to maximize the minimum computation throughput for all devices via the joint design of computing mode selection and UAV trajectory as well as resource allocation. The optimization problem is formulated as a mixed-integer nonlinear problem consisting of binary variables, which is difficult to tackle. The influence of non-binary solutions is penalized with a penalty function, based on which we develop an efficient iteration algorithm to obtain a suboptimal solution via leveraging the penalty successive convex approximation (P-SCA) method and difference of two convex (D.C.) optimization framework, where the algorithm is guaranteed to converge. Extensive simulations are conducted and the results with different system parameters show the effectiveness of the proposed joint design algorithm compared with other benchmark schemes.
ISSN:1938-1883
DOI:10.1109/ICC45855.2022.9838879