Wireless integrated network sensors
Communications of the ACM
Habitat monitoring: application driver for wireless communications technology
SIGCOMM LA '01 Workshop on Data communication in Latin America and the Caribbean
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Denial of Service in Sensor Networks
Computer
Perfectly-Secure Key Distribution for Dynamic Conferences
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Energy Analysis of Public-Key Cryptography for Wireless Sensor Networks
PERCOM '05 Proceedings of the Third IEEE International Conference on Pervasive Computing and Communications
Group-based key pre-distribution in wireless sensor networks
Proceedings of the 4th ACM workshop on Wireless security
Hi-index | 0.00 |
Security service is one of the fundamental elements required to realize the wireless sensor networks. To distribute key in WSNs, the predistribution technique is commonly used, because the traditional cryptography techniques such as public key cryptography and key distribution center (KDC) are impractical to be applied in the WSNs due to resource constraints of sensor node. The most common technique in famous predistribution schemes is random key predistribution scheme which use probability method. The random key predistribution scheme has a demerit that heavy overhead is occurred on establishing a path key. To reduce the overhead, the grid-based key predistribution scheme was proposed. They uses t-degree bivariate polynomial keys and 2-dimensional grid to provide good properties such as good resilience against the node compromise, high probability of establishing a pairwise key and the minimized overhead on establishing a path key. We extend the dimension of the grid-based key predistribution scheme which is more efficient than other existing schemes. Our scheme improves many properties, except the resilience, of the grid-based key predistribution scheme. So, we introduce n-dimensional grid-based key predistribution using group based deployment as one of methods which can enhance the resilience. Through a mathematical model, we show that our scheme is more efficient than other existing schemes including 2-dimensional grid-based scheme.