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

Alleviating Secrecy Outage Events via Power Optimization for Finite-Alphabet Inputs

Guiyang Xia, Yan Lin, Xiaobo Zhou, Lichuan Gu, Feng Shu

Published Nov 15, 2021• 2 citations
Publisher

Abstract

This letter aims at minimizing the total power consumption of security-reliability transmission (SRT) for practical finite-alphabet inputs. To this end, we coercively restrict that the mutual information over the legitimate channel is greater than an anticipated rate while the one over the illegitimate channel is constrained by a low rate. Our proposed strategy contributes to the secure transmission in circumventing secrecy outage events, which is a challenge in conventional secrecy rate maximization problems. Finally, simulation results reveal the significance of our proposed SRT in terms of both the total power consumption and the secrecy performance attained.

DOI
10.1109/lwc.2021.3127956

Related papers

Secure-Reliable Transmission Designs for Full-Duplex Receiver With Finite-Alphabet Inputs

Guiyang Xia, Xiaobo Zhou, Lichuan Gu +3 more

This paper studies a convincingly secure transmission framework under an allowable outage probability for practical finite-alphabet inputs, where a full-duplex receiver (Bob) is taken into account to emit the artificial noise for deteriorating the eavesdropper’s decoding performance. We develop a secure-reliable mechanism to take the place of prior secrecy rate (SR) maximization strategy, where a closed form expression is invoked for substituting the non-closed SR expression upon exploiting the multi-exponential decay fitting approach. Hence, the intractable expectation operation over a large number of noise samples is circumvented. Moreover, a pair of critical probabilities of the reliable transmission and secure outage are first analyzed, and then a low-complexity optimization scheme is formulated. Apart from designing the transmission scheme for classically secure networks consisting of a transmitter, Bob and an eavesdropper, we further carry out an investigation on conceiving a secure-reliable strategy against multiple Eves for improving the system’s extensibility. To this end, analytical expressions of both the reliability outage and secrecy outage probabilities for multiple-Eve scenarios are also derived. Furthermore, a pragmatic iterative solution is conceived for addressing the corresponding max-min optimization problem. Finally, the simulation results validate the significance of our considered secure-reliable transmission in terms of the average SR performance attained.

IEEE Transactions on Information Forensics and Security•Jan 1, 2022•5 citations

Outage Probability Oriented Secrecy Rate Optimization for Finite-Alphabet Inputs

Hao Xu, Guiyang Xia, Xiaobo Zhou +3 more

This letter aims at investigating the secrecy outage probability (SOP) performance and formulating an associated precoder optimization problem to maximize the achievable secrecy rate (SR) for finite-alphabet inputs. As a passive eavesdropper is taken into account, we derive that: 1) the phase of the optimal precoder is orthogonal to that of the channel spanning from the transmitter to the intended receiver; 2) the modulus of the optimal precoder vector also has a linear correlation to that of the mentioned channel. Benefited from these findings, the original optimization problem is simplified to one only related to a pair of scalars, which thus dramatically reduces the computational complexity. Our simulation results finally verify the effectiveness of the proposed precoder design scheme.

IEEE Communications Letters•Jun 14, 2023•0 citations

Secure Transmission for MISOME Wiretap Channels With Finite Alphabet Inputs

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This letter investigates secure transmission design for multiple-input single-output multi-antenna eavesdropper wiretap channels with finite alphabet inputs. With statistical channel state information of the eavesdropper's channel at the transmitter, we utilize an approximated ergodic secrecy rate to reduce the computational complexity. Then we study joint optimization of beamforming design and power control for maximizing the approximated ergodic secrecy rate. We transform the original multi-variable optimization problem into a single-variable optimization problem, which can be solved by 1-D optimization techniques. Numerical examples show that the proposed scheme is superior to the conventional schemes.

IEEE Wireless Communications Letters•Jan 23, 2018•9 citations

Cooperative Jamming for Secure Transmission with Finite Alphabet Input under Individual Power Constraint

Kuo Cao, Yueming Cai, Yongpeng Wu +1 more

This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•May 31, 2018•0 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

Jamming-Aided Secure-Reliable Transmission with Untrusted Users Under Fixed-Rate Signalling

Sapna Thapar, Shankar Prakriya, Ravikant Saini

This paper investigates a jamming-assisted secure and reliable downlink transmission with untrusted users under practical fixed-rate signalling. Unlike conventional adaptive secrecy-rate formulations, the proposed framework targets fixedrate systems, where reliability and secrecy are enforced via rate thresholds, ensuring successful decoding at the legitimate receiver while preventing information leakage to untrusted users. We consider a two-user scenario where a strong near user acts as an internal eavesdropper, and the far user's data must be secured. A transmitter-assisted power apportioning strategy is developed, where available power is split across two signalling phases for near and far users. To ensure secrecy, jamming is selectively applied only during the second phase, corresponding to far user transmission. Under statistical channel state information, a closed-form expression for secrecy non-outage probability is derived. Based on this, secrecy throughput is used as a performance metric capturing both reliability and secrecy. An optimization problem is formulated to maximize secrecy performance through joint optimization of transmission and jamming power apportioning, and the optimal solution is derived using the Karush-Kuhn-Tucker conditions. Numerical results validate the analysis, present key design insights, and show the optimal solution outperforms different benchmarks.

