Performance analysis of deterministic key allocation schemes for wireless sensor networks. (1st January 2012)

• Record Type: Journal Article
• Authors: Gupta, Abhishek; Kuri, Joy; Sanyal, Sugata
• Is Part Of: International journal of wireless and mobile computing. Volume 5:Number 3(2012)
• Page Start: 271
• Page End: 291
• Publication Date: 2012-01-01
• Subjects: symmetric key cryptography -- key distribution -- polynomial-based -- complete connectivity key distribution schemes; Mobile computing -- Periodicals; Wireless communication systems -- Periodicals; 004.6
• DOI: 10.1504/IJWMC.2012.047971
• Languages: English
• ISSNs: 1741-1084

Abstract

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, we study some deterministic methods of distribution of keys to nodes. We propose and analyse 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, we 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). With the help of these expressions, we present a number of trade-offs which should be taken into account while designing a secure system.