Selection Cooperation in Multi-Source Cooperative Networks
IEEE Transactions on Wireless Communications
PHY-layer Fairness in Amplify and Forward Cooperative Diversity Systems
IEEE Transactions on Wireless Communications
Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection
IEEE Transactions on Wireless Communications
Cooperative communication in wireless networks
IEEE Communications Magazine
Practical relay networks: a generalization of hybrid-ARQ
IEEE Journal on Selected Areas in Communications
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Relay selection and data transmission throughput tradeoff in cooperative systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Optimal timer based selection schemes
IEEE Transactions on Communications
| Hi-index | 0.00 |
Relay selection for cooperative communications has attracted considerable research interest recently. While several criteria have been proposed for selecting one or more relays and analyzed, mechanisms that perform the selection in a distributed manner have received relatively less attention. In this paper, we analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. We develop new and exact asymptotic analysis for computing the average number of slots required to resolve the best relay. We then propose and analyze a new algorithm that addresses the general problem of selecting the best Q ≥ 1 relays. Regardless of the number of relays, the algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. Our analysis also brings out an intimate relationship between multiple access selection and multiple access control algorithms.