中继选择方案的研究

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

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

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

基于信道统计特性的中继选择算法

该文提出了一种在非再生协作网络中,基于信道统计特性的最优中继选择方法。首先在等功率条件下,根据信道统计特性,定义一个等效信道增益的参数,该参数反映了中继节点在协作过程中两个阶段的信道特性。然后提出一种基于该参数的降序排列的中继选择方法。该方法在不同的信噪比范围内,选择不同的节点集合,使得系统的吞吐率中断概率最小。分析表明该选择方法的分集增益阶数能达到N+1,N为中继节点数目。仿真结果表明这种中继选择算法的中断概率性能优于其他算法。该方法进一步与功率分配相结合,构成了一种低复杂度的次优的中继选择方法。仿真结果表明这种次优算法能够取得和穷举算法相似的性能。     

协作通信系统的中继选择算法研究

协作通信作为一种新颖的无线通信技术,它的主要思想是通过中继节点参与协作传输,在目的端获得两个或者多个在空间上独立的信号样本,实现空间分集,获得分集增益.因此如何合理选择中继节点成为协作通信的关键问题之一.本文在协作通信模型及原理的基础上,对基于信道状态信息的中继选择算法进行了介绍,并对具体的选择算法的性能进行了仿真.     

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

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

无线网络中基于DSDV的最大化吞吐量的协作路由算法

为最大化无线自组织网络的吞吐量,提出一种自适应的协作路由算法。在算法中,协作分集技术与路由选择相结合,通过在路由的每一跳选择最佳的中继节点协作发送节点传输信息来改善网络吞吐量。首先通过目的序列距离矢量路由协议（DSDV）初步建立最短路由路径,在每条链路的发送节点和接收节点根据邻节点表选出公共邻居节点,建立候选中继集合;进一步,每一跳根据链路吞吐量,在候选中继集合中自适应选择最多两个中继来协助发送节点进行传输,并根据选出的中继节点数动态分配节点发射功率。在保证系统发射功率一定的情况下,最大化网络吞吐量。仿真结果表明,在相同的发射功率下,相对于非协作路由DSDV算法,采用固定数量中继的协作路由算法提高了整个网络的吞吐量,而自适应的协作路由算法可进一步提高吞吐量;同时仿真了网络吞吐量与网络规模和节点最大移动速度的变化关系。      

认知选择协同分集任意信噪比中断概率的分析

选择中继已被证明是一种有效和实用的协作分集方法.但是,现有的分析主要集中在渐进高信噪比(SNR)区域,因此,研究认知选择协同分集系统任意信噪比的中断概率具有现实意义.推导了瑞利衰落信道选择中继协议的中断概率解析式,并进行了仿真.仿真结果表明,选择中继协议在任意信噪比情况下,增加中继节点可降低中断概率,而解码中继协议(DF)在低、中信噪比情况下不一定降低中断概率;同时,选择中继协议的中断性能和分集增益随频谱空穴检测能力的提高而增强.     

编码协作分集的合作伙伴选择算法研究

协作分集的思想来源于中继信道。与中继信道所不同,在协作分集网络中,每个用户不仅要传输自己的信息,还要帮助其协作伙伴中继传输信息。也就是说,每个用户既要充当信源的角色,又要扮演中继器的角色。文章通过协作通信中编码协作机制下的多节点协作伙伴的选择,分析四种情况下的中断概率,并讨论今后研究的发展方向。     

协作OFDM系统中的子载波选择算法

研究了协作正交频分复用系统的中继方案,提出了OFDM协作分集系统中的子载波选择算法,根据子信道信息,在容量准则下,选择可以提高系统容量的子载波,以放大前传的方式转发源节点信息。仿真结果表明,在中继节点功率与源节点功率较低或中继节点靠近源或目的节点时,所有子载波都采用中继传输可降低系统容量;子载波选择算法可以改善系统容量,并且选择合适的中继节点发射功率和中继位置,可以显著提高系统容量,当中继节点位于源与目的节点中点时,系统容量最大。     

认知无线电网络基于D-OFDM的中继选择算法

认知无线电技术能有效提高频谱利用率,而协作中继是解决信号在无线媒介中消失问题的关键技术。文章基于认知无线电网络,通过创建协作表,提出了一种利用协作中继提高频谱利用率和数据传输速率的中继选择算法。其中的协作表包括信道增益、信道可用率和认知节点的不同频谱。该算法通过选择合适的中继节点以最大化源节点的传输速率。仿真结果表明了该中继选择算法的有效性。     

