EconPapers    
Economics at your fingertips  
 

Two-Stage Computation Offloading Scheduling Algorithm for Energy-Harvesting Mobile Edge Computing

Laihyuk Park, Cheol Lee, Woongsoo Na, Sungyun Choi and Sungrae Cho
Additional contact information
Laihyuk Park: Department of Computer Science and Engineering, Seoul National University of Science and Technology, Seoul 01811, Korea
Cheol Lee: School of Computer Science and Engineering, Chung-Ang University, 221 Heukseok, Dongjak, Seoul 156-756, Korea
Woongsoo Na: Media Intellectualization Research Section, Electronics and Telecommunications Research Institute, 218 Gajeong-ro, Yuseong-gu, Daejeon 34129, Korea
Sungyun Choi: School of Electrical Engineering, Korea University, 145 Anam-ro, Seongbuk-gu, Seoul 02841, Korea
Sungrae Cho: School of Computer Science and Engineering, Chung-Ang University, 221 Heukseok, Dongjak, Seoul 156-756, Korea

Energies, 2019, vol. 12, issue 22, 1-15

Abstract: Recently, mobile edge computing (MEC) technology was developed to mitigate the overload problem in networks and cloud systems. An MEC system computes the offloading computation tasks from resource-constrained Internet of Things (IoT) devices. In addition, several convergence technologies with renewable energy resources (RERs) such as photovoltaics have been proposed to improve the survivability of IoT systems. This paper proposes an MEC integrated with RER system, which is referred to as energy-harvesting (EH) MEC. Since the energy supply of RERs is unstable due to various reasons, EH MEC needs to consider the state-of-charge (SoC) of the battery to ensure system stability. Therefore, in this paper, we propose an offloading scheduling algorithm considering the battery of EH MEC as well as the service quality of experience (QoE). The proposed scheduling algorithm consists of a two-stage operation, where the first stage consists of admission control of the offloading requests and the second stage consists of computation frequency scheduling of the MEC server. For the first stage, a non-convex optimization problem is designed considering the computation capability, SoC, and request deadline. To solve the non-convex problem, a greedy algorithm is proposed to obtain approximate optimal solutions. In the second stage, based on Lyapunov optimization, a low-complexity algorithm is proposed, which considers both the workload queue and battery stability. In addition, performance evaluations of the proposed algorithm were conducted via simulation. However, this paper has a limitation in terms of verifying in a real-world scenario.

Keywords: computation offloading; mobile edge computing; energy harvesting; lyapunov optimization (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1996-1073/12/22/4367/pdf (application/pdf)
https://www.mdpi.com/1996-1073/12/22/4367/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:12:y:2019:i:22:p:4367-:d:287603

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().

 
Page updated 2025-03-19
Handle: RePEc:gam:jeners:v:12:y:2019:i:22:p:4367-:d:287603