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

International Conference on Wireless Communications and Signal Processing (WCSP)

Secure MISO Beamforming Optimization with Randomly Distributed Eavesdroppers and Interferers

Chenguang Zhu, Jing Xu, Jiang Xue

Published Oct 1, 2019• 1 citation
Publisher

Abstract

In this paper, for the conventional MISO wiretap channel, we take into account the locations' random nature regarding those eavesdroppers and the ambient interferers in the wireless networks. For the convenience of mathematical analysis, these location distributions are modeled as Poisson point processes (PPPs). We assume that the transmitter Alice has no channel state information (CSI) about the other nodes except that it knows the statistical CSI of links about the legitimate user Bob and those eavesdroppers. In order to improve the security of Bob, we further set up a protected zone (PZ) to prevent excessive eavesdroppers from overhearing confidential signals. We investigate the probabilities of connection outage and secrecy outage to derive the closed form expression of secrecy transmission rate. Afterwards, we formulate an secrecy rate maximization problem and solve it to determine the optimized beamforming vector. The numerical results reveal the superiority of the proposed beamforming optimization over the relevant eigen beamforming design in [1].

DOI
10.1109/wcsp.2019.8927847

Related papers

Energy efficiency optimization for MISO wiretap channels with statistical and imperfect CSI

Weidong Mei, Zhi Chen, Jun Fang +1 more

This paper considers an energy-efficient transmit design in a multiple-input single-output (MISO) wiretap channel. In particular, a transmitter sends one confidential message to a legitimate receiver, which must be kept perfectly secure from multiple external eavesdroppers. Assuming partial eavesdroppers' channel state information (ECSI) at the transmitter, we aim to design the transmit beamformer such that the outage secrecy energy efficiency (SEE) is maximized. Two ECSI uncertainty scenarios are studied, i.e., statistical ECSI and imperfect ECSI. For the statistical ECSI case, only the distribution of ECSI is available at the transmitter. The SEE outage constraint admits a closed-form expression in this case, and an approximate solution can be obtained by solving a sequence of convex optimization problems. However, this does not apply to the imperfect ECSI case, where the channel lies in some uncertainty set centered at the true channel. We show that a conservative transmit scheme can be derived by invoking the Bernstein-type inequality. It is proved that our proposed methods always yield a solution of rank one, with either statistical or imperfect CSI. Numerical results are finally presented to confirm the efficacy of our proposed methods.

IEEE International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)•Jul 1, 2017•4 citations

Secrecy Rate Maximization With Artificial-Noise-Aided Beamforming for MISO Wiretap Channels Under Secrecy Outage Constraint

Bo Wang, Pengcheng Mu, Zongze Li

The secrecy rate maximization with the artificial noise (AN) aided beamforming for the multipel-input-single-output (MISO) wiretap channel is addressed in this paper under the constraint of secrecy outage probability. The channel state information (CSI) of the main channel is assumed to be perfectly known while the CSI of the eavesdropper is modeled as a complex Gaussian random vector. The generalized AN scheme where the AN is not constrained to be orthogonal to the information-bearing signal is considered. The complete solution to the maximum achievable secrecy rate and the corresponding optimal power allocation between the information-bearing signal and the AN is obtained without making any approximation of the secrecy outage probability constraint. The result shows that the optimal AN is always orthogonal to the information-bearing signal.

IEEE Communications Letters•Nov 13, 2014•62 citations

Probabilistic Robust Secure Beamforming in MISO Channels With Imperfect LCSI and Statistical ECSI

Jing Xu, Siwen Xu, Chongbin Xu

In this paper, we investigate the robust secure transmit beamformming design for multiple-input single-output wiretap channels overheard by multiple non-collaborating single-antenna eavesdroppers. Assuming that at the transmitter, the instantaneous legitimate receiver's channel state information (CSI) is imperfect and only the statistical eavesdroppers' CSI is known, we seek to maximize the target secrecy rate R with the total transmit power constraint and the secrecy outage probability constraint. The resulting outage-constrained secrecy rate maximization (O-SRM) is non-convex and difficult to solve. Thus, we develop an efficient algorithm to solve it and determine the robust secure beamforming design. Specifically speaking, we first prove that the original O-SRM problem can be solved by an equivalent outage-constrained power minimization problem (O-PMP), which is easy to perform semi-definite relaxation (SDR) and can be solved by semi-definite program (SDP) consequently. Second, we transform the non-convex secrecy rate outage constraints into deterministic ones by resorting to Bernstein-type inequality II. Finally, by solving the convex approximation of the O-PMP with different Rs and bisection search over R, we convert the original O-SRM problem into a sequence of solvable SDPs. Simulation results are provided to verify the secrecy-rate performance improvement of the proposed robust beamforming compared with the existing worst-case design proposed by Li and Ma and the simple non-robust maximum-ratio transmission.

