Computer Science – Information Theory
Scientific paper
2011-02-10
Computer Science
Information Theory
Submitted to IEEE Transactions on Information Theory, October 2010
Scientific paper
We investigate the secure connectivity of wireless sensor networks under the pairwise key distribution scheme of Chan et al.. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as on/off channels. We present conditions on how to scale the model parameters so that the network i) has no secure node which is isolated and ii) is securely connected, both with high probability when the number of sensor nodes becomes large. The results are given in the form of zero-one laws, and exhibit significant differences with corresponding results in the full visibility case. Through simulations these zero-one laws are shown to be valid also under a more realistic communication model, i.e., the disk model.
Makowski Armand M.
Yagan Osman
No associations
LandOfFree
Modeling the pairwise key distribution scheme in the presence of unreliable links 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 Modeling the pairwise key distribution scheme in the presence of unreliable links, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Modeling the pairwise key distribution scheme in the presence of unreliable links will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-631775