上海交通大学学报

上海交通大学学报（自然版） ›› 2011, Vol. 45 ›› Issue (03): 331-0335.

• 无线电电子学、电信技术 • 上一篇    下一篇

两跳无线网络中的中继调度算法

 张宇, 罗汉文, 周小林   

  1. （1.上海交通大学 电子信息与电气工程学院， 上海 200240；2.复旦大学 通信科学与工程系， 上海 200433）
  • 收稿日期:2010-03-13 出版日期:2011-03-30 发布日期:2011-03-30
  • 基金资助:

    国家自然科学基金资助项目（60802011）

A Relay Scheduling Algorithm in DualHop Wireless Networks

Zhang-Yu, LUO  Han-Wen, ZHOU  Xiao-Lin   

  1. (1.School of Electronic, Information and Electrical Engineering, Shanghai Jiaotong University，Shanghai 200240, China; 2.Department of Communication Science and Engineering, Fudan University，Shanghai 200433, China)
  • Received:2010-03-13 Online:2011-03-30 Published:2011-03-30

摘要： 针对两跳无线网络的中继调度问题，提出了一种基于信道容量最大化的中继节点迭代调度算法.该算法基于放大转发型中继协议，以目标节点进行联合译码时的瞬时容量最大化为准则而依次选取中继节点，直至中继数达到源节点发射天线数或信道容量不再增加.仿真结果表明，在不同的中继节点总数、源节点发射天线数以及前后向信道信噪比条件下，该算法比传统算法获得了较大的容量增益和多中继分集增益，更加接近于信息论意义上的容量上界.

关键词: 中继选择, 两跳网络, 放大转发, 遍历容量

Abstract: This paper proposed a relay node iterative scheduling algorithm based on the channel capacity maximization for dualhop wireless networks. Based on the amplifyandforward relay protocol, the proposed algorithm selects relay nodes iteratively according to the criterion which makes the instantaneous capacity maximal when the destination node performs the joint decoding. The selection process continues until the number of the selected relays is equal to the number of source transmitting antennas or the channel capacity does not increase anymore. The simulation results show that under different conditions including total number of relay nodes, number of source transmitting antennas and signal to noise ratios of the forward and backward channels, the algorithm can obtain greater capacity gains and multirelay diversity gains over conventional algorithms and can reach the upper bound of the informationtheoretic capacity more closely.

Key words: relay selection, dualhop network, amplifyandforward, ergodic capacity