Statistical channel knowledge-based optimum power allocation for relaying protocols in the high SNR regime

We are concerned with transmit power optimization in a wireless relay network with various cooperation protocols. With statistical channel knowledge (in the form of knowledge of the fading distribution and the path loss information across all the nodes) at the transmitters and perfect channel state information at the receivers, we derive the optimal power allocation that minimizes high signal-to-noise ratio (SNR) approximations of the outage probability of the mutual information (MI) with amplify-and-forward (AF), decode-and-forward (DF) and distributed space-time coded (DSTC) relaying protocols operating over Rayleigh fading channels. We demonstrate that the high SNR approximation-based outage probability expressions are convex functions of the transmit power vector, and the nature of the optimal power allocation depends on whether or not a direct link between the source and the destination exists. Interestingly, for AF and DF protocols, this allocation depends only on the ratio of mean channel power gains (i.e., the ratio of the source-relay gain to the relay-destination gain), whereas with a DSTC protocol this allocation also depends on the transmission rate when a direct link exists. In addition to the immediate benefits of improved outage behavior, our results show that optimal power allocation brings impressive coding gains over equal power allocation. Furthermore, our analysis reveals that the coding gain gap between the AF and DF protocols can also be reduced by the optimal power allocation     

协作通信中的解码转发中继策略优化

在单中继协作通信系统模型下,研究了直接传输、固定解码转发（ DF）中继、选择DF中继和增量中继协议。为了提高协作通信系统的频谱效率和中断性能,通过比较源-目的端和中继-目的端的瞬时信道增益来判定是否需要采用协同通信模式,提出一种改进的解码转发方式（ IDF）。通过将选择DF中继和增量中继的优点结合,提出了一种增量选择中继（ ISR）策略,并给出了2种改进协议任意信噪比的中断概率表达式。仿真结果表明,与传统的单中继解码转发协议相比, IDF和ISR均具有更低的中断概率, ISR具有最低的中断概率。     

混合转发协作通信的功率分配方案

为了最大限度地利用移动终端的发射功率,提出了基于中断概率限制的混合转发协作通信功率分配方案。根据目的节点和中继节点的译码情况,选择合适的协作转发方式,充分利用了放大转发(AF)和译码转发(DF)方式的优点。在满足中断概率限制的条件下,采用图形和数值分析的方法,得到了源节点和中继节点的最优功率分配。仿真分析表明,在相同的中断概率限制下,采用的功率分配方案比等功率分配方案消耗的总功率少约2.8 dBm。     

多天线中继网络中的终端性能和多样性分析

The performance of multi-antenna multi- relay cooperative system is investigated in this paper. Two relaying strategies, i.e., reactive and proactive strategies are analyzed with the Amplifyand- Forward (AF) and Decode-and-Forward (DF) protocols. We derive the Cumulative Distribution Function (CDF) of the received Signal-to-Noise Ratio (SNR) at the destination, which is used to calculate the exact outage probability, for both AF and DF protocols. According to these results, we conclude that a cooperative network which composes K relays each equipped with nr antennas can achieve maximal order-(2nrK+1) diversity gain, by proper processing at relays and destination. Furthermore, the performance comparison is given, in terms of outage probability. These two strategies outperform each other in different scenarios in AF protocol, whilst proactive strategy is always better than its counterpart in DF protocol. According to these results, the optimal power allocation schemes among relay nodes are also presented, with reasonable power constraint.     

Mixed AF and DF cooperative relay systems and their performance bounds analyses

This paper analyzes the performance bounds of a wireless relay system consisting of several relay stations working on both amplifier‐and‐forward (AF) and decode‐and‐forward (DF) protocols. We want to study the outage probability behavior of the proposed mixed AF and DF relay systems under independent Nakagami‐m fading channels. In particular, we will derive the lower and upper bounds of outage probability of the mixed AF and DF relay systems based on maximal ratio combining diversity reception. The results give optimal configuration of AF and DF relays under a specific channel condition, thus helping us to design an optimized mixed AF and DF relay system in a generic fading environment. The trade‐off between complexity and performance is discussed in this paper. In addition, we will use computer simulations to verify the effectiveness of the proposed mixed AF and DF relay configurations. Finally, the power allocation issues for such a mixed AF and DF relay system will also be discussed. Copyright © 2012 John Wiley & Sons, Ltd.     

Outage Probability Analysis of Dual-Hop Decode-and-Forward Relaying Over Mixed Rayleigh and Generalized Gamma Fading Channels

