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 Communications, Signal Processing, and their Applications (ICCSPA)

Wasserstein Distributionally Robust Secrecy Rate Maximization for MISO Systems with Multiple Eavesdroppers

Hala Amer, Mahmoud H. Ismail, Mohamed S. Hassan

Published Jun 15, 2026• 0 citations
Publisher

Abstract

This paper investigates the problem of secrecy rate maximization in a multiple-input single-output (MISO) system in the presence of multiple passive eavesdroppers with uncertain channel state information (CSI). Unlike conventional robust or stochastic approaches that rely on deterministic uncertainty sets or assumed parametric distributions, we adopt a Wasserstein distributionally robust optimization (DRO) framework to model the uncertainty in the eavesdropper channels. We formulate the secrecy rate maximization problem with artificial noise and derive a tractable semidefinite programming (SDP) reformulation. Simulation results demonstrate that the proposed method improves secrecy reliability compared to non-robust designs and norm-bounded worst-case approaches. In particular, the proposed framework yields superior average secrecy rates, lower outage probabilities, and improved lower-tail performance under eavesdropper CSI uncertainty.

DOI
10.1109/iccspa69228.2026.11600870

Related papers

A robust artificial noise aided transmit design for MISO secrecy

Qiang Li, Wing‐Kin Ma

This paper considers an artificial noise (AN) aided secrecy rate maximization (SRM) problem for a multi-input single-output (MISO) channel overheard by multiple single-antenna eavesdroppers. We assume that the transmitter has perfect knowledge about the channel to the desired user but imperfect knowledge about the channels to the eavesdroppers. Therefore, the resultant SRM problem is formulated in the way that we maximize the worst-case secrecy rate by jointly designing the signal covariance W and the AN covariance Σ. However, such a worst-case SRM problem turns out to be hard to optimize, since it is nonconvex in W and Σ jointly. Moreover, it falls into the class of semi-infinite optimization problems. Through a careful reformulation, we show that the worst-case SRM problem can be handled by performing a one-dimensional line search in which a sequence of semidefinite programs (SDPs) are involved. Moreover, we also show that the optimal W admits a rank-one structure, implying that transmit beamforming is secrecy rate optimal under the considered scenario. Simulation results are provided to demonstrate the robustness and effectiveness of the proposed design compared to a non-robust AN design.

arXiv:1104.4260•IEEE International Conference on Acoustics Speech and Signal Processing•May 1, 2011•20 citations

Optimal and Robust Transmit Designs for MISO Channel Secrecy by Semidefinite Programming

Qiang Li, Wing‐Kin Ma

In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scenario of an intended multi-input single-output channel overheard by multiple multi-antenna eavesdroppers. Specifically, we address the transmit covariance optimization for secrecy-rate maximization (SRM) of that scenario. The challenge of this problem is that it is a nonconvex optimization problem. This paper shows that the SRM problem can actually be solved in a convex and tractable fashion, by recasting the SRM problem as a semidefinite program (SDP). The SRM problem we solve is under the premise of perfect channel state information (CSI). This paper also deals with the imperfect CSI case. We consider a worst-case robust SRM formulation under spherical CSI uncertainties, and we develop an optimal solution to it, again via SDP. Moreover, our analysis reveals that transmit beamforming is generally the optimal transmit strategy for SRM of the considered scenario, for both the perfect and imperfect CSI cases. Simulation results are provided to illustrate the secrecy-rate performance gains of the proposed SDP solutions compared to some suboptimal transmit designs.

arXiv:1012.3875•IEEE Transactions on Signal Processing•Apr 26, 2011•245 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•41 citations

Robust Sum Secrecy Rate Optimization for MIMO Two-Way Full Duplex Systems

Zheng Chu, Tuan Anh Le, Huan Xuan Nguyen +2 more

This paper considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm- bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI uncertainty model to recast our formulate RSSRM problem into convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.

