z-logo
open-access-imgOpen Access
An Efficient Key Distribution Scheme to Secure Data-Centric Routing Protocols in Hierarchical Wireless Sensor Networks
Author(s) -
Abderrahmen Guermazi,
Mohamed Abid
Publication year - 2011
Publication title -
procedia computer science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.334
H-Index - 76
ISSN - 1877-0509
DOI - 10.1016/j.procs.2011.07.028
Subject(s) - computer science , computer network , wireless sensor network , distributed computing , scalability , key (lock) , routing protocol , routing (electronic design automation) , scheme (mathematics) , key distribution , public key cryptography , computer security , encryption , database , mathematical analysis , mathematics
This paper deals with an efficient key distribution scheme which is useful to secure data-centric routing protocols in Wireless Sensor Networks. Similar to these routing protocols, the proposed scheme bootstraps secure key distribution with a centralized process which gives a multi-level hierarchical organization to WSNs. The originality of this work is to permit to use local key distribution process to establish Group Key and Pairwise Key. These two types of keys are useful to secure respectively data request diffusion and data forwarding through multi-hop routing paths. Moreover, when the WSN topology changes, the proposed scheme allows secure WSN reorganization. Security analysis explains that our proposed scheme can withstand several possible attacks against WSNs. A comparison to other solutions based on one KDC shows that the proposed scheme is significantly more efficient and scalable. This is well verified through simulations with TOSSIM under TinyOS using NesC languag

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom