期刊
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
卷 17, 期 5, 页码 3348-3357出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2020.2978946
关键词
Edge computing; Resource management; Optimization; Cloud computing; Task analysis; Energy consumption; Computational modeling; Dynamic computation offloading; edge computing; energy harvesting; fog computing; Lyapunov optimization; resource allocation
类别
资金
- NSFC [62071105]
- NSF of Hebei [E2017203351]
- Key Research and Development Project of Hebei [19252106D, TII19-3396]
This article proposes a dynamic optimization scheme for IoT fog computing system with multiple mobile devices, where resources can be dynamically coordinated and allocated. Through Lyapunov optimization, a joint computation offloading and radio resource allocation algorithm is implemented to minimize system costs related to latency, energy consumption, and weights of devices.
Fog computing system is able to facilitate computation-intensive applications and emerges as one of the promising technology for realizing the Internet of Things (IoT). By offloading the computational tasks to the fog node (FN) at the network edge, both the service latency and energy consumption can be improved, which is significant for industrial IoT applications. However, the dynamics of computational resource usages in the FN, the radio environment and the energy in the battery of IoT devices make the offloading mechanism design become challenging. Therefore, in this article, we propose a dynamic optimization scheme for the IoT fog computing system with multiple mobile devices (MDs), where the radio and computational resources, and offloading decisions, can be dynamically coordinated and allocated with the variation of radio resources and computation demands. Specifically, with the objective to minimize the system cost related to latency, energy consumption, and weights of MDs, we propose a joint computation offloading and radio resource allocation algorithm based on Lyapunov optimization. Through minimizing the derived upper bound of the Lyapunov drift-plus-penalty function, we divide the main problem into several subproblems at each time slot and address them accordingly. Through performance evaluation, the effectiveness of the proposed scheme can be verified.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据