IEEE Access•Jan 1, 2017•10 citations

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

Enhancing the Secrecy Performance of Gaussian MISO VLC Wiretap Channels with Randomly Located Eavesdroppers

Mohamed Amine Arfaoui, Ali Ghrayeb, Chadi M. Assi

We study in this paper the achievable secrecy rate of the Gaussian multiple-input single-output (MISO) visible light communication (VLC) in the presence of randomly located eavesdroppers. We consider a system model comprising a transmitter (Alice) equipped with multiple fixtures of LEDs, one legitimate receiver (Bob) equipped with a single photo-diode (PD) and a group of randomly located eavesdroppers, each equipped with a single PD. The channel is modeled as deterministic, real- valued and subject to an amplitude constraint, through which Alice wants to communicate privately with Bob. We consider the case where the eavesdroppers are colluding together, i.e., they act jointly in eavesdropping on the communication between Alice and Bob. We adopt the truncated generalized normal (TGN) as input signaling and beamforming as transmission strategy. At first, we derive a closed-form expression of the average achievable secrecy rate as a function of the density of eavesdroppers using stochastic geometry. Then, we investigate the optimal beamformer that maximizes the average achievable secrecy rate of the system. Finally, the analysis is verified by Monte Carlo simulations.

International Conference on Communications•May 1, 2018•4 citations

Robust beamforming for MISO wiretap channel by optimizing the worst-case secrecy capacity

Wei Shi, James A. Ritcey

