Optimal simultaneous wireless information and energy transfer in OFDMA decode-and-forward relay networks

In this paper, we consider simultaneous wireless information and energy transfer in an orthogonal-frequency-division-multiple-access decode-and-forward relay network, in which an energy-constrained relay node harvests energy from a source node and uses the harvested energy to forward information to multiple destination nodes. Our objective is to maximize the end-to-end sum rate by resource allocation, subject to transmit power constraint at the source and energy-harvesting (EH) constraint at the relay. A non-convex and mixed-integer programming (MIP) problem is formulated to optimize time-switching (TS) ratios of EH and information decoding at the relay, TS ratio of information transmission from relay to destinations, subcarrier allocation as well as power allocation (PA) over all subcarriers at source and relay. We propose to decouple this problem into a convex problem and an MIP problem in fractional form. To solve the MIP problem, we transform it into an equivalent optimization problem in subtractive form which has a tractable solution. As a result, we propose a novel scheme to achieve jointly optimal TS ratios, subcarrier allocation and PA. Simulation results verify the optimality of our proposed resource allocation scheme.     

Adaptive Cooperative Decode-and-Forward Transmission with Power Allocation Under Interference Constraint

In this paper, we examine an adaptive decode-and-forward cooperative protocol under interference constraint. In the proposed protocol, relying on the obtained instantaneous signal-to-noise ratios (SNRs), a direct link or relay link is used to transmit data from the secondary source to the secondary destination. In addition, once the relay link is used, the secondary source and relay must adapt their transmit power to maximize the instantaneous SNR of this link. To evaluate the performance of the proposed protocol, we derive closed-form lower-bound and upper-bound expressions for the outage probability over Rayleigh fading channel. Finally, various Monte-Carlo simulations are presented to verify our analysis and compare the performance of the proposed protocol with that of the direct transmission protocol in underlay cognitive network.     

Joint Optimization of Source Power Allocation and Relay Beamforming in Multiuser Cooperative Wireless Networks

Relay beamforming techniques have been shown to significantly enhance the sum capacity of a multiuser cooperative wireless network through the optimization of the relay weights, where concurrent communications of multiple source-destination pairs are achieved via spatial multiplexing. Further optimization of the transmit power allocation over the source nodes is expected to improve the network throughput as well. In this paper, we maximize the sum capacity of a multiuser cooperative wireless network through the joint optimization of power allocation among source nodes and relay beamforming weights across the relay nodes. We consider a two-hop cooperative wireless network, consisting of single-antenna nodes, in which multiple concurrent links are relayed by a number of cooperative nodes. When a large number of relay nodes are available, the channels of different source-destination pairs can be orthogonalized, yielding enhanced sum network capacity. Such cooperative advantage is particularly significant in high signal-to-noise ratio (SNR) regime, in which the capacity follows a logarithm law with the SNR, whereas exploiting spatial multiplexing of multiple links yields capacity increment linear to the number of users. However, the capacity performance is compromised when the input SNR is low and/or when the number of relay nodes is limited. Joint optimization of source power allocation and relay beamforming is important when the input SNR and/or the number of relay nodes are moderate or the wireless channels experience different channel variances. In these cases, joint optimization of source power and distributed beamforming weights achieves significant capacity increment over both source selection and equal source power spatial multiplexing schemes. With consideration of the needs to deliver data from each source node, we further examine the optimization of global sum capacity in the presence of individual capacity requirements by maximizing sum capacity of the network subject to a minimum capacity constraint over each individual user.     

Joint optimization of power allocation and relay location for regenerative relaying with multi‐antenna reception at destination

We consider joint power allocation (PA) and relay positioning in a dual‐hop regenerative relay system with multiple antennas equipped at the destination. With a fixed relay location, an adaptive PA strategy at the source and relay under a sum power constraint that minimizes the system outage probability is presented. With a fixed PA strategy, the optimal relay location is derived. We then propose to jointly optimize PA and relay location. It is shown that employing more destination antennas and/or choosing an appropriate relay location can significantly save the power needed at the relay. Numerical results are presented to demonstrate the performance of the proposed PA and relay positioning algorithms. Copyright © 2011 John Wiley & Sons, Ltd.     

Joint Source and Relay Precoder Design in Amplify-and-Forward MIMO Relay Systems with Direct Link

