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 Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)

Secrecy outage in random wireless networks subjected to fading

Satyanaranaya Vuppala, Giuseppe Thadeu Freitas de Abreu

Published Sep 1, 2013• 8 citations
Publisher

Abstract

We investigated the secrecy outage of unicast channels in random networks exposed to unknown numbers of randomly located eavesdroppers, obtaining original expressions which include uncertainty in terms of the location of legitimate nodes relative to eavesdroppers, the number of eavesdroppers, and fading. Under such conditions, we derive the path gain distributions of legitimate and eavesdropper nodes, as well as the corresponding secrecy non-outage. Two interesting conclusions can be drawn from our analysis. The first is that the uncertainty on the number of eavesdropper does not play a significant role in quantifying secrecy outage; and the second is that secret communication at a given rate is possible (albeit subjected to outage), with very low power. Specifically, it is found that the for a given fading figure and network density (which fundamentally determines the secrecy outage) similar secrecy outage is experience by the k-th furthest legitimate node, independent on the source's transmit power.

DOI
10.1109/pimrc.2013.6666177

Related papers

Analysis of secure unicast links in stochastic wireless networks

Satyanaranaya Vuppala, Giuseppe Thadeu Freitas de Abreu

We analyze the effect of fading onto the probability of non-zero secrecy capacity, denoted Pr{Cs:i> 0}, in stochastic wireless random networks modeled as Secrecy-Graphs. Specifically, we derive expressions to characterize the probability that the secrecy capacity of a unicast channel to a legitimate node is non-zero, in the case when the channel is affected by Nakagami-m fading, and in the presence of a random (unknown) number of eavesdroppers. The results show that fading can increase the probability of finding information-theoretic secure channels in such conditions, depending on the relative density of legitimate nodes and eavesdroppers.

International Conference on Communications•Jun 1, 2013•0 citations

Unicasting on the Secrecy Graph

Satyanaranaya Vuppala, Giuseppe Thadeu Freitas de Abreu

We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the impact of fading and of the density of legitimate nodes relative to that of eavesdroppers are obtained, in terms of the probability that secrecy capacities of unicast channels are nonzero. The results indicate that depending on the relative density of eavesdroppers and the fading intensity, the secrecy capacity of unicast channels subject to fading may be higher than under additive white Gaussian noise (AWGN).

IEEE Transactions on Information Forensics and Security•Jul 26, 2013•17 citations

Secrecy outage of Nakagami-m MISO channels with randomly located receivers

Satyanarayana Vuppala, Weigang Liu, Giuseppe Thadeu Freitas de Abreu +1 more

We perform an analysis of the secrecy outage of random networks under Nakagami-m fading with multiple transmit antennas. Specifically, using a network model that accounts for uncertainties both in node locations (distances) and channel coefficients (fading), we derive the distribution of the best path gain of eavesdroppers using Probability Generating Functional property of Poisson Point Process (PPP). Using this result, the secrecy outage probability and the conditional secrecy outage probability of random networks with multiple eavesdroppers are obtained, with basic factors such as the density of eavesdropping nodes, the number of transmit antennas and the fading coefficient all accounted for by explicit parameters. The impact of transmission factors, including number of transmit antennas, fading figure, legitimate node distance and node density are studied and analysed in numerical results.

International Conference on Communications•Jun 1, 2015•2 citations

Unicasting on the S-Graph

Satyanaranaya Vuppala, Giuseppe Thadeu Freitas de Abreu

We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the impact of fading and of the density of legitimate nodes relative to that of eavesdroppers are obtained, in terms of the probability that secrecy capacities of unicast channels are non-zero. The results indicate that depending on the relative density of eavesdroppers and the fading intensity, the secrecy capacity of unicast channels subject to fading may be higher that under AWGN.

Asilomar Conference on Signals, Systems and Computers (ACSSC)•Nov 1, 2012•1 citation

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

Secrecy analysis of random wireless networks with multiple eavesdroppers

Satyanarayana Vuppala, Symeon Chatzinotas, Björn Ottersten