Security versus reliability analysis for multi-eavesdropper cooperation wireless networks with best relay

Physical-layer security could be used to effectively combat eavesdroppers and the transmission reliability of the main link could be improved.A wireless relay network with multiple both decode and forward eavesdroppers and relays were considered,in the presence of the link from source to destination.A best relay selection scheme based on multieavesdropper’s cooperation was proposed,and the outage probability and the intercept probability was deduced under both schemes without relay and with best relay.Then,the security and reliability influenced by different relay selection schemes were analyzed.The simulation results show that the achievable channel capacity at the destination node and the system outage probability are directly affected by different relay selection scheme.Lower system outage probability can be achieved by the proposed scheme,and the system outage probability and intercept probability are both decreased with the increase of the number of relays.The intercept probability increases with the increase of the number of eavesdroppers,which,however,can be reduced by increasing the number of relays to ensure the main link’s reliable transmission.     

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.     

多接入中继信道中的单中继选择

研究表明,协作中继选择能提高无线中继网络的鲁棒性和能效。文中研究一个多接入中继信道,包含2个信源,N个中继和1个信宿。中继节点为半双工,对两个信源的信号采用非再生的网络编码。考虑直接链路,基于最佳最差信道、最佳信噪比和最佳调和平均选择,提出新的选择策略。仿真结果表明其在性能上优于原有策略。     

Relay Subset Selection in Wireless Networks Using Partial Decode-and-Forward Transmission

This paper considers the problem of selecting a subset of nodes in a two-hop wireless network to act as relays in aiding the communication between the source–destination pair. Optimal relay subset selection with the objective of maximizing the overall throughput is a difficult problem that depends on multiple factors, including node locations, queue lengths, and power consumption. A partial decode-and-forward strategy is applied in this paper to improve the tractability of the relay selection problem and the performance of the overall network. Note that the number of relays that are selected ultimately determines the performance of the network. This paper benchmarks this performance by determining the net diversity that is achieved using the relays that are selected and the partial decode-and-forward strategy. This framework is subsequently used to further transform relay selection into a simpler relay placement problem, and two proximity-based approximation algorithms are developed to determine the appropriate set of relays to be selected in the network. Other selection strategies, such as random relay selection and a greedy algorithm that relies on channel state information, are also presented. This paper concludes by showing that the proposed proximity-based relay selection strategies yield near-optimal expected rates for a small number of selected relays.      

Using Orthogonal and Quasi-Orthogonal Designs in Wireless Relay Networks

Distributed space-time coding was proposed to achieve cooperative diversity in wireless relay networks without channel information at the relays. Using this scheme, antennas of the distributive relays work as transmit antennas of the sender and generate a space-time code at the receiver. It achieves the maximal diversity when the transmit power is infinitely large. This paper is on the design of practical distributed space-time codes (DSTCs). We use orthogonal and quasi-orthogonal designs which are originally used in the design of space-time codes for multiple-antenna systems. It is well known that orthogonal space-time codes have full diversity and linear decoding complexity. They are particularly suitable for transmissions in the network setting using distributed space-time coding since their ldquoscale-freerdquo property leads to good performance. Our simulations show that they achieve lower error rates than the random code. We also compare distributed space-time coding to selection decode-and-forward using the same orthogonal designs. Simulations show that distributed space-time coding achieves higher diversity than selection decode-and-forward (DF) when there is more than one relay. We also generalize the distributed space-time coding scheme to wireless relay networks with channel information at the relays. Although our analysis and simulations show that there is no improvement in the diversity, in some networks, having channel information at the relays saves both the transmission power and the transmission time.     

Outage probability and channel capacity for the Nth best relay selection AF relaying over INID Rayleigh fading channels

Cooperative diversity systems have recently been proposed as a way to form virtual antenna schemes without utilizing collocated multiple antennas. In this paper, we consider the Nth best opportunistic amplify‐and‐forward (AF) cooperative diversity systems. The AF type can be regarded as one on the basis of modified channel state information. Wireless channels between any pair of nodes (i.e., direct and dual hop links) are assumed quasi‐static independent and nonidentically distributed (INID) Rayleigh fading. The best opportunistic AF (OAF) scheme requires two phases of transmission. During the first phase, the source node transmits a signal to all relays and the destination. In the second phase, the best relay is only selected on the basis of highest signal‐to‐noise ratio (SNR) scheme to forward the source signal to the destination. Therefore, the indirect link (i.e., source‐selected relay destination) can give the highest received SNR. However, the best relay selection cannot be available so that we might choose the second, third, or generally the Nth best relay. In this paper, we derive the approximated outage probability and channel capacity for the Nth best OAF relay systems over INID Rayleigh fading channels. At first, the indirect link's received SNR is approximated as harmonic mean upper bound. With this information, we obtain the given relay's Nth best selection probability as the closed form. Finally, both outage probability and channel capacity are derived as the closed forms. Simulation results are finally presented to validate the analysis. Copyright © 2011 John Wiley & Sons, Ltd.     

