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

arXiv:1903.10787 · IEEE Transactions on Information Forensics and Security

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

Zhengmin Kong, Shaoshi Yang, Die Wang, Lajos Hanzo

Published Apr 1, 2019• 48 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tifs.2019.2908481

Related papers

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

Jiaxing Cui, Zhengmin Kong, Jing Song +2 more

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.

IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)•Oct 1, 2021•0 citations

Resource Allocation for Secure Full-Duplex Radio Systems.

Yan Ping Sun, Derrick Wing Kwan Ng, Robert Schober

In this paper, we investigate resource allocation for a multiuser communication system employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. The considered system enables secure simultaneous downlink and uplink communication via artificial noise (AN) generation causing interference to potential eavesdroppers. The system design objective is to maximize the system secrecy throughput by jointly optimizing the downlink beamformer, the AN covariance matrix, and the uplink transmit power. The algorithm design leads to a non-convex optimization problem and obtaining the globally optimal solution entails a prohibitively high computational complexity. Therefore, an efficient suboptimal iterative algorithm based on successive convex approximation is proposed. Our simulation results confirm that the proposed suboptimal algorithm achieves a substantial system secrecy throughput gain compared to two baseline schemes.

arXiv:1705.02215•Mar 15, 2017•5 citations

Joint Information- and Jamming-Beamforming for Physical Layer Security With Full Duplex Base Station

Fengchao Zhu, Feifei Gao, Minli Yao +1 more

In this paper, we design joint information beamforming and jamming beamforming to guarantee both transmit security and receive security for a full-duplex base-station (FD-BS). Specifically, we aim to maximize the secret transmit rate while constrain the secret receive rate to be greater than a predefined bound. When FD-BS is equipped with a single transmit antenna, we derive the optimal solutions in closed-form, and interestingly, the results say that simultaneous information and jamming transmission cannot be optimal. When FD-BS is equipped with multiple transmit antennas, we convert the original nonconvex problem into a sequence of subproblems where the semidefinite programming (SDP) relaxation can be applied to efficiently find the optimal solutions. We strictly prove that such a relaxation does not change the optimality for these subproblems. Then the global optimal solutions of the original nonconvex problem can be obtained via a one-dimensional search. Simulation results are provided to verify the efficiency of the proposed algorithms.

IEEE Transactions on Signal Processing•Oct 24, 2014•190 citations

Robust Secure Beamforming for Wireless Powered Full-Duplex Systems With Self-Energy Recycling

Wei Qiang Wu, Baoyun Wang, Yong Zeng +3 more

In this paper, we study a multiuser wireless powered communication system, where an energy-constrained full-duplex information transmitter (IT), powered by wireless energy from a dedicated energy transmitter (ET), intends to send confidential information to the information receiver (IR) in the presence of multiple idle users that could be the potential eavesdroppers. In the practical scenario of imperfect channel state information and assuming that the idle users need to harvest energy from the ET, we aim to maximize the worst-case secrecy rate at the IR by jointly optimizing the transmit covariance matrix at the ET as well as the information beamforming and artificial noise covariance at the IT, subject to their individual transmit power constraints and the minimum required power transferred to the idle users. We employ the semidefinite relaxation (SDR) and extended S-procedure approaches to transform the original nonconvex optimization problem into convex problem, which can be efficiently solved by solving a sequence of semidefinite programs. Furthermore, we show that the SDR is tight since there always exists a rank-one optimal solution. For performance comparison, two heuristic schemes for ease of implementation are also developed. Numerical results are presented to show the effectiveness of our proposed schemes.

IEEE Transactions on Vehicular Technology•Aug 25, 2017•50 citations

Robust Secure Transmit Design with Artificial Noise in the Presence of Multiple Eavesdroppers

Xiaochen Liu, Yuanyuan Gao, Nan Sha +2 more

This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.

KSII Transactions on Internet and Information Systems•Jun 30, 2021•0 citations

ROBUST SECRECY DESIGN FOR MIMO SWIPT WITH ARTIFICIAL NOISE AND FULL-DUPLEX RECEIVER JAMMING

Yao Ge, P.C. Ching

In this paper, we consider a multiple-input-multiple-output (MIMO) simultaneous wireless information and power transfer (SWIPT) system, which consists of a transmitter, a full-duplex (FD) desired receiver (DR) and multiple energy receivers (ERs), i.e., potential eavesdroppers. The transmitter and DR can send artificial noise (AN) and jamming signals to interfere and carry the energy to the ERs, respectively. Considering the imperfect channel state information (CSI) related to ERs, we aim to maximize the worst-case secrecy rate by jointly optimize the information covariance matrix, AN covariance matrix at the transmitter as well as the jamming covariance matrix at the DR, subject to their individual transmit power constraints and the minimum required power transferred to the ERs. In order to solve this non-convex and semi-infinite problem, we employ the S-procedure and propose a successive convex approximation (SCA) scheme based on Taylor series approximation, which can be efficiently solved by the proposed iterative method. Simulation results are finally presented to show the effectiveness of the new robust secrecy design.

