Abstract
Efficient Branch-and-Bound (BnB) based radio resource allocation (RRA) algorithms are proposed for Orthogonal Frequency Division Multiple Access (OFDMA) system in this paper. Optimal RRA solution can be obtained by BnB based Algorithm 1 with easy implementation. Suboptimal RRA solution can be achieved by BnB based Algorithm 2 with a large computational complexity reduction. Tradeoff between throughput performance and computational complexity can be made by Algorithm 3. Simulation results support our general analysis of the algorithms, and the tradeoff between performance losing and complexity reduction achieved by Algorithm 3.
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.
