Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes

  • Kevin Henry
  • Maura B. Paterson
  • Douglas R. Stinson
Conference paper

DOI: 10.1007/978-3-662-43414-7_5

Volume 8282 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Henry K., Paterson M.B., Stinson D.R. (2014) Practical Approaches to Varying Network Size in Combinatorial Key Predistribution Schemes. In: Lange T., Lauter K., Lisoněk P. (eds) Selected Areas in Cryptography -- SAC 2013. SAC 2013. Lecture Notes in Computer Science, vol 8282. Springer, Berlin, Heidelberg

Abstract

Combinatorial key predistribution schemes can provide a practical solution to the problem of distributing symmetric keys to the nodes of a wireless sensor network. Such schemes often inherently suit networks in which the number of nodes belongs to some restricted set of values (such as powers of primes). In a recent paper, Bose, Dey and Mukerjee have suggested that this might pose a problem, since discarding keyrings to suit a smaller network might adversely affect the properties of the scheme.

In this paper we explore this issue, with specific reference to classes of key predistribution schemes based on transversal designs. We demonstrate through experiments that, for a wide range of parameters, randomly removing keyrings in fact has a negligible and largely predictable effect on the parameters of the scheme. In order to facilitate these computations, we provide a new, efficient, generally applicable approach to computing important properties of combinatorial key predistribution schemes.

We also show that the structure of a resolvable transversal design can be exploited to give a deterministic method of removing keyrings to adjust the network size, in such a way that the properties of the resulting scheme are easy to analyse. We show that these schemes have the same asymptotic properties as the transversal design schemes on which they are based, and that for most parameter choices their behaviour is very similar.

Keywords

Wireless sensor network Key predistribution scheme Combinatorial design 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Kevin Henry
    • 1
  • Maura B. Paterson
    • 2
  • Douglas R. Stinson
    • 1
  1. 1.David R. Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Department of Economics, Mathematics and StatisticsBirkbeck, University of LondonLondonUK