Computer Science – Information Theory
Scientific paper
2011-02-17
Computer Science
Information Theory
To appear: Proc. IEEE Information Theory and Applications Workshop (ITA'11), San Diego, CA, Feb. 2011, pp. 1-10, Invited Paper
Scientific paper
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 provides an overview of the main properties of this new class of random graphs. We first analyze the local properties of the iS-graph, namely the degree distributions and their dependence on fading, target secrecy rate, and eavesdropper collusion. To mitigate the effect of the eavesdroppers, we propose two techniques that improve secure connectivity. Then, we analyze the global properties of the iS-graph, namely percolation on the infinite plane, and full connectivity on a finite region. These results help clarify how the presence of eavesdroppers can compromise secure communication in a large-scale network.
Barros João
Pinto Pedro C.
Win Moe Z.
No associations
LandOfFree
Wireless Secrecy in Large-Scale Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Wireless Secrecy in Large-Scale Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Wireless Secrecy in Large-Scale Networks will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-380789