2013Unpublished venueRequires access

Downlink Relay Selection Algorithm for Amplify-and-Forward Cooperative Communication Systems

Cheng‐Ying Yang, Yi-Shan Lin, Min‐Shiang Hwang

Open publisher page 5 citations

Abstract

In wireless networks, the cooperative relaying that provides a spatial diversity and improves the performance of system is a tendency in the future communications. There are three strategies in the cooperative communications. One is Amplify-and-Forward (AF) mode. Another is Decode-and-Forward (DF) mode and the other is Compress and Forward (CF) mode. Comparing with these three kind modes, AF mode is with the low complexity to implement. Consider the Raleigh fading environment where there are one information source, M relay stations and N destinations. The downlink signal includes two parts. One is from the source and the other comes from the relay stations. In order to achieve the maximum throughput in the system, it should obtain the maximum mutual information between the source and the destination. Hence, how to select an optimal relay station is important in the cooperative communications. This project proposes a relay selection algorithm with Amplify-and-Forward mode employed. The optimal selection scheme is based on the exhaustive search method. It is easy to be realized with a high computational complexity. In order to reduce the computational complexity, the relay station selection scheme with a maximum mutual information finding is proposed. With different relay station selection schemes, the performances are given for comparison.

About this research paper

What this paper is about

In wireless networks, the cooperative relaying that provides a spatial diversity and improves the performance of system is a tendency in the future communications. There are three strategies in the cooperative communications. One is Amplify-and-Forward (AF) mode. Another is Decode-and-Forward (DF) mode and the other is Compress and Forward (CF) mode. Comparing with these three kind modes, AF mode is with the low complexity to implement. Consider the Raleigh fading environment where there are one information source, M relay stations and N destinations. The downlink signal includes two parts. One is from the source and the other comes from the relay stations. In order to achieve the maximum throughput in the system, it should obtain the maximum mutual information between the source and the destination. Hence, how to select an optimal relay station is important in the cooperative communications. This project proposes a relay selection algorithm with Amplify-and-Forward mode employed. The optimal selection scheme is based on the exhaustive search method. It is easy to be realized with a high computational complexity. In order to reduce the computational complexity, the relay station selection scheme with a maximum mutual information finding is proposed. With different relay station selection schemes, the performances are given for comparison.

Why it matters

OpenAlex reports 5 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

In wireless networks, the cooperative relaying that provides a spatial diversity and improves the performance of system is a tendency in the future communications. There are three strategies in the cooperative communications. One is Amplify-and-Forward (AF) mode. Another is Decode-and-Forward (DF) mode and the other is Compress and Forward (CF) mode. Comparing with these three kind modes, AF mode is with the low complexity to implement. Consider the Raleigh fading environment where there are one information source, M relay stations and N destinations. The downlink signal includes two parts. One is from the source and the other comes from the relay stations. In order to achieve the maximum throughput in the system, it should obtain the maximum mutual information between the source and the destination. Hence, how to select an optimal relay station is important in the cooperative communications. This project proposes a relay selection algorithm with Amplify-and-Forward mode employed. The optimal selection scheme is based on the exhaustive search method. It is easy to be realized with a high computational complexity. In order to reduce the computational complexity, the relay station selection scheme with a maximum mutual information finding is proposed. With different relay station selection schemes, the performances are given for comparison.

Key concepts: Relay, Telecommunications link, Computer science, Selection (genetic algorithm), Computational complexity theory, Fading, Mode (computer interface), Throughput

Related papers

Back to paper searchBrowse research topicsOriginal source
Downlink Relay Selection Algorithm for Amplify-and-Forward Cooperative Communication Systems — Research Paper | ScholarLens