EconPapers    
Economics at your fingertips  
 

A Key Management Method Based on Dynamic Clustering for Sensor Networks

Ying Zhang, Bingxin Zheng, Pengfei Ji and Jinde Cao

International Journal of Distributed Sensor Networks, 2015, vol. 11, issue 7, 763675

Abstract: 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.

Date: 2015
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2015/763675 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:11:y:2015:i:7:p:763675

DOI: 10.1155/2015/763675

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().

 
Page updated 2025-03-19
Handle: RePEc:sae:intdis:v:11:y:2015:i:7:p:763675