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

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.

On-Demand Decode and Forward Cooperative MAC for VoIP in Wireless Mesh Networks

“…Our goal is to reduce the transmission overhead, which is in contrast to the protocols described in the literature [11] [13] [18], which rely on exchanging control messages with the relaying nodes. We will demonstrate that our protocol effectively re-routes the packets without having to notify the network layer, should a momentary link failure occur due to excessive interference or deep channel fading, for example.…”

“…We show that our system provides improved scalability at a lower cost of transmit energy per information bit compared to a baseline system employing 802.11g protocols. In contrast to similar 'score'-based relay selection schemes, such as those of [18] [19], our system is entirely distributed and does not rely on the exchange of control messages, thereby reducing the overhead imposed. Furthermore, in contrast to [20], we introduce cooperative forwarding, and consider a more realistic WMN scenario, consisting of randomly, rather than arbitrarily, distributed mobile nodes.…”

Auction-Based Resource Allocation for Cooperative Communications

“…Related work in this area can be divided into two categories: centralized (e.g., [6], [7]) and distributed (e.g., [8]- [12]). For example, in [6], Nosratinia and Hunter proposed a centralized approach for grouping and partner selection to achieve maximal network-wide diversity.…”

“…In [7], Ng and Yu designed centralized resource allocation algorithm for power control, bandwidth allocation, relay selection and relay strategy choice in an Orthogonal Frequency-Division Multiple Access (OFDMA) based relay network. Bletsas et al in [8] proposed a distributed relay selection scheme, where one user chooses the "best" end-to-end path among many relays based on instantaneous channel measurements. In [9], Savazzi and Spagnolini considered distributed power control for a single user multiple hop transmission.…”

Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Buyer/Seller Game

“…In [6], the authors evaluated cooperative diversity performance when the best relay is chosen according to the average SNR, and the outage probability of relay selection based on the instantaneous SNR. In [7], the authors proposed a distributed relay selection scheme that requires limited network knowledge and is based on instantaneous SNRs. In [8], the relay assignment problem is solved for the multiuser cooperative communications.…”