This paper investigates the precoder design problem in a two-hop amplify-and-forward multiple-input-multiple-output relay system. Many previous works on this problem are based on the minimum mean-square error criterion and the presence of a direct link between the source and the destination is ignored. In this paper, we propose a new method for joint source and relay precoder design based on maximizing the mutual information between the source and the destination, taking both the relay link and the direct link into account. In contrast to previous works, which consider the transmit power constraints of the source and the relay independently, we assume a total power constraint on the sum transmit power of the source and the relay instead to study also the optimal power distribution over the two nodes. A constrained optimization problem with respect to the unknown source precoder matrix and relay precoder matrix is then formulated, which is nonconvex and very difficult to solve directly. We propose a structural constraint on the precoders by analyzing the structure of the problem and referring to related works. With the proposed precoders’ structure and by applying the Hadamard’s inequality, the original problem is simplified from a matrix-valued problem to a scalar-valued one. However, the new scalar-valued problem is still nonconvex and we manage to convert it into two subproblems and solve it in an iterative fashion. By using the Karash–Kuhn–Tucker (KKT) conditions, we give out the closed-form solutions to the subprobelms. Simulation results demonstrate that the proposed design method converges rapidly and significantly outperforms the existing methods.     

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     

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.     

Resource allocations in relay‐assisted cellular networks

In a relay‐assisted cellular network, the transmission mode (either direct transmission or relaying) and the transmit power of the source and relay nodes affect not only transmission rates of individual links but also the rates of other links sharing the same channel. In this paper, we propose a cross‐layer design that jointly considers the transmission mode/relay node selection (MRS) with power allocation (PA) to optimize the system rate. We first formulate an optimization problem for a cellular system, where the same frequency channel can be reused in different cells. A low complexity heuristic MRS scheme is proposed on the basis of the link and interference conditions of the source and potential relay nodes. Given the transmission mode and relay node (if the relaying mode is chosen) of each link, the transmit power of the source and relay nodes can be solved by geometric programming. This method for MRS and PA can achieve a close‐to‐optimum performance, but implementing the PA requires heavy signalling exchanged among cells. To reduce the signalling overheads, we finally proposed a heuristic and distributed method for MRS and PA inspired by some asymptotic analysis. Numerical results are conducted to demonstrate the rate performance of the proposed methods.Copyright © 2013 John Wiley & Sons, Ltd.     

Resource optimization for dual-hop device to device networks

In this paper, we consider an orthogonal frequency division multiplexing based device to device network. The communication between source and destination is facilitated by a dual-hop transmission under amplify and forward relaying protocol. The sum throughput of the system is maximized with joint optimization over power allocation at each transmitting node and sub-carrier pairing over two hops. A dual decomposition based solution is proposed subject to separate transmit power constraint at each node. Simulation results are presented to validate the performance of the proposed algorithm where the results are compared with the existing works in literature as well as with a sub-optimal power optimization solution.     

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.     

基于接收信噪比和网络寿命的最优中继选择

为了增大网络寿命,降低误符号率,优化无直传链路协作通信系统的性能,本文提出基于接收信噪比和网络寿命的最优中继选择算法。由于网络寿命的问题无法直接求解,将其转化为中继节点剩余能量与目的节点达到接收信噪比门限时发射功率的比值。首先计算各个中继在目的节点的接收信噪比,将大于信噪比门限加入候选中继,然后依次计算候选中继的联合优化函数值并排序,值最大者即为最优中继。理论推导了系统误符号率的上下界,仿真表明理论值与仿真值较为吻合,验证了系统在保证较低误符号率的基础上延长了网络寿命。     

Transmit Antenna Selection in the Alamouti-Coded MIMO Relay Systems

In the Alamouti-coded multiple-input multiple-output relay systems, we consider selecting two transmit antennas from all available antennas, at the source and relay respectively, to maximize received signal-to-noise ratio (SNR) at the destination. Since the optimal antenna selection rule is intractable, we propose three suboptimal antenna selection rules (rule one, two and three). While these rules all select two best antennas at the relay to maximize the SNR of relay-destination link. They have different selection criteria at the source. Rule one maximizes the SNR of source-relay link but ignores source–destination link. Oppositely, rule two maximizes the SNR of source–destination link but ignores source-relay link. Rule three considers both links together. We derive the closed-form outage probability expressions of rule one and two, and find an upper bound for the outage probability of rule three. The analysis results show that rule one and two cannot achieve full diversity order, and rule three can. Simulation results verify the analysis results.     

Exact and asymptotic BEP of cooperative DS-CDMA systems using decode and forward relaying in the presence of multipath propagation

In this paper, we derive the bit error probability (BEP) of cooperative DS-CDMA systems using decode and forward (DF) relaying. We consider a conventional DF protocol where all the relays that have correctly decoded transmit and a selective DF (S-DF) protocol where we activate only the relay that offers the best instantaneous signal to noise ratio (SNR) of the relay to destination link among the relays that have correctly decoded. The derived results are valid for any multipath intensity profile of the channel, any path delays and take into account the correlation of the multipath gains.     

Effects of Nodes Geometry and Power Allocation in Space-Time Coded Cooperative Wireless Systems

