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

Asilomar Conference on Signals, Systems and Computers (ACSSC)

Transmit beamforming and cooperative jamming for MIMOME wiretap channels

Wei Shi, James A. Ritcey

Published Nov 1, 2011• 2 citations
Publisher

Abstract

Joint transmit beamforming and cooperative jamming for MIMOME (multiple-input multiple-output multi-antenna-eavesdropper) wiretap channel is studied, where the model consists of a transmitter, a friendly jammer, a receiver and an eavesdropper. The optimization problem of finding transmit and jamming covariances to maximize the secrecy rate is non-convex, and blindly searching will result in local optima. Because of the transmit beamforming, the MIMOME channel can be related to an effective MISOSE channel. Using this relation, we propose an iterative algorithm that in each iteration: 1) searches the jamming covariance for the effective MISOSE channel and 2) updates the effective MISOSE channel. Numerical results show that our proposed algorithm achieves higher objective whereas blind search is trapped at local optima. The proposed algorithm achieves higher secrecy rate than the existing artificial noise scheme.

DOI
10.1109/acssc.2011.6190003

Related papers

Beyond Secrecy Rate in MISO Wiretap Channels: An Information Jamming Approach

Haiyang Zhang, Lingjie Duan

Cooperative jamming is a widely used approach for improving the security of wireless networks. In this approach, a friendly jammer sends jamming signals to disrupt the reception of the eavesdropper, which inevitably interferes with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to exceed the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that multiple multi-antenna information jammers (iJammers) transmit the source signals of the legitimate transmitter rather than independent noise signals for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. Specifically, we aim at maximizing the achievable secrecy rate by jointly optimizing the beamforming vectors at Alice and iJammers, subject to the individual transmit power constraints. We first propose a semi-definite relaxation based approach to solve the original non-convex problem optimally. For ease of implementation, we then provide a suboptimal distributed information beamforming scheme, whose optimal solution is obtained in closed-form. Finally, we extend our study to the imperfect channel state information case. Simulation results show that our proposed information jamming approach significantly outperforms the traditional cooperative jamming approach in terms of achievable secrecy rate.

IEEE Transactions on Communications•Feb 11, 2020•4 citations

Secrecy rate maximization for MIMO wiretap channels with a cooperative jammer using alternating optimization

Hehao Niu, Bangning Zhang, Daoxing Guo +1 more

In this paper, we study the secrecy rate maximization (SRM) problem for a multiple-input-multiple-output (MIMO) secrecy channel, where a multi-antenna cooperative jammer is employed to improve secret communication in the presence of multiple multi-antenna eavesdroppers. The SRM problem are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To solve the non-convexity issues, we propose an alternating optimization (AO) approach to design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. Simulation results validated the performance of the proposed algorithms.

International Conference on Electronics Instrumentation & Information Systems (EIIS)•Jun 1, 2017•2 citations

Going beyond Secrecy Rate via Information Jamming

Haiyang Zhang, Lingjie Duan

Cooperative jamming approach has been commonly used in the field of physical layer security to achieve a good secrecy rate of wireless networks. In this approach, the Gaussian noise signal sent by a friendly jammer can disrupt the reception of the eavesdropper, however, it may also interfere with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to go beyond the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that a multi-antenna friendly jammer transmits the source message rather than Gaussian noise signal for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. In particular, we aim to maximize the achievable secrecy rate by optimizing the information jammer's beamforming vector. Though the optimization problem is non-convex, we successfully solve it optimally via a two-stage based numerical approach. To gain more useful analytical results, we also propose two suboptimal jamming schemes with low computation, by targeting at improving the legitimate reception and avoiding the eavesdropping, respectively. Finally, numerical results show that the proposed information jamming approach significantly helps go beyond the secrecy rate of the existing cooperative jamming approach, especially when the transmit power of the jammer is large enough.

Globecom•Dec 1, 2018•7 citations

Secrecy Rate Optimizations for a MIMO Secrecy Channel With a Cooperative Jammer

Zheng Chu, Kanapathippillai Cumanan, Zhiguo Ding +2 more

