Analysis, Insights and Generalization of a Fast Decentralized Relay Selection Mechanism

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 computer 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. ICC 2009 This work may not be copied or rep...

• Type: Conference
• Year: 2009
• Where: ICC
• Authors: Virag Shah, Neelesh B. Mehta, Raymond Yim
• Keywords: Communications, Electric Research Laboratories, ICC 2009, Mitsubishi Electric Research, Multiple Access