Energy-Efficient Resource Allocation for Mobile-Edge Computation Offloading (Extended Version)

TL;DR

This paper develops optimal and sub-optimal resource allocation strategies for multiuser mobile-edge computation offloading systems using TDMA and OFDMA, aiming to minimize energy consumption while respecting latency constraints.

Contribution

It introduces a threshold-based optimal policy for TDMA systems and a low-complexity sub-optimal algorithm for OFDMA systems, advancing resource allocation methods in MECO.

Findings

Optimal policies have a threshold-based structure.

Sub-optimal algorithms achieve near-optimal performance.

Proposed methods reduce energy consumption and computational complexity.

Abstract

Mobile-edge computation offloading (MECO) offloads intensive mobile computation to clouds located at the edges of cellular networks. Thereby, MECO is envisioned as a promising technique for prolonging the battery lives and enhancing the computation capacities of mobiles. In this paper, we study resource allocation for a multiuser MECO system based on time-division multiple access (TDMA) and orthogonal frequency-division multiple access (OFDMA). First, for the TDMA MECO system with infinite or finite computation capacity, the optimal resource allocation is formulated as a convex optimization problem for minimizing the weighted sum mobile energy consumption under the constraint on computation latency. The optimal policy is proved to have a threshold-based structure with respect to a derived offloading priority function, which yields priorities for users according to their channel gains and local computing energy consumption. As a result, users with priorities above and below a given threshold perform complete and minimum offloading, respectively. Moreover, for the cloud with finite capacity, a sub-optimal resource-allocation algorithm is proposed to reduce the computation complexity for computing the threshold. Next, we consider the OFDMA MECO system, for which the optimal resource allocation is formulated as a non-convex mixed-integer problem. To solve this challenging problem and characterize its policy structure, a sub-optimal low-complexity algorithm is proposed by transforming the OFDMA problem to its TDMA counterpart. The corresponding resource allocation is derived by defining an average offloading priority function and shown to have close-to-optimal performance by simulation.