Percolation and Connectivity in the Intrinsically Secure Communications Graph
Open Access
- 27 February 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 58 (3), 1716-1730
- https://doi.org/10.1109/tit.2011.2173726
Abstract
The ability to exchange secret information is critical to many commercial, governmental, and military networks. The intrinsically secure communications graph (iS-graph) is a random graph which describes the connections that can be securely established over a large-scale network, by exploiting the physical properties of the wireless medium. This paper aims to characterize the global properties of the iS-graph in terms of (1) percolation on the infinite plane, and (2) full connectivity on a finite region. First, for the Poisson iS-graph defined on the infinite plane, the existence of a phase transition is proven, whereby an unbounded component of connected nodes suddenly arises as the density of legitimate nodes is increased. This shows that long-range secure communication is still possible in the presence of eavesdroppers. Second, full connectivity on a finite region of the Poisson iS-graph is considered. The exact asymptotic behavior of full connectivity in the limit of a large density of legitimate nodes is characterized. Then, simple, explicit expressions are derived in order to closely approximate the probability of full connectivity for a finite density of legitimate nodes. These results help clarify how the presence of eavesdroppers can compromise long-range secure communication.Keywords
Other Versions
This publication has 50 references indexed in Scilit:
- Secure Communication in Stochastic Wireless Networks—Part II: Maximum Rate and CollusionIEEE Transactions on Information Forensics and Security, 2011
- Secure Communication in Stochastic Wireless Networks—Part I: ConnectivityIEEE Transactions on Information Forensics and Security, 2011
- On secrecy capacity scaling in wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2010
- Secrecy throughput of MANETs with malicious nodesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2009
- Physical-layer security in stochastic wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2008
- Percolation in the signal to interference ratio graphJournal of Applied Probability, 2006
- Nearest neighbor and hard sphere models in continuum percolationRandom Structures & Algorithms, 1996
- Continuum PercolationPublished by Cambridge University Press (CUP) ,1996
- On a continuum percolation modelAdvances in Applied Probability, 1991
- Random Plane NetworksJournal of the Society for Industrial and Applied Mathematics, 1961