Performance analysis of deterministic key allocation schemes for wireless sensor networks Online publication date: Sun, 11-Jan-2015
by Abhishek Gupta; Joy Kuri; Sugata Sanyal
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 5, No. 3, 2012
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.
Online publication date: Sun, 11-Jan-2015
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org