Continuum percolation in the intrinsically secure communications graph
Name
Win-2010-Continuum percolation in the intrinsically secure communications graph.pdf
Size
189.85 KB
Format
Adobe PDF
Checksum (MD5)
50304cf3d7ea390a64fe1d35c1845b3b
Author(s)
Pinto, Pedro C.
Win, Moe Z.
Date Issued
October 2010
Journal
2010 International Symposium on Information Theory and its Applications (ISITA)
Publisher
Institute of Electrical and Electronics Engineers
Citation
Pinto, Pedro C., and Moe Z. Win. “Continuum percolation in the intrinsically secure communications graph.” ISITA2010, IEEE, Taichung, Taiwan, October 17-20, 2010, 349-354.
Version
Final published version
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.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISITA.2010.5649155