In this paper, we investigate the secrecy outage probability of random wireless networks from the perspective of the k-th best source, which has still not been well characterized. We consider the artificial noise (AN) transmission strategy at source nodes to confuse the eavesdropper. Furthermore, we use a concept of security-region based on the k-th best source index. This is pragmatic in creating a protected communication zone for the typical destination and also in bounding the number of sources that can cooperate in a Coordinated Multi-point transmission (CoMP) network. We further derive the secrecy outage probability for these CoMP sources based on the security-region. We also provide a closed-form expression for the maximum number of eavesdroppers for a given secrecy outage constraint, which can effect the secure communication. Tractable numerical results are presented under various assumptions of densities, antenna gains, AN transmission factors and path loss exponents.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Oct 1, 2017•3 citations
We investigated the secrecy outage of unicast channels in random networks exposed to unknown numbers of randomly located eavesdroppers, obtaining original expressions which include uncertainty in terms of the location of legitimate nodes relative to eavesdroppers, the number of eavesdroppers, and fading. Under such conditions, we derive the path gain distributions of legitimate and eavesdropper nodes, as well as the corresponding secrecy non-outage. Two interesting conclusions can be drawn from our analysis. The first is that the uncertainty on the number of eavesdropper does not play a significant role in quantifying secrecy outage; and the second is that secret communication at a given rate is possible (albeit subjected to outage), with very low power. Specifically, it is found that the for a given fading figure and network density (which fundamentally determines the secrecy outage) similar secrecy outage is experience by the k-th furthest legitimate node, independent on the source's transmit power.
We analyze the effect of fading onto the probability of non-zero secrecy capacity, denoted Pr{Cs:i> 0}, in stochastic wireless random networks modeled as Secrecy-Graphs. Specifically, we derive expressions to characterize the probability that the secrecy capacity of a unicast channel to a legitimate node is non-zero, in the case when the channel is affected by Nakagami-m fading, and in the presence of a random (unknown) number of eavesdroppers. The results show that fading can increase the probability of finding information-theoretic secure channels in such conditions, depending on the relative density of legitimate nodes and eavesdroppers.
We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the impact of fading and of the density of legitimate nodes relative to that of eavesdroppers are obtained, in terms of the probability that secrecy capacities of unicast channels are nonzero. The results indicate that depending on the relative density of eavesdroppers and the fading intensity, the secrecy capacity of unicast channels subject to fading may be higher than under additive white Gaussian noise (AWGN).
We perform an analysis of the secrecy outage of random networks under Nakagami-m fading with multiple transmit antennas. Specifically, using a network model that accounts for uncertainties both in node locations (distances) and channel coefficients (fading), we derive the distribution of the best path gain of eavesdroppers using Probability Generating Functional property of Poisson Point Process (PPP). Using this result, the secrecy outage probability and the conditional secrecy outage probability of random networks with multiple eavesdroppers are obtained, with basic factors such as the density of eavesdropping nodes, the number of transmit antennas and the fading coefficient all accounted for by explicit parameters. The impact of transmission factors, including number of transmit antennas, fading figure, legitimate node distance and node density are studied and analysed in numerical results.
We consider the secrecy capacity of unicast channels of ad hoc networks exposed to randomly located eavesdroppers, as modeled by S-Graphs. Expressions that quantify the impact of fading and of the density of legitimate nodes relative to that of eavesdroppers are obtained, in terms of the probability that secrecy capacities of unicast channels are non-zero. The results indicate that depending on the relative density of eavesdroppers and the fading intensity, the secrecy capacity of unicast channels subject to fading may be higher that under AWGN.
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.
In this paper, we investigate the secrecy outage probability of random wireless networks from the perspective of the k-th best source, which has still not been well characterized. We consider the artificial noise (AN) transmission strategy at source nodes to confuse the eavesdropper. Furthermore, we use a concept of security-region based on the k-th best source index. This is pragmatic in creating a protected communication zone for the typical destination and also in bounding the number of sources that can cooperate in a Coordinated Multi-point transmission (CoMP) network. We further derive the secrecy outage probability for these CoMP sources based on the security-region. We also provide a closed-form expression for the maximum number of eavesdroppers for a given secrecy outage constraint, which can effect the secure communication. Tractable numerical results are presented under various assumptions of densities, antenna gains, AN transmission factors and path loss exponents.