Secrecy Rates and Optimal Power Allocation for Full-Duplex Decode-and-Forward Relay Wire-Tap Channels

This paper investigates the secrecy rates and optimal power allocation schemes for a decode-and-forward wiretap relay channel where the transmission from a source to a destination is aided by a relay operating in a full-duplex (FD) mode under practical residual self-interference. By first considering static channels, we address the non-convex optimal power allocation problems between the source and relay nodes under individual and joint power constraints to establish closed-form solutions. An asymptotic analysis is then given to provide important insights on the derived power allocation solutions. Specifically, by using the method of dominant balance, it is demonstrated that full power at the relay is only optimal when the power at relay is sufficiently smaller when compared with that of the source. When the power at the relay is larger than the power at the source, the power consumed at the relay saturates to a constant for an effective control of self-interference. The analysis is also helpful to demonstrate that the secrecy capacity of the FD system is twice as much as that of the half-duplex system. The extension to fast fading channels with channel state information being available at the receivers but not the transmitters is also studied. To this end, we first establish a closed-form expression of the ergodic secrecy rate using simple exponential integrals for a given power allocation scheme. The results also show that with optimal power allocation schemes, FD can significantly improve the secrecy rate in fast fading environments

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

Weak Secrecy in the Multi-Way Untrusted Relay Channel with Compute-and-Forward

We investigate the problem of secure communications in a Gaussian multi-way relay channel applying the compute-and-forward scheme using nested lattice codes. All nodes employ half-duplex operation and can exchange confidential messages only via an untrusted relay. The relay is assumed to be honest but curious, i.e., an eavesdropper that conforms to the system rules and applies the intended relaying scheme. We start with the general case of the single-input multiple-output (SIMO) L-user multi-way relay channel and provide an achievable secrecy rate region under a weak secrecy criterion. We show that the securely achievable sum rate is equivalent to the difference between the computation rate and the multiple access channel (MAC) capacity. Particularly, we show that all nodes must encode their messages such that the common computation rate tuple falls outside the MAC capacity region of the relay. We provide results for the single-input single-output (SISO) and the multiple-input single-input (MISO) L-user multi-way relay channel as well as the two-way relay channel. We discuss these results and show the dependency between channel realization and achievable secrecy rate. We further compare our result to available results in the literature for different schemes and show that the proposed scheme operates close to the compute-and-forward rate without secrecy.Comment: submitted to JSAC Special Issue on Fundamental Approaches to Network Coding in Wireless Communication System

Resource Allocation for Secure Gaussian Parallel Relay Channels with Finite-Length Coding and Discrete Constellations

We investigate the transmission of a secret message from Alice to Bob in the presence of an eavesdropper (Eve) and many of decode-and-forward relay nodes. Each link comprises a set of parallel channels, modeling for example an orthogonal frequency division multiplexing transmission. We consider the impact of discrete constellations and finite-length coding, defining an achievable secrecy rate under a constraint on the equivocation rate at Eve. Then we propose a power and channel allocation algorithm that maximizes the achievable secrecy rate by resorting to two coupled Gale-Shapley algorithms for stable matching problem. We consider the scenarios of both full and partial channel state information at Alice. In the latter case, we only guarantee an outage secrecy rate, i.e., the rate of a message that remains secret with a given probability. Numerical results are provided for Rayleigh fading channels in terms of average outage secrecy rate, showing that practical schemes achieve a performance quite close to that of ideal ones

Power Efficient and Secure Full-Duplex Wireless Communication Systems

In this paper, we study resource allocation for a full-duplex (FD) radio base station serving multiple half-duplex (HD) downlink and uplink users simultaneously. The considered resource allocation algorithm design is formulated as a non-convex optimization problem taking into account minimum required receive signal-to-interference-plus-noise ratios (SINRs) for downlink and uplink communication and maximum tolerable SINRs at potential eavesdroppers. The proposed optimization framework enables secure downlink and uplink communication via artificial noise generation in the downlink for interfering the potential eavesdroppers. We minimize the weighted sum of the total downlink and uplink transmit power by jointly optimizing the downlink beamformer, the artificial noise covariance matrix, and the uplink transmit power. We adopt a semidefinite programming (SDP) relaxation approach to obtain a tractable solution for the considered problem. The tightness of the SDP relaxation is revealed by examining a sufficient condition for the global optimality of the solution. Simulation results demonstrate the excellent performance achieved by the proposed scheme and the significant transmit power savings enabled optimization of the artificial noise covariance matrix.Comment: 6 pages, invited paper, IEEE Conference on Communications and Network Security (CNS) 2015 in Florence, Italy, on September 30, 201

