A Simple Distributed Method for Relay Selection in Cooperative Diversity Wireless Networks, based on Reciprocity and Channel Measurements

TLDR

The paper proposes a simple distributed method to select the best end‑to‑end path among multiple relays in a cooperative diversity wireless network. The method operates without explicit relay coordination, relying solely on instantaneous channel measurements and reciprocity, and includes a framework to evaluate performance under arbitrary channel statistics. The results show that cooperative diversity benefits grow with the number of relays, while the method reduces the need for complex space‑time coding and coordination.

Abstract

We propose a simple distributed method to find out the "best" end-to-end path between source and destination, among M possible relays. The method requires no explicit communication among the relays, assumes no prior knowledge of network geometry and is based on instantaneous wireless channel measurements and reciprocity. The success (or failure) to select the "best" available path, depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Benefits of cooperative diversity are increased with increased number of cooperating relays, even though a single relay transmits. The method simplifies required space-time coding and coordination among the cooperating terminals.