Energy-Efficient Computation Offloading for UAV-Assisted MEC: A Two-Stage Optimization Scheme

2022 ◽  
Vol 22 (1) ◽  
pp. 1-23
Author(s):  
Weiwei Lin ◽  
Tiansheng Huang ◽  
Xin Li ◽  
Fang Shi ◽  
Xiumin Wang ◽  
...  

In addition to the stationary mobile edge computing (MEC) servers, a few MEC surrogates that possess a certain mobility and computation capacity, e.g., flying unmanned aerial vehicles (UAVs) and private vehicles, have risen as powerful counterparts for service provision. In this article, we design a two-stage online scheduling scheme, targeting computation offloading in a UAV-assisted MEC system. On our stage-one formulation, an online scheduling framework is proposed for dynamic adjustment of mobile users' CPU frequency and their transmission power, aiming at producing a socially beneficial solution to users. But the major impediment during our investigation lies in that users might not unconditionally follow the scheduling decision released by servers as a result of their individual rationality. In this regard, we formulate each step of online scheduling on stage one into a non-cooperative game with potential competition over the limited radio resource. As a solution, a centralized online scheduling algorithm, called ONCCO, is proposed, which significantly promotes social benefit on the basis of the users' individual rationality. On our stage-two formulation, we are working towards the optimization of UAV computation resource provision, aiming at minimizing the energy consumption of UAVs during such a process, and correspondingly, another algorithm, called WS-UAV, is given as a solution. Finally, extensive experiments via numerical simulation are conducted for an evaluation purpose, by which we show that our proposed algorithms achieve satisfying performance enhancement in terms of energy conservation and sustainable service provision.

Energies ◽  
2019 ◽  
Vol 12 (22) ◽  
pp. 4367
Author(s):  
Laihyuk Park ◽  
Cheol Lee ◽  
Woongsoo Na ◽  
Sungyun Choi ◽  
Sungrae Cho

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.


SIMULATION ◽  
2021 ◽  
pp. 003754972110286
Author(s):  
Eduardo Pérez

Wind turbines experience stochastic loading due to seasonal variations in wind speed and direction. These harsh operational conditions lead to failures of wind turbines, which are difficult to predict. Consequently, it is challenging to schedule maintenance actions that will avoid failures. In this article, a simulation-driven online maintenance scheduling algorithm for wind farm operational planning is derived. Online scheduling is a suitable framework for this problem since it integrates data that evolve over time into the maintenance scheduling decisions. The computational study presented in this article compares the performance of the simulation-driven online scheduling algorithm against two benchmark algorithms commonly used in practice: scheduled maintenance and condition-based monitoring maintenance. An existing discrete event system specification simulation model was used to test and study the benefits of the proposed algorithm. The computational study demonstrates the importance of avoiding over-simplistic assumptions when making maintenance decisions for wind farms. For instance, most literature assumes maintenance lead times are constant. The computational results show that allowing lead times to be adjusted in an online fashion improves the performance of wind farm operations in terms of the number of turbine failures, availability capacity, and power generation.


1995 ◽  
Vol 05 (04) ◽  
pp. 635-646 ◽  
Author(s):  
MICHAEL A. PALIS ◽  
JING-CHIOU LIOU ◽  
SANGUTHEVAR RAJASEKARAN ◽  
SUNIL SHENDE ◽  
DAVID S.L. WEI

The scheduling problem for dynamic tree-structured task graphs is studied and is shown to be inherently more difficult than the static case. It is shown that any online scheduling algorithm, deterministic or randomized, has competitive ratio Ω((1/g)/ log d(1/g)) for trees with granularity g and degree at most d. On the other hand, it is known that static trees with arbitrary granularity can be scheduled to within twice the optimal schedule. It is also shown that the lower bound is tight: there is a deterministic online tree scheduling algorithm that has competitive ratio O((1/g)/ log d(1/g)). Thus, randomization does not help.


Sign in / Sign up

Export Citation Format

Share Document