z-logo
open-access-imgOpen Access
A Key Management Method Based on Dynamic Clustering for Sensor Networks
Author(s) -
Ying Zhang,
Bingxin Zheng,
Pengfei Ji,
Jinde Cao
Publication year - 2015
Publication title -
international journal of distributed sensor networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.324
H-Index - 53
eISSN - 1550-1477
pISSN - 1550-1329
DOI - 10.1155/2015/763675
Subject(s) - computer science , key management , key (lock) , cluster analysis , distributed computing , wireless sensor network , routing (electronic design automation) , cluster (spacecraft) , particle swarm optimization , computer network , data mining , computer security , algorithm , artificial intelligence , encryption
Many cluster-based routing protocols had been proposed which had rarely considered the network security issues so far. The existing key management methods have imperfection when they combine with cluster-based routing protocols. Normally cluster-based key management method has better performance than the distributed key management method, but most of the layer-cluster key management methods do not consider the problem of key updating and being captured for cluster heads. Considering the nodes’ capture probability, particle swarm optimization algorithm was used to optimize the clustering of sensor networks. A dynamic key management method was proposed to achieve key updating regularly and provided a security strategy for sensor networks to solve the problem of being captured for cluster heads. The simulation illustrates that the proposed key management method can achieve better security performance.

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