Elements of information theory
Elements of information theory
Algorithm Design
End-to-end performance of transmission systems with relays over Rayleigh-fading channels
IEEE Transactions on Wireless Communications
Symbol error probabilities for general Cooperative links
IEEE Transactions on Wireless Communications
Improving amplify-and-forward relay networks: optimal power allocation versus selection
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
Cooperative Strategies and Capacity Theorems for Relay Networks
IEEE Transactions on Information Theory
Fading relay channels: performance limits and space-time signal design
IEEE Journal on Selected Areas in Communications
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Although several cooperative diversity strategies have been proposed for simple 2-hop multiple-relay networks, practical and efficient strategies that guarantee maximum diversity order for arbitrary, multi-hop amplify-and-forward relay networks are not yet available. In this paper, the maximum achievable diversity order for a given connectivity is shown to be determined by the number of links on the minimum cut set, and achieved by a selection strategy which maximizes end-to-end SNR. The optimal selection requires the channel information of all the links and serves as a performance bound. A sub-optimal selection method is then proposed to achieve full diversity in a distributed and low-complexity manner. The performance loss of the sub-optimal selection is shown to be small by both theoretic analysis and simulations.