DocumentCode :
1192742
Title :
Single and multiple relay selection schemes and their achievable diversity orders
Author :
Jing, Yindi ; Jafarkhani, Hamid
Author_Institution :
Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, AB
Volume :
8
Issue :
3
fYear :
2009
fDate :
3/1/2009 12:00:00 AM
Firstpage :
1414
Lastpage :
1423
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.
Keywords :
computational complexity; diversity reception; radio networks; SNR-optimal multiple relay selection scheme; SNR-suboptimal multiple relay selection schemes; complexity reduction; diversity orders; feedback bits; single-relay selection schemes; wireless relay networks; Array signal processing; Decoding; Digital relays; Fading; Feedback; Mobile communication; Performance analysis; Power control; Telecommunication network reliability; Wireless networks; Wireless relay networks; cooperative diversity; relay selection;
fLanguage :
English
Journal_Title :
Wireless Communications, IEEE Transactions on
Publisher :
ieee
ISSN :
1536-1276
Type :
jour
DOI :
10.1109/TWC.2008.080109
Filename :
4801494
Link To Document :
بازگشت