一种改进的协同中继节点选择算法  

Improved algorithm of cooperative relay nodes selection

作　　者：闻鹏举[1] 易辉跃 赵晓群[1] 徐尚志[1] 

机构地区：[1]同济大学电子与信息工程学院,上海200092 [2]上海无线通信研究中心,上海200050

出　　处：《计算机应用研究》2008年第12期3816-3818,共3页Application Research of Computers

基　　金：上海市科委无线通信系统中移动接力站关键技术与标准研究资助项目(07DZ05018);上海市重大科研攻关资助项目(07dz15006);上海市科委重点科技攻关计划资助项目(06dz15013)

摘　　要：机会主义中继选择算法(ORS)基于瞬时信道质量选择一个最优中继节点帮助源节点进行协同通信,可以取得与其他复杂协议相同的分集阶次;但该算法存在碰撞问题,其采取的退避机制会增加网络延时。为此,提出一种碰撞时的改进处理方法,可以避免延时,提高网络容量。仿真结果表明,与原方法相比,该方法在保证BER性能时可有效地提高吞吐量。Opportunistic relay selection （0RS） algorithm could achieve the same cooperative-multiplexing tradeoff as other more complex protocols by selecting a best relay based on the instantaneous channel conditions. However, it suffered from a problem of delay when collision happened during the selection. This paper proposed an improved method instead of the original back-off scheme after the collision, which increased the whole network throughput by avoiding delay. Simulations demonstrate that the new method can achieve the same BER performance while enhancing the throughput effectively.

关 键 词：中继 碰撞 协同 分集 

分 类 号：TP393.03[自动化与计算机技术—计算机应用技术]