基于协作通信的最佳中继选择方案

协作通信中的机会中继是一种基于即时信道状态选择的中继选择算法,可以获得与传统协作分集技术相同的分集增益,而不需要使用复杂的空时编码技术。但是多个节点同时竞争最佳中继时,可能出现冲突而导致选择失败。提出一种新的方案,通过引入候选节点限制策略以及控制信道对算法进行改进,仿真表明,该算法特别适用于候选中继较多的情况,可以在实现快速选择节点的同时降低选择失败概率。     

中继选择方案的研究

已有研究结果表明,机会中继可以获得与更为复杂的空时编码协作通信相同的分集增益。文中提出一种改进的最好中继选择算法,通过CRC校验得到更好候选中继节点,并进行源节点确认来消除隐藏中继,并给出了源节点与目的节点不在通信范围内的通信方法。     

用于机会中继的一种最佳中继选择算法

通过使用具有最佳瞬时信道质量的单个中继进行协作分集,机会中继可以获得与更为复杂的空时编码协作通信相同的分集增益。但是,随着可选择中继节点数的增加,最佳中继选择的失败概率会明显上升。文章提出了一种新的实用最佳中继选择算法,要求源站向最佳中继发送选择确认消息,竞争中继则在冲突发生后进行退避。仿真结果表明,采用新算法可以将选择失败的概率降低2～3个数量级,而增加的开销尚不到2％。     

最优中继选择的子载波选择算法性能分析

将协作分集技术与正交频分复用(OFDM)技术相结合的协作通信系统,研究了一种OFDM协作通信最优中继选择算法和在此基础上与最优中继选择算法结合后子载波选择算法,并对它的性能进行详细分析.同时利用仿真分析了中继转发子载波信道容量和信噪比关系的协作通信性能,以及最优中继选择算法和基于最优中继选择算法的子载波选择算法的误码率.仿真结果显示,基于协作通信系统误码率性能得到了更大的提高.可见,协作分集技术与OFDM技术结合的协作通信系统大大提高了无线通信系统的性能,降低了误码率,增强了无线通信的鲁棒性.     

跨小区多跳中继协作通信的无线通信能效优化 *

针对蜂窝网中某一基站处于体眠状态时引起各用户的通信中断问题,提出利用中继协作通信实现跨小区多跳通信的迭代中继选择算法.该算法是在有多个中继节点可为目的节点提供协作中继时,将源节点到目的节点的数据传输分为3个连续时隙,选择满足目的节点信噪比最大化的中继,以协作效率为依据删除协作效率最小的中继节点,从而逐次优化中继选择结果.仿真结果表明,该算法在跨小区多跳的通信过程中,能选择出协作效率最高的中继节点,减少协作中继的数量,可以减少中继对能源不必要的消耗,改善小区内中继协作效率,在多跳的过程中节省源节点的发射功率,从而达到能效优化的目的.     

协作通信中一种改进的最佳中继选择算法

已有研究结果表明,机会中继可以获得与更为复杂的空时编码协作通信相同的分集增益。但是,随着可选中继节点数的增多,发生冲突从而导致选择失败的概率也明显变大。本文提出了一种改进的最佳中继选择算法,源站收到最佳中继发出的标志分组后发送选择确认消息,中继节点在冲突发生后进行退避。分析结果证明,采用新算法可以大大降低选择失败的概率,而增加的开销却很小。     

基于译码——转发的多中继协作节点选择方法

由于协作通信技术能够抵抗信道衰落的影响,提供分集增益,成为目前研究热点之一。针对传统多中继译码转发协作通信中,所有潜在中继均参与协作从而导致系统的低资源利用率问题,提出了一种基于信道容量增益的中继节点选择策略。仿真结果表明,该策略只需选择一半的中继节点数就能获得和最优中继选择方法非常相近的系统性能,同时降低了系统的功率损耗和实现复杂度。     

协作网络中基于中继选择的协作波束赋形算法

针对多中继网络中所有中继节点都参与协作的协作波束赋形方法,提出了一种基于选择的协作波束赋形算法。该方法将最小化系统中断概率作为目标,得到一个次优的中继节点选择门限,小于门限的中继节点被逐一剔除,从而保证了网络中的资源只分配给有用的中继节点,获得了分集增益。该选择方法需搜索次数和中继节点的个数相等,因此大幅降低了选择过程的复杂度。蒙特卡洛仿真表明,选择波束赋形算法可有效提高系统中断概率性能和网络能量效率。     

分布式环境中协作分集的移动中继动态选择和切换策略研究

