The secrecy graph and some of its properties

@article{Haenggi2008TheSG,
  title={The secrecy graph and some of its properties},
  author={Martin Haenggi},
  journal={2008 IEEE International Symposium on Information Theory},
  year={2008},
  pages={539-543}
}
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… CONTINUE READING
Highly Influential
This paper has highly influenced 13 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 150 citations. REVIEW CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 101 extracted citations

151 Citations

0102030'10'13'16'19
Citations per Year
Semantic Scholar estimates that this publication has 151 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-9 of 9 references

and M

  • P. Balister, B. Bollobás
  • Walters, “Continuum percolation with steps in an…
  • 2004
1 Excerpt

Percolation

  • G. Grimmett
  • vol. 321 of A Series of Comprehensive Studies in…
  • 1999
1 Excerpt

Stochastic Geometry and its Applications

  • D. Stoyan, W. S. Kendall, J. Mecke
  • John Wiley & Sons
  • 1995
1 Excerpt

Random plane networks,

  • E. Gilbert
  • Journal of the Society for Industrial Applied…
  • 1961
1 Excerpt

Similar Papers

Loading similar papers…