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
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
IEEE Transactions on Dependable and Secure Computing
Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Key Management Mechanisms in Wireless Sensor Networks
SENSORCOMM '08 Proceedings of the 2008 Second International Conference on Sensor Technologies and Applications
Enhancing the Key Pre-distribution Scheme on Wireless Sensor Networks
APSCC '08 Proceedings of the 2008 IEEE Asia-Pacific Services Computing Conference
PERCOM '09 Proceedings of the 2009 IEEE International Conference on Pervasive Computing and Communications
A survey on key management mechanisms for distributed Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A survey of security issues in wireless sensor networks
IEEE Communications Surveys & Tutorials
Hashed Random Key Pre-distribution Scheme for Large Heterogeneous Sensor Networks
TRUSTCOM '12 Proceedings of the 2012 IEEE 11th International Conference on Trust, Security and Privacy in Computing and Communications
Hi-index | 0.00 |
High secure connectivity and invulnerability are two important goals of wireless sensor networks. However, many existing key management schemes for wireless sensor networks cannot achieve the two goals simultaneously. To solve the problem, the paper proposed a key management scheme based on hash chains and auxiliary nodes. In the scheme, adjacent sensor nodes can establish shared session keys with high probabilities; besides, the validity of chain keys including their identifiers can be distinguished by hash functions. Analyses show that the scheme not only can achieve the two goals to secure wireless sensor networks, but also can has advantages in terms of storage, communication overhead, and computation overhead.