Optimal relay assignment for cooperative communications
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Network beamforming using relays with perfect channel information
IEEE Transactions on Information Theory
Relay technologies for WiMAX and LTE-advanced mobile systems
IEEE Communications Magazine
Joint power allocation and relay selection in cooperative networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Subcarrier selection and power allocation for amplify-and-forward relaying over OFDM links
IEEE Transactions on Wireless Communications
Relay selection and power allocation in cooperative cellular networks
IEEE Transactions on Wireless Communications
INFOCOM'10 Proceedings of the 29th conference on Information communications
IEEE Transactions on Signal Processing
Improving amplify-and-forward relay networks: optimal power allocation versus selection
IEEE Transactions on Wireless Communications
Selection Cooperation in Multi-Source Cooperative Networks
IEEE Transactions on Wireless Communications
Semi-Distributed User Relaying Algorithm for Amplify-and-Forward Wireless Relay Networks
IEEE Transactions on Wireless Communications
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Joint optimization of relay strategies and resource allocations in cooperative cellular networks
IEEE Journal on Selected Areas in Communications
WSR Maximized Resource Allocation in Multiple DF Relays Aided OFDMA Downlink Transmission
IEEE Transactions on Signal Processing
Hi-index | 0.00 |
We investigate the joint problem of power and subcarrier allocation with relay selection for a multi-user multi-relay cellular system with selective relaying. We first formulate the optimal problem using Boolean-convex optimization with the objective of improving the average network capacity while providing proportional rate fairness to all users. We show that except for very small network instances the model is computationally very complex to solve. Then, we present a sub-optimal model by decomposing the joint problem into two sub-problems. This model proves to be a simple one, however, the sub-optimal design of the first sub-problem restricts the model from achieving near optimal solutions. Therefore, to achieve near optimal solutions, we propose an iterative two step method where near-optimal solutions can be achieved by iterating between the two steps. Numerical results show that for smaller networks this two step iterative method obtains optimal solutions in much less time. We also show that a selective relaying technique always achieves better performance over the always relaying technique.