Principles of Physical Layer Security in Multiuser Wireless Networks: A Survey

This paper provides a comprehensive review of the domain of physical layer security in multiuser wireless networks. The essential premise of physical-layer security is to enable the exchange of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers without relying on higher-layer encryption. This can be achieved primarily in two ways: without the need for a secret key by intelligently designing transmit coding strategies, or by exploiting the wireless communication medium to develop secret keys over public channels. The survey begins with an overview of the foundations dating back to the pioneering work of Shannon and Wyner on information-theoretic security. We then describe the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems, followed by generalizations to multiuser broadcast, multiple-access, interference, and relay networks. Secret-key generation and establishment protocols based on physical layer mechanisms are subsequently covered. Approaches for secrecy based on channel coding design are then examined, along with a description of inter-disciplinary approaches based on game theory and stochastic geometry. The associated problem of physical-layer message authentication is also introduced briefly. The survey concludes with observations on potential research directions in this area.Comment: 23 pages, 10 figures, 303 refs. arXiv admin note: text overlap with arXiv:1303.1609 by other authors. IEEE Communications Surveys and Tutorials, 201

Linear Precoders for Non-Regenerative Asymmetric Two-way Relaying in Cellular Systems

Two-way relaying (TWR) reduces the spectral-efficiency loss caused in conventional half-duplex relaying. TWR is possible when two nodes exchange data simultaneously through a relay. In cellular systems, data exchange between base station (BS) and users is usually not simultaneous e.g., a user (TUE) has uplink data to transmit during multiple access (MAC) phase, but does not have downlink data to receive during broadcast (BC) phase. This non-simultaneous data exchange will reduce TWR to spectrally-inefficient conventional half-duplex relaying. With infrastructure relays, where multiple users communicate through a relay, a new transmission protocol is proposed to recover the spectral loss. The BC phase following the MAC phase of TUE is now used by the relay to transmit downlink data to another user (RUE). RUE will not be able to cancel the back-propagating interference. A structured precoder is designed at the multi-antenna relay to cancel this interference. With multiple-input multiple-output (MIMO) nodes, the proposed precoder also triangulates the compound MAC and BC phase MIMO channels. The channel triangulation reduces the weighted sum-rate optimization to power allocation problem, which is then cast as a geometric program. Simulation results illustrate the effectiveness of the proposed protocol over conventional solutions.Comment: 30 pages, 7 figures, submitted to IEEE Transactions on Wireless Communication

A Modified Levenberg-Marquardt Method for the Bidirectional Relay Channel

This paper presents an optimization approach for a system consisting of multiple bidirectional links over a two-way amplify-and-forward relay. It is desired to improve the fairness of the system. All user pairs exchange information over one relay station with multiple antennas. Due to the joint transmission to all users, the users are subject to mutual interference. A mitigation of the interference can be achieved by max-min fair precoding optimization where the relay is subject to a sum power constraint. The resulting optimization problem is non-convex. This paper proposes a novel iterative and low complexity approach based on a modified Levenberg-Marquardt method to find near optimal solutions. The presented method finds solutions close to the standard convex-solver based relaxation approach.Comment: submitted to IEEE Transactions on Vehicular Technology We corrected small mistakes in the proof of Lemma 2 and Proposition