TY - JOUR
T1 - Task offloading in NOMA-based fog computing networks
T2 - 2019 IEEE Global Communications Conference, GLOBECOM 2019
AU - Wang, Kunlun
AU - Zhou, Yong
AU - Yang, Yang
AU - Yuan, Xiaojun
AU - Luo, Xiliang
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019
Y1 - 2019
N2 - Fog computing (FC) has the potential to enable computation-intensive applications for the next generation wireless networks. In parallel with the development of FC, nonorthogonal multiple access (NOMA) has been recognized as a promising solution to improve the spectrum efficiency. In this paper, a NOMA-based FC system is considered, where multiple task nodes perform task scheduling via NOMA to a helper node, the helper node with abundant computation resource is required to compute the computation task from the task nodes. We formulate a joint task scheduling, computational resource allocation, and power allocation problem with an objective to minimize the sum cost (i.e., delay and energy consumptions for all task nodes) realizing energy-delay tradeoff. It is challenging to obtain an optimal policy for such a combinatorial optimization problem. To this end, we propose an online learning-based optimization framework to tackle this problem. Simulation results show that the proposed scheme significantly reduces the sum cost compared to the baselines.
AB - Fog computing (FC) has the potential to enable computation-intensive applications for the next generation wireless networks. In parallel with the development of FC, nonorthogonal multiple access (NOMA) has been recognized as a promising solution to improve the spectrum efficiency. In this paper, a NOMA-based FC system is considered, where multiple task nodes perform task scheduling via NOMA to a helper node, the helper node with abundant computation resource is required to compute the computation task from the task nodes. We formulate a joint task scheduling, computational resource allocation, and power allocation problem with an objective to minimize the sum cost (i.e., delay and energy consumptions for all task nodes) realizing energy-delay tradeoff. It is challenging to obtain an optimal policy for such a combinatorial optimization problem. To this end, we propose an online learning-based optimization framework to tackle this problem. Simulation results show that the proposed scheme significantly reduces the sum cost compared to the baselines.
UR - https://www.scopus.com/pages/publications/85081965033
U2 - 10.1109/GLOBECOM38437.2019.9013841
DO - 10.1109/GLOBECOM38437.2019.9013841
M3 - 会议文章
AN - SCOPUS:85081965033
SN - 2334-0983
JO - Proceedings - IEEE Global Communications Conference, GLOBECOM
JF - Proceedings - IEEE Global Communications Conference, GLOBECOM
M1 - 9013841
Y2 - 9 December 2019 through 13 December 2019
ER -