z-logo
open-access-imgOpen Access
Delay aware scheduling in UAV‐enabled OFDMA mobile edge computing system
Author(s) -
Liu Siyang,
Yang Tingting
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2020.0274
Subject(s) - computer science , orthogonal frequency division multiple access , telecommunications link , mobile edge computing , scheduling (production processes) , orthogonal frequency division multiplexing , distributed computing , real time computing , mathematical optimization , computer network , server , channel (broadcasting) , mathematics
In infrastructure‐less scenarios such as rural environments, wild emergency response, military applications and disaster relief, unmanned aerial vehicles (UAVs) are capable of providing enhanced mobile edge computing (MEC) services for ground users. Although small latency is the most important advantage of MEC system, how to provide delay aware scheduling in UAV‐enabled MEC system still remains unsolved. In this study, the authors investigate the delay aware scheduling problem in UAV‐enabled orthogonal frequency division multiple access (OFDMA) MEC system and formulate two non‐convex optimisation problems. Moreover, they consider uplink and downlink architecture with characteristics in different UAV‐ground links and traffic load. Furthermore, they propose two novel multi‐stages resource allocation algorithms, i.e. the JSPA‐T and JSPA‐F algorithms with respect to downlink transmit power allocation and sub‐carrier assignment. The mathematical frameworks with duality theory based alternative search optimisation and successive approximation method are proposed. The simulation results validate the performance improvement of the proposed solutions as well as the fast converge behaviour and small computational complexity.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here