Abstract

This paper investigates relay selection and subcarrier allocation in cooperative OFDMA systems where users with best-effort (BE) service and rate-constrained (RC) service coexist. We formulate the problem as a binary integer linear programming to maximize the network data rate with quality-of-service (QoS) requirements. A greedy algorithm is proposed for the degradation problem of only BE users and a direct search algorithm for hybrid users is proposed to reduce the number of variables and the size of the constraint matrix. Simulation results demonstrate that the proposed algorithm significantly improves the computing speed and enhances the system total throughput.

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.