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.     

分布式双向中继选择算法及用户功率分配

针对放大转发的瑞利双向中继信道的节点选择问题,提出了基于部分信道信息的分布式双向中继选择算法。算法通过计算双向链路的接收信噪比,推导出满足目标接收信噪比的转发阈值,各中继节点根据该阈值决定是否参与转发,从而实现分布式选择。此外,考虑用户总功率受限的情况,在分布式中继选择基础上提出了优化功率分配策略,使双向信道的接收信噪比更加接近。仿真结果表明,分布式中继选择算法与最优多中继算法的系统传输速率相似,计算复杂度大大降低,尤其是在中继数目增大的情况下更加明显。优化功率分配策略能进一步提高系统能量效率,在相同性能下可节省7%左右的功率。     

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.     

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     

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.     

Relay assisted F/TDMA ad hoc networks: node classification, power allocation and relaying strategies

This paper considers the design of relay assisted F/TDMA ad hoc networks with multiple relay nodes each of which assists the transmission of a predefined subset of source nodes to their respective destinations. Considering the sum capacity as the performance metric, we solve the problem of optimally allocating the total power of each relay node between the transmissions it is assisting. We consider four different relay transmission strategies, namely regenerative decode-and-forward (RDF), nonregenerative decode-and-forward (NDF), amplify- and-forward (AF) and compress-and-forward (CF). We first obtain the optimum power allocation policies for the relay nodes that employ a uniform relaying strategy for all nodes. We show that the optimum power allocation for the RDF and NDF cases are modified water-filling solutions. Weobserve that for a given relay transmit power, NDF always outperforms RDF whereas CF always provides higher sum capacity than AF. When CF and NDF are compared, it is observed that either of CF or NDF may outperform the other in different scenarios. This observation suggests that the sum capacity can be further improved by having each relay adopt its relaying strategy in helping different source nodes. We investigate this problem next and determine the optimum power allocation and relaying strategy for each source node that relay nodes assist. We observe that optimum power allocation for relay nodes with hybrid relaying strategies provides higher sum capacity than pure RDF, NDF, AF or CF relaying strategies.     

Opportunistic Decode-and-Forward Relaying with Interferences at Relays

In this paper, a decode-and-forward cooperative interference-limited multiple relay network is considered. An efficient relay selection strategy and its performance analysis are proposed, where only the relay nodes are affected by multiple interferences. In the proposed relay selection scheme, the selected relay is not always used, depending on the power of interferences and the channel state information of all links, while the direct path between source and destination is always used. For analytical tractability the distribution of interference-limited channel is approximated as an exponential distribution with high accuracy. Analysis of cooperative networks with interference-limited relays can be performed using the approximate exponential distribution by the same methods which have been used without interferences. We derive the bit error probability and outage probability of the proposed opportunistic max-min relay selection (OMRS) scheme in independent non-identically distributed Rayleigh fading channels. Numerical results present the superiority of OMRS over the conventional relay selection scheme which always uses the selected relay path. The exactness of the approximate analysis for interference-limited relays is also shown in numerical results.     

Capacity bounds and power allocation for wireless relay channels

We consider three-node wireless relay channels in a Rayleigh-fading environment. Assuming transmitter channel state information (CSI), we study upper bounds and lower bounds on the outage capacity and the ergodic capacity. Our studies take into account practical constraints on the transmission/reception duplexing at the relay node and on the synchronization between the source node and the relay node. We also explore power allocation. Compared to the direct transmission and traditional multihop protocols, our results reveal that optimum relay channel signaling can significantly outperform multihop protocols, and that power allocation has a significant impact on the performance.     

Randomized cyclic delay code for cooperative communication systems

We deal here with distributed cooperative communication systems in which a single source transmits its information with the help of multiple relays to a destination. Specifically, we consider decode and forward relay networks based on orthogonal frequency division multiplexing (OFDM). Most previous work needs a priori information for antenna allocation to obtain cooperative diversity advantages. We propose a simple method that does not require additional information in order to coordinate relay transmission. Our main proposal is to retransmit randomly cyclic-shifted sequences of the received symbol at relays. Simulation results verify that full gain in diversity is achieved when the number of subcarriers is sufficiently large.     

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.     

Residual energy based multi-relay selection and power allocation scheme in two-way relay network

