IEEE Transactions on Wireless Communications· 2016Q1
Energy-Efficient Resource Allocation for Mobile-Edge Computation Offloading
- 1,543citations
- Q1SCImago
- 2016year
Short summary
This paper proposes optimal and sub-optimal resource allocation algorithms for mobile-edge computation offloading (MECO) systems using TDMA and OFDMA, minimizing mobile energy consumption while meeting latency constraints.
AI-generated from the title and abstract; the full text is not read.
Key points
- Optimal resource allocation for TDMA MECO systems minimizes weighted sum mobile energy consumption under latency constraints.
- A threshold-based policy is derived, prioritizing users based on channel gains and local energy costs for complete or minimum offloading.
- A sub-optimal algorithm is proposed for finite cloud capacity TDMA systems to reduce computational complexity.
- For OFDMA MECO systems, a low-complexity sub-optimal algorithm transforms the problem into a TDMA counterpart, achieving close-to-optimal performance.
AI-generated from the title and abstract; the full text is not read.
Abstract
Mobile-edge computation offloading (MECO) off-loads 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 cloud 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 mixed-integer problem. To solve this challenging problem and characterize its policy structure, a low-complexity sub-optimal 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 in simulation.
The authors' abstract, as published at the source. IEEE Transactions on Wireless Communications, 2016 · DOI ↗
Continue with a free account
Ask the paper: 3 free questions a day about this paper; save it, get its citation, new summaries every day for your field. Takeaways are Premium.
Continue free on the webSign in with Google or Apple; no card needed. You come back to this paper.
On your phone:
Field: Computer Networks and Communications
Computer Networks and CommunicationsComputer Science