Super Critical and Sub Critical Regimes of Percolation with Secure Communication

Details Super Critical and Sub Critical Regimes of Percolation with Secure Communication Super Critical and Sub Critical Regimes of Percolation with Secure Communication

2011-04-06

arxiv.org/abs/1104.1075v1

Computer Science

Information Theory

Scientific paper

Percolation in an information-theoretically secure graph is considered where both the legitimate and the eavesdropper nodes are distributed as Poisson point processes. For both the path-loss and the path-loss plus fading model, upper and lower bounds on the minimum density of the legitimate nodes (as a function of the density of the eavesdropper nodes) required for non-zero probability of having an unbounded cluster are derived. The lower bound is universal in nature, i.e. the constant does not depend on the density of the eavesdropper nodes.

Affiliated with

Also associated with

No associations

Rating

Super Critical and Sub Critical Regimes of Percolation with Secure Communication 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 Super Critical and Sub Critical Regimes of Percolation with Secure Communication, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Super Critical and Sub Critical Regimes of Percolation with Secure Communication will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-417951