Continuum percolation in the intrinsically secure communications graph
- 1 October 2010
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The intrinsically secure communications graph (iS-graph) is a random graph which captures the connections that can be securely established over a large-scale network, in the presence of eavesdroppers. It is based on principles of information-theoretic security, widely accepted as the strictest notion of security. In this paper, we are interested in characterizing the global properties of the iS-graph in terms of percolation on the infinite plane. We prove the existence of a phase transition in the Poisson iS-graph, whereby an unbounded component of securely connected nodes suddenly arises as we increase the density of legitimate nodes. Our work shows that long-range communication in a wireless network is still possible when a secrecy constraint is present.Keywords
Other Versions
This publication has 15 references indexed in Scilit:
- On secrecy capacity scaling in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Stochastic geometry and random graphs for the analysis and design of wireless networksIEEE Journal on Selected Areas in Communications, 2009
- A Mathematical Theory of Network Interference and Its ApplicationsProceedings of the IEEE, 2009
- PercolationPublished by Cambridge University Press (CUP) ,2006
- Percolation in the signal to interference ratio graphJournal of Applied Probability, 2006
- Information-Theoretic Key Agreement: From Weak to Strong Secrecy for FreeLecture Notes in Computer Science, 2000
- PercolationGrundlehren der mathematischen Wissenschaften, 1999
- On a continuum percolation modelAdvances in Applied Probability, 1991
- Random Plane NetworksJournal of the Society for Industrial and Applied Mathematics, 1961
- On Ising's model of ferromagnetismMathematical Proceedings of the Cambridge Philosophical Society, 1936