In this paper, we have proposed a multi-relay selection and power allocation scheme for two-way relay network which aims to maximize the sum-rate of two-way relay system. First, to prolong network lifetime, a multi-relay selection strategy is proposed in which both channel state information （CSI） and remaining energy （RE） are considered. Next, a multi-relay power allocation algorithm based on convex optimization （MRPA-CO） is presented. To reduce the computational complexity, it can be divided into two steps： terminal nodes power allocation （TNPA） and relay nodes power allocation （RNPA）. Simulation results indicate that the proposed relay selection strategy can significantly prolong network lifetime compared to other relay selection strategies which consider CSI only, and the MRPA-CO algorithm has great advantage over equal power allocation （EPA） on sum-rate in two-way relay network.     

Optimal Amplify‐and‐Forward Scheme for Parallel Relay Networks with Correlated Relay Noise

This paper studies a parallel relay network where the relays employ an amplify‐and‐forward (AF) relaying scheme and are subjected to individual power constraints. We consider correlated effective relay noise arising from practical scenarios when the relays are exposed to common interferers. Assuming that the noise covariance and the full channel state information are available, we investigate the problem of finding the optimal AF scheme in terms of maximum end‐to‐end transmission rate. It is shown that the maximization problem can be equivalently transformed to a convex semi‐definite program, which can be efficiently solved. Then an upper bound on the maximum achievable AF rate of this network is provided to further evaluate the performance of the optimal AF scheme. It is proved that the upper bound can be asymptotically achieved in two special regimes when the transmit power of the source node or the relays is sufficiently large. Finally, both theoretical and numerical results are given to show that, on average, noise correlation is beneficial to the transmission rate — whether the relays know the noise covariance matrix or not.     

Outage analysis of blind cooperative diversity

Mobile users with single antennas can still take advantage of spatial diversity through cooperative space–time‐encoded transmission. In this paper, we considered a scheme in which a relay chooses to cooperate only if its source–relay channel is of an acceptable quality, and we evaluate the usefulness of relaying when the source acts blindly and ignores the decision of the relays whether they may cooperate or not. In our study, we consider the regenerative relays in which the decisions to cooperate are based on a targeted end‐to‐end data rate R. We derived the end‐to‐end outage probability for a transmission rate R and a code rate ρ and look at a power allocation strategy between the source and the relays in order to minimize the end‐to‐end outage probability at the destination for high signal‐to‐noise ratio, by using the golden section search method. Performance results show that the computer simulations‐based results coincide with our analytical results. Copyright © 2011 John Wiley & Sons, Ltd.     

Power Allocation Schemes for Amplify-and-Forward MIMO-OFDM Relay Links

We consider a two-hop MIMO-OFDM communication scheme with a source, an amplify-and-forward relay, and a destination. We examine the possibilities of power allocation (PA) over the subchannels in frequency and space domains to maximize the instantaneous rate of this link if channel state information at the transmitter (CSIT) is available. We consider two approaches: (i) separate optimization of the source or the relay PA with individual per node transmit power constraints and (ii) joint optimization of the source and the relay PA with joint transmit power constraint. We provide the optimal PA at the source (or the relay) with a node transmit power constraint that maximizes the instantaneous rate for a given relay (or source) PA. Furthermore, we show that repeating this separate optimization of the source and the relay PA alternately converges and improves the achievable rate of the considered link. Since the joint optimization of the source and the relay PA is analytically not tractable we use a high SNR approximation of the SNR at the destination. This approximation leads to rates which are quite tight to the optimum.     

Spectral efficient protocols for half-duplex fading relay channels

We study two-hop communication protocols where one or several relay terminals assist in the communication between two or more terminals. All terminals operate in half-duplex mode, hence the transmission of one information symbol from the source terminal to the destination terminal occupies two channel uses. This leads to a loss in spectral efficiency due to the pre-log factor one-half in corresponding capacity expressions. We propose two new half-duplex relaying protocols that avoid the pre-log factor one-half. Firstly, we consider a relaying protocol where a bidirectional connection between two terminals is established via one amplify-and-forward (AF) or decode-and-forward (DF) relay (two-way relaying). We also extend this protocol to a multi-user scenario, where multiple terminals communicate with multiple partner terminals via several orthogonalize-and-forward (OF) relay terminals, i.e., the relays orthogonalize the different two-way transmissions by a distributed zero-forcing algorithm. Secondly, we propose a relaying protocol where two relays, either AF or DF, alternately forward messages from a source terminal to a destination terminal (two-path relaying). It is shown that both protocols recover a significant portion of the half-duplex loss     

