Abstract
In this paper, we investigate the downlink resource allocation problem for the user-centric ultra-dense networks (UUDN) which can provide high area throughput density. UUDN can effectively improve the user experience since one user can be served by more than one access points (APs) simultaneously. However, the ultra-dense node deployment will also result in serious co-channel interference which will degrade the performance of the networks. Nonorthogonal multiple access (NOMA) is introduced to reduce the interference caused by the network densification. We consider the resource allocation for both the wireless backhaul downlink and the user access downlink at the same time in UUDN with NOMA, which involves the APs grouping and power allocation. The resource allocation problem is formulated as a mixed integer nonconvex optimization problem due to the combinatorial nature of APs grouping. We first decompose the problem into the APs grouping subproblem and power allocation subproblem to reduce the computational complexity. For the APs grouping subproblem, we model it as a bipartite graph maximum weight matching problem, and the Hungarian algorithm is used to solve it. When the APs grouping is fixed, the original problem is still difficult to tackle since the power allocation is a max-min optimization problem. The KKT conditions are applied to optimize the power allocation subproblem. Simulation results illustrate that the proposed resource allocation algorithm can effectively improve the system throughput of UUDN.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.