Relay ordering in a multi-hop cooperative diversity network

  • Authors:
  • Zhihang Yi;Il-Min Kim

  • Affiliations:
  • Department of Electrical and Computer Engineering, Queen's University, Kingston, ON, Canada;Department of Electrical and Computer Engineering, Queen's University, Kingston, ON, Canada

  • Venue:
  • IEEE Transactions on Communications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we first propose an optimum relay ordering algorithm for the multi-branch multi-hop cooperative diversity networks. This optimum algorithm has a high complexity that makes it hard to implement. Therefore, a suboptimum relay ordering algorithm, which considerably reduces the complexity, is then developed. Furthermore, for a cooperative network with two relays, we analytically evaluate the performance of the suboptimum algorithm by using an approximate end-to-end signal-to-noise ratio expression. Specifically, an approximate probability of wrong selection and an approximate expression of the symbol error rate are derived. The analysis and the numerical results demonstrate that the suboptimum algorithm performs very well as the optimum one at a much lower complexity.