Content area

Abstract

In the Industrial Internet, computing- and power-limited mobile devices (MDs) in the production process can hardly support the computation-intensive or time-sensitive applications. As a new computing paradigm, mobile edge computing (MEC) can almost meet the requirements of latency and calculation by handling tasks approximately close to MDs. However, the limited battery capacity of MDs causes unreliable task offloading in MEC, which will increase the system overhead and reduce the economic efficiency of manufacturing in actual production. To make the offloading scheme adaptive to that uncertain mobile environment, this paper considers the reliability of MDs, which is defined as residual energy after completing a computation task. In more detail, we first investigate the task offloading in MEC and also consider reliability as an important criterion. To optimize the system overhead caused by task offloading, we then construct the mathematical models for two different computing modes, namely, local computing and remote computing, and formulate task offloading as a mixed integer non-linear programming (MINLP) problem. To effectively solve the optimization problem, we further propose a heuristic algorithm based on greedy policy (HAGP). The algorithm achieves the optimal CPU cycle frequency for local computing and the optimal transmission power for remote computing by alternating optimization (AP) methods. It then makes the optimal offloading decision for each MD with a minimal system overhead in both of these two modes by the greedy policy under the limited wireless channels constraint. Finally, multiple experiments are simulated to verify the advantages of HAGP, and the results strongly confirm that the considered task offloading reliability of MDs can reduce the system overhead and further save energy consumption to prolong the life of the battery and support more computation tasks.

Details

1009240
Title
HAGP: A Heuristic Algorithm Based on Greedy Policy for Task Offloading with Reliability of MDs in MEC of the Industrial Internet
Author
Guo, Min 1   VIAFID ORCID Logo  ; Huang, Xing 2 ; Wang, Wei 2 ; Liang, Bing 2 ; Yang, Yanbing 3   VIAFID ORCID Logo  ; Zhang, Lei 3 ; Chen, Liangyin 3   VIAFID ORCID Logo 

 School of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China; [email protected] (M.G.); [email protected] (X.H.); [email protected] (W.W.); [email protected] (B.L.); [email protected] (Y.Y.); [email protected] (L.Z.); School of Mathematics and Computer Science, Northwest Minzu University, Lanzhou 730050, China 
 School of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China; [email protected] (M.G.); [email protected] (X.H.); [email protected] (W.W.); [email protected] (B.L.); [email protected] (Y.Y.); [email protected] (L.Z.) 
 School of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China; [email protected] (M.G.); [email protected] (X.H.); [email protected] (W.W.); [email protected] (B.L.); [email protected] (Y.Y.); [email protected] (L.Z.); Institude for Industrial Internet Research, Sichuan University, Chengdu 610065, China 
Publication title
Sensors; Basel
Volume
21
Issue
10
First page
3513
Publication year
2021
Publication date
2021
Publisher
MDPI AG
Place of publication
Basel
Country of publication
Switzerland
e-ISSN
14248220
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
Publication history
 
 
Online publication date
2021-05-18
Milestone dates
2021-04-13 (Received); 2021-05-13 (Accepted)
Publication history
 
 
   First posting date
18 May 2021
ProQuest document ID
2532965813
Document URL
https://www.proquest.com/scholarly-journals/hagp-heuristic-algorithm-based-on-greedy-policy/docview/2532965813/se-2?accountid=208611
Copyright
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-04-22
Database
ProQuest One Academic