Associative Task Computation Offloading for Industrial Internet of Things

In this paper, we propose a computational offloading strategy tailored for multiple industrial equipment (IE) within an Industrial Internet of Things (IIoT) framework. Our primary focus is on addressing the computational offloading problem, specifically by modeling the associative relationship between tasks as a Directed Acyclic Graph (DAG). Initially, we transform the DAG task offloading problem into a Markov decision process (MDP). Subsequently, to derive the optimal offloading decision, we propose a novel approach termed DAG Task offloading with Message Passing Neural Network (MPNN) and Double Deep Q-Network (DAGTO-MAD). The proposed algorithm aims to min-imize the completion time of the task set. Moreover, we enhance the performance of the MPNN by adapting it to extract structural information from the DAG more efficiently. Simulation results demonstrate that our proposed algorithm achieves a shorter completion time compared to existing offloading algorithms across various environments. Additionally, our algorithm exhibits robust convergence and versatility, highlighting its effectiveness in real-application scenarios.

Authors

Institutions

Publication Details

Published
2024-10-24
DOI
https://doi.org/10.1109/wcsp62071.2024.10826688
Primary Topic
Robotics and Automated Systems
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Associative Task Computation Offloading for Industrial Internet of Things

Chaowei Wang, Fan Jiang, Lei Liu, Hang Zhang
Robotics and Automated Systems
article

Associative Task Computation Offloading for Industrial Internet of Things

Chaowei Wang, Fan Jiang, Lei Liu, Hang Zhang
article en

Abstract

In this paper, we propose a computational offloading strategy tailored for multiple industrial equipment (IE) within an Industrial Internet of Things (IIoT) framework. Our primary focus is on addressing the computational offloading problem, specifically by modeling the associative relationship between tasks as a Directed Acyclic Graph (DAG). Initially, we transform the DAG task offloading problem into a Markov decision process (MDP). Subsequently, to derive the optimal offloading decision, we propose a novel approach termed DAG Task offloading with Message Passing Neural Network (MPNN) and Double Deep Q-Network (DAGTO-MAD). The proposed algorithm aims to min-imize the completion time of the task set. Moreover, we enhance the performance of the MPNN by adapting it to extract structural information from the DAG more efficiently. Simulation results demonstrate that our proposed algorithm achieves a shorter completion time compared to existing offloading algorithms across various environments. Additionally, our algorithm exhibits robust convergence and versatility, highlighting its effectiveness in real-application scenarios.

Beijing University of Posts and Telecommunications (CN), Xi’an University of Posts and Telecommunications (CN)
National Natural Science Foundation of China
Decent work and economic growth
Openalex Percentile: Top 69%
Robotics and Automated Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.