By Topic

Multi-neighbor random key pre-distribution: a probabilistic analysis

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
$31 $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

3 Author(s)
Wei-Shou Li ; Dept. of Comput. Sci. & Inf. Eng., Nat. Sun Yat-Sen Univ., Kaohsiung ; Tung-Shih Su ; Wen-Shyong Hsieh

In this study, to obtain stronger connectivity, we propose and analyze a scheme extended by random key predistribution (RKP), which can work only in highly dense networks and require path construction. We propose a multi-neighbor random key pre-distribution scheme that releases these strong constraints. Accordingly, an establishment protocol and a probabilistic analysis in terms of dependency overhead are presented. We have made use of the measure of dependence to derive the exact value of the key connectivity probability.

Published in:

Communications Letters, IEEE  (Volume:13 ,  Issue: 5 )