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, the authors analyze a splitting algorithm for selecting the single best relay amongst a known number of active nodes in a cooperative network. They develop new and exact asymptotic analysis for computer the average number of slots required to resolve the best relay.