Cooperative communications are effective in improving the performance and extend the coverage of wireless networks. One issue is to find proper methods to allocate cooperative nodes. In this paper we investigate the effects of relay position and power allocation strategy in cooperative communications employing space-time codes (STCs). We consider non-ideal links between source, relay, and destination enabling the analysis of relay allocation problem based on the performance of each link in realistic scenarios. The frame error rate for various channel conditions, available diversity, relay positions, and transmitted power levels is obtained. Both the situation of balanced and unbalanced transmit power levels for source, relay, and destination are compared. Cooperative pragmatic STCs in block fading channel (BFC) are considered for our analysis. The results provide insight on how to allocate relay nodes based on geometry, link quality, and transmitted power considerations.     

Hybrid Multihop Relay Protocol Using Dynamic Power Allocation for LTE-Advanced System

In this paper, an adaptive relay scheme of hybrid relay system is proposed based on channel state information of the received signal-to-noise ratio (SNR) at the relay node. hybrid relay system is comprised of amplify-and-forward, decode-and-forward and demodulate-and-forward together in cooperative networks. The relay protocols are selected adaptively, on the basis of power allocation (PA) constraint, or the SNR value at previous hop. Thus multihop performance of the relay system can be improved by applying PA allocation scheme. The simulation results show that the performance of the novel hybrid relay protocol can be improved significantly compared to the conventional hybrid system in terms of error performance and link efficiency.     

Cross-layer optimization for 3-D video transmission over cooperative relay systems

The rate budget constraint and the available instantaneous signal-to-noise ratio of the best relay selection in cooperative systems can dramatically impact the system performance and complexity of video applications, since they determine the video distortion. By taking into account these constrained factors, we first outline the signal model and formulate the system optimization problem. Next, we propose a new approach to cross-layer optimization for 3-D video transmission over cooperative relay systems. We propose procedures for estimation of the end-to-end instantaneous signal-to-noise ratio using an estimate of the available instantaneous signal-to-noise ratios between the source–destination, and source–relay–destination before starting to send the video signal to the best relay and destination. A novel approach using Lagrange multipliers is developed to solve the optimum bit allocation problem. Based on the rate budget constraint and the estimated the end-to-end instantaneous signal-to-noise ratio, the proposed joint source–channel coding (JSCC) algorithm simultaneously assigns source code rates for the application layer, the number of high and low priority packets for the network layer, and channel code rates for the physical layer based on criteria that maximize the quality of video, whilst minimizing the complexity of the system. Finally, we investigate the impact of the estimated the end-to-end instantaneous signal-to-noise ratio on the video system performance and complexity. Experimental results show that the proposed JSCC algorithm outperforms existing algorithms in terms of peak signal-to-noise ratio. Moreover, the proposed JSCC algorithm is found to be computationally more efficient since it can minimize the overall video distortion in a few iterations.     

Subcarrier pairing for amplify-and-forward and decode-and-forward OFDM relay links

We consider a two-hop relay link in which orthogonal frequency division multiplexing (OFDM) is used on both hops. Under a joint sum-power constraint, our aim is to allocate power over subcarriers on the two hops such that the instantaneous rate of the relay link is maximized. Ordered subcarrier pairing (OSP) has been proposed in the literature to further improve the relay link rate; however, the optimality of OSP has been proven only for equal power allocation and the proof of its optimality under optimal power allocation has not been available yet. In this letter, we will provide our proof which verifies that OSP is optimal for both amplify-and-forward (AF) and decode-and-forward (DF) relay links when optimal power allocation is applied.     

Design of Distributed Beamforming for Dual‐Hop Multiple‐Access Relay Networks

This paper studies a dual‐hop multiple‐access relay network where two independent source nodes transmit information to a common destination node with the aid of multiple single‐antenna amplify‐and‐forward relays. Each relay node is subject to an individual power constraint. We focus on the design of distributed beamforming schemes for the relays to support the transmission rate requirements of the two sources. To this end, we first characterize the achievable rate region for this network via solving a sequence of corner point optimization problems proposed in this paper. We also develop several low‐complexity suboptimal schemes in closed form. Two inner bounds of the achievable rate region are theoretically shown to be approximately optimal in two special scenarios. Finally, numerical results demonstrate the effectiveness of our proposed approaches.     

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     

Subcarrier-pair Based Power Allocation for Cooperative OFDM AF Multi-Relay Networks

For conventional subcarrier pairing schemes in cooperative orthogonal frequency division multiplexing amplify and forward multi-relay networks, to avoid interference, each subcarrier pair (SP) is assigned to only one relay. Over a specific subcarrier, the destination receives signals transmitted from only one relay. In our subcarrier pairing scheme, we assign each SP to all the relays. Thus, over a specific subcarrier, the destination receives signals transmitted from all the relays. Since it is assumed that there exists the direct link from the source to the destination, we assume that the source also transmits signals during the second time slot for the direct transmission mode. We propose an enhanced joint subcarrier pairing and power allocation optimization scheme which maximizes the transmission rate subject to total network power constraint. The problem is simplified and solved by using dual method. It is shown from simulation results that our proposed scheme outperforms the other schemes.