Delay-constrained achievable rate maximization in wireless relay networks with causal feedback

In conventional digital communication systems, the quality of the received signal does not improve beyond a certain level as the channel quality increases. Such kind of quality saturation effect is caused by the unrecoverable quantization errors produced by source coding. The Hybrid Digital-Analog (HDA) transmission, where the quantization errors are transmitted in an analog mode along with the quantized data in a digital mode, has been recognized as an effective technique to combat the quality saturation effect. In this paper, we introduce HDA transmission in Wireless Relay Networks (WRNs) over Rayleigh slow-fading channels to eliminate the quality saturation effect and achieve graceful improvement for the better channel quality. Our goal is to minimize the end-to-end distortion by optimal power allocation. We note that digital-analog power allocation involved in HDA transmission is coupled with source-relay power allocation in WRNs. Therefore, the joint power allocation problem should be considered. We investigate this problem for two kinds of relays in WRNs, i.e., Amplify-and-Forward (AF) relays and Decode-and-Forward (DF) relays. In the case of AF relays, we find that the joint power problem is concave and thus derive the explicit expressions of the optimal solution. In the case of DF relays, we formulate the joint power allocation problem as a nonlinear fractional programming problem and then propose an efficient algorithm to search the optimal solution. Simulation results show that the proposed joint power allocation schemes outperform existing schemes in terms of end-to-end distortion in both WRNs with AF relays and that with DF relays under various channel conditions.

In this paper, we study the power allocation for two-way amplify-and-forward relay networks with asymmetric traffic requirements in cognitive radio. The proposed power allocation scheme is achieved by minimizing the weaker link's individual outage probability under the sum-power constraint and interference power threshold (IPT) constraints of the primary user (PU). Particularly, for the purpose of accomplishing the power allocation more realistically, the interference to each other between PU and secondary user (SU) and relay is taken into consideration. And the closed-form solution is derived for the optimum power allocation scheme of each case. Numerical results confirm that the proposed scheme improves the system performance compared with the equal power allocation scheme under various traffic requirements. The outage probability of SU communication is limited by the IPT constraints of PU and is affected significantly by the IPT level of PU. Furthermore, regardless of the symmetric or asymmetric traffic requirements, the proposed power allocation scheme is more suitable for cognitive two-way relaying networks.

We investigate a power allocation optimization problem under the scenario of multiple cooperative relays and one destination with multiple receiving antennas. We consider the relay protocol, decode and forward (DAF). An optimal power allocation scheme (OPA), through singular value decomposition (SVD) of the channel matrix, is developed among the relay nodes under a certain power constraint to achieve the maximum channel capacity. The expression of the optimal power allocation coefficient is derived using Lagrange multiplier. Simulation results show that the OPA can obtain higher capacity gain and lower outage probability comparing with the uniform power allocation (UPA) scheme. Moreover, we show that the OPA with DAF has better performance than it with AAF.

In this paper, the error performance analysis of an amplify-and-forward (AF) relay-aided cooperative multi-antenna system using spatial modulation (SM) over Rayleigh channels is presented. The SM is a simple and spectral efficient modulation technique that can increase the data rate by using input data bits to select a transmit antenna to send a constellation point. The relay transmission deploying SM not only can enhance the coverage and but also can improve the spectral efficiency. In the performance analysis, the overall average bit error rate (BER), which is related to the error probability of an antenna index detection ( $P_{a}$ ) and the error probability of symbol detection ( $P_{d}$ ) given transmit antenna index, is analyzed. With the derivation of the probability density function and the moment generating function of output signal-to-noise ratio (SNR), closed-form expressions of $P_{a}$ and $P_{d}$ are obtained to compute the overall BER. With the obtained BER expression, asymptotical BER expressions are derived to reveal the BER performance of the system at high SNR. By minimizing the asymptotical BER, a suboptimal power allocation (PA) scheme is developed. The diversity gain is analyzed at high SNR. The results indicate that the cooperative AF-SM can achieve full diversity order. Simulation results verify the effectiveness of the theoretical BER analysis, and the cooperative AF-SM with PA scheme outperforms upon the equal PA scheme.

In this paper, the impact of diversity order on symbol error rate (SER) performance is investigated for the cooperative amplify-and-forward (AF) multiple-input-and-multiple-output (MIMO) relaying system under the average power scaling (APS) constraints. Furthermore, the optimal power allocation (OPA) scheme is proposed based on the criterion of maximizing signal-to-noise-ratio (SNR). Through the SER analysis and numerical results, it can be shown that the diversity order in AF MIMO relaying system under APS is M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> (the number of transmitting antennas) when uniform power allocation (UPA) is adopted. Given M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> receiving antennas at the relay nodes, the proposed novel OPA scheme can not only reduce the SER but also improve the diversity order efficiently up to M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">R</sub> even when M <sub xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">T</sub> = 1.

