旋转编码协作方案中的功率优化分配研究

针对等功率分配(EPA)导致系统资源利用率低的问题,提出了一种旋转编码协作方案中的功率优化分配(OPA)方法。该方法首先利用Chernoff界推导了端到端系统误符号率(SER)的上界,然后在总功率一定的条件下,以最小化SER上界为目标,根据平均信道增益来计算源和中继间的功率分配因子。最后将功率分配信息通过反馈信道发送给协作用户,从而实现了功率的自适应分配,提高了系统的资源利用率。仿真结果验证了所提OPA方法的有效性。     

Symbol error rate analysis and power allocation for hybrid cooperation in Rayleigh fading environment

In this paper, we investigate the symbol error rate (SER) performance and power allocation for hybrid cooperation (HC) system in a Rayleigh fading environment. Specifically, we derive closed‐form and approximate SER expressions for the HC system by using the moment generating function (MGF)‐based approach. However, the resultant SER expressions contain an MGF of the harmonic mean of two independent random variables, which is not tractable in SER analysis. Then, we present simple and tight bounds on the SER to show the asymptotic behavior of the HC system. It is shown that the HC system achieves full diversity order. On the basis of the tight SER bound, the power allocation is investigated. It is found that the optimal power allocation (OPA) of the HC system does not depend on the fading parameter of the source‐to‐destination channel and it only depends on the channel links related to the relay. With the increase of the ratio of mean channel power gains (i.e., the ratio of the relay‐to‐destination channel gain to the source‐to‐relay channel gain), more performance gain can be acquired by using the OPA scheme. Finally, the analytical results are validated through computer simulations. Copyright © 2012 John Wiley & Sons, Ltd.     

一种协作网络编码方案的功率优化分配方法

该文针对传统双路无线中继系统中的源和中继采用等功率发送,导致系统资源利用率低的问题,提出一种译码转发-空时协作网络编码方案的功率优化分配方法。该方法以最小化两源用户中断概率中的较大者为目标,并利用中断概率的高阶近似解,通过迭代计算获得最优功率分配因子。所提功率优化分配方法计算复杂度低且仅需信道的平均增益信息。仿真结果表明,与平均功率分配方法相比,所提功率优化分配方法使系统的中断概率和误码率性能均得到有效提升。     

Power allocations in minimum-energy SER-constrained cooperative networks

In this paper, we propose minimum power allocation strategies for repetition-based amplify-and-forward (AF) relaying, given a required symbol error rate (SER) at the destination. We consider the scenario where one source and multiple relays cooperate to transmit messages to the destination. We derive the optimal power allocation strategy for two-hop AF cooperative network that minimizes the total relay power subject to the SER requirement at the destination. Two outstanding features of the proposed schemes are that the power coefficients have a simple solution and are independent of knowledge of instantaneous channel state information (CSI). We further extend the SER constraint minimum power allocation to the case of multibranch, multihop network and derive the closed-form solution for the power control coefficients. For the case of power-limited relays, we propose two iterative algorithms to find the power coefficients for the SER constraint minimum-energy cooperative networks. However, this power minimization strategy does not necessarily maximize the lifetime of battery-limited systems. Thus, we propose two other AF cooperative schemes which consider the residual battery energy, as well as the statistical CSI, for the purpose of lifetime maximization. Simulations show that the proposed minimum power allocation strategies could considerably save the total transmitted power compared to the equal transmit power scheme.     

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.     

Nelder‐Mead–based power optimization for secrecy enhancement in amplify‐and‐forward cooperative relay networks

Cooperative communication based on relaying nodes has been considered as a promising technique to increase the physical layer security (PLS) performance in wireless communications. In this paper, an optimal power allocation (OPA) scheme based on Nelder‐Mead (NM) algorithm is proposed for improving the secrecy rate of amplify‐and‐forward (AF) cooperative relay networks employing cooperative jamming (CJ) scheme. The proposed hybrid jamming scheme allows the source and selected relay to transmit the jamming signal along with the information to confound the eavesdropper. The path selection probability of ant colony optimization (ACO) algorithm is used for selecting the relay for transmission. The performance based on secrecy rate is evaluated for “n” trusted relays distributed dispersedly between the source and destination. Gradient‐based optimization and three‐dimensional exhaustive search methods are used as benchmark schemes for comparison of the proposed power optimization algorithm. The secrecy performance is also compared with conventional AF scheme and CJ scheme without power optimization (EPA). The impact of single and multiple relays on secrecy performance is also evaluated. Numerical results reveal that, compared with the gradient method and exhaustive search algorithm, the proposed power allocation strategy achieves optimal performance. Also, the derived OPA results show a significantly higher secrecy rate than the EPA strategy for both CJ and AF schemes.     

Minimized SER and QOS Based Power Allocation Strategies for Multi HDAF Relay Cooperative Network