IEEE Global Conference on Signal and Information Processing•Nov 1, 2018•3 citations
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.
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 resource allocation for a multiuser communication system employing a full-duplex base station for serving multiple half-duplex downlink and uplink users simultaneously. The considered system enables secure simultaneous downlink and uplink communication via artificial noise (AN) generation causing interference to potential eavesdroppers. The system design objective is to maximize the system secrecy throughput by jointly optimizing the downlink beamformer, the AN covariance matrix, and the uplink transmit power. The algorithm design leads to a non-convex optimization problem and obtaining the globally optimal solution entails a prohibitively high computational complexity. Therefore, an efficient suboptimal iterative algorithm based on successive convex approximation is proposed. Our simulation results confirm that the proposed suboptimal algorithm achieves a substantial system secrecy throughput gain compared to two baseline schemes.
In this paper, we design joint information beamforming and jamming beamforming to guarantee both transmit security and receive security for a full-duplex base-station (FD-BS). Specifically, we aim to maximize the secret transmit rate while constrain the secret receive rate to be greater than a predefined bound. When FD-BS is equipped with a single transmit antenna, we derive the optimal solutions in closed-form, and interestingly, the results say that simultaneous information and jamming transmission cannot be optimal. When FD-BS is equipped with multiple transmit antennas, we convert the original nonconvex problem into a sequence of subproblems where the semidefinite programming (SDP) relaxation can be applied to efficiently find the optimal solutions. We strictly prove that such a relaxation does not change the optimality for these subproblems. Then the global optimal solutions of the original nonconvex problem can be obtained via a one-dimensional search. Simulation results are provided to verify the efficiency of the proposed algorithms.
In this paper, we study a multiuser wireless powered communication system, where an energy-constrained full-duplex information transmitter (IT), powered by wireless energy from a dedicated energy transmitter (ET), intends to send confidential information to the information receiver (IR) in the presence of multiple idle users that could be the potential eavesdroppers. In the practical scenario of imperfect channel state information and assuming that the idle users need to harvest energy from the ET, we aim to maximize the worst-case secrecy rate at the IR by jointly optimizing the transmit covariance matrix at the ET as well as the information beamforming and artificial noise covariance at the IT, subject to their individual transmit power constraints and the minimum required power transferred to the idle users. We employ the semidefinite relaxation (SDR) and extended S-procedure approaches to transform the original nonconvex optimization problem into convex problem, which can be efficiently solved by solving a sequence of semidefinite programs. Furthermore, we show that the SDR is tight since there always exists a rank-one optimal solution. For performance comparison, two heuristic schemes for ease of implementation are also developed. Numerical results are presented to show the effectiveness of our proposed schemes.
This paper studies secure wireless transmission from a multi-antenna transmitter to a single-antenna intended receiver overheard by multiple eavesdroppers with considering the imperfect channel state information (CSI) of wiretap channel.To enhance security of communication link, the artificial noise (AN) is generated at transmitter.We first design the robust joint optimal beamforming of secret signal and AN to minimize transmit power with constraints of security quality of service (QoS), i.e., minimum allowable signal-to-interference-and-noise ratio (SINR) at receiver and maximum tolerable SINR at eavesdroppers.The formulated design problem is shown to be nonconvex and we transfer it into linear matrix inequalities (LMIs).The semidefinite relaxation (SDR) technique is used and the approximated method is proved to solve the original problem exactly.To verify the robustness and tightness of proposed beamforming, we also provide a method to calculate the worst-case SINR at eavesdroppers for a designed transmit scheme using semidefinite programming (SDP).Additionally, the secrecy rate maximization is explored for fixed total transmit power.To tackle the nonconvexity of original formulation, we develop an iterative approach employing sequential parametric convex approximation (SPCA).The simulation results illustrate that the proposed robust transmit schemes can effectively improve the transmit performance.
In this paper, we consider a multiple-input-multiple-output (MIMO) simultaneous wireless information and power transfer (SWIPT) system, which consists of a transmitter, a full-duplex (FD) desired receiver (DR) and multiple energy receivers (ERs), i.e., potential eavesdroppers. The transmitter and DR can send artificial noise (AN) and jamming signals to interfere and carry the energy to the ERs, respectively. Considering the imperfect channel state information (CSI) related to ERs, we aim to maximize the worst-case secrecy rate by jointly optimize the information covariance matrix, AN covariance matrix at the transmitter as well as the jamming covariance matrix at the DR, subject to their individual transmit power constraints and the minimum required power transferred to the ERs. In order to solve this non-convex and semi-infinite problem, we employ the S-procedure and propose a successive convex approximation (SCA) scheme based on Taylor series approximation, which can be efficiently solved by the proposed iterative method. Simulation results are finally presented to show the effectiveness of the new robust secrecy design.