Continuum percolation in the intrinsically secure communications graph
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 notio...
Main Authors: | Pinto, Pedro C. (Contributor), Win, Moe Z. (Contributor) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Aeronautics and Astronautics (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor) |
Format: | Article |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2011-11-01T14:34:19Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Percolation and Connectivity in the Intrinsically Secure Communications Graph
by: Pinto, Pedro C., et al.
Published: (2013) -
Percolation: Discrete and Continuum Models
by: Bai, Wei
Published: (2014) -
Percolation of the prolate ellipsoids of rotation in the continuum
by: M. M. Buzmakova
Published: (2012-12-01) -
Intrinsically secure communication in large-scale wireless networks
by: Pinto, Pedro C. (Pedro Correia)
Published: (2010) -
Percolation centrality: quantifying graph-theoretic impact of nodes during percolation in networks.
by: Mahendra Piraveenan, et al.
Published: (2013-01-01)