Trellis coded modulation scheme for the fading relay channel

A decode and forward protocol based Trellis Coded Modulation (TCM) scheme for the half-duplex relay channel, in a Rayleigh fading environment, is presented. The proposed scheme can achieve any spectral efficiency greater than or equal to one bit per channel use (bpcu). A near-ML decoder for the suggested TCM scheme is proposed. It is shown that the high Signal to Noise Ratio (SNR) performance of this near-ML decoder approaches the performance of the optimal ML decoder. Based on the derived Pair-wise Error Probability (PEP) bounds, design criteria to maximize the diversity and coding gains are obtained. Simulation results show a large gain in SNR for the proposed TCM scheme over uncoded communication as well as the direct transmission without the relay.

Optimal capacity relay node placement in a multi-hop network on a line

We use information theoretic achievable rate formulas for the multi-relay channel to study the problem of optimal placement of relay nodes along the straight line joining a source node and a destination node. The achievable rate formulas that we utilize are for full-duplex radios at the relays and decode-and-forward relaying. For the single relay case, and individual power constraints at the source node and the relay node, we provide explicit formulas for the optimal relay location and the optimal power allocation to the source-relay channel, for the exponential and the power-law path-loss channel models. For the multiple relay case, we consider exponential path-loss and a total power constraint over the source and the relays, and derive an optimization problem, the solution of which provides the optimal relay locations. Numerical results suggest that at low attenuation the relays are mostly clustered close to the source in order to be able to cooperate among themselves, whereas at high attenuation they are uniformly placed and work as repeaters. We also prove that a constant rate independent of the attenuation in the network can be achieved by placing a large enough number of relay nodes uniformly between the source and the destination, under the exponential path-loss model with total power constraint.

BER Analysis of Space Shift Keying in Cooperative Multi-hop Multi-branch DF Relaying

Space shift keying (SSK) is an attractive modulation technique for multi-antenna communications. In SSK, only one among the available transmit antennas is activated during one channel use, and the index of the chosen transmit antenna conveys information. In this paper, we analyze the performance of SSK in multi-hop, multi-branch cooperative relaying systems. We consider the decode-and-forward relaying protocol, where a relay forwards the decoded symbol if it decodes the symbol correctly from the received signal. We derive closed-form expressions for the end-to-end bit error rate of SSK in this system. Analytical and simulation results match very well.

Secure Transmission in Cooperative Networks with Weak Eavesdroppers

In this letter, we propose a scheme to improve the secrecy rate of cooperative networks using Analog Network Coding (ANC). ANC mixes the signals in the air; the desired signal is then separated out, from the mixed signals, at the legitimate receiver using techniques like self interference subtraction and signal nulling, thereby achieving better secrecy rates. Assuming global channel state information, memoryless adversaries and the decode-and-forward strategy, we seek to maximize the average secrecy rate between the source and the destination, subject to an overall power budget. Then, exploiting the structure of the optimization problem, we compute its optimal solution. Finally, we use numerical evaluations to compare our scheme with the conventional approaches.

Optimal power allocation for protective jamming in wireless networks: A flow based model

We address the problem of passive eavesdroppers in multi-hop wireless networks using the technique of friendly jamming. The network is assumed to employ Decode and Forward (DF) relaying. Assuming the availability of perfect channel state information (CSI) of legitimate nodes and eavesdroppers, we consider a scheduling and power allocation (PA) problem for a multiple-source multiple-sink scenario so that eavesdroppers are jammed, and source-destination throughput targets are met while minimizing the overall transmitted power. We propose activation sets (AS-es) for scheduling, and formulate an optimization problem for PA. Several methods for finding AS-es are discussed and compared. We present an approximate linear program for the original nonlinear, non-convex PA optimization problem, and argue that under certain conditions, both the formulations produce identical results. In the absence of eavesdroppers' CSI, we utilize the notion of Vulnerability Region (VR), and formulate an optimization problem with the objective of minimizing the VR. Our results show that the proposed solution can achieve power-efficient operation while defeating eavesdroppers and achieving desired source-destination throughputs simultaneously. (C) 2015 Elsevier B.V. All rights reserved.

Sum Secrecy Rate in Multicarrier DF Relay Beamforming