In this paper, we study different secrecy rate optimization techniques for a multiple-input–multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to improve secret communication in the presence of a multiantenna eavesdropper. Specifically, we consider two optimization problems, namely, power minimization and secrecy rate maximization. These problems are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To circumvent these nonconvexity issues, we alternatively design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. For a given transmit covariance matrix at the cooperative jammer, we solve the power minimization and secrecy rate maximization problems based on a Taylor series expansion. Then, we propose two iterative algorithms to solve these approximated problems. In addition, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploitingS-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming. Moreover, we consider the secrecy rate maximization problem based on game theory, where the jammer introduces charges for its jamming service based on the amount of the interference caused to the eavesdropper. This secrecy rate maximization problem is formulated into aStackelberggame where the jammer and the transmitter are the leader and the follower of the game, respectively. For the proposed game,Stackelbergequilibrium is analytically derived. Simulation results have been provided to validate the convergence and performance of the proposed algorithms. In addition, it is shown that the proposed robust scheme outperforms the nonrobust scheme in terms of the achieved secrecy rate and the worst-case secrecy rate. Finally, theStackelbergequilibrium solution has been validated through numerical results.

IEEE Transactions on Vehicular Technology•Oct 6, 2014•206 citations

Optimal Cooperative Jamming for Multiuser Broadcast Channel with Multiple Eavesdroppers

Jun Jie Yang, Il‐Min Kim, Dong In Kim

Cooperative jamming for multiuser multiple input multiple output (MIMO) broadcast channel is studied to enhance the physical layer security with the help of a friendly jammer. We assume the base station transmits multiple independent data streams to multiple legitimate users. During the transmission, however, there are multiple eavesdroppers with multiple antennas that have interests in the streams from the base station. In order to wiretap the desired streams, the eavesdroppers may collude or not, and maximize the signal-to-interference-plus-noise ratio (SINR) of the desired streams using receive beamforming. The optimal cooperative jammer is designed to keep the achieved SINR at eavesdroppers below a threshold to guarantee that the transmission from the base station to legitimate users is confidential. One main advantage of the proposed cooperative jamming scheme is that no modification is needed for the existing precoding schemes at the base station and decoding schemes at legitimate users. Thus, any existing practical precoding/decoding schemes for multiuser MIMO broadcast channel can be applied directly with the help of a friendly jammer using the proposed cooperative jamming.

IEEE Transactions on Wireless Communications•Jun 1, 2013•82 citations

Analysis and Design of Multi-antenna Systems for Physical-layer Security and Interference Characterization

Wei Shi

It has become crucial to provide effective solutions to the security issues associated in a wireless transmission medium.The essential goal of physical-layer security is to enable the transmission of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers.We begin with an overview of the foundations dating back to the pioneering work on physical-layer security, and the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems.The explosion of interest in multi-antenna systems led to the realization that exploiting the available spatial dimensions could also enhance the secrecy capabilities of wireless channels.Our work analyzes and optimizes multi-antenna systems under various assumptions on system model and channel information: transmission only versus joint transmission/jamming, perfect channel state information (CSI), imperfect CSI, and completely unknown CSI.With perfect CSI: We first study the problem of joint transmit and cooperative jamming to maximize the secrecy rate of MISOSE wiretap channels.We reduce the problem of maximizing the secrecy rate to the problem of finding the optimal jamming levels, and solve it by a one-dimensional search that is computationally affordable.We then study MIMOME wiretap channel with transmit beamforming (the rank-1 constraint on the transmit covariance matrix) and cooperative jamming.We propose an iterative algorithm by relating the MIMOME channel to the effective MISOSE channel.With imperfect CSI: assuming the CSI of the receiver and the eavesdropper channel belong to given uncertainty sets, we optimize the worst-case secrecy rate of the MISOSE wiretap channel.By proving the saddle-point solution, we transformed the worst-case optimization problem into a quasi-convex optimization problem.Moreover, for jamming-aided MISOSE channel with imperfect CSI, we propose to approximate the worst-case secrecy rate as the worst-case SINR-ratio problem.A minimax solution is shown to exist for the problem, based on which some insightful results of the optimal transmit and jamming covariances are obtained.A quasi-convex optimization algorithm that is tractable and efficient is provided for solving the worst-case SINR-ratio problem.With no CSI: We study how cooperative jamming helps improve the secure throughput of large decentralized networks where both the locations and CSI of eavesdroppers are unknown.The spatial distributions are modeled as Poisson point processes.The helping jammers broadcast artificial noise that confuses eavesdropper but zero-forcing to the legitimate receiver.A jamming protocol based on IEEE 802.11RTS/CTS is proposed. Closed-form results analyze the benefits of jamming on secure communications.This thesis continues on analyzing large distributed networks using stochastic geometry.The geometry of the locations of the nodes plays a key role since it determines the signalto-interference-plus-noise-ratio (SINR) at each receiver.The advantages of using stochastic geometry are: 1) performance metric can be exactly derived in some important cases, and tightly bounded in many others; 2) performance depends on fundamental network parameters, such as the densities of the underlying point processes.Design insights are obtainable from these performance expressions.Specifically, we study the performance of minimummean-square-error (MMSE) receivers under supposition of multiple Poisson point processes, non-homogeneous Poisson process and cluster Poisson point process of interferers.We discover that the SINR outage exhibits a superposition property for multiple homogeneous (or non-homogeneous) Poisson fields of interferers.Using this property, we extend the outage analysis to Poisson clustered processes which is formed by Poisson clusters consisting of Poisson distributed children points.

