Gupta, Abhishek and Kuri, Joy and Nuggehalli, Pavan (2006) A new scheme for establishing pairwise keys for wireless sensor networks. In: 8th International Conference on Distributed Computing and Networking,, Dec 27-30, 2006, Guwahati, India, pp. 522-533.
fulltext.pdf - Published Version
Restricted to Registered users only
Download (292Kb) | Request a copy
This paper addresses the problem of secure path key establishment in wireless sensor networks that uses the random key predistribution technique. Inspired by the recent proxy-based scheme in  and , we introduce a fiiend-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 friendbased scheme performs better than the proxy-based scheme in terms of resilience against node capture.
|Item Type:||Conference Paper|
|Additional Information:||Copyright of this article belongs to Springer.|
|Department/Centre:||Division of Electrical Sciences > Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology)|
|Date Deposited:||01 Sep 2010 05:59|
|Last Modified:||19 Sep 2010 06:12|
Actions (login required)