arXiv:1705.06113•IEEE Vehicular Technology Conference•Sep 1, 2017•5 citations

Secrecy Rate Optimizations for a MISO Secrecy Channel with Multiple Multiantenna Eavesdroppers

Zheng Chu, Hong Xing, Martin Johnston +1 more

This paper investigates secrecy rate optimization problems for a multiple-input-single-output (MISO) secrecy channel in the presence of multiple multiantenna eavesdroppers. Specifically, we consider power minimization and secrecy rate maximization problems for this secrecy network. First, we formulate the power minimization problem based on the assumption that the legitimate transmitter has perfect channel state information (CSI) of the legitimate user and the eavesdroppers, where this problem can be reformulated into a second-order cone program (SOCP). In addition, we provide a closed-form solution of transmit beamforming for the scenario of an eavesdropper. Next, we consider robust secrecy rate optimization problems by incorporating two probabilistic channel uncertainties with CSI feedback. By exploiting the Bernstein-type inequality and S-Procedure to convert the probabilistic secrecy rate constraint into the determined constraint, we formulate this secrecy rate optimization problem into a convex optimization framework. Furthermore, we provide analyses to show the optimal transmit covariance matrix is rank-one for the proposed schemes. Numerical results are provided to validate the performance of these two conservative approximation methods, where it is shown that the Bernstein-type inequality-based approach outperforms the S-Procedure approach in terms of the achievable secrecy rates.

IEEE Transactions on Wireless Communications•Aug 24, 2015•115 citations

Safe convex approximation to outage-based MISO secrecy rate optimization under imperfect CSI and with artificial noise

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

