An Efficient Scheme for Establishing Pairwise Keys for Wireless Sensor Networks
Data(s) |
09/07/2007
|
---|---|
Resumo |
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. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/41368/1/An_Efficient.pdf 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 . |
Publicador |
IEEE |
Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4268102 http://eprints.iisc.ernet.in/41368/ |
Palavras-Chave | #Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology) |
Tipo |
Conference Paper PeerReviewed |