In this paper, a multi hybrid decode-amplify-forward relay cooperative network with perfect CSI in flat Rayleigh fading channel is considered. Using moment generating function based approach, the closed form of symbol error rate (SER) with asymptotic approximation is derived. Based on the lower bound of SER (Olfat and Olfat in IET Commun 5(4):2018–2027, 2011), Lagrange multiplier method and differential evolution (DE) algorithm based power allocation schemes are proposed. With fixed source power, the relay powers are optimized with the proposed schemes by the power allocation factor. Further the SER performance of proposed power allocation schemes is investigated by varying the location of the relays. The performance gain of proposed power allocation schemes depends on the channel quality of source to relay and relay to destination links. It is observed that the proposed power allocation schemes outperform the equal power allocation scheme and DE based power allocation provides SER response close to power allocation with Lagrange multiplier method. In order to achieve the target SER (quality of service) minimum power allocation is introduced as minimum relay power allocation and minimum source and relay power allocation.

     

Performance Analysis and Optimal Power Allocation for Space–Time and Amplify-and-Forward Cooperative System

In this paper, we consider a space?Ctime and amplify-and-forward (ST-AF) cooperative system which consists of two-antenna source, single-antenna relay and destination. Source transmits Alamouti space?Ctime coding symbols to destination with cooperation of relay which adopts AF strategy. Closed-form symbol error rate (SER) is derived for the ST-AF system with PSK signals. Moreover, a SER approximation is developed to show the asymptotic performance of the ST-AF cooperative system in medium and high SNR regimes. For comparison, the SER approximation of another cooperative space?Ctime coding (C-STC) scheme is also derived. Theoretical analysis shows that the ST-AF can obtain more diversity gain and achieve higher diversity order than C-STC. Statistical optimal power allocation (OPA) algorithm for the ST-AF cooperative system is presented based on the SER performance. It turns out the OPA only depends on the channel links related to the relay, not depend on the direct link between source and destination. Finally, numerical simulations validate the theoretical analysis.     

全双工目的端加扰安全传输系统中的天线模式切换

在包含一个单天线信源、一个单天线窃听者和一个多天线全双工目的端的无线窃听信道通信系统中,提出并解决了最大化可达安全速率的优化问题。为最大化全双工目的端加扰无线通信系统的可达安全速率,基于动态天线模式切换和最优功率分配技术,设计了一种两步走联合优化方案。具体地,基于全局信道状态信息,首先推导出最优功率分配因子的闭合表达式。结合最优功率分配因子闭合式,设计了一种基于贪婪策略的天线模式切换方案,分别得到最优的发射和接收天线集。仿真结果验证,采用本文所设计联合优化方案的全双工目的端加扰无线通信系统的安全性能远优于传统全双工目的端加扰无线通信系统。      

Joint Power Allocation and Interference Mitigation Techniques for Cooperative Spread Spectrum Systems with Multiple Relays

This paper presents joint power allocation and interference mitigation techniques for the downlink of spread spectrum systems which employ multiple relays and the amplify and forward cooperation strategy. We propose a joint constrained optimization framework that considers the allocation of power levels across the relays subject to an individual power constraint and the design of linear receivers for interference suppression. We derive constrained minimum mean-squared error (MMSE) expressions for the parameter vectors that determine the optimal power levels across the relays and the linear receivers. In order to solve the proposed optimization problem efficiently, we develop joint adaptive power allocation and interference suppression algorithms that can be implemented in a distributed fashion. The proposed stochastic gradient (SG) and recursive least squares (RLS) algorithms mitigate the interference by adjusting the power levels across the relays and estimating the parameters of the linear receiver. SG and RLS channel estimation algorithms are also derived to determine the coefficients of the channels across the base station, the relays and the destination terminal. The results of simulations show that the proposed techniques obtain significant gains in performance and capacity over non-cooperative systems and cooperative schemes with equal power allocation.     

认知无线电中基于中继位置和主用户位置的功率分配

针对认知无线电网络,提出了一种基于组间协作的联合直接传输和协作传输的传输机制,在满足干扰约束和峰值功率约束的情况下,通过分析瑞利衰落环境下放大转发协作单中继系统的性能,研究了中继位置和主用户位置对于系统的最优功率分配和系统吞吐量的影响,并对最优功率分配方案和等功率分配方案的性能进行了比较。仿真结果表明,中继位置和主用户的位置对于系统性能起着关键的作用,最优功率分配方案取得相对于等功率分配方案更优的性能,采用最优功率分配方案时,中继节点位于源节点和目的节点连线的中点且靠近认知用户时的系统性能最优。     

Power allocation in a transmit diversity system with mean channel gain information