In this paper, we analyze and compare the outage probabilities of selection relaying protocols for cooperative communications in wireless networks. Depending on the quality of the source-relay channel, the relay may choose either decode-and-forward (DF), amplify-and-forward (AF), or direct-transmission (DT) to forward signals. It turns out that in terms of outage probability, two selection relaying protocols are better than others: either selection between DF and AF protocols (DF-AF) or selection between DF and DT protocols (DF-DT). We show that with an equal power allocation at the source and the relay, both the DF-AF and DF-DT selection protocols have the same asymptotic outage probability. However, with an optimum power allocation strategy, the DF-AF selection is in general better than the DF-DT selection. Simulations are also presented to validate the analytical results.

In this letter, the outage probabilities of selection relaying protocols are analyzed and compared for cooperative wireless networks. It is assumed that both source and relay use equal allocated time in transmission. Depending on the quality of the source-relay channel, the relay may choose either Decode-and-Forward (DF), Amplify-and-Forward (AF), or Direct-Transmission (DT) to forward signals. It turns out that in terms of outage probability, two selection relaying schemes are better than others: selecting between DF and AF protocols (DF-AF) or selecting between DF and DT protocols (DF-DT). It is shown that with an equal power allocation, both of the DF-AF and DF-DT selection relaying protocols have the same asymptotic outage probability. However, with an optimum power allocation strategy, the DF-AF selection scheme is in general better than the DF-DT selection scheme. Note that the optimum power allocations depend on channel variances, not on instantaneous channel gains. When the quality of the relay-destination link is much better than that of the source-relay link, observed from simulation, the outage probability of the DF-AF selection protocol with its optimum power allocation is 1.5 dB better than that of the DF-DT selection with its own optimum power allocation. Extensive simulations are presented to validate the analytical results.

We propose a link adaptation and selection method for the links constituting an orthogonal frequency division multiplexing (OFDM) based wireless relay network. The proposed link adaptation and selection method selects the forwarding, modulation, and channel coding schemes providing the highest end-to- end throughput and decides whether to use the relay or not. The link adaptation and selection is done for each sub-channel based on instantaneous signal to interference plus noise ratio (SINR) conditions in the source-to-destination, source-to-relay and relay- to-destination links. The considered forwarding schemes are amplify and forward (AF) and simple adaptive decode and forward (DF). Efficient adaptive modulation and coding decision rules are provided for various relaying schemes. The proposed end-to-end link adaptation and selection method ensures that the end-to-end throughput is always larger than or equal to that of transmissions without relay and non-adaptive relayed transmissions. Our evaluations show that over the region where relaying improves the end- to-end throughput, the DF scheme provides significant throughput gain over the AF scheme provided that the error propagation is avoided via error detection techniques. We provide a frame structure to enable the proposed link adaptation and selection method for orthogonal frequency division multiple access (OFDMA)-time division duplex relay networks based on the IEEE 802.16e standard.

In this paper, we study the power allocation of suggested cognitive relay network model to minimize the system outage probability subject to total and individual power constraints for cognitive relays and subject to interference constraints for primary user nodes. In suggested model, a source is assisted by cognitive relay nodes which allow coexisting with primary user nodes by imposing severe constraints on the transmission power so that they operate below the noise floor of primary nodes. A relay transmission scheme, namely, amplify-and-forward (AF) is considered. We present an optimal power allocation (OPA) scheme to minimize the system outage probability, based on complete channel state information among the source, destination and relay nodes and mean channel gains between primary user nodes and cognitive relays. The analytical power allocation strategies have been validated through numerical simulations. The results indicate that the AF with OPA has significantly better outage behavior and average throughput than AF scheme.

This paper presents an optimal energy-efficient power allocation scheme for a point-to-point multicarrier link over frequency-selective fading channel subject to a delay-outage probability constraint. For a target delay-outage limit, the energy efficiency (EE) objective function is formulated as the ratio of the achieved link effective capacity to the total expenditure power, expressed in units of b/J/Hz. We first prove that this objective function is quasi-concave in the transmission power, and, hence, the global maximum solution of the underlying optimization problem can be obtained using fractional programming. Subsequently, we develop a two-step optimal power allocation algorithm by first obtaining the average sum power level corresponding to the maximum achievable EE, followed by jointly distributing this obtained average power over time and frequency. Analytical results show that the EE-based power allocation has a structure similar to that of the QoS-driven spectral-efficient scheme, but with a different cut-off threshold below which no transmission power is allocated. Simulation results show that the proposed joint optimal power allocation scheme provides significant EE gains over the simple independent subcarrier optimization scheme, where these performance advantages become more pronounced with tighter delay constraints and in fading channels with more severe frequency selectivity.