PHY-layer Fairness in Amplify and Forward Cooperative Diversity Systems

We deal with the concept of physical-layer fairness in amplify and forward cooperative diversity systems, which reflects the need for equally allocating the consumed power among the relays. To this end, we propose a method which utilizes knowledge on both the instantaneous and average channel conditions in order to encompass this concept, by attributing a weight coefficient to each relay depending on its average channel state and then selecting the relay with the best instantaneous "weighted" channel conditions. We also provide a performance analysis of the proposed scheme that includes an analytical expression for the outage probability, together with a closed form one in the high signal-to-noise-ratio (SNR) regime. Through the latter expression, the average symbol error probability (ASEP) for high SNRs is also derived. Numerical results demonstrate that, for small number of available relays or for high SNRs, the performance of the proposed scheme resembles that of the "best relay selection" scheme, in terms of outage probability and ASEP, despite maintaining the average power consumptions equal.     

Distributed Space-Time Cooperative Systems with Regenerative Relays

This paper addresses some of the opportunities and the challenges in the design of multi-hop systems that utilize cooperation with one or two intermediate regenerative relays to provide high-quality communication between a source and a destination. We discuss the limitations of using a distributed Alamouti scheme in the relay channel and the additional complexity required to overcome its loss of diversity. As an alternative to the distributed Alamouti scheme, we propose and analyze two error aware distributed space-time (EADST) systems built around the Alamouti code. First, using a bit error rate based relay selection approach, we design an EADST system with one and two regenerative relays that rely on feedback from the destination and we show that the proposed system improves on the distributed Alamouti scheme. In addition, we prove that the proposed one relay EADST system collects the full diversity of the distributed MISO channel. Second, we introduce an EADST system without feedback in which the relaying energies depend on the error probabilities at the relays. Numerical results show that both EADST systems perform close to the error probability lower bound obtained by considering error-free reception at the relays     

Criterions of designing codebooks and a relay selection scheme for a relay network

For a relay network system with amplify and forward protocol, in this paper, analysis of performance is conducted, and an upper bound of pairwise error probability is obtained. Moreover, a scheme of relay selection is analyzed under assumptions that (i) the relays amplify and forward received signals without any signal processing; (ii) the receiver only knows channel state information from the relays to the receiver; and (iii) the transmitter and the relays do not have any channel state information. Based on the upper bound, a criterion of designing codebook is proposed. Surprisingly, this bound shows that increasing the number of relays can hardly improve performance. Furthermore, the error probability is decreasing with a speed of P^?1, no matter how large the relay number is, where P is the total energy. Also, for the relay selection, the optimal selecting way is to select only one relay with the largest channel gain, which is very different from existing schemes. These results are all confirmed by simulations. Copyright © 2015 John Wiley & Sons, Ltd.     

A simple Cooperative diversity method based on network path selection

Cooperative diversity has been recently proposed as a way to form virtual antenna arrays that provide dramatic gains in slow fading wireless environments. However, most of the proposed solutions require distributed space-time coding algorithms, the careful design of which is left for future investigation if there is more than one cooperative relay. We propose a novel scheme that alleviates these problems and provides diversity gains on the order of the number of relays in the network. Our scheme first selects the best relay from a set of M available relays and then uses this "best" relay for cooperation between the source and the destination. We develop and analyze a distributed method to select the best relay that requires no topology information and is based on local measurements of the instantaneous channel conditions. This method also requires no explicit communication among the relays. The success (or failure) to select the best available path depends on the statistics of the wireless channel, and a methodology to evaluate performance for any kind of wireless channel statistics, is provided. Information theoretic analysis of outage probability shows that our scheme achieves the same diversity-multiplexing tradeoff as achieved by more complex protocols, where coordination and distributed space-time coding for M relay nodes is required, such as those proposed by Laneman and Wornell (2003). The simplicity of the technique allows for immediate implementation in existing radio hardware and its adoption could provide for improved flexibility, reliability, and efficiency in future 4G wireless systems.