IEEE Transactions on Wireless Communications

Artificial Noise-Aided Secure Relay Communication With Unknown Channel Knowledge of Eavesdropper

Bin Li, Meiying Zhang, Yue Rong, Zhu Han

Published Jan 10, 2021• 35 citations

Abstract

In this article, a new relay-aided secure communication system is investigated, where a transmitter sends signals to a destination via an amplify-and-forward (AF) relay in the presence of an eavesdropper. We consider a general system configuration, where the source, relay, destination, and eavesdropper are all equipped with multiple antennas. In the practical scenarios of unknown eavesdropper's channel state information (CSI) and uncertainty of the eavesdropper's location, we aim to maximize the expected value of the system secrecy rate over the presumed distribution of the eavesdropper's channels, by exploiting the artificial noise (AN) transmitted by the source and relay nodes. The system design issue is formulated as a nonconvex stochastic optimization problem with a source transmission power constraint and a nonconvex relay transmission power constraint. A novel computational method is proposed to solve this challenging problem. The new method is developed based on an exact penalty function method together with a parallel stochastic decomposition algorithm. Numerical simulations are performed to study the effectiveness of the proposed scheme at various locations of the eavesdropper. Simulation results show that for most cases, secure communication can be achieved without the CSI knowledge of eavesdropper's channels, and the achievable secrecy rate follows the trend of a benchmark system where the eavesdropper's full CSI is available. In particular, the achievable system secrecy rate increases with the number of antennas at the legitimate users. Moreover, the optimal power allocated for the transmission of the AN increases with the system signal-to-noise ratio. The proposed computational method achieves a higher system secrecy rate than a conventional penalty function based approach.

DOI: 10.1109/twc.2020.3047926

Related papers

Robust artificial noise assisted secure transceiver optimization in AF relay networks with multiple source-destination pairs

Liang Jin, Lijian Zhang, Kaizhi Huang +3 more

We consider an amplify-and-forward (AF) relay network with multiple source-destination pairs in the presence of an eavesdropper. This paper studies the robust artificial noise (AN) assisted joint transceiver optimization for secure communication with imperfect channel state information (CSI) of legitimate users and no CSI regarding the eavesdropper. The goal is to design the linear precoding matrix of the relay and the linear equalizer of each destination, such that the transmit power for the information-bearing signals and forwarded background noises at the relay can be minimized subject to the quality of service (QoS) constraints at the destinations. The remainder of the constrained total power is used to generate the AN for jamming the eavesdropper. Although such a power minimization problem is nonconvex, we recast it into two semidefinite programming (SDP) subproblems which can be solved using interior-point methods. Then this problem can be solved with the alternating iterative optimization algorithm. Simulations demonstrate that the proposed algorithm can significantly reduce the sensitivity to imperfect CSI, while degrading the eavesdropper's capability of intercepting.

International Conference on Signal Processing and Communication SystemsDec 1, 20142 citations

Secure MIMO Relaying Network: An Artificial Noise Aided Robust Design Approach

Jiaxin Yang, Qiang Li, Benoı̂t Champagne +2 more

Owing to the vulnerability of relay-assisted and device-to-device (D2D) communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence we address the problem of secure transmission in a relay-assisted network, where a pair of legitimate user equipments (UEs) communicate with the aid of a multiple-input multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves). Assuming imperfect knowledge of the eves' channels, we jointly optimize the power of the source UE, the amplify-and-forward (AF) relaying matrix and the covariance of the artificial noise (AN) transmitted by the relay, in order to maximize the received signal-to-interference-plus-noise ratio (SINR) at the destination, while imposing a set of robust secrecy constraints. To tackle the resultant nonconvex optimization problem, a globally optimal solution based on a bi-level optimization framework is proposed, but with high complexity. Then a low-complexity sub-optimal method relying on a new penalized difference-of-convex (DC) algorithmic framework is proposed, which is specifically designed for non-convex semidefinite programs (SDPs). We show how this penalized DC framework can be invoked for solving our robust secure relaying problem with proven convergence. Our extensive simulation results show that both proposed solutions are capable of ensuring the secrecy of the relay-aided transmission and significantly improve the robustness towards the eves' channel uncertainties as compared to the non-robust counterparts. It is also demonstrated the penalized DC-based method advocated yields a performance close to the globally optimal solution.

arXiv:1606.07176Jun 23, 20160 citations

Robust AN-Aided Secure Precoding for an AF MIMO Untrusted Relay System

Quanzhong Li, Liang Yang, Qi Zhang +1 more