A Gaussian multiple-input single-output (MISO) secrecy channel is considered, where a transmitter is equipped with multiple antennas, and an intended receiver and an eavesdropper each equipped with a single antenna. This paper studies the robust beamforming design in the presence of uncertainty of channel state information (CSI) on the eavesdropper channel. Under the assumption that all possible states of the eavesdropper channel are in a given set, the problem of optimizing the transmit covariance for the worst-case secrecy capacity which is the maximum transmission rate at which the eavesdropper is unable to decode under any channel realization in the set, is cast as a max-min optimization problem. We propose to transfer the max-min problem into a convex optimization problem that can be solved efficiently. The optimal secrecy rate and transmit covariance are expressed in the form of the generalized eigenvalue and eigenvector, the same form as the conventional case of the perfect eavesdropper's CSI, which indicates our results is the generalization of the conventional case.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2010•32 citations
In this paper, for the conventional MISO wiretap channel, we take into account the locations' random nature regarding those eavesdroppers and the ambient interferers in the wireless networks. For the convenience of mathematical analysis, these location distributions are modeled as Poisson point processes (PPPs). We assume that the transmitter Alice has no channel state information (CSI) about the other nodes except that it knows the statistical CSI of links about the legitimate user Bob and those eavesdroppers. In order to improve the security of Bob, we further set up a protected zone (PZ) to prevent excessive eavesdroppers from overhearing confidential signals. We investigate the probabilities of connection outage and secrecy outage to derive the closed form expression of secrecy transmission rate. Afterwards, we formulate an secrecy rate maximization problem and solve it to determine the optimized beamforming vector. The numerical results reveal the superiority of the proposed beamforming optimization over the relevant eigen beamforming design in [1].
This paper considers an energy-efficient transmit design in a multiple-input single-output (MISO) wiretap channel. In particular, a transmitter sends one confidential message to a legitimate receiver, which must be kept perfectly secure from multiple external eavesdroppers. Assuming partial eavesdroppers' channel state information (ECSI) at the transmitter, we aim to design the transmit beamformer such that the outage secrecy energy efficiency (SEE) is maximized. Two ECSI uncertainty scenarios are studied, i.e., statistical ECSI and imperfect ECSI. For the statistical ECSI case, only the distribution of ECSI is available at the transmitter. The SEE outage constraint admits a closed-form expression in this case, and an approximate solution can be obtained by solving a sequence of convex optimization problems. However, this does not apply to the imperfect ECSI case, where the channel lies in some uncertainty set centered at the true channel. We show that a conservative transmit scheme can be derived by invoking the Bernstein-type inequality. It is proved that our proposed methods always yield a solution of rank one, with either statistical or imperfect CSI. Numerical results are finally presented to confirm the efficacy of our proposed methods.
The secrecy rate maximization with the artificial noise (AN) aided beamforming for the multipel-input-single-output (MISO) wiretap channel is addressed in this paper under the constraint of secrecy outage probability. The channel state information (CSI) of the main channel is assumed to be perfectly known while the CSI of the eavesdropper is modeled as a complex Gaussian random vector. The generalized AN scheme where the AN is not constrained to be orthogonal to the information-bearing signal is considered. The complete solution to the maximum achievable secrecy rate and the corresponding optimal power allocation between the information-bearing signal and the AN is obtained without making any approximation of the secrecy outage probability constraint. The result shows that the optimal AN is always orthogonal to the information-bearing signal.
In this paper, we investigate the robust secure transmit beamformming design for multiple-input single-output wiretap channels overheard by multiple non-collaborating single-antenna eavesdroppers. Assuming that at the transmitter, the instantaneous legitimate receiver's channel state information (CSI) is imperfect and only the statistical eavesdroppers' CSI is known, we seek to maximize the target secrecy rate R with the total transmit power constraint and the secrecy outage probability constraint. The resulting outage-constrained secrecy rate maximization (O-SRM) is non-convex and difficult to solve. Thus, we develop an efficient algorithm to solve it and determine the robust secure beamforming design. Specifically speaking, we first prove that the original O-SRM problem can be solved by an equivalent outage-constrained power minimization problem (O-PMP), which is easy to perform semi-definite relaxation (SDR) and can be solved by semi-definite program (SDP) consequently. Second, we transform the non-convex secrecy rate outage constraints into deterministic ones by resorting to Bernstein-type inequality II. Finally, by solving the convex approximation of the O-PMP with different Rs and bisection search over R, we convert the original O-SRM problem into a sequence of solvable SDPs. Simulation results are provided to verify the secrecy-rate performance improvement of the proposed robust beamforming compared with the existing worst-case design proposed by Li and Ma and the simple non-robust maximum-ratio transmission.
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.
We study in this paper the achievable secrecy rate of the Gaussian multiple-input single-output (MISO) visible light communication (VLC) in the presence of randomly located eavesdroppers. We consider a system model comprising a transmitter (Alice) equipped with multiple fixtures of LEDs, one legitimate receiver (Bob) equipped with a single photo-diode (PD) and a group of randomly located eavesdroppers, each equipped with a single PD. The channel is modeled as deterministic, real- valued and subject to an amplitude constraint, through which Alice wants to communicate privately with Bob. We consider the case where the eavesdroppers are colluding together, i.e., they act jointly in eavesdropping on the communication between Alice and Bob. We adopt the truncated generalized normal (TGN) as input signaling and beamforming as transmission strategy. At first, we derive a closed-form expression of the average achievable secrecy rate as a function of the density of eavesdroppers using stochastic geometry. Then, we investigate the optimal beamformer that maximizes the average achievable secrecy rate of the system. Finally, the analysis is verified by Monte Carlo simulations.
A Gaussian multiple-input single-output (MISO) secrecy channel is considered, where a transmitter is equipped with multiple antennas, and an intended receiver and an eavesdropper each equipped with a single antenna. This paper studies the robust beamforming design in the presence of uncertainty of channel state information (CSI) on the eavesdropper channel. Under the assumption that all possible states of the eavesdropper channel are in a given set, the problem of optimizing the transmit covariance for the worst-case secrecy capacity which is the maximum transmission rate at which the eavesdropper is unable to decode under any channel realization in the set, is cast as a max-min optimization problem. We propose to transfer the max-min problem into a convex optimization problem that can be solved efficiently. The optimal secrecy rate and transmit covariance are expressed in the form of the generalized eigenvalue and eigenvector, the same form as the conventional case of the perfect eavesdropper's CSI, which indicates our results is the generalization of the conventional case.