By Topic

Single and multiple relay selection schemes and their achievable diversity orders

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yindi Jing ; Department of Electrical and Computer Engineering, University of Alberta, Edmonton, T6G 2V4 Canada ; Hamid Jafarkhani

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.

Published in:

IEEE Transactions on Wireless Communications  (Volume:8 ,  Issue: 3 )