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

The Secrecy Outage Probability for the iii th Closest Legitimate User in Stochastic Networks

Juan Bai, Xiaofeng Tao, Jin Xu, Qimei Cui

Published May 30, 2014• 14 citations
Publisher

Abstract

Motivated by information-theoretic security, the Poisson model for secure connectivity in stochastic networks has recently received great attention. Although several expressions for secrecy characterization between a typical node and its neighbors were obtained, to the authors' knowledge, there are no exact closed-form expressions for the Rayleigh fading channel. In this letter, a method is proposed for obtaining the closed-form expressions for secrecy outage probability at the ith closest legitimate user for colluding eavesdroppers in the Rayleigh fading channel. Analytical results easily show that the secrecy outage probability exponentially increases with respect to the value of the index i, whereas the secrecy rate requirement must be sacrificed to realize secure connectivity for farther legitimate users. Furthermore, the method is also developed for non-colluding in Rayleigh fading and deterministic channels to better demonstrate the impact of collusion and Rayleigh fading on secure connectivity.

DOI
10.1109/lcomm.2014.2327627

Related papers

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•25 citations

On the Secrecy of Interference-Limited Networks under Composite Fading Channels

Hirley Alves, Carlos H. M. de Lima, Pedro H. J. Nardelli +2 more

This letter deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of path-loss, log-normal shadowing and Nakagami-m fading. Both the probability of non-zero secrecy capacity and the secrecy outage probability are then derived in closed-form expressions using tools of stochastic geometry and higher-order statistics. Our numerical results show how the secrecy metrics are affected by the disposition of the desired receiver, the eavesdropper and the legitimate transmitter.

arXiv:1411.3838•IEEE Signal Processing Letters•Jan 30, 2015•11 citations

Asymptotic Secrecy Analysis of Random Networks With Colluding Eavesdroppers

Satyanarayana Vuppala, Giuseppe Thadeu Freitas de Abreu

We perform an analysis of the secrecy outage and transmission capacity of random networks under Nakagami-m fading with colluding eavesdroppers, in the asymptotic case of large reference signal-to-noise ratios. In literature, secrecy analysis from the perspective of collusion pool has still not been well characterized. Considering a network model that accounts for uncertainties both in node locations and channel coefficients, we approximate the distribution of the aggregate path gain received by a collusion of eavesdroppers. Using this result, the asymptotic secrecy rate distribution, the secrecy outage probability, and the secrecy transmission capacity of random networks with colluding eavesdroppers are obtained, with basic factors such as density of nodes, the guarding distance, and the fading figure all accounted for by explicit parameters. Since secrecy in low-outage random networks are found to be most significant when the density of active nodes is small, the expressions derived can be seen as upper-bounds on the three aforementioned secrecy performance metrics in random networks, offering particular insight on the impact of fading, density, and guarding distances, while taking into account cooperation among eavesdroppers. Furthermore, we give a bound on colluding pool size, which is pragmatic in creating a nonprotected communication zone for the typical destination.

IEEE Systems Journal•Apr 29, 2016•5 citations

Secure Communications over Wireless Networks

Md. Zahurul I. Sarkar

Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.

IGI Global eBooks•Jan 1, 2012•0 citations

On the effect of colluding eavesdroppers on secrecy capacity scaling

O. Ozan Koyluoglu, C. Emre Koksal, Hesham El Gamal

In a powerful secrecy attack, eavesdroppers can collude, i.e., they can share their observations. Securing information in such a scenario will be an even more challenging task compared to non-colluding case. We here analyze the effect of eavesdropper collusion on the achievable performance in both the path loss and ergodic multi-path fading models. We provide two results: 1) For the Poisson point process model in a random extended network, if the legitimate nodes have unit intensity (λ = 1) and the colluding eavesdroppers have an intensity of λe= O((log n)-(2+p)) for any p > 0, almost all of the nodes can achieve a secure rate of Ω(1/(√n)); I and 2) In the K-user Gaussian interference channel with E external colluding eavesdroppers, a secure degrees of freedom of η =[1/2-E/K]+per frequency-time slot is achievable for each user in the ergodic setting (in the absence of the eavesdropper channel state information).

European Wireless Conference•Jan 1, 2010•11 citations

Secure Communications through Rayleigh Fading SIMO Channel with Multiple Eavesdroppers

M. Z. I. Sarkar, Tharmalingam Ratnarajah

We consider a single-input multiple-output (SIMO) Rayleigh fading broadcast channel, where the transmitter sends some confidential information to one user which is a legitimate receiver in the presence of multiple eavesdroppers. The eavesdroppers are mutually independent and perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that each eavesdropper gets zero bits of information. Here, we find the probability of non-zero secrecy mutual information and secure outage probability to investigate the outage behavior of proposed model. We also present a formulation of ergodic secrecy mutual information in the presence of multiple eavesdroppers.

