arrow
Return

Multi-objective optimization algorithm for multi-workflow computation offloading in resource-limited IIoT

delete2024-08-01
delete2
PRE
AI
B
Baoshan Sun
H
Hao Huang *
Z
Zhengyi Chai
Y
Ying-Jie Zhao
DOI:10.1016/j.swevo.2024.101646delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Industrial internet of things (IIoT) connects traditional industrial devices with the network to provide intelligent services, which is regarded as the key technology for achieving Industry 4.0 and enabling the transformation of the manufacturing sector. Multi-access edge computing (MEC) has brought significant opportunities to expedite the development of IIoT. However, the unique task characteristics and dense deployment of IIoT devices, coupled with the resource starvation problem (RSP) arising from the limited resources of edge servers, pose challenges to the direct applicability of existing MEC algorithms in MEC-assisted IIoT scenarios. To this end, a multi-objective evolutionary algorithm is proposed to simultaneously optimize delay and energy consumption for multi-workflow execution in resource-limited IIoT. First, the initialization of execution location based on delay and the initialization of execution order satisfying the priority constraint can generate high-quality initial solutions. Then, the improved crossover and mutation operations guide the population evolution, which can span the large infeasible solution region. Finally, dynamic task scheduling (DTS) dynamically changes the execution location of tasks affected by RSP according to the execution efficiency, so as to avoid the tasks blindly waiting for server resources. The comprehensive simulation results demonstrate the effectiveness of the proposed method in achieving a balance between the execution delay and energy consumption of IIoT devices.
Keywords:
Multi-access edge computing
Computation offloading
Multi-objective optimization
IIoT

Journal

Swarm and Evolutionary Computation cover
Swarm and Evolutionary Computation
IF:
8.5
Papers:
2.1K
Citations:
1.0W

Organization

T
Tiangong University
Scholars:
1.2W
Papers: 7.7K
Citations: 1.1W