Fundamentals of wireless communication
Fundamentals of wireless communication
Fast multiple access selection through variable power transmissions
IEEE Transactions on Wireless Communications
On the study of network coding with diversity
IEEE Transactions on Wireless Communications
Relay selection and data transmission throughput tradeoff in cooperative systems
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Cooperative wireless communications: a cross-layer approach
IEEE Wireless Communications
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
Bidirectional regenerative half-duplex relaying using relay selection
IEEE Transactions on Wireless Communications - Part 2
Energy-Efficient Cooperative Relaying over Fading Channels with Simple Relay Selection
IEEE Transactions on Wireless Communications
A simple Cooperative diversity method based on network path selection
IEEE Journal on Selected Areas in Communications
Optimal timer based selection schemes
IEEE Transactions on Communications
The relay selection and transmission trade-off in cooperative communication systems
IEEE Transactions on Wireless Communications
Voluntary energy harvesting relays and selection in cooperative wireless networks
IEEE Transactions on Wireless Communications
Hi-index | 0.01 |
Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new 'contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q ≥ 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.