Secure beamforming transmission with limited training and feedback

We consider the secure beamforming transmission over a quasi-static block fading channel from a multi-antenna transmitter to a desired single-antenna receiver, in the presence of a passive single-antenna eavesdropper. We focus on a practical scenario where the transmitter can only acquire the statistical channel knowledge of the eavesdropper and the partial channel knowledge of the legitimate receiver through a finite amount of signaling overhead. To keep control of the outage events caused by the limited channel knowledge, We firstly propose a strategy to determine the wiretap code parameters under the outage constraints, based on which we establish a necessary transmission condition to guarantee a positive secrecy rate. Aided by this transmission condition, we propose an on-off-based transmission scheme and characterize the secrecy throughput performance of the system. Our designed transmission scheme is beneficial for the deployment of physical layer security in practical frequency division duplex (FDD) systems with limited training and feedback.ARC Discovery Projects Grant DP15010390

BeamSec: A Practical mmWave Physical Layer Security Scheme Against Strong Adversaries

The high directionality of millimeter-wave (mmWave) communication systems has proven effective in reducing the attack surface against eavesdropping, thus improving the physical layer security. However, even with highly directional beams, the system is still exposed to eavesdropping against adversaries located within the main lobe. In this paper, we propose \acrshort{BSec}, a solution to protect the users even from adversaries located in the main lobe. The key feature of BeamSec are: (i) Operating without the knowledge of eavesdropper's location/channel; (ii) Robustness against colluding eavesdropping attack and (iii) Standard compatibility, which we prove using experiments via our IEEE 802.11ad/ay-compatible 60 GHz phased-array testbed. Methodologically, BeamSec first identifies uncorrelated and diverse beam-pairs between the transmitter and receiver by analyzing signal characteristics available through standard-compliant procedures. Next, it encodes the information jointly over all selected beam-pairs to minimize information leakage. We study two methods for allocating transmission time among different beams, namely uniform allocation (no knowledge of the wireless channel) and optimal allocation for maximization of the secrecy rate (with partial knowledge of the wireless channel). Our experiments show that \acrshort{BSec} outperforms the benchmark schemes against single and colluding eavesdroppers and enhances the secrecy rate by 79.8% over a random paths selection benchmark

Resource allocation and feedback in wireless multiuser networks

This thesis focuses on the design of algorithms for resource allocation and feedback in wireless multiuser and heterogeneous networks. In particular, three key design challenges expected to have a major impact on future wireless networks are considered: cross-layer scheduling; structured quantization codebook design for MU-MIMO networks with limited feedback; and resource allocation to provide physical layer security. The first design challenge is cross-layer scheduling, where policies are proposed for two network architectures: user scheduling in single-cell multiuser networks aided by a relay; and base station (BS) scheduling in CoMP. These scheduling policies are then analyzed to guarantee satisfaction of three performance metrics: SEP; packet delay; and packet loss probability (PLP) due to buffer overflow. The concept of the τ-achievable PLP region is also introduced to explicitly describe the tradeoff in PLP between different users. The second design challenge is structured quantization codebook design in wireless networks with limited feedback, for both MU-MIMO and CoMP. In the MU-MIMO network, two codebook constructions are proposed, which are based on structured transformations of a base codebook. In the CoMP network, a low-complexity construction is proposed to solve the problem of variable codebook dimensions due to changes in the number of coordinated BSs. The proposed construction is shown to have comparable performance with the standard approach based on a random search, while only requiring linear instead of exponential complexity. The final design challenge is resource allocation for physical layer security in MU-MIMO. To guarantee physical layer security, the achievable secrecy sum-rate is explicitly derived for the regularized channel inversion (RCI) precoder. To improve performance, power allocation and precoder design are jointly optimized using a new algorithm based on convex optimization techniques