Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks

The growth in artificial intelligence (AI) technology has attracted substantial interests in latency-aware task offloading of mobile edge computing (MEC)—namely, minimizing service latency. Additionally, the use of MEC systems poses an additional problem arising from limited battery resources of MDs. This paper tackles the pressing challenge of latency-aware distributed task offloading optimization, where user association (UA), resource allocation (RA), full-task offloading, and battery of mobile devices (MDs) are jointly considered. In existing studies, joint optimization of overall task offloading and UA is seldom considered due to the complexity of combinatorial optimization problems, and in cases where it is considered, linear objective functions such as power consumption are adopted. Revolutionizing the realm of MEC, our objective includes all major components contributing to users’ quality of experience, including latency and energy consumption. To achieve this, we first formulate an NP-hard combinatorial problem, where the objective function comprises three elements: communication latency, computation latency, and battery usage. We derive a closed-form RA solution of the problem; next, we provide a distributed pricing-based UA solution. We simulate the proposed algorithm for various resource-intensive tasks. Our numerical results show that the proposed method Pareto-dominates baseline methods. More specifically, the results demonstrate that the proposed method can outperform baseline methods by <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1.62 times shorter latency</i> with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">41.2% less energy consumption</i>.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Mobile Computing
Published
2024-09-10
DOI
https://doi.org/10.1109/tmc.2024.3458185
Citations
19
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
6.63

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks

Youngchol Choi, Hyun Jong Yang, Jonggyu Jang, Minwoo Kim
19 citations
IEEE Transactions on Mobile Computing
IoT and Edge/Fog Computing
6.63
article

Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks

Youngchol Choi, Hyun Jong Yang, Jonggyu Jang, Minwoo Kim
article en
19 citations

Abstract

The growth in artificial intelligence (AI) technology has attracted substantial interests in latency-aware task offloading of mobile edge computing (MEC)—namely, minimizing service latency. Additionally, the use of MEC systems poses an additional problem arising from limited battery resources of MDs. This paper tackles the pressing challenge of latency-aware distributed task offloading optimization, where user association (UA), resource allocation (RA), full-task offloading, and battery of mobile devices (MDs) are jointly considered. In existing studies, joint optimization of overall task offloading and UA is seldom considered due to the complexity of combinatorial optimization problems, and in cases where it is considered, linear objective functions such as power consumption are adopted. Revolutionizing the realm of MEC, our objective includes all major components contributing to users’ quality of experience, including latency and energy consumption. To achieve this, we first formulate an NP-hard combinatorial problem, where the objective function comprises three elements: communication latency, computation latency, and battery usage. We derive a closed-form RA solution of the problem; next, we provide a distributed pricing-based UA solution. We simulate the proposed algorithm for various resource-intensive tasks. Our numerical results show that the proposed method Pareto-dominates baseline methods. More specifically, the results demonstrate that the proposed method can outperform baseline methods by <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1.62 times shorter latency</i> with <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">41.2% less energy consumption</i>.

IEEE Transactions on Mobile ComputingVol. 23(12)
Pohang University of Science and Technology (KR), Seoul National University (KR), Korea Research Institute of Ships and Ocean Engineering
National Research Foundation of Korea, Ministry of Science and ICT, South Korea
Decent work and economic growth
Openalex Percentile: Top 3%
IoT and Edge/Fog Computing
6.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.