Dynamic Task Offloading for Mobile Edge Computing with Hybrid Energy Supply

Abstract

Mobile edge computing (MEC), as a new distributed computing model, satisfies the low energy consumption and low latency requirements of computation-intensive services. The task offloading of MEC has become an important research hotspot, as it solves the problems of insufficient computing capability and battery capacity of Internet of things (IoT) devices. This study investigates task offloading scheduling in a dynamic MEC system. By integrating energy harvesting technology into IoT devices, we propose a hybrid energy supply model. We jointly optimize local computing, offloading duration, and edge computing decisions to minimize system cost. On the basis of stochastic optimization theory, we design an online dynamic task offloading algorithm for MEC with a hybrid energy supply called DTOME. DTOME can make task offloading decisions by weighing system cost and queue stability. We quote dynamic programming theory to obtain the optimal task offloading strategy. Simulation results verify the effectiveness of DTOME, and show that DTOME entails lower system cost than two baseline task offloading strategies.

Workflow scheduling strategy based on deep reinforcement learning

“…Literature [7] puts forward a multi-objective artificial bee colony algorithm, which is a swarm intelligence algorithm that can reduce energy consumption, execution time and cost respectively and improve resource utilization, but it does not discuss mutually exclusive performance indicators, such as execution time and overall cost, and provides a compromise solution. Literature [8] puts forward a hybrid particle swarm optimization (PSO)HEFT algorithm, which focuses on solving the problem of high energy consumption in the process of workflow scheduling in cloud computing system, and it can obtain a scheduling solution that balances the scheduling quality and energy consumption, but this algorithm is not suitable for dealing with scientific workflow scheduling problems oriented to data flow. This kind of algorithm can find the feasible solution under the constraint conditions, but because it can't predict the deviation between the feasible solution and the optimal solution, the convergence speed is slow, and it often falls into the local optimal solution in the process of solving, so it is difficult to meet the task requirements of low latency.…”

Keywords-Driven Paper Recommendation Based on Mobile Edge Computing Environment Framework

“…Mining. On the mobile edge end [27], according to reader's query keywords, we will introduce our paper recommendation approach based on a W-PCG (i.e., G w ). Specifically, given a query Q containing l (l ≥ 2) query keywords (i.e., Q � {k 1 , • • • , k l }), our proposal can find optimal answer trees on G w , denoted as T w (Q), where T w (Q) is not only a connected tree containing all query keywords (i.e., Q) but also having highest correlation.…”

Digital twin‐based framework for wireless multimodal interactions over long distance

“…However, the case cannot be directly copied and becomes more challenging in mobile communication networks, where low‐end user devices communicate with remote companions by accessing to the nearby base station (BS). User devices always have limited computation and energy resources, 10 thus it becomes impossible to deploy the opposite DT on these low‐end devices for real‐time predictions. Moreover, most of the existing works supposed the predicting model in opposite DT was simple and fixed, 11 which did not need constant updates to keep consistent with the dynamic physical counterpart.…”