TY - JOUR
T1 - Joint Task Partitioning and User Association for Latency Minimization in Mobile Edge Computing Networks
AU - Feng, Mingjie
AU - Krunz, Marwan
AU - Zhang, Wenhan
N1 - Funding Information:
Manuscript received February 4, 2021; revised April 9, 2021; accepted May 20, 2021. Date of publication June 22, 2021; date of current version August 13, 2021. This work was supported in part by the National Science Foundation under Grants CNS-1910348, CNS-1563655, CNS-1731164, CNS-1813401, and IIP-1822071 and in part by the Broadband Wireless Access & Applications Center (BWAC). A part of this paper was presented at the IEEE International Workshop on Intelligent Cloud Computing and Networking (ICCN’21) [1]. The review of this article was coordinated by Prof. D. Tarchi. (Corresponding author: Mingjie Feng.) Mingjie Feng was with the Department of Electrical and Computer Engineering, University of Arizona, Tucson, AZ 85721 USA. He is now with the Wuhan National Laboratory for Optoelectronics, Huazhong University of Science and Technology, Wuhan 430074, China (e-mail: [email protected]).
Publisher Copyright:
© 1967-2012 IEEE.
PY - 2021/8
Y1 - 2021/8
N2 - Mobile edge computing (MEC) is a promising solution to support emerging delay-sensitive mobile applications, such as self-driving, augment/virtual reality, and various Internet of Things (IoT) applications. By deploying MEC servers at network edge, e.g., close to cellular base stations (BSs), the computational tasks generated by these applications can be offloaded to edge nodes (ENs) and be quickly executed there. At the same time, with the projected large number of IoT devices, the communication and computational resources allocated to each user can be quite limited, making it challenging to provide low-latency MEC services. In this paper, we investigate the problem of task partitioning and user association in an MEC system, aiming to minimize the average latency of all users. We assume that each task can be partitioned into multiple subtasks that can be executed on local devices (e.g., vehicles), MEC servers, and/or cloud servers; each user can be associated with one of the nearby ENs. The subtasks can be independent of or dependent on each other. For each case, we formulate the joint optimization of task partitioning ratios and user association as a mixed integer programming problem. Each problem is solved by decomposing it into two subproblems. The lower-level subproblem is task partitioning under a given user association, which can be solved optimally. The higher-level subproblem is user association, we propose a dual decomposition-based approach and a matching-based approach to derive near-optimal solutions. Simulation results show that compared to benchmark schemes, the proposed schemes reduce the average latency by about 50% and 40% for the cases of independent and dependent subtasks, respectively.
AB - Mobile edge computing (MEC) is a promising solution to support emerging delay-sensitive mobile applications, such as self-driving, augment/virtual reality, and various Internet of Things (IoT) applications. By deploying MEC servers at network edge, e.g., close to cellular base stations (BSs), the computational tasks generated by these applications can be offloaded to edge nodes (ENs) and be quickly executed there. At the same time, with the projected large number of IoT devices, the communication and computational resources allocated to each user can be quite limited, making it challenging to provide low-latency MEC services. In this paper, we investigate the problem of task partitioning and user association in an MEC system, aiming to minimize the average latency of all users. We assume that each task can be partitioned into multiple subtasks that can be executed on local devices (e.g., vehicles), MEC servers, and/or cloud servers; each user can be associated with one of the nearby ENs. The subtasks can be independent of or dependent on each other. For each case, we formulate the joint optimization of task partitioning ratios and user association as a mixed integer programming problem. Each problem is solved by decomposing it into two subproblems. The lower-level subproblem is task partitioning under a given user association, which can be solved optimally. The higher-level subproblem is user association, we propose a dual decomposition-based approach and a matching-based approach to derive near-optimal solutions. Simulation results show that compared to benchmark schemes, the proposed schemes reduce the average latency by about 50% and 40% for the cases of independent and dependent subtasks, respectively.
KW - Mobile edge computing
KW - delay-sensitive IoT applications
KW - task partitioning
KW - user association
UR - http://www.scopus.com/inward/record.url?scp=85109028418&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85109028418&partnerID=8YFLogxK
U2 - 10.1109/TVT.2021.3091458
DO - 10.1109/TVT.2021.3091458
M3 - Article
AN - SCOPUS:85109028418
SN - 0018-9545
VL - 70
SP - 8108
EP - 8121
JO - IEEE Transactions on Vehicular Technology
JF - IEEE Transactions on Vehicular Technology
IS - 8
M1 - 9462425
ER -