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 Wireless Communications Letters

Outage Constrained Secrecy Rate Maximization for MIMOME Multicast Wiretap Channels

Huanhuan Song, Hong Wen, Runfa Liao, Yi Chen, Songlin Chen

Published Nov 9, 2018• 10 citations
Publisher

Abstract

In this letter, we investigate a robust transmit optimization design based on an artificial noise (AN)-aided precoding scheme for maximizing secrecy rate in a multiple-input multiple-output multiple-eavesdropper multicast network where a transmitter sends confidential information to multiple intended users and provides energy for multiple idle nodes while multiple passive eavesdroppers try to overhear the secret information. Supposing Gaussian CSI uncertainties, the proposed outage-constrained secrecy rate maximization (OC-SRM) problem is nonconvex and its analytical analysis is more challenging than several existing OC-SRM schemes. Technically, to circumvent this mathematically intractable secrecy problem, we resort to low SNR approximation and some conservative approximations (e.g., Bernstein-type inequality and sphere bounding) to reformulate the OC-SRM problem into two convex subproblems which can be efficiently solved by the off-the-shelf optimization solver. Simulation results are provided to validate the security performance of the robust AN-aided precoding design.

DOI
10.1109/lwc.2018.2880439

Related papers

A Safe Approximation Approach to Secrecy Outage Design for MIMO Wiretap Channels

Qiang Li, Wing‐Kin Ma, Anthony Man–Cho So

Consider a multi-input multi-output (MIMO) channel wiretapped by multiple multi-antenna eavesdroppers. Assuming imperfect eavesdroppers' channel state information (CSI) at the transmitter, an outage-constrained secrecy rate maximization (OC-SRM) problem is considered. Specifically, we aim to design the transmit covariance matrix such that the outage secrecy rate is maximized for a given outage probability. The OC-SRM problem is challenging, and as a compromise, we resort to a recently developed Bernstein-type inequality approach to obtain a safe (conservative) approximate solution for OC-SRM. The merit of the proposed safe design lies in its tractability. In particular, a safe solution can be efficiently computed by alternately solving two convex conic optimization problems. The efficacy of the proposed design is demonstrated by simulations.

IEEE Signal Processing Letters•Jan 1, 2014•43 citations

Robust Outage Secrecy Rate Optimizations for a MIMO Secrecy Channel

Zheng Chu, Kanapathippillai Cumanan, Zhiguo Ding +2 more

This letter investigates robust secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, two robust secrecy rate optimization problems are studied: robust power minimization with an outage secrecy rate constraint and robust secrecy rate maximization subject to the outage secrecy rate and transmit power constraints. Here, it is assumed that the legitimate transmitter has perfect channel state information (CSI) of the legitimate receiver and imperfect CSI of the eavesdropper. Both robust problems are not convex in terms of transmit covariance matrix and the outage secrecy rate constraint. Hence, we propose a conservative approximation approach to reformulate this outage secrecy rate constraint by exploiting the Bernstein-type inequality to obtain a tractable solution for these two robust problems. Numerical results have been provided to validate the convergence and the performance of the proposed robust algorithms.

IEEE Wireless Communications Letters•Nov 26, 2014•65 citations

Energy-efficient secrecy precoding for general MIMOME wiretap channels

Bing Fang, Zuping Qian, Zhong Wei +1 more

In this paper, we study the energy-efficient secrecy precoding problem for a general multiple-input multiple-output multiple-eavesdropper (MIMOME) wiretap channel. The system model considered here consists of a common transmitter, a legitimate receiver, and multiple eavesdroppers, all mounted with multiple antennas. In order to improve the energy efficiency (EE) performance of the proposed system, an artificial noise (AN)-aided precoding scheme is adopted. Because the formulated EE maximization problem is of huge nonconvex complexity, we solve it by employing a two-tier optimization structure. Although the outer-tier optimization problem is quite simple and can be efficiently solved by the famous golden section searching method, the inner-tier optimization problem turns out to be nonconvex and cannot be easily solved. To solve it, we relax it to a secrecy rate maximization (SRM) problem, which naturally constitutes a difference convex (DC)-type programming problem and can be iteratively solved by employing a successive convex approximation (SCA) method. Numerical simulations are further provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a near-optimal solution.

International Conference on Wireless Communications and Signal Processing (WCSP)•Oct 1, 2015•2 citations

Artificial Noise Aided Secure Multicasting Design under the Secrecy Outage Probability Constraint

