ACM Transactions on Sensor Networks (TOSN)
A group-based security policy for wireless sensor networks
Proceedings of the 2010 ACM Symposium on Applied Computing
Noninteractive pairwise key establishment for sensor networks
IEEE Transactions on Information Forensics and Security
A survey on key management mechanisms for distributed Wireless Sensor Networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A novel node level security policy framework for wireless sensor networks
Journal of Network and Computer Applications
A high performance and intrinsically secure key establishment protocol for wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A half-key key management scheme for wireless sensor networks
Proceedings of the 2011 ACM Symposium on Research in Applied Computation
A novel key management scheme for wireless embedded systems
ACM SIGAPP Applied Computing Review
100% connectivity for location aware code based KPD in clustered WSN: merging blocks
ISC'12 Proceedings of the 15th international conference on Information Security
Resource-efficient authentic key establishment in heterogeneous wireless sensor networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Wireless sensor networks pose new security and privacy challenges. One of the important challenges is how to bootstrap secure communications among nodes. Several key management schemes have been proposed. However, they either cannot offer strong resilience against node capture attacks, or require too much memory for achieving the desired connectivity. In this paper, we propose a novel key management scheme using deployment knowledge. In our scheme, a target field is divided into a number of hexagon grids and sensor nodes are divided into the same number of groups as that of grids, where each group is deployed into a unique grid. By using deployment knowledge, we drastically reduce the number of potential groups from which a node's neighbors may come. Thus, a pairwise key can be generated efficiently for any two neighbor nodes. Compared with existing schemes, our scheme achieves higher connectivity with a much lower memory requirement and shorter transmission range. It also outperforms others in terms of resilience against node capture attacks.