The secrecy graph and some of its properties
- 1 July 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The underlying point process models considered are lattices and Poisson point processes. In the lattice case, analogies to standard bond and site percolation can be exploited to determine percolation thresholds. In the Poisson case, the node degrees are determined and percolation is studied using analytical bounds and simulations. It turns out that a small density of eavesdroppers already has a drastic impact on the connectivity of the secrecy graph.Keywords
This publication has 6 references indexed in Scilit:
- On Distances in Uniformly Random NetworksIEEE Transactions on Information Theory, 2005
- Continuum percolation with steps in the square or the discRandom Structures & Algorithms, 2005
- Continuum Percolation with Unreliable and Spread-Out ConnectionsJournal of Statistical Physics, 2005
- Fast transmission in Ad Hoc networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- Continuum percolation with steps in an annulusThe Annals of Applied Probability, 2004
- Random Plane NetworksJournal of the Society for Industrial and Applied Mathematics, 1961