Opportunistic Secrecy with a Strict Delay Constraint

We investigate the delay limited secrecy capacity of the flat fading channel under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the delay limited secrecy capacity are derived, and shown to be tight in the high signal-to-noise ratio (SNR) regime. In the second scenario, only the main channel CSI is assumed to be available at the transmitter where, remarkably, we establish the achievability of a non-zero delay-limited secure rate, for a wide class of channel distributions, with a high probability. In the two cases, our achievability arguments are based on a novel two-stage key-sharing approach that overcomes the secrecy outage phenomenon observed in earlier works.Comment: Submitted to IEEE Transactions on Information Theor

On the Delay Limited Secrecy Capacity of Fading Channels

In this paper, the delay limited secrecy capacity of the flat fading channel is investigated under two different assumptions on the available transmitter channel state information (CSI). The first scenario assumes perfect prior knowledge of both the main and eavesdropper channel gains. Here, upper and lower bounds on the secure delay limited capacity are derived and shown to be tight in the high signal-to-noise ratio (SNR) regime (for a wide class of channel distributions). In the second scenario, only the main channel CSI is assumed to be available at the transmitter. Remarkably, under this assumption, we establish the achievability of non-zero secure rate (for a wide class of channel distributions) under a strict delay constraint. In the two cases, our achievability arguments are based on a novel two-stage approach that overcomes the secrecy outage phenomenon observed in earlier works.Comment: Proceedings of the 2009 IEEE International Symposium on Information Theory (ISIT 2009), Seoul, Korea, June 28-July 3, 200

Beamforming Techniques for Non-Orthogonal Multiple Access in 5G Cellular Networks

In this paper, we develop various beamforming techniques for downlink transmission for multiple-input single-output (MISO) non-orthogonal multiple access (NOMA) systems. First, a beamforming approach with perfect channel state information (CSI) is investigated to provide the required quality of service (QoS) for all users. Taylor series approximation and semidefinite relaxation (SDR) techniques are employed to reformulate the original non-convex power minimization problem to a tractable one. Further, a fairness-based beamforming approach is proposed through a max-min formulation to maintain fairness between users. Next, we consider a robust scheme by incorporating channel uncertainties, where the transmit power is minimized while satisfying the outage probability requirement at each user. Through exploiting the SDR approach, the original non-convex problem is reformulated in a linear matrix inequality (LMI) form to obtain the optimal solution. Numerical results demonstrate that the robust scheme can achieve better performance compared to the non-robust scheme in terms of the rate satisfaction ratio. Further, simulation results confirm that NOMA consumes a little over half transmit power needed by OMA for the same data rate requirements. Hence, NOMA has the potential to significantly improve the system performance in terms of transmit power consumption in future 5G networks and beyond.Comment: accepted to publish in IEEE Transactions on Vehicular Technolog

Power Efficient MISO Beamforming for Secure Layered Transmission

This paper studies secure layered video transmission in a multiuser multiple-input single-output (MISO) beamforming downlink communication system. The power allocation algorithm design is formulated as a non-convex optimization problem for minimizing the total transmit power while guaranteeing a minimum received signal-to-interference-plus-noise ratio (SINR) at the desired receiver. In particular, the proposed problem formulation takes into account the self-protecting architecture of layered transmission and artificial noise generation to prevent potential information eavesdropping. A semi-definite programming (SDP) relaxation based power allocation algorithm is proposed to obtain an upper bound solution. A sufficient condition for the global optimal solution is examined to reveal the tightness of the upper bound solution. Subsequently, two suboptimal power allocation schemes with low computational complexity are proposed for enabling secure layered video transmission. Simulation results demonstrate significant transmit power savings achieved by the proposed algorithms and layered transmission compared to the baseline schemes.Comment: Accepted for presentation at the IEEE Wireless Communications and Networking Conference (WCNC), Istanbul, Turkey, 201