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 Communications workshops

Joint power and beam optimization in a multi-carrier MIMO wiretap channel with Full-Duplex jammer

Omid Taghizadeh, Tianyu Yang, Rudolf Mathar

Published May 1, 2017• 3 citations
Publisher

Abstract

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent method, by re-structuring our problem as a separately convex program. Moreover, for the special case that the transmitter is equipped with a single antenna, an optimal transmit power allocation strategy is obtained analytically, assuming a known jamming strategy. The performance of the proposed design is then numerically evaluated compared to the other design strategies, and under different system assumptions.

DOI
10.1109/iccw.2017.7962841

Related papers

Sum Secrecy Rate Maximization in a Multi-Carrier MIMO Wiretap Channel with Full-Duplex Jamming

Tianyu Yang, Omid Taghizadeh, Rudolf Mathar

In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent method, by re-structuring our problem as a separately convex program. Moreover, for the special case that the transmitter is equipped with a single antenna, an optimal transmit power allocation strategy is obtained analytically, assuming a known jamming strategy. We also study a FD bidirectional secure communication system, where the jamming power can be reused to enhance the sum secrecy rate. The performance of the proposed design is then numerically evaluated compared to the other design strategies, and under different system assumptions.

arXiv:1802.05209•Feb 14, 2018•0 citations

Improving Physical Layer Secrecy Using Full-Duplex Jamming Receivers

Gan Zheng, Ioannis Krikidis, Jiangyuan Li +2 more

This paper studies secrecy rate optimization in a wireless network with a single-antenna source, a multi-antenna destination and a multi-antenna eavesdropper. This is an unfavorable scenario for secrecy performance as the system is interference-limited. In the literature, assuming that the receiver operates in half duplex (HD) mode, the aforementioned problem has been addressed via use of cooperating nodes who act as jammers to confound the eavesdropper. This paper investigates an alternative solution, which assumes the availability of a full duplex (FD) receiver. In particular, while receiving data, the receiver transmits jamming noise to degrade the eavesdropper channel. The proposed self-protection scheme eliminates the need for external helpers and provides system robustness. For the case in which global channel state information is available, we aim to design the optimal jamming covariance matrix that maximizes the secrecy rate and mitigates loop interference associated with the FD operation. We consider both fixed and optimal linear receiver design at the destination, and show that the optimal jamming covariance matrix is rank-1, and can be found via an efficient 1-D search. For the case in which only statistical information on the eavesdropper channel is available, the optimal power allocation is studied in terms of ergodic and outage secrecy rates. Simulation results verify the analysis and demonstrate substantial performance gain over conventional HD operation at the destination.

arXiv:1308.0094•IEEE Transactions on Signal Processing•Jun 18, 2013•384 citations

Secure Cooperative Network With Multi-Antenna Full-Duplex Receiver

Fatemeh Jafarian, Zahra Mobini, Mohammadali Mohammadi

In this paper, the physical-layer security of a cooperative wireless system with multi-antenna full-duplex (FD) destination is examined. More specifically, we consider a cooperative transmission scenario in which a source communicates with a destination through a relay in the presence of an eavesdropper. In order to degrade the wiretap channel, the FD destination simultaneously transmits an interference signal towards the eavesdropper, while receiving information from the relay. A joint transmit and receive beamformer design is proposed to maximize the signal-to-interference-plus-noise ratio (SINR) at the destination, while guaranteeing that the SINR at the eavesdropper is below a certain threshold. We reformulate the optimization problem as a semidefinite relaxation problem in terms of a transmit beamforming matrix. To balance the performance and system complexity, we investigate suboptimum beamforming designs based on zero-forcing criterion. We derive exact closed-form expressions for the average secrecy rates of the proposed suboptimum designs. Our results reveal that optimum and suboptimum beamforming schemes along with friendly jamming significantly improve the secrecy performance. Moreover, simulation results demonstrate that the optimum scheme outperforms suboptimum schemes, especially in high transmit power regimes.

IEEE Systems Journal•Jan 9, 2019•14 citations

Secrecy Power Allocation Using Successive Convex Approximation for In-band Full Duplex Two-way MIMO Wiretap Channel

Navneet Garg, Haifeng Luo, Tharmalingam Ratnarajah

In this paper, we consider a two-way wiretap channel in the presence of Multi-Input Multi-Output Multi-antenna Eve (MIMOME), where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex manner and Eve tries to decode the information exchanged between Alice and Bob. For this system with keyless security, we provide artificial noise (AN) based signal design while assuming AN to be known/unknown at the receivers (Alice and Bob). Power allocation problems are formulated with the objective of maximization of sum secrecy rates subject to the transmit power constraint. Accounting for non-ideal self-interference cancellation, a successive convex approximation-based algorithm for the solution for the cases of full CSI, and limited CSI knowledge, including partial information at Eve. For the limited CSI case, numerical ergodic rates are optimized. Simulation results show that with power constraints satisfied, secrecy rates are maximized, and with only partial information at Eve, secrecy rates are improved accordingly.

International Conference on Communications•Jun 9, 2024•0 citations

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

A Minorization–Maximization Algorithm for Maximizing the Secrecy Rate of the MIMOME Wiretap Channel

Mudassir Masood, Ali Ghrayeb, Prabhu Babu +2 more

