Group Key Distribution Protocols In Wireless Sensor Networks

Wireless sensor networks (WSN) consists of a large number sensor nodes with limited power, computation, storage and communication capabilities. Sensor nodes can be deployed in many different fields such as military, environment, health, home and other commercial areas etc. Moreover, in some deployment scenarios sensor nodes need to operate under adversarial condition. Security solutions for such applications depend on existence of strong and efficient key distribution mechanisms.In this paper, we first introduce the concept of key ring evolution into the key pre-distribuion scheme. We add the key ring evolution phase after the direct pairwise key establishment phase to propose an easy and practical resistent random key pre-distribution scheme. In the proposed scheme, each node evolves the keys in its key ring after the direct pairwise key establishment phase and deletes the original keys in its the key ring. This will decrease the risk of leaking the original keys in the key pool even if the nodes were compromised by attacker, because keys in key ring are not as the same as the original ones in the key pool. Besides, this key ring evolution phase does not involve any network-wide broadcast message form BS(Base Station), hence, it is especially simple and effcient.. The new proposed scheme also combines the property of energy effcient in the key discovery phase to realize no communication requirement. Due to the lossy of the networks, self-healing key distribution is important. In this paper, we also analyze two existing constant storage selfhealing key distribution schemes in wireless sensor networks. Then, we show two attacks to the Dutta et al.'s scheme and propose a modified scheme MSHKD scheme to overcome the two flaws.Then, we propose a new self-healing key distribution scheme NSKD with RR scheme to improve the modified scheme. The most prominent properties of the new proposed scheme are as follows: achieving forward secrecy, backward secrecy and resisting to a collusion attack. So that a revoked user with the assistance of the newly joined users cannot get any information of group session keys which it is not entitled to get.Furthermore, we propose another new self-healing key distribution scheme NCSSKD with R scheme. It is shown that the proposed scheme realizes the properties such as constant storage, forward secrecy and backward secrecy. Moreover, the proposed scheme has the property of long life-span of the users' personal secret keys. So the user's personal secret key is not restricted in a fixed session in the setup phase and the user's personal secret key can be used until the user is revoked from the group. Finally, we will present that the proposed scheme is more practical and effcient than some existing schemes.Lastly, we use of the C++ compiled language to perform the system of the NCSSKD with R scheme. The experiment result demonstrates that the analysis is right and the proposed protocol is feasible and efficient in practice.