On the Calculation of the Incomplete MGF with Applications to Wireless Communications

(c) 20xx IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/ republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works. DOI: 10.1109/TCOMM.2016.2626440The incomplete moment generating function (IMGF) has paramount relevance in communication theory, since it appears in a plethora of scenarios when analyzing the performance of communication systems. We here present a general method for calculating the IMGF of any arbitrary fading distribution. Then, we provide exact closed-form expressions for the IMGF of the very general κ-μ shadowed fading model, which includes the popular κ-μ, η-μ, Rician shadowed, and other classical models as particular cases. We illustrate the practical applicability of this result by analyzing several scenarios of interest in wireless communications: 1) physical layer security in the presence of an eavesdropper; 2) outage probability analysis with interference and background noise; 3) channel capacity with side information at the transmitter and the receiver; and 4) average bit-error rate with adaptive modulation, when the fading on the desired link can be modeled by any of the aforementioned distributions.Universidad de Málaga. Campus de Execelencia Internacional. Andalucía Tech

Secure Two-Way Transmission via Wireless-Powered Untrusted Relay and External Jammer

In this paper, we propose a two-way secure communication scheme where two transceivers exchange confidential messages via a wireless powered untrusted amplify-and-forward (AF) relay in the presence of an external jammer. We take into account both friendly jamming (FJ) and Gaussian noise jamming (GNJ) scenarios. Based on the time switching (TS) architecture at the relay, the data transmission is done in three phases. In the first phase, both the energy-starved nodes, the untrustworthy relay and the jammer, are charged by non-information radio frequency (RF) signals from the sources. In the second phase, the two sources send their information signals and concurrently, the jammer transmits artificial noise to confuse the curious relay. Finally, the third phase is dedicated to forward a scaled version of the received signal from the relay to the sources. For the proposed secure transmission schemes, we derive new closed-form lower-bound expressions for the ergodic secrecy sum rate (ESSR) in the high signal-to-noise ratio (SNR) regime. We further analyze the asymptotic ESSR to determine the key parameters; the high SNR slope and the high SNR power offset of the jamming based scenarios. To highlight the performance advantage of the proposed FJ, we also examine the scenario of without jamming (WoJ). Finally, numerical examples and discussions are provided to acquire some engineering insights, and to demonstrate the impacts of different system parameters on the secrecy performance of the considered communication scenarios. The numerical results illustrate that the proposed FJ significantly outperforms the traditional one-way communication and the Constellation rotation approach, as well as our proposed benchmarks, the two-way WoJ and GNJ scenarios.Comment: 14 pages, 6 figures, Submitted to IEEE Transactions on Vehicular Technolog

Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming

In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scenario of an intended multi-input single-output channel overheard by multiple multi-antenna eavesdroppers. Specifically, we address the transmit covariance optimization for secrecy-rate maximization (SRM) of that scenario. The challenge of this problem is that it is a nonconvex optimization problem. This paper shows that the SRM problem can actually be solved in a convex and tractable fashion, by recasting the SRM problem as a semidefinite program (SDP). The SRM problem we solve is under the premise of perfect channel state information (CSI). This paper also deals with the imperfect CSI case. We consider a worst-case robust SRM formulation under spherical CSI uncertainties, and we develop an optimal solution to it, again via SDP. Moreover, our analysis reveals that transmit beamforming is generally the optimal transmit strategy for SRM of the considered scenario, for both the perfect and imperfect CSI cases. Simulation results are provided to illustrate the secrecy-rate performance gains of the proposed SDP solutions compared to some suboptimal transmit designs.Comment: 32 pages, 5 figures; to appear, IEEE Transactions on Signal Processing, 201