期刊
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING
卷 13, 期 3, 页码 553-566出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/JSTSP.2019.2898643
关键词
Graph theory; internet of things; non-orthogonal multiple access; resource management
资金
- China Postdoctoral Science Foundation [BX20180262, 2018M641019]
- National Natural Science Foundation of China [61571370, 61601365]
- Fundamental Research Funds for the Central Universities [3102017OQD091]
- Civil Aircraft Major Project of China [MIZ-2015-F-009]
Non-Orthogonal Multiple Access (NOMA) provides potential solutions for the stringent requirements of the Internet of Things (IoT) on low latency and high reliability. In this paper, we jointly consider user scheduling and power control to investigate the access delay minimization problem (ADMP) for the up-link NOMA networks with massive IoT devices. Specifically, the ADMP is formulated as a mixed-integer and non-convex programming problem with the objective to minimize the maximum access delay of all devices under individual data transmission demand. We prove that the ADMP is NP-hard. To tackle this hard problem, we divide it into two subproblems, i.e., the user scheduling subproblem (LISP) and the power control subproblem (PCP), and then propose an efficient algorithm to solve them in an iterative manner. In particular, the USP is recast as a K-CUT problem and solved by a graph-based method. For the PCP, we devise an iterative algorithm to solve it optimally leveraging the standard interference function. Simulation results indicate that our algorithm has good convergence and can significantly reduce the access delay in comparison with other schemes.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据