By Topic

On the Connectivity of Sensor Networks Under Random Pairwise Key Predistribution

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Osman Yağan ; Department of Electrical and Computer Engineering and CyLab, Carnegie Mellon University, Pittsburgh, PA, USA ; Armand M. Makowski

We investigate the connectivity of wireless sensor networks under the random pairwise key predistribution scheme of Chan Under the assumption of full visibility, this reduces to studying the connectivity in the so-called random K-out graph H (n;K); here, n is the number of nodes and K <; n is an integer parameter affecting the number of keys stored at each node. We show that if K ≥ 2 (respectively, K=1), the probability that H (n;K) is a connected graph approaches 1 (respectively, 0) as n goes to infinity. For the one-law this is done by establishing an explicitly computable lower bound on the probability of connectivity. Using this bound, we see that with high probability, network connectivity can already be guaranteed (with K ≥ 2) by a relatively small number of sensors. This corrects earlier predictions made on the basis of a heuristic transfer of connectivity results available for Erdös-Rényi graphs.

Published in:

IEEE Transactions on Information Theory  (Volume:59 ,  Issue: 9 )