Convex Optimization
Diversity through coded cooperation
IEEE Transactions on Wireless Communications
Improving amplify-and-forward relay networks: optimal power allocation versus selection
IEEE Transactions on Wireless Communications
Cooperative Communications with Outage-Optimal Opportunistic Relaying
IEEE Transactions on Wireless Communications
Selection Cooperation in Multi-Source Cooperative Networks
IEEE Transactions on Wireless Communications
Performance analysis of single relay selection in rayleigh fading
IEEE Transactions on Wireless Communications
Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks
IEEE Transactions on Information Theory
Cooperative diversity in wireless networks: Efficient protocols and outage behavior
IEEE Transactions on Information Theory
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
On the optimal number of relay stations in two-hop relay cooperative cellular networks
Proceedings of the 5th International Conference on Ubiquitous Information Management and Communication
| Hi-index | 0.00 |
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.