Evidence map›Paper›PMID 34070024›Full record

ArticleSensors (Basel, Switzerland)2021

HAGP: A Heuristic Algorithm Based on Greedy Policy for Task Offloading with Reliability of MDs in MEC of the Industrial Internet.

Min Guo, Xing Huang, Wei Wang, Bing Liang, Yanbing Yang, Lei Zhang, Liangyin Chen

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

7 authors.

Min GuoSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.ORCID 0000-0002-8803-8550
Xing HuangSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.
Wei WangSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.
Bing LiangSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.
Yanbing YangSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.ORCID 0000-0002-9266-8600
Lei ZhangSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.
Liangyin ChenSchool of Computer Science & School of Software Engineering, Sichuan University, Chengdu 610065, China.ORCID 0000-0001-6166-890X

Funding

National Natural Science Foundation of China 62072319the Applied Basic Research Programs of Science and Technology Department of Sichuan Province under Grant 2019YJ0110the fundamental research funds for the central universities 31920190092the Key Research and Development Program of the Science and Technology Department of Sichuan Province 2020YFS0575the Key Research and Development Program of the Science and Technology Department of Sichuan Province 20ZDYF1906
6 · The paper itself

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.

Indexed as

Industrial Internetmobile edge computing (MEC)optimizationreliabilitytask offloading

Identifiers

PMID34070024
PMCPMC8157835

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.