Date Added: Mar 2012
Because of the resource-constrained nature of Wireless Sensor Networks (WSNs), it is easier to use a security system based on symmetric key cryptography. However, the distribution and management of cryptographic keys pose challenges of their own. In this paper, the authors study some deterministic methods of distribution of keys to nodes. They propose and analyze a polynomial-based scheme and a complete connectivity scheme. An analytical comparison between the schemes, in terms of security and connectivity, is presented next. Motivated by the schemes, they present a general key allocation scheme and derive general expressions for security and connectivity that are applicable to any deterministic key distribution algorithm in a certain class (not just the polynomial and full-connectivity schemes mentioned above).