4.8 Article

Partial Offloading Scheduling and Power Allocation for Mobile Edge Computing Systems

Journal

IEEE INTERNET OF THINGS JOURNAL
Volume 6, Issue 4, Pages 6774-6785

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JIOT.2019.2911455

Keywords

Convex optimization; energy efficiency; resource allocation; task offloading; task scheduling

Funding

  1. National Natural Science Foundation of China [61309027, 617725534, 61728108]
  2. Hunan Provincial Natural Science Foundation of China [2018JJ3888]
  3. Scientific Research Fund of Hunan Provincial Education Department [18B197]
  4. National Key Research and Development Program of China [2018YFB1700200]
  5. Open Research Project of Key Laboratory of Intelligent Information Perception and Processing Technology (Hunan Province) [2017KF01]
  6. Foundation Project of Hunan Internet of Things Society [2018-2]

Ask authors/readers for more resources

Mobile edge computing (MEC) is a promising technique to enhance computation capacity at the edge of mobile networks. The joint problem of partial offloading decision, offloading scheduling, and resource allocation for MEC systems is a challenging issue. In this paper, we investigate the joint problem of partial offloading scheduling and resource allocation for MEC systems with multiple independent tasks. A partial offloading scheduling and power allocation (POSP) problem in single-user MEC systems is formulated. The goal is to minimize the weighted sum of the execution delay and energy consumption while guaranteeing the transmission power constraint of the tasks. The execution delay of tasks running at both MEC and mobile device is considered. The energy consumption of both the task computing and task data transmission is considered as well. The formulated problem is a nonconvex mixed-integer optimization problem. In order to solve the formulated problem, we propose a two-level alternation method framework based on Lagrangian dual decomposition. The task offloading decision and offloading scheduling problem, given the allocated transmission power, is solved in the upper level using flow shop scheduling theory or greedy strategy, and the suboptimal power allocation with the partial offloading decision is obtained in the lower level using convex optimization techniques. We propose iterative algorithms for the joint problem of POSP. Numerical results demonstrate that the proposed algorithms achieve near-optimal delay performance with a large energy consumption reduction.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.8
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available