Multi-neighbor random key pre-distribution: a probabilistic analysis
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 constrai...
Saved in:
Published in | IEEE communications letters Vol. 13; no. 5; pp. 306 - 308 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York, NY
IEEE
01.05.2009
Institute of Electrical and Electronics Engineers The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | 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. |
---|---|
Bibliography: | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1089-7798 1558-2558 |
DOI: | 10.1109/LCOMM.2009.090144 |