Robust artificial noise (AN) aided secure precoding for an amplify-and-forward multiple-input multiple-output untrusted relay system is studied, where the relay is untrusted and willing to help forwarding multiple data streams from the source to destination. We consider that the available channel state information is imperfect and modeled by the worst case model. Our objective is to maximize the worst case secrecy rate under the robust transmit power constraints at the source and relay, by jointly designing the signal and AN precoding matrices at the source and the precoding matrix at the relay. The robust secure precoding problem is nonconvex and hard to solve. To overcome this difficulty, we propose the weighted minimum mean square error based method, where the signdefiniteness lemma is used to eliminate the channel uncertainties and an effective iterative optimization algorithm is developed. Simulation results are provided to demonstrate the effectiveness of the proposed scheme.

IEEE Transactions on Vehicular TechnologySep 4, 201720 citations

Artificial-Noise-Aided Transmission in Multi-Antenna Relay Wiretap Channels With Spatially Random Eavesdroppers

Chenxi Liu, Nan Yang, Robert Malaney +1 more

We design a new relay-aided secure transmission scheme, in which a source communicates with a destination through a trusted decode-and-forward relay in the presence of spatially random-distributed non-colluding eavesdroppers. We consider a general antenna configuration, in which the source, relay, destination, and eavesdroppers are equipped with multiple antennas. We assume that both the source and the relay transmit artificial noise signals in addition to information signals. We also assume that the source and the relay adopt different codebooks, and that the transmitted signals from the source and relay are not jointly processed at each eavesdropper. We first derive a closed-form expression for the transmission outage probability and a new expression for the secrecy outage probability. Notably, these expressions are valid for an arbitrary number of antennas at the source, relay, and destination. We then derive simple yet valuable expressions for the asymptotic transmission outage probability and the asymptotic secrecy outage probability, which reveal the secrecy performance when the number of antennas at the source grows sufficiently large. Using our expressions, we quantify a practical performance metric, namely, the secrecy throughput, under a secrecy outage probability constraint. We further determine the system and channel parameters that maximize the secrecy throughput, leading to analytical security solutions suitable for real-world deployment.

arXiv:1509.05486IEEE Transactions on Wireless CommunicationsAug 24, 201644 citations

Improving Physical Layer Security of AF Relay Networks via Beam-Forming and Jamming

Abdelhamid Salem, Khairi Ashour Hamdi

In this paper the cooperation of beam-forming and artificial noise (AN) in two-hop amplify-and- forward (AF) relaying system is proposed to enhance the security. we consider a half duplex AF relaying network with a multi-antenna source node and a destination in the presence of a passive eavesdropper.Since channel state information (CSI) of the eavesdropper is unknown, the AN transmitted by the source in the first phase and by the relays in the second phase is in all directions except the legitimate node one. As such two scenarios are considered here,: i) when all the relays amplify and forward the information source signal ii) when only the best relay is selected to amplify and forward the information source signal. The beam-former weights and the power allocation are obtained by solving an optimization problem. Results reveal that the proposed system can provide considerable improvements in terms of secrecy rate. It is also found that increasing the AN power, relative to the information signal power, will further improve the secrecy rate.

IEEE Vehicular Technology ConferenceSep 1, 20167 citations

Joint Secure AF Relaying and Artificial Noise Optimization: A Penalized Difference-of-Convex Programming Framework

Jiaxin Yang, Qiang Li, Yunlong Cai +3 more

Owing to the vulnerability of relay-assisted communications, improving wireless security from a physical layer signal processing perspective is attracting increasing interest. Hence, we address the problem of secure transmission in a relay-assisted network, where a pair of legitimate user equipments (UEs) communicate with the aid of a multiple-input multiple output (MIMO) relay in the presence of multiple eavesdroppers (eves). Assuming imperfect knowledge of the eves' channels, we jointly optimize the power of the source UE, the amplify-and-forward relaying matrix, and the covariance of the artificial noise transmitted by the relay, in order to maximize the received signal-to-interference-plus-noise ratio at the destination, while imposing a set of robust secrecy constraints. To tackle the resultant non-convex optimization problem with tractable complexity, a new penalized difference-of-convex (DC) algorithm is proposed, which is specifically designed for solving a class of non-convex semidefinite programs. We show how this penalized DC framework can be invoked for solving our robust secure relaying problem with proven convergence. In addition, to benchmark the proposed algorithm, we subsequently propose a semidefinite relaxation-based exhaustive search approach, which yields an upper bound of the secure relaying problem, however, with significantly higher complexity. Our simulation results show that the proposed solution is capable of ensuring the secrecy of the relay-aided transmission and significantly improving the robustness toward the eves' channel uncertainties as compared with the non-robust counterparts. It is also demonstrated the penalized DC-based method advocated yields a performance close to the upper bound.

IEEE AccessJan 1, 201611 citations