Efficient path key establishment for wireless sensor networks

Authors:
Noureddine Mehallegue;Ahmed Bouridane;Emi Garcia
Affiliations:
The Institute of Electronics, Communications and Information Technology, Queen's University of Belfast, Northern Ireland Science Park, Belfast, UK;The Institute of Electronics, Communications and Information Technology, Queen's University of Belfast, Northern Ireland Science Park, Belfast, UK;The Institute of Electronics, Communications and Information Technology, Queen's University of Belfast, Northern Ireland Science Park, Belfast, UK
Venue:
EURASIP Journal on Wireless Communications and Networking
Year:
2008

Citing 11
Cited 0

An optimal class of symmetric key generation systems

Proc. of the EUROCRYPT 84 workshop on Advances in cryptology: theory and application of cryptographic techniques
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing Pairwise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach

ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
Node-disjointness-based multipath routing for mobile ad hoc networks

PE-WASUN '04 Proceedings of the 1st ACM international workshop on Performance evaluation of wireless ad hoc, sensor, and ubiquitous networks
Key Infection: Smart Trust for Smart Dust

ICNP '04 Proceedings of the 12th IEEE International Conference on Network Protocols
Establishing pairwise keys in distributed sensor networks

ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks

ACM Transactions on Information and System Security (TISSEC)
A robust on-demand path-key establishment framework via random key predistribution for wireless sensor networks

EURASIP Journal on Wireless Communications and Networking
Improving Key Distribution forWireless Sensor Networks

AHS '07 Proceedings of the Second NASA/ESA Conference on Adaptive Hardware and Systems
A survey on sensor networks

IEEE Communications Magazine

Quantified Score

Hi-index	0.04

Visualization

Abstract

Key predistribution schemes have been proposed as means to overcome wireless sensor network constraints such as limited communication and processing power. Two sensor nodes can establish a secure link with some probability based on the information stored in their memories, though it is not always possible that two sensor nodes may set up a secure link. In this paper, we propose a new approach that elects trusted common nodes called "Proxies" which reside on an existing secure path linking two sensor nodes. These sensor nodes are used to send the generated key which will be divided into parts (nuggets) according to the number of elected proxies. Our approach has been assessed against previously developed algorithms, and the results show that our algorithm discovers proxies more quickly which are closer to both end nodes, thus producing shorter path lengths. We have also assessed the impact of our algorithm on the average time to establish a secure link when the transmitter and receiver of the sensor nodes are "ON." The results show the superiority of our algorithm in this regard. Overall, the proposed algorithm is well suited for wireless sensor networks.