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 International Conference on Communications workshops

Secrecy CPS Transmission Scheme for Slow Fading Independent Parallel Wiretap Channels with New SOP Constraint

Xia Wang, Pengcheng Mu, Weile Zhang, Qinye Yin

Published May 1, 2018• 0 citations
Publisher

Abstract

This paper concerns the problem of secrecy transmission on slow fading parallel wiretap channels, where a transmitter Alice wants to transmit messages to an intended receiver Bob with an illegitimate receiver Eve eavesdropping on these messages. The channels are modeled as independent Parallel Rayleigh fading channels, and the coding per sub-channel (CPS) scheme is used with distinct encoders for each sub-channel. Moreover, the channel state information (CSI)concerning Bob is assumed to be perfectly known, while only the probability density function (PDF) of the CSI concerning Eve is available since Eve is usually a passive receiver. We aim to maximize the sum of secrecy rates with the CPS scheme under the constraint of secrecy outage probability (SOP). To this end, we propose a new average SOP which is a weighted sum of all the SOP for each sub-channel, and a secrecy rate maximization (SRM) problem is formulated under the constraint of SOP. Since this SRM problem is not convex and difficult to solve, three suboptimal solutions are proposed which improves the secrecy rate step by step. Numerical results show that the new SOP constraint is beneficial to improve the secrecy rate compared to the conventional one.

DOI
10.1109/iccw.2018.8403772

Related papers

A new scheme to improve the secrecy throughput under the constraints of secrecy outage probability and average transmit power

Pengcheng Mu, Peizhi Yang, Bo Wang +2 more