•Apr 17, 2013•0 citations
Joint transmit beamforming and cooperative jamming for MIMOME (multiple-input multiple-output multi-antenna-eavesdropper) wiretap channel is studied, where the model consists of a transmitter, a friendly jammer, a receiver and an eavesdropper. The optimization problem of finding transmit and jamming covariances to maximize the secrecy rate is non-convex, and blindly searching will result in local optima. Because of the transmit beamforming, the MIMOME channel can be related to an effective MISOSE channel. Using this relation, we propose an iterative algorithm that in each iteration: 1) searches the jamming covariance for the effective MISOSE channel and 2) updates the effective MISOSE channel. Numerical results show that our proposed algorithm achieves higher objective whereas blind search is trapped at local optima. The proposed algorithm achieves higher secrecy rate than the existing artificial noise scheme.
Cooperative jamming is a widely used approach for improving the security of wireless networks. In this approach, a friendly jammer sends jamming signals to disrupt the reception of the eavesdropper, which inevitably interferes with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to exceed the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that multiple multi-antenna information jammers (iJammers) transmit the source signals of the legitimate transmitter rather than independent noise signals for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. Specifically, we aim at maximizing the achievable secrecy rate by jointly optimizing the beamforming vectors at Alice and iJammers, subject to the individual transmit power constraints. We first propose a semi-definite relaxation based approach to solve the original non-convex problem optimally. For ease of implementation, we then provide a suboptimal distributed information beamforming scheme, whose optimal solution is obtained in closed-form. Finally, we extend our study to the imperfect channel state information case. Simulation results show that our proposed information jamming approach significantly outperforms the traditional cooperative jamming approach in terms of achievable secrecy rate.
In this paper, we study the secrecy rate maximization (SRM) problem for a multiple-input-multiple-output (MIMO) secrecy channel, where a multi-antenna cooperative jammer is employed to improve secret communication in the presence of multiple multi-antenna eavesdroppers. The SRM problem are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To solve the non-convexity issues, we propose an alternating optimization (AO) approach to design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. Simulation results validated the performance of the proposed algorithms.
Cooperative jamming approach has been commonly used in the field of physical layer security to achieve a good secrecy rate of wireless networks. In this approach, the Gaussian noise signal sent by a friendly jammer can disrupt the reception of the eavesdropper, however, it may also interfere with the legitimate receiver. In this paper, we propose a novel approach, namely, information jamming, to go beyond the secrecy rate achieved by the traditional cooperative jamming approach in a multiple-input single-output (MISO) wiretap channel. We propose that a multi-antenna friendly jammer transmits the source message rather than Gaussian noise signal for simultaneously enhancing the signal strength at the legitimate receiver and canceling the received signal at the eavesdropper. In particular, we aim to maximize the achievable secrecy rate by optimizing the information jammer's beamforming vector. Though the optimization problem is non-convex, we successfully solve it optimally via a two-stage based numerical approach. To gain more useful analytical results, we also propose two suboptimal jamming schemes with low computation, by targeting at improving the legitimate reception and avoiding the eavesdropping, respectively. Finally, numerical results show that the proposed information jamming approach significantly helps go beyond the secrecy rate of the existing cooperative jamming approach, especially when the transmit power of the jammer is large enough.
In this paper, we study different secrecy rate optimization techniques for a multiple-input–multiple-output (MIMO) secrecy channel, where a multiantenna cooperative jammer is employed to improve secret communication in the presence of a multiantenna eavesdropper. Specifically, we consider two optimization problems, namely, power minimization and secrecy rate maximization. These problems are not jointly convex in terms of the transmit covariance matrices of the legitimate transmitter and the cooperative jammer. To circumvent these nonconvexity issues, we alternatively design the transmit covariance matrix of the legitimate transmitter and the cooperative jammer. For a given transmit covariance matrix at the cooperative jammer, we solve the power minimization and secrecy rate maximization problems based on a Taylor series expansion. Then, we propose two iterative algorithms to solve these approximated problems. In addition, we develop a robust scheme by incorporating channel uncertainties associated with the eavesdropper. By exploitingS-Procedure, we show that these robust optimization problems can be formulated into semidefinite programming. Moreover, we consider the secrecy rate maximization problem based on game theory, where the jammer introduces charges for its jamming service based on the amount of the interference caused to the eavesdropper. This secrecy rate maximization problem is formulated into aStackelberggame where the jammer and the transmitter are the leader and the follower of the game, respectively. For the proposed game,Stackelbergequilibrium is analytically derived. Simulation results have been provided to validate the convergence and performance of the proposed algorithms. In addition, it is shown that the proposed robust scheme outperforms the nonrobust scheme in terms of the achieved secrecy rate and the worst-case secrecy rate. Finally, theStackelbergequilibrium solution has been validated through numerical results.
Cooperative jamming for multiuser multiple input multiple output (MIMO) broadcast channel is studied to enhance the physical layer security with the help of a friendly jammer. We assume the base station transmits multiple independent data streams to multiple legitimate users. During the transmission, however, there are multiple eavesdroppers with multiple antennas that have interests in the streams from the base station. In order to wiretap the desired streams, the eavesdroppers may collude or not, and maximize the signal-to-interference-plus-noise ratio (SINR) of the desired streams using receive beamforming. The optimal cooperative jammer is designed to keep the achieved SINR at eavesdroppers below a threshold to guarantee that the transmission from the base station to legitimate users is confidential. One main advantage of the proposed cooperative jamming scheme is that no modification is needed for the existing precoding schemes at the base station and decoding schemes at legitimate users. Thus, any existing practical precoding/decoding schemes for multiuser MIMO broadcast channel can be applied directly with the help of a friendly jammer using the proposed cooperative jamming.
It has become crucial to provide effective solutions to the security issues associated in a wireless transmission medium.The essential goal of physical-layer security is to enable the transmission of confidential messages over a wireless medium in the presence of unauthorized eavesdroppers.We begin with an overview of the foundations dating back to the pioneering work on physical-layer security, and the evolution of secure transmission strategies from point-to-point channels to multiple-antenna systems.The explosion of interest in multi-antenna systems led to the realization that exploiting the available spatial dimensions could also enhance the secrecy capabilities of wireless channels.Our work analyzes and optimizes multi-antenna systems under various assumptions on system model and channel information: transmission only versus joint transmission/jamming, perfect channel state information (CSI), imperfect CSI, and completely unknown CSI.With perfect CSI: We first study the problem of joint transmit and cooperative jamming to maximize the secrecy rate of MISOSE wiretap channels.We reduce the problem of maximizing the secrecy rate to the problem of finding the optimal jamming levels, and solve it by a one-dimensional search that is computationally affordable.We then study MIMOME wiretap channel with transmit beamforming (the rank-1 constraint on the transmit covariance matrix) and cooperative jamming.We propose an iterative algorithm by relating the MIMOME channel to the effective MISOSE channel.With imperfect CSI: assuming the CSI of the receiver and the eavesdropper channel belong to given uncertainty sets, we optimize the worst-case secrecy rate of the MISOSE wiretap channel.By proving the saddle-point solution, we transformed the worst-case optimization problem into a quasi-convex optimization problem.Moreover, for jamming-aided MISOSE channel with imperfect CSI, we propose to approximate the worst-case secrecy rate as the worst-case SINR-ratio problem.A minimax solution is shown to exist for the problem, based on which some insightful results of the optimal transmit and jamming covariances are obtained.A quasi-convex optimization algorithm that is tractable and efficient is provided for solving the worst-case SINR-ratio problem.With no CSI: We study how cooperative jamming helps improve the secure throughput of large decentralized networks where both the locations and CSI of eavesdroppers are unknown.The spatial distributions are modeled as Poisson point processes.The helping jammers broadcast artificial noise that confuses eavesdropper but zero-forcing to the legitimate receiver.A jamming protocol based on IEEE 802.11RTS/CTS is proposed. Closed-form results analyze the benefits of jamming on secure communications.This thesis continues on analyzing large distributed networks using stochastic geometry.The geometry of the locations of the nodes plays a key role since it determines the signalto-interference-plus-noise-ratio (SINR) at each receiver.The advantages of using stochastic geometry are: 1) performance metric can be exactly derived in some important cases, and tightly bounded in many others; 2) performance depends on fundamental network parameters, such as the densities of the underlying point processes.Design insights are obtainable from these performance expressions.Specifically, we study the performance of minimummean-square-error (MMSE) receivers under supposition of multiple Poisson point processes, non-homogeneous Poisson process and cluster Poisson point process of interferers.We discover that the SINR outage exhibits a superposition property for multiple homogeneous (or non-homogeneous) Poisson fields of interferers.Using this property, we extend the outage analysis to Poisson clustered processes which is formed by Poisson clusters consisting of Poisson distributed children points.