We consider physical layer security in a multi-input multi-output multi-eavesdropper wiretap channel and present an exact solution to the problem of secrecy rate maximization. A system model with multiple multi-antenna eavesdroppers and multiple multi-antenna full-duplex receivers is considered, which is general enough such that models existing in the literature may be considered as special cases. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receivers. The resulting optimization problem is non-convex and difficult to solve. We develop a minorization-maximization algorithm to solve the problem exactly and the results can therefore be used to benchmark existing methods. Numerical results are presented to demonstrate the efficacy of the proposed approach.

IEEE Communications Letters•Dec 7, 2016•14 citations
In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent method, by re-structuring our problem as a separately convex program. Moreover, for the special case that the transmitter is equipped with a single antenna, an optimal transmit power allocation strategy is obtained analytically, assuming a known jamming strategy. The performance of the proposed design is then numerically evaluated compared to the other design strategies, and under different system assumptions.
In this paper we address a sum secrecy rate maximization problem for a multi-carrier and MIMO communication system. We consider the case that the receiver is capable of full-duplex (FD) operation and simultaneously sends jamming signal to a potential eavesdropper. In particular, we simultaneously take advantage of the spatial and frequency diversity in the system in order to obtain a higher level of security in the physical layer. Due to the non-convex nature of the resulting mathematical problem, we propose an iterative solution with a guaranteed convergence, based on block coordinate descent method, by re-structuring our problem as a separately convex program. Moreover, for the special case that the transmitter is equipped with a single antenna, an optimal transmit power allocation strategy is obtained analytically, assuming a known jamming strategy. We also study a FD bidirectional secure communication system, where the jamming power can be reused to enhance the sum secrecy rate. The performance of the proposed design is then numerically evaluated compared to the other design strategies, and under different system assumptions.
This paper studies secrecy rate optimization in a wireless network with a single-antenna source, a multi-antenna destination and a multi-antenna eavesdropper. This is an unfavorable scenario for secrecy performance as the system is interference-limited. In the literature, assuming that the receiver operates in half duplex (HD) mode, the aforementioned problem has been addressed via use of cooperating nodes who act as jammers to confound the eavesdropper. This paper investigates an alternative solution, which assumes the availability of a full duplex (FD) receiver. In particular, while receiving data, the receiver transmits jamming noise to degrade the eavesdropper channel. The proposed self-protection scheme eliminates the need for external helpers and provides system robustness. For the case in which global channel state information is available, we aim to design the optimal jamming covariance matrix that maximizes the secrecy rate and mitigates loop interference associated with the FD operation. We consider both fixed and optimal linear receiver design at the destination, and show that the optimal jamming covariance matrix is rank-1, and can be found via an efficient 1-D search. For the case in which only statistical information on the eavesdropper channel is available, the optimal power allocation is studied in terms of ergodic and outage secrecy rates. Simulation results verify the analysis and demonstrate substantial performance gain over conventional HD operation at the destination.
In this paper, the physical-layer security of a cooperative wireless system with multi-antenna full-duplex (FD) destination is examined. More specifically, we consider a cooperative transmission scenario in which a source communicates with a destination through a relay in the presence of an eavesdropper. In order to degrade the wiretap channel, the FD destination simultaneously transmits an interference signal towards the eavesdropper, while receiving information from the relay. A joint transmit and receive beamformer design is proposed to maximize the signal-to-interference-plus-noise ratio (SINR) at the destination, while guaranteeing that the SINR at the eavesdropper is below a certain threshold. We reformulate the optimization problem as a semidefinite relaxation problem in terms of a transmit beamforming matrix. To balance the performance and system complexity, we investigate suboptimum beamforming designs based on zero-forcing criterion. We derive exact closed-form expressions for the average secrecy rates of the proposed suboptimum designs. Our results reveal that optimum and suboptimum beamforming schemes along with friendly jamming significantly improve the secrecy performance. Moreover, simulation results demonstrate that the optimum scheme outperforms suboptimum schemes, especially in high transmit power regimes.
In this paper, we consider a two-way wiretap channel in the presence of Multi-Input Multi-Output Multi-antenna Eve (MIMOME), where both nodes (Alice and Bob) transmit and receive in an in-band full-duplex manner and Eve tries to decode the information exchanged between Alice and Bob. For this system with keyless security, we provide artificial noise (AN) based signal design while assuming AN to be known/unknown at the receivers (Alice and Bob). Power allocation problems are formulated with the objective of maximization of sum secrecy rates subject to the transmit power constraint. Accounting for non-ideal self-interference cancellation, a successive convex approximation-based algorithm for the solution for the cases of full CSI, and limited CSI knowledge, including partial information at Eve. For the limited CSI case, numerical ergodic rates are optimized. Simulation results show that with power constraints satisfied, secrecy rates are maximized, and with only partial information at Eve, secrecy rates are improved accordingly.
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.
We consider physical layer security in a multi-input multi-output multi-eavesdropper wiretap channel and present an exact solution to the problem of secrecy rate maximization. A system model with multiple multi-antenna eavesdroppers and multiple multi-antenna full-duplex receivers is considered, which is general enough such that models existing in the literature may be considered as special cases. In particular, we perform joint beamforming and artificial noise optimization in an effort to maximize the achievable secrecy rate. The optimization is performed in the presence of artificial noise generated by both transmitter and legitimate receivers. The resulting optimization problem is non-convex and difficult to solve. We develop a minorization-maximization algorithm to solve the problem exactly and the results can therefore be used to benchmark existing methods. Numerical results are presented to demonstrate the efficacy of the proposed approach.