In this letter, outage probability of dual-hop decode-and-forward (DF) relaying scheme is analyzed over mixed Rayleigh and generalized Gamma fading channels. Cooperation model considered in this work consists of a source, a relay and a destination. It is assumed that source-relay and relay-destination channels experience Rayleigh fading and generalized Gamma fading, respectively. Exact outage probability expression is derived and outage performance is illustrated for both direct transmission and DF relaying scheme.     

多中继AF协作系统功率分配研究

功率分配是协作通信中一个重要的研究方向,文章分析了放大转发（AF）协作方式下,基于正交信道的多协作中继系统模型,在此基础上推导了系统中断概率。并以最小化系统中断概率为目标,给出系统功率分配约束表达式,进一步分析了功率分配与中继节点位置的关系,计算求得单中继和两中继情况系统最优功率分配系数。系统仿真表明最优功率分配相对常规的等功率分配,系统性能明显提升。     

双向协作系统的中继选择和功率分配策略

针对瑞利衰落信道下双向多中继协作通信系统,为了降低中断概率,提出了一种基于最小化中断概率的中继选择策略和功率分配方案。首先联合考虑两条链路的中继节点处信噪比和信道增益实现双链路中继选择,然后推导出一种新的最优中继下双向放大转发协作中断概率的近似表达式上界,并利用凸优化求解得到使中断概率最小的最优功率分配解。仿真结果表明,与现有策略相比,提出的策略能够明显降低系统中断概率和误码率,显著提高系统性能。     

基于中断概率的协作通信中继选择与功率分配算法

研究了功率受限情况下多中继协作通信网络的中继选择和功率优化问题。在AF网络中,提出了一种低复杂度中继选择与功率分配算法,其目标是在总功率一定的条件下使系统的中断概率最小。本算法对源节点和所有潜在中继节点进行功率分配,结合当前信噪比选择最优的中继集合,通过最速下降法求出使系统中断概率最低的功率分配因子。该算法不需要知道大量瞬时信道信息、不需要系统在等功率条件下进行中继选择,只需求得中继节点排列矩阵便可根据当前信噪比自适应获得最优中继节点集合。仿真结果表明,在相同条件下,该算法明显优于不同中继节点集合下几种算法的中断性能,并且与传统的SAF及AAF算法相比,有效降低了中断概率,提升了系统性能和功率效率。     

Energy efficiency optimization of one-way and two-way DF relaying considering circuit power

In this paper, the energy efficiency (EE) of a decode and forward (DF) relay system is studied, where two sources communicate through a half-duplex relay node in one-way and two-way relaying strategies. Both the circuitry power and the transmission power of all nodes are taken into consideration. In addition, three different coding schemes for two-way DF relaying strategy with two phases and two-way DF relaying with three phases are considered. The aim is to maximize the EE of the system for a constant spectral efficiency (SE). For this purpose, the transmission time and the transmission power of each node are optimized. Simulations are used to compare the EE–SE curve of different DF strategies with one-way and two-way amplify and forward (AF) strategies and direct transmission (DT), to find the best energy efficient strategy in different SE conditions. Analytical and simulation results demonstrate that in low SE conditions, DF relaying strategies are more energy efficient compared to that of AF strategies and DT. However, in high SE conditions, the EE of two-way AF relaying and DT strategy outperform some of the DF relaying strategies. In simulations, the impact of different circuitry power and different channel conditions on the EE–SE curves are also investigated.     

Joint power allocation and relay selection for decode-and-forward cooperative relay in secure communication

In this paper, we investigate the cooperative strategy with total power constraint in decode-and-forward (DF) relaying scenario, in the presence of an eavesdropper. Due to the difference of channel for each source-relay link, not all relay nodes have constructive impacts on the achievable secrecy rate. Besides, the final achieved secrecy rate depends on both source-relay and relay-destination links in DF relaying scenario. Therefore, the principal question here is how to select cooperative strategy among relays with proper power allocation to maximize the secrecy rate. Three strategies are considered in this paper. First, we investigate the cooperative jamming (CJ) strategy, where one relay with achieved target transmission rate is selected as a conventional relay forwarding signal, and remaining relays generate artificial noise via CJ strategy to disrupt the eavesdropper. Two CJ schemes with closed-form solutions, optimal cooperative jamming (OCJ) and null space cooperative jamming (NSCJ), are proposed. With these solutions, the corresponding power allocation is formulated as a geometric programming (GP) problem and solved efficiently by convex programming technique. Then, to exploit the cooperative diversity, we investigate the cooperative relaying (CR) strategy. An iterative algorithm using semi-definite programming (SDP) and GP together with bisection search method is proposed to optimize the cooperative relaying weight and power allocated to the source and relays. Furthermore, to exploit the advantages of both CR and CJ, we propose an adaptive strategy to enhance the security. Simulation results demonstrate that the efficiency of the proposed cooperative strategies in terms of secrecy rate.     

