Abstract
We consider a system with a single base station communicating with multiple users over orthogonal channels while being assisted by multiple relays. Several recent works have suggested that selection, i.e., a single relay helping the source, is the best option in terms of the resulting complexity and overhead. However, in a multiuser setting, optimal relay assignment is a combinatorial problem. In this paper, using the sum rate as our design metric, we develop a convex optimization problem that provides an extremely tight upper bound on performance. We also provide a heuristic to find a close-to-optimal relay assignment. Simulation results using realistic channel models demonstrate the efficacy of the proposed scheme.
Sign-in/Register to access full text options 
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.