In this paper, we study sum secrecy rate in multicarrier decode-and-forward relay beamforming. We obtain the optimal source power and relay weights on each subcarrier which maximize the sum secrecy rate. For a given total power on a given subcarrier k, P-0(k), we reformulate the optimization problem by relaxing the rank-1 constraint on the complex positive semidefinite relay weight matrix, and solve using semidefinite programming. We analytically prove that the solution to the relaxed optimization problem is indeed rank 1. We show that the subcarrier secrecy rate, R-s (P-0(k)), is a concave function in total power P-0(k) if R-s (P-0(k)) > 0 for any P-0(k) > 0. Numerical results show that the sum secrecy rate with optimal power allocation across subcarriers is more than the sum secrecy rate with equal power allocation. We also propose a low complexity suboptimal power allocation scheme which outperforms equal power allocation scheme.

Spectrum efficient cooperative relaying based on outage-multiplexing tradeoff analysis.

Spectrum efficient multiple relay selection strategy for two-hop cooperative decode-and-forward relay networks is proposed for the case when the sum power among all relay nodes is limited. Based on the outage-multiplexing tradeoff (OMT), the number of active relay nodes is maximized so that the resulting sum-relay capacity is maximized while each relay outage capacity remains greater than or equal to a certain target level. Using asymptotic analysis, it is shown that for the proposed OMT relaying strategy the associated multiplexing and cooperative system diversity gains improve proportionally with the number of active relay nodes. It is also shown analytically that the proposed OMT relaying outperforms the conventional opportunistic single relaying in terms of the sum-relay capacity.

Generalized Selection Combining in Cognitive MIMO Relay Networks

We propose transmit antenna selection with receive generalized selection combining (TAS/GSC) in dual-hop cognitive decode-and-forward (DF) relay networks for reliability enhancement and interference relaxation. In this paradigm, a single antenna which maximizes the receive signal-to-noise ratio (SNR) is selected at the secondary transmitter and a subset of receive antennas with the highest SNRs are combined at the secondary receiver. To demonstrate the impact of multiple primary users on the cognitive relay network, we derive new closed-form expressions for the exact and asymptotic outage probability with TAS/GSC in the secondary network. Several important design insights are reached. We corroborate that the full diversity gain is achieved, which is entirely determined by the total number of antennas in the secondary network. The negative impact of the primary network on the secondary network is reflected in the SNR gain.

Ergodic Capacity of Cognitive TAS/GSC Relaying in Nakagami-m Fading Channels

We examine the impact of transmit antenna selection with receive generalized selection combining (TAS/GSC) for cognitive decode-and-forward (DF) relaying in Nakagami-m fading channels. We select a single transmit antenna at the secondary transmitter which maximizes the receive signal-to-noise ratio (SNR) and combine a subset of receive antennas with the largest SNRs at the secondary receiver. In an effort to assess the performance, we first derive the probability density function and cumulative distribution function of the end-to-end SNR using the moment generating function. We then derive new exact closed-form expression for the ergodic capacity. More importantly, by deriving the asymptotic expression for the high SNR approximation of the ergodic capacity, we gather deep insights into the high SNR slope and the power offset. Our results show that the high SNR slope is 1/2 under the proportional interference power constraint. Under the fixed interference power constraint, the high SNR slope is zero.

Transmit Antenna Selection for Interference Management in Cognitive Relay Networks

We propose transmit antenna selection (TAS) in decode-and-forward (DF) relaying as an effective approach to reduce the interference in underlay spectrum sharing networks with multiple primary users (PUs) and multiple antennas at the secondary users (SUs). We compare two distinct protocols: 1) TAS with receiver maximal-ratio combining (TAS/MRC) and 2) TAS with receiver selection combining (TAS/SC). For each protocol, we derive new closed-form expressions for the exact and asymptotic outage probability with independent Nakagami-m fading in the primary and secondary networks. Our results are valid for two scenarios related to the maximum SU transmit power, i.e., P, and the peak PU interference temperature, i.e., Q. When P is proportional to Q, our results confirm that TAS/MRC and TAS/SC relaying achieve the same full diversity gain. As such, the signal-to-noise ratio (SNR) advantage of TAS/MRC relaying relative to TAS/SC relaying is characterized as a simple ratio of their respective SNR gains. When P is independent of Q, we find that an outage floor is obtained in the large P regime where the SU transmit power is constrained by a fixed value of Q. This outage floor is accurately characterized by our exact and asymptotic results.

