Designs, Codes and Cryptography

, Volume 67, Issue 1, pp 111–136

Key predistribution schemes for distributed sensor networks via block designs

Article

DOI: 10.1007/s10623-011-9590-1

Cite this article as:
Bose, M., Dey, A. & Mukerjee, R. Des. Codes Cryptogr. (2013) 67: 111. doi:10.1007/s10623-011-9590-1

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.

Keywords

Association schemeBIB designConnectivityDualPBIB designResiliency

Mathematics Subject Classification (2010)

94C3068R05

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Indian Statistical InstituteKolkataIndia
  2. 2.Indian Statistical InstituteNew DelhiIndia
  3. 3.Indian Institute of Management CalcuttaKolkataIndia