一种双向多跳中继选择算法与信息交互模型

Multi-hop Relay Selection Algorithm and an Information Exchanging Model

在协同通信中,针对多跳中继通信传输网络,在单向传输模式的基础上,提出了一种双向通信模式下基于维特比算法的双向中继选择算法(BRSVA)。根据各传输中继节点间的瞬时信噪比,对维特比算法中的支路度量和路径度量进行重新定义,并且构建滑窗以限制内存,对通信网络进行研究分析,以当前跳滑窗内具有最大路径度量值的路径上第一簇中继作为该簇的最佳中继。随着滑窗向前推进,对整个中继网络每一簇进行最佳中继的选择,进而得出一条由最佳中继构成的最佳路径。最后在此路径上提出了一种新的混合型双向信息交互模型,实现通信双方的信息交互。为了验证该中继选择算法与该信息交互传输模型的效果,将其仿真结果与理想内存下的最优中继选择算法做对比,结果证明在有限的内存需求与复杂度下,该算法的中断性能可接近最优选择。

In cooperative communication,for multi-hop relay communication networks,a bidirectional relay selection based on Viterbi algorithm(BRSVA)is proposed based on unidirectional transmission model.Branch metrics and path metrics are redefined on the basis of the instantaneous SNR of each transmission relay node,and a sliding window to limit memory is constructed.The best relay is defined as the one of the first cluster on the path with the largest path metric in the current sliding window.As the sliding window slides,the best relay of each cluster in the entire network is selected,and the best path composed of the best relays is obtained.Finally,a new hybrid information exchanging model is proposed on the best path to achieve the exchange of information between the two sources.In order to verify the effectiveness of the relay selection algorithm and the information exchanging model,simulation results are compared with the optimal relay selection algorithm with unlimited memory.The results show that under the limited memory requirements and complexity,the outage performance of the proposed algorithm is close to the optimal selection.