Single and multiple relay selection schemes and their achievable diversity orders

  • Authors:

  • Yindi Jing;Hamid Jafarkhani

  • Affiliations:

  • Department of Electrical and Computer Engineering, University of Alberta, Edmonton, AB, Canada;Department of Electrical and Computer Engineering, University of California, Irvine, Irvine, CA

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

Quantified Score

Hi-index 0.07

Visualization

Abstract

This paper is on relay selection schemes for wireless relay networks. First, we derive the diversity of many single-relay selection schemes in the literature. Then, we generalize the idea of relay selection by allowing more than one relay to cooperate. The SNR-optimal multiple relay selection scheme can be achieved by exhaustive search, whose complexity increases exponentially in the network size. To reduce the complexity, several SNR-suboptimal multiple relay selection schemes are proposed, whose complexity is linear in the number of relays. They are proved to achieve full diversity. Simulation shows that they perform much better than the corresponding single relay selection methods and very close to the SNR-optimal multiple relay selection scheme. In addition, for large networks, these multiple relay selection schemes require the same amount of feedback bits from the receiver as single relay selection schemes.