A Fast Algorithm for Energy-Saving Offloading with Reliability and Latency Requirements in Multi-Access Edge Computing

40Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Multi-Access Edge Computing (MEC) is a promising paradigm that providing cloud-like service for handling the high-complexity and latency-sensitive applications on user equipment (UE) via computation offloading. However, the execution reliability is rarely considered in current MEC studies, which is an important factor to guarantee the quality of service (QoS). For that, this paper considers an energy-saving offloading to satisfy the reliability and latency requirements of the application. Specifically, we formulate an optimization problem to minimize the UE's energy consumption with reliability and latency constraints. To tackle this NP-hard problem, we first divide the entire application into multiple directed-acyclic-graph-(DAG)-based subtasks, where the subtask can be executed on the UE locally or MEC server remotely. Then, we decompose the overall reliability and latency requirements into multiple constraints for each subtask. Finally, we propose a fast heuristic algorithm to find a solution satisfying the constraints. Simulation results demonstrate the proposed algorithm obtains lower energy consumption compared with the local execution and random assignment and costs less runtime compared with the greedy algorithm.

Cite

CITATION STYLE

APA

Liu, H., Cao, L., Pei, T., Deng, Q., & Zhu, J. (2020). A Fast Algorithm for Energy-Saving Offloading with Reliability and Latency Requirements in Multi-Access Edge Computing. IEEE Access, 8, 151–161. https://doi.org/10.1109/ACCESS.2019.2961453

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free