Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)

Robust AN-aided Secure Beamforming for Full-Duplex Relay System with Multiple Eavesdroppers

Jiaxing Cui, Zhengmin Kong, Jing Song, Weijun Yin, Xianjun Deng

Published Oct 1, 2021• 0 citations
Publisher

Abstract

In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.

DOI
10.1109/trustcom53373.2021.00057

Related papers

Robust Beamforming and Jamming for Enhancing the Physical Layer Security of Full Duplex Radios

Zhengmin Kong, Shaoshi Yang, Die Wang +1 more

In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush-Kuhn-Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.

arXiv:1903.10787•IEEE Transactions on Information Forensics and Security•Apr 1, 2019•48 citations

Robust Secure Beamforming for SWIPT-Aided Relay Systems With Full-Duplex Receiver and Imperfect CSI

Xinrui Li, Wei Wang, Miao Zhang +2 more

This paper investigates an energy-constrained relay-assisted secure communication system in the presence of a legitimate source-destination pair and a passive eavesdropper with imperfect channel state information (CSI). The energy-constrained relay exploits a power splitting (PS) protocol to simultaneously harvest energy and decode information from the received signal from the source, and then forwards the confidential signal to the full-duplex (FD) destination while it simultaneously transmits artificial noise (AN) to confuse the passive eavesdropper. This robust beamforming design is developed by maximizing the secrecy rate under the constraints of energy harvesting (EH) requirement at the relay and AN transmit power at the destination. Specifically, we formulate the joint relay beamforming and PS ratio as well as the AN power optimization as a non-convex quadratically-constrained problem. In order to circumvent this non-convexity issue, we decompose the original problem into three subproblems which can be determined by the proposed semidefinite relaxation (SDR) and successive convex optimization methods. Furthermore, we derive closed-form expressions for the optimal solutions of each subproblem. Finally, the original non-convex problem can be solved through a convergence guaranteed iterative algorithm. Simulation results are provided to demonstrate the effectiveness and superior performance of the proposed robust design compared with the benchmark schemes.

IEEE Transactions on Vehicular Technology•Dec 24, 2019•33 citations

Robust joint beamforming and artificial noise design for amplify-and-forward multi-antenna relay systems

Lijian Zhang, Liang Jin, Wenyu Luo +2 more

In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.

IEEE International Conference on Acoustics Speech and Signal Processing•Apr 1, 2015•4 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 Technology•Sep 4, 2017•20 citations

Robust beamforming and cooperative jamming for secure transmission in DF relay systems

Bin Li, Zesong Fei

In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.

EURASIP Journal on Wireless Communications and Networking•Mar 1, 2016•11 citations

PNC-Aided Robust Secure Beamforming Design for Two-Way Relay Networks with Artificial Noise

Yunqin Hao, Tiejun Lv, Jie Jack Zeng +1 more

In this paper, we study a two-way relay network (TWRN), in which eavesdroppers' channel state information is imperfect, and all the eavesdroppers collude to form joint receive beamforming for enhanced receptions. To ensure the robustness of the TWRN, we design the transmit beamforming and establish two secure beamforming design formulations, which combines the physical layer network coding with artificial noise technique at the relay. One secure beamforming design formulation is to minimize the total transmit power in the TWRN, and the other one is to guarantee a maximum secrecy sum rate (SSR) in the worst-case. With the help of approximation techniques, the former optimization problem is converted into a convex problem, whose semidefinite relaxation solution is rank-one. However, due to the maximum available power limit of the system, the power optimization problem may be infeasible. To overcome this problem, the SSR optimization formulation is presented, and the optimization problem is decoupled into two subproblems that can be transformed into the convex forms. Finally, it is verified by the numerical results that the proposed schemes are effective.

