Average Reliability-Optimal Offloading for Mobile Edge Computing in Low-Latency Industrial IoT Networks

In this paper, we consider a multi-access mobile edge computing (MEC) network with multiple sensors and one MEC server in industrial Internet of Things networks, where the MEC server provides a joint computation service (in the computation phase) for a set of sub-tasks offloaded by different sensors (in the communication phase). Due to the requirements of low latency and ultra reliability, we utilize finite blocklength information theory to characterize the reliability of the communication phase and exploit extreme value theory to investigate the delay violation probability in the computation phase. Following these characterizations, we derive the average end-to-end error probability of the entire service and provide two average end-to-end reliability-optimal design frameworks considering fixed frames structure and dynamic frames structure, in both of which the goal is to minimize the average end-to-end error probability by optimally allocating the total time length to each frame, as well as allocating each frame length to the communication phase and the computation phase. For the fixed frames structure, the original problem is decomposed, and the joint convexity of the decomposed sub-problems is rigorously proved, and the optimal solutions are obtained by the proposed optimal time allocation algorithm. Moreover, for the dynamic frames structure, we reformulate the optimization problem by introducing an average time constraint. By exploiting Lagrange multipliers, we transform the reformulated optimization problem into a dual problem with strong duality, the solutions of which can be obtained by the proposed time allocation algorithm. Via simulations, we validate the proven convexity and the approximation in our analytical model and evaluate the performance for both fixed frames length structure and dynamic frames length structure.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Mobile Computing
Published
2025-02-18
DOI
https://doi.org/10.1109/tmc.2025.3541661
Primary Topic
IoT and Edge/Fog Computing
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Average Reliability-Optimal Offloading for Mobile Edge Computing in Low-Latency Industrial IoT Networks

Jie Wang, Yulin Hu, Anke Schmeink, M. Cenk Gursoy et al.
1 links
IEEE Transactions on Mobile Computing
IoT and Edge/Fog Computing
article

Average Reliability-Optimal Offloading for Mobile Edge Computing in Low-Latency Industrial IoT Networks

Jie Wang, Yulin Hu, Anke Schmeink, M. Cenk Gursoy, Yao Zhu
article en

Abstract

In this paper, we consider a multi-access mobile edge computing (MEC) network with multiple sensors and one MEC server in industrial Internet of Things networks, where the MEC server provides a joint computation service (in the computation phase) for a set of sub-tasks offloaded by different sensors (in the communication phase). Due to the requirements of low latency and ultra reliability, we utilize finite blocklength information theory to characterize the reliability of the communication phase and exploit extreme value theory to investigate the delay violation probability in the computation phase. Following these characterizations, we derive the average end-to-end error probability of the entire service and provide two average end-to-end reliability-optimal design frameworks considering fixed frames structure and dynamic frames structure, in both of which the goal is to minimize the average end-to-end error probability by optimally allocating the total time length to each frame, as well as allocating each frame length to the communication phase and the computation phase. For the fixed frames structure, the original problem is decomposed, and the joint convexity of the decomposed sub-problems is rigorously proved, and the optimal solutions are obtained by the proposed optimal time allocation algorithm. Moreover, for the dynamic frames structure, we reformulate the optimization problem by introducing an average time constraint. By exploiting Lagrange multipliers, we transform the reformulated optimization problem into a dual problem with strong duality, the solutions of which can be obtained by the proposed time allocation algorithm. Via simulations, we validate the proven convexity and the approximation in our analytical model and evaluate the performance for both fixed frames length structure and dynamic frames length structure.

IEEE Transactions on Mobile ComputingVol. 24(7)
Wuhan University (CN), Syracuse University (US), RWTH Aachen University (DE)
Industry, innovation and infrastructure
Openalex Percentile: Top 98%
IoT and Edge/Fog Computing
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.