2013Signal Processing: Algorithms, Architectures, Arrangements, and ApplicationsRequires access

Relay selection algorithm for wireless cooperative network

Ahmed El‐Mahdy, Nada Tarek

Open publisher page 4 citations

Abstract

Spatial diversity is one of the most efficient techniques used to overcome fading in wireless systems which can be accomplished by cooperative communication. Cooperative communication describes strategies to transfer data from the source to the destination by employing relay nodes between them. In this paper a relay selection algorithm is proposed where one relay is chosen based on instantaneous signal to noise ratio (ISNR) either between the source and relay or the relay and the destination. The performance of the algorithm is evaluated for perfect and estimated channel and for both decode-and-forward (DF) and amplify and forward (AF) protocols. The performance of the algorithm is compared with other existing methods for relay selection. Numerical results show that the proposed algorithm has better performance than some of the previous algorithms.

About this research paper

What this paper is about

Spatial diversity is one of the most efficient techniques used to overcome fading in wireless systems which can be accomplished by cooperative communication. Cooperative communication describes strategies to transfer data from the source to the destination by employing relay nodes between them. In this paper a relay selection algorithm is proposed where one relay is chosen based on instantaneous signal to noise ratio (ISNR) either between the source and relay or the relay and the destination. The performance of the algorithm is evaluated for perfect and estimated channel and for both decode-and-forward (DF) and amplify and forward (AF) protocols. The performance of the algorithm is compared with other existing methods for relay selection. Numerical results show that the proposed algorithm has better performance than some of the previous algorithms.

Why it matters

OpenAlex reports 4 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Spatial diversity is one of the most efficient techniques used to overcome fading in wireless systems which can be accomplished by cooperative communication. Cooperative communication describes strategies to transfer data from the source to the destination by employing relay nodes between them. In this paper a relay selection algorithm is proposed where one relay is chosen based on instantaneous signal to noise ratio (ISNR) either between the source and relay or the relay and the destination. The performance of the algorithm is evaluated for perfect and estimated channel and for both decode-and-forward (DF) and amplify and forward (AF) protocols. The performance of the algorithm is compared with other existing methods for relay selection. Numerical results show that the proposed algorithm has better performance than some of the previous algorithms.

Key concepts: Relay, Computer science, Fading, Relay channel, Selection algorithm, Selection (genetic algorithm), Algorithm, Cooperative diversity

Related papers

Back to paper searchBrowse research topicsOriginal source
Relay selection algorithm for wireless cooperative network — Research Paper | ScholarLens