International Conference on Communications•May 1, 2019•0 citations
In this paper, we investigate the physical layer security of a full-duplex decode-and-forward relay-aided system in the worst case, where all channel state informations are realistic imperfect. For the sake of confidentiality of signals transmitted from source to destination, a robust artificial noise (AN)-aided beamforming scheme is proposed. Explicitly, our objective function is that of maximizing the worst-case secrecy rate under the transmit power constraints, by jointly optimizing the beamforming matrix and AN at the source and the relay. To overcome the non-convexity of the robust AN-aided secure beamforming problem, we transform it into multi-block convex problems, where the semi-infinite linear matrix inequality is applied to eliminate the channel uncertainties. As a benefit, our proposed robust AN -aided secure beamforming scheme obtains substantial secrecy performance gains, which verifies the efficiency of the proposed scheme.
In this paper, we investigate the physical layer security of a full-duplex base station (BS)-aided system in the worst case, where an uplink transmitter (UT) and a downlink receiver (DR) are equipped with a single antenna, while a powerful eavesdropper is equipped with multiple antennas. For securing the confidentiality of signals transmitted from the BS and UT, an artificial noise (AN)-aided secrecy beamforming scheme is proposed, which is robust to the realistic imperfect state information of both the eavesdropping channel and the residual self-interference channel. Our objective function is that of maximizing the worst-case sum secrecy rate achieved by the BS and UT, through jointly optimizing the beamforming vector of the confidential signals and the transmit covariance matrix of the AN. However, the resulting optimization problem is non-convex and non-linear. In order to efficiently obtain the solution, we transform the non-convex problem into a sequence of convex problems by adopting the block coordinate descent algorithm. We invoke a linear matrix inequality for finding its Karush-Kuhn-Tucker (KKT) solution. In order to evaluate the achievable performance, the worst-case secrecy rate is analytically derived. Furthermore, we construct another secrecy transmission scheme using the projection matrix theory for performance comparison. Our simulation results show that the proposed robust secrecy transmission scheme achieves substantial secrecy performance gains, which verifies the efficiency of the proposed method.
This paper investigates an energy-constrained relay-assisted secure communication system in the presence of a legitimate source-destination pair and a passive eavesdropper with imperfect channel state information (CSI). The energy-constrained relay exploits a power splitting (PS) protocol to simultaneously harvest energy and decode information from the received signal from the source, and then forwards the confidential signal to the full-duplex (FD) destination while it simultaneously transmits artificial noise (AN) to confuse the passive eavesdropper. This robust beamforming design is developed by maximizing the secrecy rate under the constraints of energy harvesting (EH) requirement at the relay and AN transmit power at the destination. Specifically, we formulate the joint relay beamforming and PS ratio as well as the AN power optimization as a non-convex quadratically-constrained problem. In order to circumvent this non-convexity issue, we decompose the original problem into three subproblems which can be determined by the proposed semidefinite relaxation (SDR) and successive convex optimization methods. Furthermore, we derive closed-form expressions for the optimal solutions of each subproblem. Finally, the original non-convex problem can be solved through a convergence guaranteed iterative algorithm. Simulation results are provided to demonstrate the effectiveness and superior performance of the proposed robust design compared with the benchmark schemes.
In this paper, we address physical layer security for amplify-and-forward (AF) multi-antenna relay systems in the presence of multiple eavesdroppers. A robust joint design of cooperative beamforming (CB) and artificial noise (AN) is proposed with imperfect channel state information (CSI) of both the destination and the eavesdroppers. We aim to maximize the worst-case secrecy rate subject to the sum power and the per-antenna power constraints at the relay. Such joint design problem is non-convex. By utilizing the semidefinite relaxation (SDR) technique, S-procedure and the successive convex approximation (SCA) algorithm, the original non-convex optimization problem is recast into a series of semidefinite programs (SDPs) which can be efficiently solved using interior-methods. Simulation results are presented to verify the effectiveness of the proposed design.
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.
In this paper, we study robust joint beamforming and cooperative jamming (CJ) in a secure decode-and-forward (DF) relay system in the presence of multiple eavesdroppers, in which a multi-antenna DF relay employs transmit beamforming to help the source deliver information to the destination and simultaneously generates Gaussian artificial noise to confuse these eavesdroppers. We assume that all the channel state information (CSI) is imperfectly known at the relay subject to norm-bounded CSI errors. Our objective is to maximize the achievable secrecy rate at the destination by jointly optimizing the transmit beamforming vector of information signals and the covariance matrix of jamming signals at the relay subject to its total transmit power constraint. Although this problem is non-convex and in general difficult to be solved, we obtain its optimal solution via the technique of semi-definite relaxation (SDR) together with a one-dimensional (1-D) search. Specifically, we prove that the SDR is tight for the problem of our interest. Finally, numerical results are provided to validate our proposed scheme.
In this paper, we study a two-way relay network (TWRN), in which eavesdroppers' channel state information is imperfect, and all the eavesdroppers collude to form joint receive beamforming for enhanced receptions. To ensure the robustness of the TWRN, we design the transmit beamforming and establish two secure beamforming design formulations, which combines the physical layer network coding with artificial noise technique at the relay. One secure beamforming design formulation is to minimize the total transmit power in the TWRN, and the other one is to guarantee a maximum secrecy sum rate (SSR) in the worst-case. With the help of approximation techniques, the former optimization problem is converted into a convex problem, whose semidefinite relaxation solution is rank-one. However, due to the maximum available power limit of the system, the power optimization problem may be infeasible. To overcome this problem, the SSR optimization formulation is presented, and the optimization problem is decoupled into two subproblems that can be transformed into the convex forms. Finally, it is verified by the numerical results that the proposed schemes are effective.