In a relay network with a single source-destination pair, we examine the achievable rates with amplify-and-forward (AF) relaying strategy. Motivated by applications in sensor networks, we consider power-constrained networks with large bandwidth resources and a large number of nodes. We show that the AF strategy does not necessarily benefit from the large available bandwidth. We characterize the optimum AF bandwidth and show that transmitting in the optimum bandwidth allows the network to operate in the linear regime where the achieved rate increases linearly with the available network power. We then present the optimum power allocation among the AF relays. The solution, which can be viewed as a form of maximum ratio combining, indicates the favorable relay positions in the network. Motivated by the large bandwidth resources we further consider a network that uses orthogonal transmissions at the nodes. While the above result for the optimum bandwidth still holds, a different set of relays should optimally be employed. In this case, the relay power solution can be viewed as a form of water-filling. The optimum AF bandwidth and the relay powers can be contrasted to the decode-and-forward (DF) solution. In a network with unconstrained bandwidth, the DF strategy will operate in the wideband regime to minimize the energy cost per information bit (S. Verdu, 2002), (O. Oyman et al., 2004). The wideband DF strategy requires again a different choice of relays; in the case of orthogonal signaling, the data should be sent through only one DF relay (I. Maric et al., 2004). Thus, in general, in a large scale network, a choice of a coding strategy goes beyond determining a coding scheme at a node; it also determines the operating bandwidth as well as the best distribution of the relay power.

We consider the secure transmission of information over an ergodic fading channel in the presence of an eavesdropper. Our eavesdropper can be viewed as the wireless counterpart of Wyner's wiretapper. The secrecy capacity of such a system is characterized under the assumption of asymptotically long coherence intervals. We analyze the full channel state information (CSI) case, where the transmitter has access to the channel gains of the legitimate receiver and eavesdropper, and the main channel CSI scenario, where only the legitimate receiver channel gain is known at the transmitter. In each scenario, the secrecy capacity is obtained along with the optimal power and rate allocation strategies. We then propose a low-complexity on/off power allocation strategy that achieves near-optimal performance with only the main channel CSI. More specifically, this scheme is shown to be asymptotically optimal as the average SNR goes to infinity, and interestingly, is shown to attain the secrecy capacity under the full CSI assumption. Remarkably, our results reveal the positive impact of fading on the secrecy capacity and establish the critical role of rate adaptation, based on the main channel CSI, in facilitating secure communications over slow fading channels.

In this study, the authors consider the secrecy communication of one source-destination pair in a wireless multi-hop relay network, where each node is equipped with multiple antennas. They use the method of interference alignment for secrecy transmission in the presence of an eavesdropper. Firstly, they propose a decode-and-forward (DF) relaying protocol and give a new result on the joint probability density function of the first, second, horizontal ellipsis , kth ($k=1, 2,\ldots $k=1,2, horizontal ellipsis ) largest eigenvalues of the complex Wishart matrices $\boldsymbol{H} \boldsymbol{H}H$HHH, where $\boldsymbol{H}$H is an matrix whose elements are independent identically distributed complex Gaussian variables with zero mean and unit variance. They then utilise this result to characterise the legitimate outage probability and the diversity order of the proposed DF protocol. The case where the relay works in the amplify-and-forward (AF) mode is considered at last, and the diversity order of the proposed AF protocol is given.

We consider a parallel relay communication network based on the nonorthorgonal amplify-and-forward protocol. We design two optimal power allocation schemes: separate power allocation (SPA) of the relays using the improved water-filling algorithm and joint power allocation (JPA) of the source and relays using convex optimization algorithm. Simulation results show that, in the fading channels with path loss, the proposed JPA and SPA have better mutual information performances than equal power allocation and direct transmission without relay.

In this paper, we study relay selection and power allocation in multiple decode-and-forward (DF) relay assisted OFDM cognitive radio (CR) relay networks. We consider the scenario where only the fading statistics between the cognitive and primary users are known at the CR transmitters. The objective of resource allocation is to maximize the instantaneous capacity of the CR network when the primary users are subject to an average interference constraint and the CR transmitters are subject to maximum transmit power constraint. The joint optimization is a mixed binary integer programming problem which is NP-hard. Thus, we propose a simple suboptimal resource allocation method.