IEEE Journal on Selected Areas in Communications· 2016Q1
Dynamic Computation Offloading for Mobile-Edge Computing With Energy Harvesting Devices
- 1,694citations
- Q1SCImago
- 2016year
Short summary
A novel Lyapunov optimization-based algorithm dynamically offloads mobile computation tasks to edge servers, jointly optimizing offloading decisions, CPU frequencies, and transmit power for energy harvesting devices.
AI-generated from the title and abstract; the full text is not read.
Key points
- Develops a dynamic computation offloading strategy for MEC systems with energy harvesting.
- The proposed Lyapunov optimization-based algorithm jointly optimizes offloading decisions, CPU frequencies, and transmit power.
- The algorithm is online, requiring only current system state information.
- Achieves asymptotic optimality and is validated through simulations.
AI-generated from the title and abstract; the full text is not read.
Abstract
Mobile-edge computing (MEC) is an emerging paradigm to meet the ever-increasing computation demands from mobile applications. By offloading the computationally intensive workloads to the MEC server, the quality of computation experience, e.g., the execution latency, could be greatly improved. Nevertheless, as the on-device battery capacities are limited, computation would be interrupted when the battery energy runs out. To provide satisfactory computation performance as well as achieving green computing, it is of significant importance to seek renewable energy sources to power mobile devices via energy harvesting (EH) technologies. In this paper, we will investigate a green MEC system with EH devices and develop an effective computation offloading strategy. The execution cost, which addresses both the execution latency and task failure, is adopted as the performance metric. A low-complexity online algorithm is proposed, namely, the Lyapunov optimization-based dynamic computation offloading algorithm, which jointly decides the offloading decision, the CPU-cycle frequencies for mobile execution, and the transmit power for computation offloading. A unique advantage of this algorithm is that the decisions depend only on the current system state without requiring distribution information of the computation task request, wireless channel, and EH processes. The implementation of the algorithm only requires to solve a deterministic problem in each time slot, for which the optimal solution can be obtained either in closed form or by bisection search. Moreover, the proposed algorithm is shown to be asymptotically optimal via rigorous analysis. Sample simulation results shall be presented to corroborate the theoretical analysis as well as validate the effectiveness of the proposed algorithm.
The authors' abstract, as published at the source. IEEE Journal on Selected Areas in 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