Abstract
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 uplink 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 (USP) 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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: IEEE Journal of Selected Topics in Signal Processing
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
