Please use this identifier to cite or link to this item:
|Title:||Key predistribution schemes for distributed sensor networks via block designs|
Designs, Codes, and Cryptography
|Abstract:||Key predistribution schemes for distributed sensor networks have received significant attention in the recent literature. In this paper we propose a new construction method for these schemes based on combinations of duals of standard block designs. Our method is a broad spectrum one which works for any intersection threshold. By varying the initial designs, we can generate various schemes and this makes the method quite flexible. We also obtain explicit algebraic expressions for the metrics for local connectivity and resiliency. These schemes are quite efficient with regard to connectivity and resiliency and at the same time they allow a straightforward shared-key discovery. � 2011 Springer Science+Business Media, LLC|
|Description:||Bose, Mausumi, Indian Statistical Institute, Kolkata 700108, India; Dey, Aloke, Indian Statistical Institute, New Delhi 110016, India; Mukerjee, Rahul, Indian Institute of Management Calcutta, Kolkata 700104, India|
ISSN/ISBN - 09251022
DOI - 10.1007/s10623-011-9590-1
|Appears in Collections:||Operations Management|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.