ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks

Gupta, Abhishek and Nuggehalli, Pavan and Kuri, Joy (2007) An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks. In: 2nd International Conference on Communication Systems Software and Middleware, 2007. COMSWARE 2007. , 7-12 Jan. 2007 , Bangalore .

[img] PDF
An_Efficient.pdf - Published Version
Restricted to Registered users only

Download (882Kb) | Request a copy
Official URL: http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumb...

Abstract

This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key pre-distribution technique. Inspired by the recent proxy-based scheme in the work of Ling and Znati (2005) and Li et al. (2005), we introduce a friend-based scheme for establishing pairwise keys securely. We show that the chances of finding friends in a neighbourhood are considerably more than that of finding proxies, leading to lower communication overhead. Further, we prove that the friend-based scheme performs better than the proxy-based scheme both in terms of resilience against node capture as well as in energy consumption for pairwise key establishment, making our scheme more feasible.

Item Type: Conference Paper
Additional Information: Copyright 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Electrical Sciences > Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology)
Date Deposited: 13 Oct 2011 09:42
Last Modified: 13 Oct 2011 09:42
URI: http://eprints.iisc.ernet.in/id/eprint/41368

Actions (login required)

View Item View Item