Cooperative Jamming for Secure Communications in MIMO Relay Networks

Secure communications can be impeded by eavesdroppers in conventional relay systems. This paper proposes cooperative jamming strategies for two-hop relay networks where the eavesdropper can wiretap the relay channels in both hops. In these approaches, the normally inactive nodes in the relay network can be used as cooperative jamming sources to confuse the eavesdropper. Linear precoding schemes are investigated for two scenarios where single or multiple data streams are transmitted via a decode-and-forward (DF) relay, under the assumption that global channel state information (CSI) is available. For the case of single data stream transmission, we derive closed-form jamming beamformers and the corresponding optimal power allocation. Generalized singular value decomposition (GSVD)-based secure relaying schemes are proposed for the transmission of multiple data streams. The optimal power allocation is found for the GSVD relaying scheme via geometric programming. Based on this result, a GSVD-based cooperative jamming scheme is proposed that shows significant improvement in terms of secrecy rate compared to the approach without jamming. Furthermore, the case involving an eavesdropper with unknown CSI is also investigated in this paper. Simulation results show that the secrecy rate is dramatically increased when inactive nodes in the relay network participate in cooperative jamming.Comment: 30 pages, 7 figures, to appear in IEEE Transactions on Signal Processin

Two-path succesive relaying schemes in the presence of inter-relay interference

Relaying is a promising technique to improve wireless network performance. A conventional relay transmits and receives signals in two orthogonal channels due to half duplex constraint of wireless network. This results in inefficient use of spectral resources. Two-Path Successive Relaying (TPSR) has been proposed to recover loss in spectral efficiency. However, the performance of TPSR is degraded by Inter-Relay Interference (IRI). This thesis investigates the performance of TPSR affected by IRI and proposes several schemes to improve relaying reliability, throughput and secrecy. Simulations revealed that the existing TPSR could perform worse than the conventional Half Duplex Relaying (HDR) scheme. Opportunistic TPSR schemes are proposed to improve the capacity performance. Several relay pair selection criteria are developed to ensure the selection of the best performing relay pair. Adaptive schemes which dynamically switch between TPSR and conventional HDR are proposed to further improve the performance. Simulation and analytical results show that the proposed schemes can achieve up to 45% ergodic capacity improvement and lower outage probability compared to baseline schemes, while achieving the maximum diversity and multiplexing tradeoff of the multi-input single-output channel. In addition, this thesis proposes secrecy TPSR schemes to protect secrecy of wireless transmission from eavesdropper. The use of two relays in the proposed schemes deliver more robust secrecy transmission while the use of scheduled jamming signals improves secrecy rate. Simulation and analytical results reveal that the proposed schemes can achieve up to 62% ergodic secrecy capacity improvement and quadratically lower intercept and secrecy outage probabilities if compared to existing schemes. Overall, this thesis demonstrates that the proposed TPSR schemes are able to deliver performance improvement in terms of throughput, reliability and secrecy in the presence of IRI

Physical Layer Service Integration in 5G: Potentials and Challenges

High transmission rate and secure communication have been identified as the key targets that need to be effectively addressed by fifth generation (5G) wireless systems. In this context, the concept of physical-layer security becomes attractive, as it can establish perfect security using only the characteristics of wireless medium. Nonetheless, to further increase the spectral efficiency, an emerging concept, termed physical-layer service integration (PHY-SI), has been recognized as an effective means. Its basic idea is to combine multiple coexisting services, i.e., multicast/broadcast service and confidential service, into one integral service for one-time transmission at the transmitter side. This article first provides a tutorial on typical PHY-SI models. Furthermore, we propose some state-of-the-art solutions to improve the overall performance of PHY-SI in certain important communication scenarios. In particular, we highlight the extension of several concepts borrowed from conventional single-service communications, such as artificial noise (AN), eigenmode transmission etc., to the scenario of PHY-SI. These techniques are shown to be effective in the design of reliable and robust PHY-SI schemes. Finally, several potential research directions are identified for future work.Comment: 12 pages, 7 figure