Cart (Loading....) | Create Account
Close category search window
 

An effective group-based key establishment scheme for large-scale wireless sensor networks using bivariate polynomials

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Das, A.K. ; Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur ; Sengupta, I.

Key establishment in sensor networks is a challenging problem because of the resource limitations of the sensors. Due to resource constraints as well as vulnerable to physical capture of the sensor nodes, the traditional public-key routines are not feasible to apply in most sensor network architectures. Several symmetric key establishment mechanisms are proposed in the literature to establish symmetric keys between communicating sensor nodes for their secret communications in a sensor network, but most of them are not scalable. In this paper, we propose a deterministic group-based key pre-distribution scheme based on a hierarchical wireless sensor networks using bivariate polynomials over a finite field. This scheme guarantees that a direct key is always established between any two neighbor sensors in any deployment group. Our proposed scheme also guarantees that no matter how many sensor nodes are compromised, the non-compromised nodes can still communicate with 100% secrecy, i.e., our scheme is always unconditionally secure against node capture attacks. Moreover, it provides significantly better trade-off between communication overhead, network connectivity and security against node capture compared to the existing key pre-distribution schemes. Finally, it also supports dynamic node addition after the initial deployment of the nodes in the network.

Published in:

Communication Systems Software and Middleware and Workshops, 2008. COMSWARE 2008. 3rd International Conference on

Date of Conference:

6-10 Jan. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.