Duality and Rate Optimization for Multiple Access and Broadcast Channels With Amplify-and-Forward Relays

In this paper, we consider multihop multiple access (MAC) and broadcast channels (BC) where communication takes place with the assistance of relays that amplify and forward (AF) their received signals. For a two-hop parallel AF relay MAC, assuming a sum power constraint across all relays we characterize optimal relay amplification factors and the resulting optimal rate regions. We find the maximum sum rate and the maximum rate for each user in closed form and express the optimal rate pair (R₁, R₂) that maximizes mu₁R₁+mu₂R₂ as the solution of a pair of simultaneous equations. We find that the parallel AF relay MAC with total transmit power of the two users P₁+P₂=P and total relay power P_R is the dual of the parallel AF relay BC where the MAC source nodes become the BC destination nodes, the MAC destination node becomes the BC source node, the dual BC source transmit power is P_R and the total transmit power of the AF relays is P. The duality means that the rate region of the AF relay MAC with a sum power constraint P on the transmitters is the same as that of the dual BC. The duality relationship is found to be useful in characterizing the rate region of the AF relay BC as the union of MAC rate regions. The duality is established for distributed multiple antenna AF relay nodes and multiple (more than 2) hops as well.     

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.     

On the capacity of the single source multiple relay single destination mesh network

In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We investigate the mesh network when there is one source, one destination, and multiple relays, which we call the single source multiple relay single destination (SSMRSD) mesh network. We derive the asymptotic capacity of the SSMRSD mesh network when the relay powers grow to infinity. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in a Gaussian setting. We then show that this bound is achievable asymptotically using the compress-and-forward strategy for the multiple relay channel. We also perform numerical computations for the case when the relays have finite powers. We observe that even when the relay power is only a few times larger than the source power, the compress-and-forward rate gets close to the capacity. The results indicate the value of cooperation in wireless mesh networks. The capacity characterization quantifies how the relays can cooperate, using the compress-and-forward strategy, to either conserve node energy or to increase transmission rate.     

QoS-guaranteed multi-relay selection and power allocation optimization in cooperative systems

This paper investigates the relay selection and power allocation problem in multi-user based cooperative networks, where intermediate relay nodes help source forward information to destination using decode-and-forward (DF) relaying protocol. Specifically, we propose a novel multi-relay nodes selection strategy taking both instantaneous channel state information (I-CSI) and residual energy into consideration, by which 'emergence' diversity gain can be achieved and the imbalance of resource utilization can be overcome. Besides, using Largangian dual-primal decomposition and subgradient projection approach, an optimal power allocation algorithm at source and cooperative relay nodes is presented with the constraints of each user's individual quality of service (QoS) requirements and system total transmit power. Theoretical analysis and simulation results demonstrate that the proposed scheme can significantly improve energy efficiency, while guaranteeing a good balance between achievable data rate and average network lifetime with relatively low implementation complexity.     

On the performance of distributed space-time coding systems with one and two non-regenerative relays

Spatial diversity can be induced by using wireless relay stations, which cooperate by amplifying and retransmitting the information received from a source to a destination station. In this context we propose a distributed space-time coding (DSTC) system based on the Alamouti codes. We characterize the symbol error rate of systems with one and two non-regenerative relays using bounds and high signal-to-noise ratio (SNR) approximations. The asymptotic (high SNR) symbol error probability formulas are used to optimize the power allocation in the DSTC system. Furthermore, using the asymptotic symbol error probability formulas we argue that the DSTC system has at least 1.5 times the diversity achieved by point-to-point transmissions with the same bandwidth. Simulations show not only that the DSTC outperforms the amplify-and-forward cooperative system with orthogonal transmissions, but also convolutional encoded one-hop transmissions with the same information rate as the DSTC system. Assuming full channel knowledge at the source and the relays, we find an optimum cooperative system by minimizing the bit error rate of the DSTC system with one and two non-regenerative relays subject to fixed transmit energy constraints at each radio. Numerical results show that the DSTC system with two relays performs very close to the optimum cooperative system.