International Conference on Communications•May 1, 2010•10 citations
Motivated by information-theoretic security, the Poisson model for secure connectivity in stochastic networks has recently received great attention. Although several expressions for secrecy characterization between a typical node and its neighbors were obtained, to the authors' knowledge, there are no exact closed-form expressions for the Rayleigh fading channel. In this letter, a method is proposed for obtaining the closed-form expressions for secrecy outage probability at the ith closest legitimate user for colluding eavesdroppers in the Rayleigh fading channel. Analytical results easily show that the secrecy outage probability exponentially increases with respect to the value of the index i, whereas the secrecy rate requirement must be sacrificed to realize secure connectivity for farther legitimate users. Furthermore, the method is also developed for non-colluding in Rayleigh fading and deterministic channels to better demonstrate the impact of collusion and Rayleigh fading on secure connectivity.
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.
This letter deals with the secrecy capacity of the radio channel in interference-limited regime. We assume that interferers are uniformly scattered over the network area according to a Point Poisson Process and the channel model consists of path-loss, log-normal shadowing and Nakagami-m fading. Both the probability of non-zero secrecy capacity and the secrecy outage probability are then derived in closed-form expressions using tools of stochastic geometry and higher-order statistics. Our numerical results show how the secrecy metrics are affected by the disposition of the desired receiver, the eavesdropper and the legitimate transmitter.
We perform an analysis of the secrecy outage and transmission capacity of random networks under Nakagami-m fading with colluding eavesdroppers, in the asymptotic case of large reference signal-to-noise ratios. In literature, secrecy analysis from the perspective of collusion pool has still not been well characterized. Considering a network model that accounts for uncertainties both in node locations and channel coefficients, we approximate the distribution of the aggregate path gain received by a collusion of eavesdroppers. Using this result, the asymptotic secrecy rate distribution, the secrecy outage probability, and the secrecy transmission capacity of random networks with colluding eavesdroppers are obtained, with basic factors such as density of nodes, the guarding distance, and the fading figure all accounted for by explicit parameters. Since secrecy in low-outage random networks are found to be most significant when the density of active nodes is small, the expressions derived can be seen as upper-bounds on the three aforementioned secrecy performance metrics in random networks, offering particular insight on the impact of fading, density, and guarding distances, while taking into account cooperation among eavesdroppers. Furthermore, we give a bound on colluding pool size, which is pragmatic in creating a nonprotected communication zone for the typical destination.
Nakagami-m fading channel is chosen to analyze the secrecy capacity for fading channels since the Nakagami-m distribution can model fading conditions, which are more or less severe than that of Rayleigh and has the advantage of including Rayleigh as a special case. At first, secrecy capacity is defined in case of full channel state information (CSI) at the transmitter, where transmitter has access to both the main channel and eavesdropper channel gains. Secondly, secrecy capacity is defined with only main channel CSI at the transmitter. Then, optimal power allocation at the transmitter that achieves the secrecy capacity is derived for both the cases. Moreover, secrecy capacity is defined under open-loop transmission scheme, and the exact closed form analytical expression for the lower bound of ergodic secrecy capacity is derived for Nakagami-m fading single-input multiple-output (SIMO) channel. In addition, secrecy capacity is defined for the AWGN channel in order to realize the information-theoretic security of wireless channels with no fading. Finally, analytical expressions for the probability of non-zero secrecy capacity and secure outage probability are derived in order to investigate the secure outage performance of fading channels.
In a powerful secrecy attack, eavesdroppers can collude, i.e., they can share their observations. Securing information in such a scenario will be an even more challenging task compared to non-colluding case. We here analyze the effect of eavesdropper collusion on the achievable performance in both the path loss and ergodic multi-path fading models. We provide two results: 1) For the Poisson point process model in a random extended network, if the legitimate nodes have unit intensity (λ = 1) and the colluding eavesdroppers have an intensity of λe= O((log n)-(2+p)) for any p > 0, almost all of the nodes can achieve a secure rate of Ω(1/(√n)); I and 2) In the K-user Gaussian interference channel with E external colluding eavesdroppers, a secure degrees of freedom of η =[1/2-E/K]+per frequency-time slot is achievable for each user in the ergodic setting (in the absence of the eavesdropper channel state information).
We consider a single-input multiple-output (SIMO) Rayleigh fading broadcast channel, where the transmitter sends some confidential information to one user which is a legitimate receiver in the presence of multiple eavesdroppers. The eavesdroppers are mutually independent and perfect secrecy is achieved when the transmitter and the legitimate receiver can communicate at some positive rate, while insuring that each eavesdropper gets zero bits of information. Here, we find the probability of non-zero secrecy mutual information and secure outage probability to investigate the outage behavior of proposed model. We also present a formulation of ergodic secrecy mutual information in the presence of multiple eavesdroppers.