在协作无线通信系统中,中继节点的移动会大大降低系统的性能,目前该方面的结果很少。本文探讨分布式环境中协作分集的移动中继选择算法,在放大转发（AF）协作通信模式下,给出了基于信道统计状态信息的功率分配和中继的动态选择策略。针对单中继情况提出了中继切换方案,针对多中继情况提出了动态剔除、补充中继的方案,并导出了分集增益及系统容量的计算公式。通过模拟仿真分析,该方案能有效的降低中断概率,提高系统分集增益,扩大系统容量,实现良好的整体性能。      

协作分集中中继选择算法的研究

协作分集是近几年无线通信技术的研究热点.在协作通信中合理地选择中继能给系统带来更大的增益.本文介绍了协作时机的选择和协作关系的形成,重点讨论了3种主要的中继选择方法:基于位置信息、基于平均接收信噪比和基于瞬时信道状态的中继选择算法,并对这些方法进行了分析和比较.     

Cooperative communications with relay selection for wireless networks: design issues and applications

Relay selection schemes for cooperative communications to achieve full cooperative diversity gains while maintaining spectral and energy efficiency have been extensively studied in a recent research. These schemes select only the best relay from multiple relaying candidates to cooperate with a communication link. In the present paper, we reviewed recently proposed cooperative communication protocols that integrate with relay selection mechanisms. The key design issues for relay selection mechanisms, for example, relaying candidate selection, optimal relay assignment, and cooperative transmission, were identified. We further discussed the challenges of optimal relay assignment in multi‐hop wireless sensor networks and presented the potential applications of cooperative communications with a relay selection in such networks. Future research directions were outlined, for example, the issues of service differentiation and system fairness in cooperative communication systems and the joint use of game theory and adaptive learning techniques in relaying candidate selection and optimal‐relay assignment mechanisms for efficient allocation of network resources. Copyright © 2011 John Wiley & Sons, Ltd.     

认知合作中继网络中的最优中继选择策略

认知合作中继通信可以有效提升无线通信网络的性能和频谱效率。在中继节点较多的情况下,最优中继选择是一个有待解决的问题,它是中继探测成本与合作通信的分集增益之间的一个折中。基于有限情形的最优停时理论给出了最优中继选择策略,进一步得到一个纯SNR（signal-to-noise ratio,信噪比）阈值结构的策略。数字仿真结果验证了其有效性,在待探测中继较多和每个中继探测成本较高情况下,该最优中继选择策略以最少的探测次数获得最大的收益增益。     

Predictive relay‐selection cooperative diversity in land mobile satellite systems

Cooperative diversity protocols promise a new dimension of diversity that provides better communication by engaging nearby relays in forming a ‘virtual’ array of antennas for combined signal transmission. The current incremental cooperative diversity algorithms incrementally select best relay(s) to cooperate based on the channel quality reported by the relays. However, the algorithms do not take into consideration the fact that the chosen best relay(s) at estimation may not always be the best at the time of communication. This is due to the time delay between the relay selection and its transmission of signal (problem of outdated channel quality information (CQI)). To solve this problem, the concept of channel prediction is introduced and employed whereby each relay determines a predicted value of its CQI based on its past measurements. The paper therefore develops a novel predictive relay‐selection (PRS) cooperative diversity model that seeks to improve land mobile satellite communication through prediction protocols. In the model, the chosen best relay is the one with the best predicted CQI value instead of the traditional outdated one. Performance analysis of outage probability and average bit error probability for the newly developed PRS cooperation shows that the PRS cooperation is better than direct and outdated CQI relay communication. Copyright © 2015 John Wiley & Sons, Ltd.     

A utility-based capacity optimization framework for achieving cooperative diversity in the hierarchical converged heterogeneous wireless networks

A hierarchical convergence mechanism for the heterogeneous wireless communication system via the heterogeneous cooperative relay node is presented in this paper, in which the techniques of cooperative communication and wireless relay are utilized to improve performances of the individual user and the overall converged networks. In order to evaluate the benefits of the proposal, a utility-based capacity optimization framework for achieving the heterogeneous cooperative diversity gain is proposed. The heterogeneous cooperative capacity, relay selection and power allocation theoretical models are derived individually. The joint optimization model for relay selection and power allocation is presented as well. Owing to the computation complexity, the sub-optimal cooperative relay selection algorithm, the sub-optimal power allocation algorithm and the sub-optimal joint algorithm are determined to approach the maximum overall networks' spectrum efficiency. These proposed algorithms are designed in conformance to guarantee the equivalent transmission rates of the different wireless access networks. The simulation results demonstrate that the utility-based capacity model is available for the heterogeneous cooperative wireless communication system, and the proposed algorithms can improve performances by achieving the cooperative gain and taking full advantage of the cross-layer design. Copyright © 2008 John Wiley & Sons, Ltd.     