Consider a scenario in which an MISO channel is overheard by multiple single-antenna eavesdroppers. The transmitter has perfect channel state information (CSI) with the legitimate channel, but has imperfect CSI with the eavesdroppers' channels. The CSI uncertainties are assumed stochastic. We formulate an artificial-noise (AN)-aided secrecy-rate maximization problem where the CSI uncertainties are handled using an outage-based formulation. Our aim is to find, for this problem, tractable designs for the transmit and AN covariances. Unfortunately, outage-based optimization problems are generally difficult to solve. The main contribution here is to derive a safe, convex optimization-based, approximation to the considered problem. The advantages of the method are shown by simulations.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2011•42 citations
This paper investigates the problem of secrecy rate maximization in a multiple-input single-output (MISO) system in the presence of multiple passive eavesdroppers with uncertain channel state information (CSI). Unlike conventional robust or stochastic approaches that rely on deterministic uncertainty sets or assumed parametric distributions, we adopt a Wasserstein distributionally robust optimization (DRO) framework to model the uncertainty in the eavesdropper channels. We formulate the secrecy rate maximization problem with artificial noise and derive a tractable semidefinite programming (SDP) reformulation. Simulation results demonstrate that the proposed method improves secrecy reliability compared to non-robust designs and norm-bounded worst-case approaches. In particular, the proposed framework yields superior average secrecy rates, lower outage probabilities, and improved lower-tail performance under eavesdropper CSI uncertainty.
This paper considers an artificial noise (AN) aided secrecy rate maximization (SRM) problem for a multi-input single-output (MISO) channel overheard by multiple single-antenna eavesdroppers. We assume that the transmitter has perfect knowledge about the channel to the desired user but imperfect knowledge about the channels to the eavesdroppers. Therefore, the resultant SRM problem is formulated in the way that we maximize the worst-case secrecy rate by jointly designing the signal covariance W and the AN covariance Σ. However, such a worst-case SRM problem turns out to be hard to optimize, since it is nonconvex in W and Σ jointly. Moreover, it falls into the class of semi-infinite optimization problems. Through a careful reformulation, we show that the worst-case SRM problem can be handled by performing a one-dimensional line search in which a sequence of semidefinite programs (SDPs) are involved. Moreover, we also show that the optimal W admits a rank-one structure, implying that transmit beamforming is secrecy rate optimal under the considered scenario. Simulation results are provided to demonstrate the robustness and effectiveness of the proposed design compared to a non-robust AN design.
In recent years there has been growing interest in study of multi-antenna transmit designs for providing secure communication over the physical layer. This paper considers the scenario of an intended multi-input single-output channel overheard by multiple multi-antenna eavesdroppers. Specifically, we address the transmit covariance optimization for secrecy-rate maximization (SRM) of that scenario. The challenge of this problem is that it is a nonconvex optimization problem. This paper shows that the SRM problem can actually be solved in a convex and tractable fashion, by recasting the SRM problem as a semidefinite program (SDP). The SRM problem we solve is under the premise of perfect channel state information (CSI). This paper also deals with the imperfect CSI case. We consider a worst-case robust SRM formulation under spherical CSI uncertainties, and we develop an optimal solution to it, again via SDP. Moreover, our analysis reveals that transmit beamforming is generally the optimal transmit strategy for SRM of the considered scenario, for both the perfect and imperfect CSI cases. Simulation results are provided to illustrate the secrecy-rate performance gains of the proposed SDP solutions compared to some suboptimal transmit designs.
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 considers multiple-input multiple-output (MIMO) full-duplex (FD) two-way secrecy systems. Specifically, both multi-antenna FD legitimate nodes exchange their own confidential message in the presence of an eavesdropper. Taking into account the imperfect channel state information (CSI) of the eavesdropper, we formulate a robust sum secrecy rate maximization (RSSRM) problem subject to the outage probability constraint of the achievable sum secrecy rate and the transmit power constraint. Unlike other existing channel uncertainty models, e.g., norm- bounded and Gaussian-distribution, we exploit a moment-based random distributed CSI uncertainty model to recast our formulate RSSRM problem into convex optimization frameworks based on a Markov's inequality and robust conic reformulation, i.e., semidefinite programming (SDP). In addition, difference-of-concave (DC) approximation is employed to iteratively tackle the transmit covariance matrices of these legitimate nodes. Simulation results are provided to validate our proposed FD approaches.
This paper investigates secrecy rate optimization problems for a multiple-input-single-output (MISO) secrecy channel in the presence of multiple multiantenna eavesdroppers. Specifically, we consider power minimization and secrecy rate maximization problems for this secrecy network. First, we formulate the power minimization problem based on the assumption that the legitimate transmitter has perfect channel state information (CSI) of the legitimate user and the eavesdroppers, where this problem can be reformulated into a second-order cone program (SOCP). In addition, we provide a closed-form solution of transmit beamforming for the scenario of an eavesdropper. Next, we consider robust secrecy rate optimization problems by incorporating two probabilistic channel uncertainties with CSI feedback. By exploiting the Bernstein-type inequality and S-Procedure to convert the probabilistic secrecy rate constraint into the determined constraint, we formulate this secrecy rate optimization problem into a convex optimization framework. Furthermore, we provide analyses to show the optimal transmit covariance matrix is rank-one for the proposed schemes. Numerical results are provided to validate the performance of these two conservative approximation methods, where it is shown that the Bernstein-type inequality-based approach outperforms the S-Procedure approach in terms of the achievable secrecy rates.
Consider a scenario in which an MISO channel is overheard by multiple single-antenna eavesdroppers. The transmitter has perfect channel state information (CSI) with the legitimate channel, but has imperfect CSI with the eavesdroppers' channels. The CSI uncertainties are assumed stochastic. We formulate an artificial-noise (AN)-aided secrecy-rate maximization problem where the CSI uncertainties are handled using an outage-based formulation. Our aim is to find, for this problem, tractable designs for the transmit and AN covariances. Unfortunately, outage-based optimization problems are generally difficult to solve. The main contribution here is to derive a safe, convex optimization-based, approximation to the considered problem. The advantages of the method are shown by simulations.