Percolation and Connectivity in the Intrinsically Secure Communications Graph
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 ph...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | English |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE),
2013-09-24T18:25:52Z.
|
| Subjects: | |
| Online Access: | Get fulltext |