The Secrecy Graph and Some of its Properties

Details The Secrecy Graph and Some of its Properties The Secrecy Graph and Some of its Properties

2008-04-14

arxiv.org/abs/0804.2249v1

Computer Science

Information Theory

5 pages. Accepted at 2008 IEEE Symposium on Information Theory (ISIT'08)

Scientific paper

A new random geometric graph model, the so-called secrecy graph, is introduced and studied. The graph represents a wireless network and includes only edges over which secure communication in the presence of eavesdroppers is possible. The underlying point process models considered are lattices and Poisson point processes. In the lattice case, analogies to standard bond and site percolation can be exploited to determine percolation thresholds. In the Poisson case, the node degrees are determined and percolation is studied using analytical bounds and simulations. It turns out that a small density of eavesdroppers already has a drastic impact on the connectivity of the secrecy graph.

Affiliated with

Also associated with

No associations

Rating

The Secrecy Graph and Some of its Properties 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 The Secrecy Graph and Some of its Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Secrecy Graph and Some of its Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-72105