Distributed Task Offloading and Resource Allocation for Latency Minimization in Mobile Edge Computing Networks
- Authors
- Kim, Minwoo; Jang, Jonggyu; 최영철; Yang, Hyun Jong
- Issue Date
- 12월-2024
- Publisher
- IEEE COMPUTER SOC
- Keywords
- Servers; Artificial intelligence; Resource management; Batteries; Energy consumption; Optimization; Delays; Latency minimization; delay minimization; mobile edge computing; resource allocation; user association; task offloading; energy efficiency; edge AI
- Citation
- IEEE TRANSACTIONS ON MOBILE COMPUTING, v.23, no.12, pp 15149 - 15166
- Pages
- 18
- Journal Title
- IEEE TRANSACTIONS ON MOBILE COMPUTING
- Volume
- 23
- Number
- 12
- Start Page
- 15149
- End Page
- 15166
- URI
- https://www.kriso.re.kr/sciwatch/handle/2021.sw.kriso/10594
- DOI
- 10.1109/TMC.2024.3458185
- ISSN
- 1536-1233
1558-0660
- 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 1.62 times shorter latency with 41.2% less energy consumption.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - ETC > 1. Journal Articles

Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.