Decode-to-cooperate: a sequential alamouti-coded cooperation strategy in dual-hop wireless relay networks

An optimal cooperation strategy, decode-to-cooperate, is proposed and investigated for performance improvements in dual-hop wireless relay networks. Based on decode-and-forward (DF) strategy with multiple relay selection, we design a novel scheme such that the source node keeps transmitting sequentially and the selected relays cooperate by transmitting the decoded signal using distributed Alamouti coding. We exploit the multipath propagation effect of the wireless channel to achieve lower probability of error and introduce optimum power allocation and relay positioning. We analyze the scenario when the source to destination direct link is not available and derive a closed form expression for symbol error rate (SER), its upper bound and an asymptotically tight approximation to exploit the performance gain by selecting the optimum relays in a multiple-relay cooperation scheme. Moreover, asymptotic optimum power allocation (based on the SER approximation) and optimal relay positioning are also considered to further improve the SER. The proposed relay selection scheme outperforms cooperative (DF) and non-cooperative schemes by more than 2 dB.     

Cooperative Communication Protocols in Wireless Networks: Performance Analysis and Optimum Power Allocation

In this paper, symbol-error-rate (SER) performance analysis and optimum power allocation are provided for uncoded cooperative communications in wireless networks with either decode-and-forward (DF) or amplify-and-forward (AF) cooperation protocol, in which source and relay send information to destination through orthogonal channels. In case of the DF cooperation systems, closed-form SER formulation is provided for uncoded cooperation systems with PSK and QAM signals. Moreover, an SER upper bound as well as an approximation are established to show the asymptotic performance of the DF cooperation systems, where the SER approximation is asymptotically tight at high signal-to-noise ratio (SNR). Based on the asymptotically tight SER approximation, an optimum power allocation is determined for the DF cooperation systems. In case of the AF cooperation systems, we obtain at first a simple closed-form moment generating function (MGF) expression for the harmonic mean to avoid the hypergeometric functions as commonly used in the literature. By taking advantage of the simple MGF expression, we obtain a closed-form SER performance analysis for the AF cooperation systems with PSK and QAM signals. Moreover, an SER approximation is also established which is asymptotically tight at high SNR. Based on the asymptotically tight SER approximation, an optimum power allocation is determined for the AF cooperation systems. In both the DF and AF cooperation systems, it turns out that an equal power strategy is good, but in general not optimum in cooperative communications. The optimum power allocation depends on the channel link quality. An interesting result is that in case that all channel links are available, the optimum power allocation does not depend on the direct link between source and destination, it depends only on the channel links related to the relay. Finally, we compare the performance of the cooperation systems with either DF or AF protocol. It is shown that the performance of a systems with the DF cooperation protocol is better than that with the AF protocol. However, the performance gain varies with different modulation types and channel conditions, and the gain is limited. For example, in case of BPSK modulation, the performance gain cannot be larger than 2.4 dB; and for QPSK modulation, it cannot be larger than 1.2 dB. Extensive simulation results are provided to validate the theoretical analysis.     

Particle swarm optimization–based power allocation for Alamouti amplify and forward relaying protocol

The performance of wireless communication systems is improved over flat fading channel by using Alamouti coding scheme, which provides the quality of diversity gain. In this paper, performance analysis of symbol error rate (SER) and particle swarm optimization (PSO)–based power allocation (PA) for Alamouti amplify and forward (AF) relaying protocol using maximum ratio combining (MRC) technique is presented. Analytical expression of SER upper bound and SER approximation is derived for Alamouti AF relaying protocol with quadrature phase shift keying (QPSK) modulation over Rayleigh fading channel and Rician fading channel. In addition, PSO‐based optimum PA factor is calculated on the basis of the minimum SER of proposed method. PSO‐based optimum PA gives 0.5 dB of improved signal‐to‐noise ratio (SNR) compared with the equal power allocation (EPA). The theoretical approximate SER result is compared with the simulated SER. The proposed protocol provides full diversity gain and reduces SER compared with the existing AF and decode and forward (DF) relaying protocols over Rayleigh fading channel and Rician fading channel.     

机会全双工/双向中继策略

