Abstract
A low-complexity optimization scheme is proposed to balance the tradeoff between system capacity and proportional fairness in orthogonal frequency division multiple access (OFDMA) based multicast systems. The major challenge is to solve the non-convexity optimization problem with strict proportional fairness. Constrained team progress algorithm (CTPA) solves this non-convexity problem by allocating sub-channels to each group based on sub-channel gains and proportional fairness constraint. Mapping power algorithm (MPA) guarantees strict proportional fairness with efficient power allocation which utilizes the mapping relation between power and throughput. CTPA-MPA is analyzed in three aspects: complexity, fairness and efficiency. We numerically show that when the system capacity is slightly increased in lower power region compared with several previous approaches, CTPA-MPA improves the proportional fairness in a typical scenario with 4 groups over 16 sub-channels, while reducing the complexity from exponential to linear in the number of sub-channels. It is also proved available in a more complicated system.
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.
