Max-min relay selection in bidirectional cooperative networks with imperfect channel estimation

被引:5
|
作者
Taghiyar, M. J. [1 ]
Muhaidat, S. [1 ]
Liang, J. [1 ]
机构
[1] Simon Fraser Univ, Sch Engn Sci, Burnaby, BC V5A 1S6, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
PERFORMANCE ANALYSIS; EFFICIENT PROTOCOLS; DIVERSITY;
D O I
10.1049/iet-com.2011.0572
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The authors study the performance of wireless bidirectional relay-assisted networks in the presence of imperfect channel state information, where two end-source terminals S-1 and S-2 communicate with the assistance of M relay terminals R-j's. The max-min relay selection criterion is used to select the best relay that maximises the minimum signal-to-noise ratio of the links S-1 -> R-j -> S-2 and S-2 -> R-j -> S-1 over all relay terminals. The authors investigate the impact of imperfect channel estimation on the outage probability P-out of the system by means of the correlation coefficient rho(Si) of the estimated channel gains and their actual values. Furthermore, the authors show that in a bidirectional relay-assisted network neither of the links S-1 -> R-j -> S-2 and S-2 -> R-j -> S-1 dominates the performance of the system. Instead, the performance is determined by the average performance of the two links, based on that the authors then discuss the power allocation in such networks. The authors demonstrate that in order to minimise P-out of the entire system, increasing the transmission power of the link with better estimation cannot compensate for the effect of the worse link and therefore the optimum power allocation with the least complexity is to transmit at each source terminals S-1 and S-2 with equal powers. Numerical results are also presented to corroborate the analytical expressions.
引用
收藏
页码:2497 / 2502
页数:6
相关论文
共 50 条
  • [1] Relay Selection for Multi-Channel Cooperative Multicast: Lexicographic Max-Min Optimization
    Wang, Yitu
    Wang, Wei
    Chen, Lin
    Zhou, Pan
    Zhang, Zhaoyang
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2018, 66 (03) : 959 - 971
  • [2] Relay Assignment for Max-Min Capacity in Cooperative Wireless Networks
    Pham, Tung T.
    Nguyen, Ha H.
    Tuan, Hoang D.
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2012, 61 (05) : 2387 - 2394
  • [3] Relay Selection with Imperfect CSI in Bidirectional Cooperative Networks
    Taghiyar, M. Jafar
    Muhaidat, Sami
    Liang, Jie
    Dianati, Mehrdad
    IEEE COMMUNICATIONS LETTERS, 2012, 16 (01) : 57 - 59
  • [4] Using Moment Generating Function for Performance Analysis in Non-Regenerative Cooperative Relay Networks with Max-Min Relay Selection
    Asshad, Muhammad
    Kavak, Adnan
    Kucuk, Kerem
    Khan, Sajjad Ahmad
    AEU-INTERNATIONAL JOURNAL OF ELECTRONICS AND COMMUNICATIONS, 2020, 116
  • [5] BER Analysis of NOMA with Max-Min Relay Selection
    Shen, Meng
    Huang, Zihao
    Lei, Xianfu
    Fan, Lisheng
    CHINA COMMUNICATIONS, 2021, 18 (07) : 172 - 182
  • [6] BER Analysis of NOMA with Max-Min Relay Selection
    Meng Shen
    Zihao Huang
    Xianfu Lei
    Lisheng Fan
    China Communications, 2021, 18 (07) : 172 - 182
  • [7] Joint Optimization of Relay Selection and Power Allocation in Cooperative OFDM Networks with Imperfect Channel Estimation
    Tran, Phuong T.
    Lehnert, James S.
    2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2012,
  • [8] Power Allocation and Relay Selection for AF Cooperative Relay Systems With Imperfect Channel Estimation
    Wang, Chin-Liang
    Chen, Jyun-Yu
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (09) : 7809 - 7813
  • [9] Max-Min Lifetime Optimization for Cooperative Communications in Multi-Channel Wireless Networks
    Li, Peng
    Guo, Song
    Cheng, Zixue
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2014, 25 (06) : 1533 - 1542
  • [10] Power Allocation with Max-Min and Min-Max Fairness for Cognitive Radio Networks with Imperfect CSI
    Tang Lun
    Yan Jing-lin
    Li Qing
    Chen Qian-bin
    Wang Huan
    WIRELESS PERSONAL COMMUNICATIONS, 2012, 65 (03) : 671 - 687