Continuum Percolation in the Intrinsically Secure Communications Graph
arXiv:1007.4002 · doi:10.1109/ISITA.2010.5649155
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.
arXiv commentAccepted in the IEEE International Symposium on Information Theory and its Applications (ISITA'10), Taichung, Taiwan, Oct. 2010
References in corpus (1)
Cited by in corpus (6)
- On the Throughput Cost of Physical Layer Security in Decentralized Wireless Networks
- Physical Layer Security in Cellular Networks: A Stochastic Geometry Approach
- When Does Relay Transmission Give a More Secure Connection in Wireless Ad Hoc Networks?
- Wireless Secrecy in Large-Scale Networks
- Techniques for Enhanced Physical-Layer Security
- Boundaries as an Enhancement Technique for Physical Layer Security