Abstract
This letter investigates the spectrum efficient resource management problem (SERMP) for non-orthogonal multiple access-based uplink networks. Specifically, we take the decoding threshold of successive interference cancellation into account and formulate the SERMP as a sum-rate maximization problem by jointly considering the user pairing, channel assignment, and power control. For tackling this hard problem, we first analytically get the optimal transmit power for each user pair with given channel assignments. Afterward, we tactfully transform the primal problem into a maximum weighted independent set issue in graph theory, based on which we devise a low-complexity resource allocation algorithm. Finally, simulation results exhibit the performance improvement of our algorithm against other schemes in terms of data rate and number of supported users.
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 callDisclaimer: 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.