传统双向中继（Two-way relaying,TWR）策略在信道和数据速率非对称性条件下性能较差。本文提出一种机会全双工/双向中继策略,提高无线中继系统在信道和数据速率非对称条件下的中断概率性能。以最优中断概率为准则,将机会全双工/双向中继策略建模为传输时间分配问题,给出了机会全双工/双向中继策略最优时间资源和中继功率分配方案。仿真结果表明,与传统的全双工中继（Full-duplex relaying,FDR）和双向中继（TWR）比较,所提策略能够获得更好的中断概率性能。      

Single-User Broadcasting Protocols Over a Two-Hop Relay Fading Channel

A two-hop relay fading channel is considered, where only decoders possess perfect channel state information (CSI). Various relaying protocols and broadcasting strategies are studied. The main focus of this work is on simple relay transmission scheduling schemes. For decode-and-forward (DF) relaying, the simple relay cannot buffer multiple packets, nor can it reschedule retransmissions. This gives rise to consideration of other relaying techniques, such as amplify-and-forward (AF), where a maximal broadcasting achievable rate is analytically derived. A quantize-and-forward (QF) relay, coupled with a single-level code at the source, uses codebooks matched to the received signal power and performs optimal quantization. This is simplified by a hybrid amplify-QF (AQF) relay, which performs scaling, and single codebook quantization on the input. It is shown that the latter is optimal by means of throughput on the relay-destination link, while maintaining a lower coding complexity than the QF setting. A further extension of the AQF allows the relay to perform successive refinement, coupled with a matched multilevel code. Numerical results show that for high signal-to-noise ratios (SNRs), the broadcast approach over AF relay may achieve higher throughput gains than other relaying protocols that are numerically tractable     

认知中继网络中的信道分配方法研究

认知中继网络中,对信道进行分配可以有效地提高端到端吞吐量。对三节点认知中继网络下的信道分配进行了研究。中继节点采用解码转发协议时,提出了一种次优的分配方法,将信道按信道增益排序,然后逐个地分配中继信道。中继节点采用放大转发协议时,给出了最优的信道分配方法,提出了一种次优的信道分配方法。次优方法逐个地比较中继信道采用传统协作方式传输时的端到端吞吐量、分配为双跳信道S-R和R-D链路时的端到端吞吐量完成分配。和最优方法相比,两种次优方法以较小的性能损失换取了计算复杂度的降低。给出了数值仿真,比较了两种传输方式下的端到端吞吐量性能,验证了以上方法的有效性。通过对比仿真时间,比较了最优方法和次优方法的计算复杂度。给定信道总数,对次优方法下信道分配后的比例进行了仿真,发现待分配中继信道以1/3的比例分配为直传信道;而在放大转发下,待分配中继信道几乎不被分配为双跳信道。      

Performance Analysis of Full-Duplex Relaying with Parial Relay Selection

This paper addresses full-duplex relaying with partial relay selection, where the relay with the best instantaneous signal-to-noise ratio across the source-relay link is selected to amplify the signal received from the source and forward it to the destination. Some expressions for outage probability and symbol error rate are derived to provide the performance analysis in an independent and identically distributed Rayleigh fading environment. Monte-Carlo simulations are also performed to demonstrate the validity of the analytical results.     

Effects of CEE and Feedback Error on Performance for AF-ORS with PSA-CE Schemes Over Quasi-Static Rayleigh Fading Channels

In this paper, we propose the analytical approach for amplify-and-forward (AF) opportunistic relaying schemes (ORS). When operation of AF-ORS consists of relay selection and data transmission phases based on pilot symbol assisted-channel estimation (PSA-CE) methods over quasi-static Rayleigh fading channels, we show that the relay selection phase can be implemented by pilots symbols transmission for source-relay and relay-destination. Moreover, the feedback method for the selected relay index is proposed to have a simple fashion. Then, we investigate the effects of both a channel estimation error and an estimated noise variance, which are obtained by PSA-CE methods, on the received signal-to-noise ratio (SNR). The average SNR loss is also derived in terms with the number of pilots in PSA-CE methods. Moreover, the average symbol error rate, the outage probability, and the normalized channel capacity of the ORS are derived in approximated closed-form expressions for an arbitrary link SNR when the channel state information in the source-relay-destination link is estimated based on transmitted pilots symbols. As the number of pilot symbols, the derived analytical approach is verified, and by comparing it with simulation results, the accuracy is demonstrated. In addition, it is verified that the effect of the feedback error can be neglected for PAS-CE methods over quasi-static fading channels.     

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

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