TY - JOUR
T1 - Online Task Scheduling and Resource Allocation for Intelligent NOMA-Based Industrial Internet of Things
AU - Wang, Kunlun
AU - Zhou, Yong
AU - Liu, Zening
AU - Shao, Ziyu
AU - Luo, Xiliang
AU - Yang, Yang
N1 - Publisher Copyright:
© 1983-2012 IEEE.
PY - 2020/5
Y1 - 2020/5
N2 - Fog computing (FC) has the potential to process computation-intensive tasks in Industrial Internet of Things (IIoT) systems. In parallel with the development of FC, non-orthogonal multiple access (NOMA) has been recognized as a promising technique to significantly improve the spectrum efficiency. In this paper, a NOMA-based FC framework for IIoT systems is considered, where multiple task nodes offload their tasks via NOMA to multiple nearby helper nodes for execution. We formulate a joint task scheduling and subcarrier allocation problem, with an objective to minimize the total cost in terms of the delay and energy consumption, while taking into account the practical communication and computation constraints. Note that the task scheduling includes task, computation resource, and power allocations. Since the task and subcarrier allocations involve binary variables, it is challenging to obtain an optimal solution for such a combinatorial problem. To this end, we solve the task scheduling and subcarrier allocation problem in an online learning fashion. During the online learning process, we propose an iterative algorithm to jointly optimize the subcarrier allocation and task scheduling in each time episode. Simulation results show that the proposed scheme can significantly reduce the sum cost compared to the baseline schemes.
AB - Fog computing (FC) has the potential to process computation-intensive tasks in Industrial Internet of Things (IIoT) systems. In parallel with the development of FC, non-orthogonal multiple access (NOMA) has been recognized as a promising technique to significantly improve the spectrum efficiency. In this paper, a NOMA-based FC framework for IIoT systems is considered, where multiple task nodes offload their tasks via NOMA to multiple nearby helper nodes for execution. We formulate a joint task scheduling and subcarrier allocation problem, with an objective to minimize the total cost in terms of the delay and energy consumption, while taking into account the practical communication and computation constraints. Note that the task scheduling includes task, computation resource, and power allocations. Since the task and subcarrier allocations involve binary variables, it is challenging to obtain an optimal solution for such a combinatorial problem. To this end, we solve the task scheduling and subcarrier allocation problem in an online learning fashion. During the online learning process, we propose an iterative algorithm to jointly optimize the subcarrier allocation and task scheduling in each time episode. Simulation results show that the proposed scheme can significantly reduce the sum cost compared to the baseline schemes.
KW - Fog computing
KW - delay-energy tradeoff
KW - industrial Internet of Things
KW - non-orthogonal multiple access
KW - online learning
UR - https://www.scopus.com/pages/publications/85084918133
U2 - 10.1109/JSAC.2020.2980908
DO - 10.1109/JSAC.2020.2980908
M3 - 文章
AN - SCOPUS:85084918133
SN - 0733-8716
VL - 38
SP - 803
EP - 815
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 5
M1 - 9036885
ER -