Zero-one laws for connectivity in random key graphs

Details Zero-one laws for connectivity in random key graphs Zero-one laws for connectivity in random key graphs

2009-08-25

arxiv.org/abs/0908.3644v1

Mathematics

Combinatorics

Submitted to Random Structures and Algorithms

Scientific paper

The random key graph is a random graph naturally associated with the random key predistribution scheme of Eschenauer and Gligor for wireless sensor networks. For this class of random graphs we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke. In particular, the results are given under conditions which are more realistic for applications to wireless sensor networks.

Affiliated with

Also associated with

No associations

Rating

Zero-one laws for connectivity in random key graphs 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 Zero-one laws for connectivity in random key graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Zero-one laws for connectivity in random key graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233514