Continuum Percolation in the Intrinsically Secure Communications Graph

Details Continuum Percolation in the Intrinsically Secure Communications Graph Continuum Percolation in the Intrinsically Secure Communications Graph

2010-07-22

arxiv.org/abs/1007.4002v1

Computer Science

Information Theory

Accepted in the IEEE International Symposium on Information Theory and its Applications (ISITA'10), Taichung, Taiwan, Oct. 201

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Continuum Percolation in the Intrinsically Secure Communications Graph 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 Continuum Percolation in the Intrinsically Secure Communications Graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Continuum Percolation in the Intrinsically Secure Communications Graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-138244