Percolation in the Secrecy Graph

Details Percolation in the Secrecy Graph Percolation in the Secrecy Graph

2011-07-22

arxiv.org/abs/1107.4613v1

Mathematics

Probability

22 pages, 3 figures

Scientific paper

Secrecy graphs model the connectivity of wireless networks under secrecy constraints. Directed edges in the graph are present whenever a node can talk to another node securely in the presence of eavesdroppers. In the case of infinite networks, a critical parameter is the maximum density of eavesdroppers that can be accommodated while still guaranteeing an infinite component in the network, i.e., the percolation threshold. We focus on the case where the location of the nodes and the eavesdroppers are given by Poisson point processes. We present bounds for different types of percolation, including in-, out- and undirected percolation.

Affiliated with

Also associated with

No associations

Rating

Percolation in the Secrecy Graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Percolation in the Secrecy Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Percolation in the Secrecy Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-667154