A new look at dual-hop relaying: Performance limits with hardware impairments

Physical transceivers have hardware impairments that create distortions which degrade the performance of communication systems. The vast majority of technical contributions in the area of relaying neglect hardware impairments and, thus, assume ideal hardware. Such approximations make sense in low-rate systems, but can lead to very misleading results when analyzing future high-rate systems. This paper quantifies the impact of hardware impairments on dual-hop relaying, for both amplify-and-forward and decode-and-forward protocols. The outage probability (OP) in these practical scenarios is a function of the effective end-to-end signal-to-noise-and-distortion ratio (SNDR). This paper derives new closed-form expressions for the exact and asymptotic OPs, accounting for hardware impairments at the source, relay, and destination. A similar analysis for the ergodic capacity is also pursued, resulting in new upper bounds. We assume that both hops are subject to independent but non-identically distributed Nakagami-m fading. This paper validates that the performance loss is small at low rates, but otherwise can be very substantial. In particular, it is proved that for high signal-to-noise ratio (SNR), the end-to-end SNDR converges to a deterministic constant, coined the SNDR ceiling, which is inversely proportional to the level of impairments. This stands in contrast to the ideal hardware case in which the end-to-end SNDR grows without bound in the high-SNR regime. Finally, we provide fundamental design guidelines for selecting hardware that satisfies the requirements of a practical relaying system.

Performance Analysis of Randomized Distributed Space-Time Codes over Composite Gamma/Lognormal Fading Channels

This work investigates the end-to-end performance of randomized distributed space-time codes with complex Gaussian distribution, when employed in a wireless relay network. The relaying nodes are assumed to adopt a decode-and-forward strategy and transmissions are affected by small and large scale fading phenomena. Extremely tight, analytical approximations of the end-to-end symbol error probability and of the end-to-end outage probability are derived and successfully validated through Monte-Carlo simulation. For the high signal-to-noise ratio regime, a simple, closed-form expression for the symbol error probability is further provided.

Interference Investigation for Cognitive Spectrum Sharing Networks with Reactive DF Relay Selection

Cognitive radio (CR) with spectrum-sharing has been envisioned as emerging technology for the next generation of mobile and wireless networks by allowing the unlicensed customers simultaneously utilize the licensed radio frequency spectrums. However, the CR has faced some practical challenges due to its deduced system performance as compared to non spectrum-sharing counterpart. In this paper, we therefore consider the potential of incorporating the cooperative communications into CR by introducing the concept of reactive multiple decode-and-forward (DF) relays. In particular, we derive new results for exact and asymptotic expressions for the performance of cognitive relay networks with K-th best relay selection. Our novel results have exhibited the significance of using relay networks to enhance the system performance of CR.

Transmit Antenna Selection in Cognitive MIMO Relaying with Multiple Primary Transceivers

We consider transmit antenna selection (TAS) in cognitive multiple-input multiple-output (MIMO) relay networks, as an interference-aware design for secondary users (SUs) to ensure power and interference constraints of multiple primary users (PUs). In doing so, we derive new exact and asymptotic expressions for the outage probability of TAS with maximal ratio combining (TAS/MRC) and with selection combining (TAS/SC) over Rayleigh fading. The proposed analysis and simulations highlight that TAS/MRC and TAS/SC with decode-and-forward relaying achieve the same diversity order in cognitive MIMO networks, which scales with the minimum number of antennas at the SUs. Furthermore, we accurately characterize the outage gap between TAS/MRC and TAS/SC relaying as a concise ratio of their array gains.

Relay Selection for Security Enhancement in Cognitive Relay Networks

This letter proposes several relay selection policies for secure communication in cognitive decode-and-forward (DF) relay networks, where a pair of cognitive relays are opportunistically selected for security protection against eavesdropping. The first relay transmits the secrecy information to the destination,
and the second relay, as a friendly jammer, transmits the jamming signal to confound the eavesdropper. We present new exact closed-form expressions for the secrecy outage probability. Our analysis and simulation results strongly support our conclusion that the proposed relay selection policies can enhance the performance of secure cognitive radio. We also confirm that the error floor phenomenon is created in the absence of jamming.