Abstract

In this paper, we consider the joint relay selection and power allocation problem for two-way relay systems with multiple relay nodes. Traditionally, relay selection schemes are primarily focused on selecting one relay node to maximize the transmission sum rate or minimize the outage probability. If so, it is possible to cause certain relay nodes overloaded. In addition, the joint relay selection and power allocation problem is a mixed integer program problem and prohibitive in terms of complexity. Therefore, we propose a novel low complexity joint relay selection and power allocation algorithm with proportional fair scheduling to get the load-balancing among potential relays. Simulation results turn out that, compared with round-robin schemes and max sum rate schemes, the proposed algorithm can achieve the tradeoff between system transmission sum rate and load-balancing.

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.