IEEE Vehicular Technology Conference•Sep 1, 2026•0 citations
This letter aims at minimizing the total power consumption of security-reliability transmission (SRT) for practical finite-alphabet inputs. To this end, we coercively restrict that the mutual information over the legitimate channel is greater than an anticipated rate while the one over the illegitimate channel is constrained by a low rate. Our proposed strategy contributes to the secure transmission in circumventing secrecy outage events, which is a challenge in conventional secrecy rate maximization problems. Finally, simulation results reveal the significance of our proposed SRT in terms of both the total power consumption and the secrecy performance attained.
This paper studies a convincingly secure transmission framework under an allowable outage probability for practical finite-alphabet inputs, where a full-duplex receiver (Bob) is taken into account to emit the artificial noise for deteriorating the eavesdropper’s decoding performance. We develop a secure-reliable mechanism to take the place of prior secrecy rate (SR) maximization strategy, where a closed form expression is invoked for substituting the non-closed SR expression upon exploiting the multi-exponential decay fitting approach. Hence, the intractable expectation operation over a large number of noise samples is circumvented. Moreover, a pair of critical probabilities of the reliable transmission and secure outage are first analyzed, and then a low-complexity optimization scheme is formulated. Apart from designing the transmission scheme for classically secure networks consisting of a transmitter, Bob and an eavesdropper, we further carry out an investigation on conceiving a secure-reliable strategy against multiple Eves for improving the system’s extensibility. To this end, analytical expressions of both the reliability outage and secrecy outage probabilities for multiple-Eve scenarios are also derived. Furthermore, a pragmatic iterative solution is conceived for addressing the corresponding max-min optimization problem. Finally, the simulation results validate the significance of our considered secure-reliable transmission in terms of the average SR performance attained.
This letter aims at investigating the secrecy outage probability (SOP) performance and formulating an associated precoder optimization problem to maximize the achievable secrecy rate (SR) for finite-alphabet inputs. As a passive eavesdropper is taken into account, we derive that: 1) the phase of the optimal precoder is orthogonal to that of the channel spanning from the transmitter to the intended receiver; 2) the modulus of the optimal precoder vector also has a linear correlation to that of the mentioned channel. Benefited from these findings, the original optimization problem is simplified to one only related to a pair of scalars, which thus dramatically reduces the computational complexity. Our simulation results finally verify the effectiveness of the proposed precoder design scheme.
This letter investigates secure transmission design for multiple-input single-output multi-antenna eavesdropper wiretap channels with finite alphabet inputs. With statistical channel state information of the eavesdropper's channel at the transmitter, we utilize an approximated ergodic secrecy rate to reduce the computational complexity. Then we study joint optimization of beamforming design and power control for maximizing the approximated ergodic secrecy rate. We transform the original multi-variable optimization problem into a single-variable optimization problem, which can be solved by 1-D optimization techniques. Numerical examples show that the proposed scheme is superior to the conventional schemes.
This letter studies secure transmission design with finite alphabet input for cooperative jamming network under individual power constraint. By adopting the zero-force scheme, where the jamming signal is fully laid in the null space of the relay-destination channel, the problem of enhancing the achievable secrecy rate is decomposed into two independent subproblems: relay weights design and power control. We reveal that the problem of relay weights design is identical to the problem of minimizing the maximal equivalent source-eavesdropper channel gain, which can be transformed into a semi-definite programming (SDP) problem and thus is tackled using interior point method. Besides, the problem of power control is solved with the fundamental relation between mutual information and minimum mean square error (MMSE). Numerical results show that the proposed scheme achieves significant performance gains compared to the conventional Gaussian design.
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.
This paper investigates a jamming-assisted secure and reliable downlink transmission with untrusted users under practical fixed-rate signalling. Unlike conventional adaptive secrecy-rate formulations, the proposed framework targets fixedrate systems, where reliability and secrecy are enforced via rate thresholds, ensuring successful decoding at the legitimate receiver while preventing information leakage to untrusted users. We consider a two-user scenario where a strong near user acts as an internal eavesdropper, and the far user's data must be secured. A transmitter-assisted power apportioning strategy is developed, where available power is split across two signalling phases for near and far users. To ensure secrecy, jamming is selectively applied only during the second phase, corresponding to far user transmission. Under statistical channel state information, a closed-form expression for secrecy non-outage probability is derived. Based on this, secrecy throughput is used as a performance metric capturing both reliability and secrecy. An optimization problem is formulated to maximize secrecy performance through joint optimization of transmission and jamming power apportioning, and the optimal solution is derived using the Karush-Kuhn-Tucker conditions. Numerical results validate the analysis, present key design insights, and show the optimal solution outperforms different benchmarks.