By Topic

Performance Analysis of Connectivity on Multi-hop Random Key Pre-distribution

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

2 Author(s)
Wei-Shou Li ; Dept. of Comput. Sci. & Eng., Nat. Sun Yat-Sen Univ., Kaohsiung, Taiwan ; Wen-Shyong Hsieh

In this work, to obtain stronger connectivity, we propose and analyze a scheme extended by random key pre-distribution (RKP), which can work only in highly dense networks and require path construction. We investigate the threshold property of multi-hop key connectivity in random geometric networks. We have made use of the Jansonpsilas inequality to deal with the dependency overhead. Accordingly, our analysis is from a local perspective, average node degree, to describe the behavior of the entire network. Moreover,our results show that the proposed solution provides a good approximation of the empirical probability.

Published in:

New Trends in Information and Service Science, 2009. NISS '09. International Conference on

Date of Conference:

June 30 2009-July 2 2009