We study the power allocation problem in a transmit diversity wireless system with mean channel gain information. In Rayleigh fading for a given set of mean channel gains and nodes, we seek to find the power allocation that minimizes the outage probability subject to a total power constraint. The optimal solution is shown to be computationally intensive when the number of channels is large. Instead, we derive a simple solution based on the upper bound to the outage probability which can be summarized as equal power allocation with channel selection. Numerical results show that the proposed solution is near-optimal over a wide range of parameter values. The problem addressed and the solution are relevant to a decode-and-forward cooperative relaying system with only partial channel information available to the relays.     

Distributed Adaptive Power Allocation for Wireless Relay Networks

In this paper, we consider a 2-hop wireless diversity relay network. We explore transmit power allocation among the source and relays to maximize the received signal to noise ratio (SNR) at the destination. We consider two relay protocols, "amplify and forward" (AAF) and "decode and forward" (DAF) and design the respective power allocations for both uneeded and coded systems. For a 2-hop relay system with one relay node, we derive a closed-form power allocation solution and, based on it, we propose a relay activation condition. If and only if the fading channel coefficients satisfy this condition, the relay transmits the signals to the destination; otherwise, the relay will stay in the idle state. For a system with more than one relay node, general closed-form power allocation solutions based on an exact SNR expression are difficult to derive; we hence, calculate a SNR upper bound and derive a sub-optimum power allocation solution based on this bound. The simulation results show that for a 2-hop diversity relay channel with one relay node the proposed adaptive power allocation (APA) scheme yields about 1- 2 dB SNR gains compared to the equal power allocation. This SNR gain increases monotonically as the number of relays increases     

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     

Decode-and-Forward Cooperative Diversity with Power Allocation in Wireless Networks

We study power allocation for the decode-and-forward cooperative diversity protocol in a wireless network under the assumption that only mean channel gains are available at the transmitters. In a Rayleigh fading channel with uniformly distributed node locations, we aim to find the power allocation that minimizes the outage probability under a short-term power constraint, wherein the total power for all nodes is less than a prescribed value during each two-stage transmission. Due to the computational and implementation complexity of the optimal solution, we derived a simple near-optimal solution. In this near-optimal scheme, a fixed fraction of the total power is allocated to the source node in stage I. In stage II, the remaining power is split equally among a set of selected nodes if the selected set is not empty, and otherwise is allocated to the source node. A node is selected if it can decode the message from the source and its mean channel gain to the destination is above a threshold. In this scheme, each node only needs to know its own mean channel gain to the destination and the number of selected nodes. Simulation results show that the proposed scheme achieves an outage probability close to that for the optimal scheme obtained by numerical search, and achieves significant performance gain over other schemes in the literature     

Performance analysis and power allocation for decode‐and‐forward cooperative communications over Rician fading channel

This paper derives the asymptotic symbol error rate (SER) and outage probability of decode‐and‐forward (DF) cooperative communications over Rician fading channels. How to optimally allocate the total power is also addressed when the performance metric in terms of SER or outage probability is taken into consideration. Analysis reveals the insights that Rician factor has a great impact on the system performance as compared with the channel variance, and the relay–destination channel quality is of importance. In addition, the source–relay channel condition is irrelevant to the optimal power allocation design. Simulation and numerical evaluation substantiate the tightness of the asymptotic expressions in the high‐SNR regions and demonstrate the accuracy of our theoretical analysis. Copyright © 2011 John Wiley & Sons, Ltd.     

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.     

Performance of Decode-and-Forward Cooperative Communications with Multiple Dual-Hop Relays over Nakagami-m Fading Channels

In this letter, we examine the symbol-error-rate (SER) performance of decode-and-forward (DF) cooperative communications. Our focus is on the scenario in which multiple dual-hop relays are employed and the channel environment is described by Nakagami-m fading. Cooperative diversity is observed from the derived error-rate expressions, and some insight into how channel conditions in the relay nodes affect the SER performance is obtained. In addition, with the knowledge of the partial channel state information (CSI) at the transmitting sides, we derive an optimal power allocation scheme to further enhance the SER performance. Simulation results are finally presented to demonstrate the correctness of our analysis and perception for the considered DF protocol.     

Distributed Relay Selection and Power Control for Multiuser Cooperative Communication Networks Using Stackelberg Game

The performance in cooperative communication depends on careful resource allocation such as relay selection and power control, but the traditional centralized resource allocation requires precise measurements of channel state information (CSI). In this paper, we propose a distributed game-theoretical framework over multiuser cooperative communication networks to achieve optimal relay selection and power allocation without knowledge of CSI. A two-level Stackelberg game is employed to jointly consider the benefits of the source node and the relay nodes in which the source node is modeled as a buyer and the relay nodes are modeled as sellers, respectively. The proposed approach not only helps the source find the relays at relatively better locations and "buy” an optimal amount of power from the relays, but also helps the competing relays maximize their own utilities by asking the optimal prices. The game is proved to converge to a unique optimal equilibrium. Moreover, the proposed resource allocation scheme with the distributed game can achieve comparable performance to that employing centralized schemes.