Abstract
In this letter, we study the maximum access problem (MAP) for uplink networks with non-orthogonal multiple access technique. Specifically, the MAP is formulated as a mixed integer programming problem with admission control, user clustering, channel assignment, and power control taken into account. To deal with this challenging problem, we first recast it as the maximum independent set (MIS) problem in graph theory. Then, we propose an efficient algorithm to solve this MIS problem in a low complexity manner. Finally, simulation results indicate that our algorithm can greatly improve the number of supported users compared to other schemes. The performance of our algorithm under different channel conditions and non-uniform distributions of users is also investigated.
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.
