摘要
在多个信源、中继及目的端的环境中,研究了放大转发协作系统的中继选择策略与传输机制.为了求得最优解,在最优中继节点选择策略中使用了穷举算法,此方法计算复杂度会随着中继节点数目增加而大幅上升.在此基础上,提出了改进的中继节点选择策略,该策略先使系统的平均误码率最小,之后再使目的端中断容量最大化.仿真及分析结果表明,该策略除了能达到与最优算法类似的吞吐量之外,复杂度也大大降低.
In the case of multiple sources,relay and destination nodes,this paper have researched relay selection strategy and transport mechanism in amplify and forward cooperative system.In order to get the optimal solution,the method of exhaustion is used in the optimal relay selection strategy; the computational complexities of this method increase with the increase in the number of relay nodes significantly.On this basis,the improved relay node selection strategy is proposed,the strategy is to make the minimum average bit error rate of the system,and then the outage capacity of destination is maximized.Simulation and analysis show that:the strategy can achieve throughput similar to optimal algorithm,and complexity is also greatly reduced.
出处
《华中师范大学学报(自然科学版)》
CAS
北大核心
2014年第5期662-666,共5页
Journal of Central China Normal University:Natural Sciences
基金
天津工业大学科研启动基金(030372)
关键词
中继选择
放大转发
协作通信
复杂度
穷举法
relay selection
amplify and forward
collaborative communications
complexity
brute-force method