Energy-Efficient Edge Offloading in Heterogeneous Industrial IoT Networks for Factory of Future

IEEE Access

Hung-Yu Wei¹  Che-Wei Hsu¹  Yung-Lin Hsu² 

[1] Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan;Graduate Institute of Communication Engineering, National Taiwan University, Taipei, Taiwan;

关键词: URLLC;    mMTC;    factory of future (FoF);    multi-access edge computing (MEC);    the industrial IoT (IIoT);    5G NR-U;   

DOI  :  10.1109/ACCESS.2020.3029253

来源: DOAJ

【 摘 要 】

The ultra-reliable and low latency communication (URLLC) and massive machine type communication (mMTC) in 5G are envisioned to support intelligent automation in the heterogeneous Factory of Future (FoF) networks, and Mobile-edge computing (MEC) is considered to be a promising system for enabling real-time task processing at the edge of the network. In the future factory, production machines, and environmental monitoring devices will be endowed with the wireless connecting for mobility. These devices are deployed for running complicated real-time tasks. To make such mission-critical tasks being processed in time, parts of the tasks should be completed with the assistance of the edge server or even the cloud. In this work, we jointly investigate the partial task offloading, computation, and communication (licensed and unlicensed) resource allocation problem in the trade-off between overall power consumption and quality of service (QoS) satisfaction. A 2-tier MEC-cloud framework is provided, wherein the IoT mobile devices (MDs) are able to partition the tasks into segments and offload them to the MEC and the cloud server. Considering the limits of communication and computation resources, we proposed a mechanism call 5G and NR-U opportunity-cost-based offloading algorithm (5G/NR-U OCBOA) to optimize resource allocation. Within the mechanism, there are two proposed algorithms, 5G OCBOA is for the licensed-only case, and NR-U OCBOA dedicates on unlicensed one. We iteratively perform the two algorithms to get the final solution. The simulation results show that our low-complexity algorithms almost outperform the other benchmark greedy algorithms. The proposed algorithm is up to 59.3% MD blocking probability less, up to 58.7% power saving gain, and up to 47.6% more QoS gain.

【 授权许可】

Unknown