Abstract

Full-duplex (FD) communication is promoted to double the spectral efficiency when compared with the half-duplex counterpart. In the context of cellular networks, however, FD communication exacerbates the aggregate uplink (UL) and downlink (DL) interference, which diminishes the foreseen FD gains. This paper considers a flexible duplex system, denoted by $\alpha $ -duplex system, wherein a fine-grained bandwidth control for each UL/DL channel pair in each base station (BS) is allowed, which also leads to partial spectrum overlap between the UL and DL channels. This paper addresses the resulting interference management problem by maximizing a network-wide rate-based utility function subject to UL/DL power constraints, so as to determine user-to-BS association, user-to-channel scheduling, the UL and DL transmit powers, and the fraction of spectrum overlap between UL and DL for every user, under the assumption that the number of available channels and users is equal. This paper solves such a non-convex mixed-integer optimization problem in an iterative way by decoupling the problem into several sub-problems. Particularly, the user-to-BS association problem is solved using a matching algorithm that is a generalization of the stable marriage problem. The scheduling problem is solved by an iterative Hungarian algorithm. The power and spectrum overlap problem is solved by successive convex approximation. The proposed iterative strategy guarantees an efficient one-to-one user to BS and channel assignment. It further provides optimized flexible duplexing and power allocation schemes for all transceivers. Simulations results show appreciable gains when comparing the proposed solution with different schemes from the literature.

Full Text
Paper version not known

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 call

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.