Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Directed diffusion: a scalable and robust communication paradigm for sensor networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Simple and fault-tolerant key agreement for dynamic collaborative groups
Proceedings of the 7th ACM conference on Computer and communications security
Key Agreement in Dynamic Peer Groups
IEEE Transactions on Parallel and Distributed Systems
Communications of the ACM
SPINS: security protocols for sensor networks
Proceedings of the 7th annual international conference on Mobile computing and networking
An architecture for building self-configurable systems
MobiHoc '00 Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing
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
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Secure Group Communication in Asynchronous Networks with Failures: Integration and Experiments
ICDCS '00 Proceedings of the The 20th International Conference on Distributed Computing Systems ( ICDCS 2000)
Providing Robust and Ubiquitous Security Support for Mobile Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A pairwise key pre-distribution scheme for wireless sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
LEAP: efficient security mechanisms for large-scale distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
A unified security framework with three key management schemes for wireless sensor networks
Computer Communications
| Hi-index | 0.00 |
In this paper, we describe a group key management protocol for hierarchical sensor networks where instead of using pre-deployed keys, each sensor node generates a partial key dynamically using a function. The function takes partial keys of its children as arguments. The design of the protocol is motivated by the fact that traditional cryptographic techniques are impractical in sensor networks because of associated high energy and computational overheads. The group key management protocol supports the establishment of two types of group keys; one for the nodes within a group (intra-cluster), and the other among a group of cluster heads (inter-cluster). The protocol handles freshness of the group key dynamically, and eliminates the involvement of a trusted third party (TTP). We have experimentally analyzed the time and energy consumption in broadcasting partial keys and the group key under two sensor routing protocols (Tiny-AODV and Tiny-Diffusion) by varying the number of nodes and key sizes. The performance study provides the optimum number of partial keys needed for computing the group key to balance the key size for security requirements and the power consumption. The experimental study also concludes that the energy consumption of SPIN [9] increases rapidly as the number of group members increases in comparison to our protocol. Similarly the pre-deployed key approach requires more communication time in comparison with this protocol. We have implemented this protocol using MICA2 motes and repeated most of the experiments which are done in simulation and we found out that the obtained results are very close to the observations made using the simulator.