Bo Wang, Pengcheng Mu, Weile Zhang +1 more

This paper studies the artificial noise (AN) aided secure transmission design in a multiple-input- single-output multicast channel where a common message is transmitted to multiple receivers and only statistical channel state information of the eavesdropper is available. In this scenario, there may be no valid null space which allows the AN not to affect the legitimate receivers, and the traditional null-space AN scheme may not be applicable. To find the optimal design, we formulate a secrecy outage probability (SOP) constrained secrecy rate maximization problem which applies to an arbitrary number of the receivers. We adopt a novel approximation of the intractable SOP constraint and establish an efficient algorithm which solves the approximated problem to global optimality. The effectiveness of AN as well as the proposed solution is confirmed by simulation results. It is shown that the AN aided approach performs much better than pure beamforming even when there is no valid null space.

Globecom•Dec 1, 2017•3 citations

Robust Artificial Noise Aided Transmit Design for MISO Wiretap Channels with Channel Uncertainty

Yanqun Tang, Jun Xiong, Dongtang Ma +1 more

In this letter, we study the robust artificial noise (AN) aided transmit design for a multiple-input single-output (MISO) wiretap channel with a single-antenna eavesdropper. We consider two uncertainty models for the imperfect channel state information (CSI) on the main and eavesdropper's channels at the transmitter. For the deterministic uncertainty model, we solve the worst-case secrecy rate maximization (WC-SRM) problem via semidefinite program (SDP). For the stochastic uncertainty model, we propose a suboptimal solution to the outage probability constrained secrecy rate maximization (OP-SRM) problem based on the robust design for the WC-SRM problem. The simulation results demonstrate performance improvement of the proposed worst case robust design as compared to that based on the worst case method without usage of AN.

IEEE Communications Letters•Oct 10, 2013•42 citations

Artificial Noise-Aided Secure Multicasting Design Under Secrecy Outage Constraint

Bo Wang, Pengcheng Mu

This paper investigates the physical layer security in a multiple-input-single-output multicast channel, where a common message is transmitted to multiple receivers and only statistical channel state information of the eavesdropper is available. We consider transmitting some artificial noise (AN) along with the information-bearing signal to improve secrecy. To find the optimal AN design, we formulate a secrecy outage probability (SOP) constrained secrecy rate maximization problem. For solving this problem, we adopt a novel transformation of the intractable SOP constraint and establish an efficient algorithm which solves the transformed problem to global optimality. We also propose a low-complexity refinement method to reduce the conservatism incurred by the transformation and an efficient algorithm to find a suboptimal solution when the information-bearing signal is transmitted using single-stream beamforming. Our solution is found to be a valuable generalization of the traditional null-space AN scheme. According to our simulation results, when the number of receivers is less than that of transmit antennas, distributing AN uniformly in the null space of the legitimate channel vectors is near-optimal. When there is no valid null space, transmitting AN will interfere with some legitimate receivers, and the secrecy performance can also be improved with carefully designed AN.

IEEE Transactions on Communications•Sep 1, 2017•27 citations
In this letter, we investigate a robust transmit optimization design based on an artificial noise (AN)-aided precoding scheme for maximizing secrecy rate in a multiple-input multiple-output multiple-eavesdropper multicast network where a transmitter sends confidential information to multiple intended users and provides energy for multiple idle nodes while multiple passive eavesdroppers try to overhear the secret information. Supposing Gaussian CSI uncertainties, the proposed outage-constrained secrecy rate maximization (OC-SRM) problem is nonconvex and its analytical analysis is more challenging than several existing OC-SRM schemes. Technically, to circumvent this mathematically intractable secrecy problem, we resort to low SNR approximation and some conservative approximations (e.g., Bernstein-type inequality and sphere bounding) to reformulate the OC-SRM problem into two convex subproblems which can be efficiently solved by the off-the-shelf optimization solver. Simulation results are provided to validate the security performance of the robust AN-aided precoding design.
Consider a multi-input multi-output (MIMO) channel wiretapped by multiple multi-antenna eavesdroppers. Assuming imperfect eavesdroppers' channel state information (CSI) at the transmitter, an outage-constrained secrecy rate maximization (OC-SRM) problem is considered. Specifically, we aim to design the transmit covariance matrix such that the outage secrecy rate is maximized for a given outage probability. The OC-SRM problem is challenging, and as a compromise, we resort to a recently developed Bernstein-type inequality approach to obtain a safe (conservative) approximate solution for OC-SRM. The merit of the proposed safe design lies in its tractability. In particular, a safe solution can be efficiently computed by alternately solving two convex conic optimization problems. The efficacy of the proposed design is demonstrated by simulations.
This letter investigates robust secrecy rate optimization techniques for a multiple-input-multiple-output (MIMO) wiretap channel in the presence of a multiantenna eavesdropper. In particular, two robust secrecy rate optimization problems are studied: robust power minimization with an outage secrecy rate constraint and robust secrecy rate maximization subject to the outage secrecy rate and transmit power constraints. Here, it is assumed that the legitimate transmitter has perfect channel state information (CSI) of the legitimate receiver and imperfect CSI of the eavesdropper. Both robust problems are not convex in terms of transmit covariance matrix and the outage secrecy rate constraint. Hence, we propose a conservative approximation approach to reformulate this outage secrecy rate constraint by exploiting the Bernstein-type inequality to obtain a tractable solution for these two robust problems. Numerical results have been provided to validate the convergence and the performance of the proposed robust algorithms.
In this paper, we study the energy-efficient secrecy precoding problem for a general multiple-input multiple-output multiple-eavesdropper (MIMOME) wiretap channel. The system model considered here consists of a common transmitter, a legitimate receiver, and multiple eavesdroppers, all mounted with multiple antennas. In order to improve the energy efficiency (EE) performance of the proposed system, an artificial noise (AN)-aided precoding scheme is adopted. Because the formulated EE maximization problem is of huge nonconvex complexity, we solve it by employing a two-tier optimization structure. Although the outer-tier optimization problem is quite simple and can be efficiently solved by the famous golden section searching method, the inner-tier optimization problem turns out to be nonconvex and cannot be easily solved. To solve it, we relax it to a secrecy rate maximization (SRM) problem, which naturally constitutes a difference convex (DC)-type programming problem and can be iteratively solved by employing a successive convex approximation (SCA) method. Numerical simulations are further provided to demonstrate the proposed algorithms. Results show that our algorithms can converge fast to a near-optimal solution.
This paper studies the artificial noise (AN) aided secure transmission design in a multiple-input- single-output multicast channel where a common message is transmitted to multiple receivers and only statistical channel state information of the eavesdropper is available. In this scenario, there may be no valid null space which allows the AN not to affect the legitimate receivers, and the traditional null-space AN scheme may not be applicable. To find the optimal design, we formulate a secrecy outage probability (SOP) constrained secrecy rate maximization problem which applies to an arbitrary number of the receivers. We adopt a novel approximation of the intractable SOP constraint and establish an efficient algorithm which solves the approximated problem to global optimality. The effectiveness of AN as well as the proposed solution is confirmed by simulation results. It is shown that the AN aided approach performs much better than pure beamforming even when there is no valid null space.
In this letter, we study the robust artificial noise (AN) aided transmit design for a multiple-input single-output (MISO) wiretap channel with a single-antenna eavesdropper. We consider two uncertainty models for the imperfect channel state information (CSI) on the main and eavesdropper's channels at the transmitter. For the deterministic uncertainty model, we solve the worst-case secrecy rate maximization (WC-SRM) problem via semidefinite program (SDP). For the stochastic uncertainty model, we propose a suboptimal solution to the outage probability constrained secrecy rate maximization (OP-SRM) problem based on the robust design for the WC-SRM problem. The simulation results demonstrate performance improvement of the proposed worst case robust design as compared to that based on the worst case method without usage of AN.
This paper investigates the physical layer security in a multiple-input-single-output multicast channel, where a common message is transmitted to multiple receivers and only statistical channel state information of the eavesdropper is available. We consider transmitting some artificial noise (AN) along with the information-bearing signal to improve secrecy. To find the optimal AN design, we formulate a secrecy outage probability (SOP) constrained secrecy rate maximization problem. For solving this problem, we adopt a novel transformation of the intractable SOP constraint and establish an efficient algorithm which solves the transformed problem to global optimality. We also propose a low-complexity refinement method to reduce the conservatism incurred by the transformation and an efficient algorithm to find a suboptimal solution when the information-bearing signal is transmitted using single-stream beamforming. Our solution is found to be a valuable generalization of the traditional null-space AN scheme. According to our simulation results, when the number of receivers is less than that of transmit antennas, distributing AN uniformly in the null space of the legitimate channel vectors is near-optimal. When there is no valid null space, transmitting AN will interfere with some legitimate receivers, and the secrecy performance can also be improved with carefully designed AN.