The issue of physical layer security for the wireless communication with slow fading is addressed in this paper, and the secrecy outage performance is concerned. The system is modeled as a wiretap channel, and each of the transmitter and receivers is equipped with a single antenna. The channel state information (CSI) about the channel from the transmitter to the legitimate receiver (the main channel) is assumed to be perfectly known by the transmitter and the receivers, while the transmitter does not know the CSI about the channel from the transmitter to the eavesdropper (the eavesdropper's channel) but its probability density function (PDF). Differing from the fixed secrecy rate scheme and the on/off scheme in the literature, this paper adaptively chooses the secrecy rate. The secrecy rate for each value of the main channel gain is determined by the required secrecy outage probability and the PDF of the eavesdropper's channel, and the secrecy throughput is maximized under the constraint of the transmit power for the required secrecy outage probability. The quasi-static Rayleigh fading channel is used to compare our scheme with the two existing schemes, and simulation results show that our scheme outperforms them when small secrecy outage probabilities are required.

IEEE International Conference on Communications workshops•Jun 1, 2014•5 citations

Resource allocation for secret transmissions on parallel Rayleigh channels

Nicola Laurenti, Stefano Tomasin, Francesco Renna

A transmission between two agents, Alice and Bob, over a set of parallel sub-channels is overheard by a third agent Eve, through a second set of parallel sub-channels. All subchannels are flat with random and independent gains and additive white Gaussian noise (AWGN). Alice splits the total amount of available power among the sub-channels, with the purpose of maximizing the communication rate to Bob, under reliability and secrecy constraints. To this end, two schemes are considered. In one case the secret message is encoded with a single wiretap code and then split among the sub-channels. In the latter case the secret message is first split into a number of sub-messages, each separately encoded and transmitted on a different sub-channel. The achievable secrecy rates under a constraint on the secrecy outage probability (SOP) are derived and closed form expressions for Rayleigh fading sub-channels are obtained. In order to limit the complexity of resources optimization (power and rates) we also consider suboptimal solutions based on the selection of active sub-channels over which power is split either equally or according to a waterfilling algorithm with respect to the Alice-Bob channel.

International Conference on Communications•Jun 1, 2014•8 citations

A nonadaptive transmission scheme in slow fading wiretap channels with adjustable transmit power under secrecy outage constraint

Zongze Li, Pengcheng Mu, Bo Wang +3 more

Physical layer security in slow fading wiretap channels is often guaranteed by constraining the secrecy outage probability (SOP) below a maximum tolerable value. In this paper, we propose a new nonadaptive (NADP) transmission scheme for maximizing the secrecy throughput by using adjustable transmit power based on the instantaneous channel state information (CSI) of the main channel under an SOP constraint. To solve this problem, we transform the optimization problem to single-variable maximization problems in two cases, and the quasiconcavity of them is proved which allows us to use the Golden Section Method (GSM) to find the optimal solution. Simulation results are provided and verify that the proposed NADP scheme is superior to the existing one especially when the transmit power is high.

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

Secure On–Off Transmission in Slow Fading Wiretap Channel With Imperfect CSI

Pengcheng Mu, Zongze Li, Bo Wang

This paper investigates the slow fading single-antenna wiretap channel with imperfect channel state information (CSI) and studies an on-off transmission scheme with fixed communication rate, secrecy rate, and transmit power for maximizing the secrecy throughput under the constraints of secrecy outage probability (SOP) and reliability outage probability (ROP). We first solve this problem in a special case without ROP constraint for which the optimal secrecy throughput is obtained under SOP constraint. The result for the special case gives us an upper bound for the secrecy throughput with imperfect CSI. With the help of this special case, a general case with ROP constraint is studied. In this case, the problem is transformed into a one-dimensional (1-D) search problem on a finite interval, which can be solved either by the exhaustive 1-D search to obtain the optimal solution or by the golden search method (GSM) to obtain a suboptimal solution. Simulation results are finally presented to validate the theoretical analysis and show that the performance obtained by using the GSM based 1-D search is very close to that of exhaustive 1-D search.

IEEE Transactions on Vehicular Technology•May 15, 2017•21 citations

Practical Transmission Scheme With Fixed Communication Rate Under Constraints of Transmit Power and Secrecy Outage Probability

Zongmian Li, Pengcheng Mu, Bo Wang +1 more

The issue of physical layer security in single-antenna wiretap channels with slow fading is addressed in this letter. With the assumption of perfect channel state information (CSI) about the main channel and statistical CSI about the eavesdropper's channel, we propose a new secure transmission scheme under the constraints of transmit power and secrecy outage probability (SOP). This scheme fixes the communication rate and adaptively adjusts the secrecy rate and the transmit power during transmission, which is different from the conventional adaptive and non-adaptive schemes in the literature. By fixing the communication rate, the proposed scheme fixes the length of codebook and thus simplifies the codebook design. Simulation results show that the proposed scheme performs well when the SOP constraint is strict.

IEEE Communications Letters•Apr 10, 2015•17 citations

Bounds on the Secrecy Outage Probability for Dependent Fading Channels

Karl-Ludwig Besser, Eduard Axel Jorswieck

The amount of sensitive data, which is transmitted wirelessly will increase with future technologies. This raises many questions about secure data transmission. Besides cryptography, information-theoretic security gained increasing attention over the recent years. Among others, it deals with the problem of secure data transmission on the physical layer to a legitimate receiver (Bob) in the presence of an eavesdropper (Eve). In this work, we investigate upper and lower bounds on the secrecy outage probability for slowly-fading wiretap channels with an arbitrary dependency structure between the fading channels to Bob and Eve. Both cases of absence of channel-state information at the transmitter (CSI-T) and availability of CSI-T of only the main channel to the legitimate receiver are considered. Furthermore, we derive explicit expressions for the upper and lower bounds for Rayleigh fading and compare them to the case of independent channels. The joint distribution of the legitimate and eavesdropper channels has a tremendous impact on the achievable secrecy outage probability. The bounds enable developing guaranteed secrecy schemes by only measuring the marginal channel distributions.

arXiv:2004.06644•IEEE Transactions on Communications•Sep 25, 2020•24 citations
This paper concerns the problem of secrecy transmission on slow fading parallel wiretap channels, where a transmitter Alice wants to transmit messages to an intended receiver Bob with an illegitimate receiver Eve eavesdropping on these messages. The channels are modeled as independent Parallel Rayleigh fading channels, and the coding per sub-channel (CPS) scheme is used with distinct encoders for each sub-channel. Moreover, the channel state information (CSI)concerning Bob is assumed to be perfectly known, while only the probability density function (PDF) of the CSI concerning Eve is available since Eve is usually a passive receiver. We aim to maximize the sum of secrecy rates with the CPS scheme under the constraint of secrecy outage probability (SOP). To this end, we propose a new average SOP which is a weighted sum of all the SOP for each sub-channel, and a secrecy rate maximization (SRM) problem is formulated under the constraint of SOP. Since this SRM problem is not convex and difficult to solve, three suboptimal solutions are proposed which improves the secrecy rate step by step. Numerical results show that the new SOP constraint is beneficial to improve the secrecy rate compared to the conventional one.
The issue of physical layer security for the wireless communication with slow fading is addressed in this paper, and the secrecy outage performance is concerned. The system is modeled as a wiretap channel, and each of the transmitter and receivers is equipped with a single antenna. The channel state information (CSI) about the channel from the transmitter to the legitimate receiver (the main channel) is assumed to be perfectly known by the transmitter and the receivers, while the transmitter does not know the CSI about the channel from the transmitter to the eavesdropper (the eavesdropper's channel) but its probability density function (PDF). Differing from the fixed secrecy rate scheme and the on/off scheme in the literature, this paper adaptively chooses the secrecy rate. The secrecy rate for each value of the main channel gain is determined by the required secrecy outage probability and the PDF of the eavesdropper's channel, and the secrecy throughput is maximized under the constraint of the transmit power for the required secrecy outage probability. The quasi-static Rayleigh fading channel is used to compare our scheme with the two existing schemes, and simulation results show that our scheme outperforms them when small secrecy outage probabilities are required.
A transmission between two agents, Alice and Bob, over a set of parallel sub-channels is overheard by a third agent Eve, through a second set of parallel sub-channels. All subchannels are flat with random and independent gains and additive white Gaussian noise (AWGN). Alice splits the total amount of available power among the sub-channels, with the purpose of maximizing the communication rate to Bob, under reliability and secrecy constraints. To this end, two schemes are considered. In one case the secret message is encoded with a single wiretap code and then split among the sub-channels. In the latter case the secret message is first split into a number of sub-messages, each separately encoded and transmitted on a different sub-channel. The achievable secrecy rates under a constraint on the secrecy outage probability (SOP) are derived and closed form expressions for Rayleigh fading sub-channels are obtained. In order to limit the complexity of resources optimization (power and rates) we also consider suboptimal solutions based on the selection of active sub-channels over which power is split either equally or according to a waterfilling algorithm with respect to the Alice-Bob channel.
Physical layer security in slow fading wiretap channels is often guaranteed by constraining the secrecy outage probability (SOP) below a maximum tolerable value. In this paper, we propose a new nonadaptive (NADP) transmission scheme for maximizing the secrecy throughput by using adjustable transmit power based on the instantaneous channel state information (CSI) of the main channel under an SOP constraint. To solve this problem, we transform the optimization problem to single-variable maximization problems in two cases, and the quasiconcavity of them is proved which allows us to use the Golden Section Method (GSM) to find the optimal solution. Simulation results are provided and verify that the proposed NADP scheme is superior to the existing one especially when the transmit power is high.
This paper investigates the slow fading single-antenna wiretap channel with imperfect channel state information (CSI) and studies an on-off transmission scheme with fixed communication rate, secrecy rate, and transmit power for maximizing the secrecy throughput under the constraints of secrecy outage probability (SOP) and reliability outage probability (ROP). We first solve this problem in a special case without ROP constraint for which the optimal secrecy throughput is obtained under SOP constraint. The result for the special case gives us an upper bound for the secrecy throughput with imperfect CSI. With the help of this special case, a general case with ROP constraint is studied. In this case, the problem is transformed into a one-dimensional (1-D) search problem on a finite interval, which can be solved either by the exhaustive 1-D search to obtain the optimal solution or by the golden search method (GSM) to obtain a suboptimal solution. Simulation results are finally presented to validate the theoretical analysis and show that the performance obtained by using the GSM based 1-D search is very close to that of exhaustive 1-D search.
The issue of physical layer security in single-antenna wiretap channels with slow fading is addressed in this letter. With the assumption of perfect channel state information (CSI) about the main channel and statistical CSI about the eavesdropper's channel, we propose a new secure transmission scheme under the constraints of transmit power and secrecy outage probability (SOP). This scheme fixes the communication rate and adaptively adjusts the secrecy rate and the transmit power during transmission, which is different from the conventional adaptive and non-adaptive schemes in the literature. By fixing the communication rate, the proposed scheme fixes the length of codebook and thus simplifies the codebook design. Simulation results show that the proposed scheme performs well when the SOP constraint is strict.
The amount of sensitive data, which is transmitted wirelessly will increase with future technologies. This raises many questions about secure data transmission. Besides cryptography, information-theoretic security gained increasing attention over the recent years. Among others, it deals with the problem of secure data transmission on the physical layer to a legitimate receiver (Bob) in the presence of an eavesdropper (Eve). In this work, we investigate upper and lower bounds on the secrecy outage probability for slowly-fading wiretap channels with an arbitrary dependency structure between the fading channels to Bob and Eve. Both cases of absence of channel-state information at the transmitter (CSI-T) and availability of CSI-T of only the main channel to the legitimate receiver are considered. Furthermore, we derive explicit expressions for the upper and lower bounds for Rayleigh fading and compare them to the case of independent channels. The joint distribution of the legitimate and eavesdropper channels has a tremendous impact on the achievable secrecy outage probability. The bounds enable developing guaranteed secrecy schemes by only measuring the marginal channel distributions.