一种基于非正交信道的分布式中继选择及功率分配方法

针对非正交两跳多中继协作通信系统中的分布式中继选择问题,提出了一种基于非正交信道的中继选择准则,简化了系统的设计。分析了其误码率性能,给出了其解析表达式和以总功率为约束条件下的最优功率分配方案。仿真结果表明,最佳中继选择准则明显优于传统的中继选择准则,且在最优功率分配方案下,可以获得明显的分集增益,系统的误码率显著下降。     

A Survey of Distributed Relay Selection Schemes in Cooperative Wireless Ad hoc Networks

Cooperative communication aims to achieve spatial diversity gain via the cooperation of user terminals in transmission without requiring multiple transceiver antennas on the same node. It employs one or more terminals as relays in the neighbourhood of the transmitter and the receiver, which collaborate in the transmission and serve as a virtual MIMO antenna array. Allowing cooperation in wireless communication engenders new problems related to resource allocation and relay selection. Optimal relay selection is vital for reaping the performance benefit of cooperative communication. It is a challenging task to share channel information in timely and distributed manner and at the same time make optimal selection of relay in a time varying radio environment. This paper presents a comprehensive survey of distributed relay selection schemes for cooperative communication that have been proposed in the literature. We discuss various classifications of relay selection schemes and describe their characteristics and functionality. We then present a qualitative comparison of their performance against a set of representative metrics. Finally, we discuss some of their shortcomings and suggest some research directions.     

Greedy Algorithm Applied to Relay Selection for Cooperative Communication Systems in Amplify-and-Forward Mode

Using a relaying system to provide spatial diversity and improve the system performance is a tendency in the wireless cooperative communications. Amplify-and-forward (AF) mode with a low complexity is easy to be implemented. Under the consideration of cooperative communication systems, the scenario includes one information source, M relay stations and N destinations. This work proposes a relay selection algorithm in the Raleigh fading channel. Based on the exhaustive search method, easily to realize, the optimal selection scheme can be found with a highly complicated calculation. In order to reduce the computational complexity, an approximate optimal solution with a greedy algorithm applied for the relay station selection is proposed. With different situations of the communication systems, the performance evaluation obtained by both the proposed algorithm and the exhaustive search algorithm are given for comparison. It shows the proposed algorithm could provide a solution approach to the optimal one.     

基于任一随机选择转接节点的协作分集方法及其中断概率分析

 转接节点的选择是协作通信中的一个比较重要的问题.在许多实际情况中并不是所有节点都参与转接,本文研究了在所有潜在的转接节点中任选一个节点作为转接节点的协作分集方法,推导了这种协作分集方法中断概率的上界和下界.理论计算和仿真结果表明该协作分集的 中断概率的上界基本不随潜在的转接节点的数目的增加而变化,而下界却随潜在的转接节点的数目的增加而显著降低.     

基于深度强化学习的协作通信中继选择

协作通信是无线传感器网络(Wireless Sensor Network,WSN)实现数据可靠传输的关键技术,而协作通信技术的关键在于中继方案的选择。为此,提出了一种基于深度强化学习的协作通信中继选择算法(Deep Q-Learning Based Relay Selection Scheme,DQ-RSS)。首先,将WSN中具有中继选择的协作通信过程建模为马尔科夫决策过程,并采用Q学习在未知网络模型的情况下获取最佳中继选择策略;其次,针对高维状态空间下Q学习收敛时间长的问题,采用DQN(Deep-Q-Net)算法来加速Q学习的收敛。对比仿真实验结果表明,DQ-RSS在中断概率、系统容量和能耗方面均优于现有的中继选择方案,且能够有效节省收敛时间。     

Performance analysis of opportunistic nonregenerative relaying

Opportunistic relaying in cooperative communication depends on careful relay selection. However, the traditional centralized method used for opportunistic amplify‐and‐forward protocols requires precise measurements of channel state information at the destination. In this paper, we adopt the max–min criterion as a relay selection framework for opportunistic amplify‐and‐forward cooperative communications, which was exhaustively used for the decode‐and‐forward protocol, and offer an accurate performance analysis based on exact statistics of the local signal‐to‐noise ratios of the best relay. Furthermore, we evaluate the asymptotical performance and deduce the diversity order of our proposed scheme. Finally, we validate our analysis by showing that performance simulation results coincide with our analytical results over Rayleigh fading channels, and we compare the max–min relay selection with their centralized channel state information‐based and partial relay selection counterparts. Copyright © 2013 John Wiley & Sons, Ltd.