计算机工程与应用 ›› 2014, Vol. 50 ›› Issue (7): 221-224.

• 信号处理 • 上一篇    下一篇

SR门限中继选择算法研究

陈  勤,芮贤义   

  1. 苏州大学 电子信息学院,江苏 苏州 215021
  • 出版日期:2014-04-01 发布日期:2014-04-25

Research of threshold relay selection algorithm based on source to relay channel information

CHEN Qin, RUI Xianyi   

  1. School of Electronic Information, Soochow University, Suzhou, Jiangsu 215021, China
  • Online:2014-04-01 Published:2014-04-25

摘要: 中继选择是协作通信领域的关键问题,尤其对于电池供电能量有限的无线移动设备。与基于两跳瞬时信道信息的中继选择算法不同,介绍了一种基于源到中继信道信息的SR门限比较算法。该算法在中继节点设置合适的信噪比门限,将源和多个中继节点的信噪比与门限值比较,选择出最优中继进行传输。在该算法的基础上,理论分析了最优中继及目的节点处的输出信噪比,仿真结果表明该算法可以获得与基于两跳瞬时信道信息算法相近的性能。但由于中继只需考虑自身和源节点之间的瞬时信道状态,所以中继的功耗大大减小,算法的复杂性降低。

关键词: 协作通信, 中继选择, 译码转发, 门限比较, 功率分配

Abstract: Relay selection is a key problem in the field of cooperative communications, especially for mobile devices using battery to supply power. Different from the relay selection algorithm which is based on the instantaneous Channel State Information(CSI) of two hops, the proposed algorithm which is called threshold comparison algorithm is just based on the instantaneous CSI of the first hop. In this algorithm, a predetermined threshold is set at the relay node and is compared with the Signal-to-Noise Ratio(SNR) between source and relay node. The optimal relay is selected. This paper analyzes the output SNR at the suboptimal relay node theoretically. The simulation results show that the proposed algorithm can achieve similar performance compared with the former algorithm which is based on the instantaneous CSI of two hops. However, it simply considers the instantaneous CSI between the relay node and the source node, so the relay power consumption as well as the complexity of the algorithm is greatly reduced.

Key words: cooperative communications, relay selection, decode-and-forward, threshold comparison, power allocation