Hierarchical Grid-Based Pairwise Key Pre-distribution in Wireless Sensor Networks
Abedelaziz Mohaisen, DaeHun Nyang, KyungHee Lee

TL;DR
This paper proposes a hierarchical grid-based key pre-distribution method for wireless sensor networks, enhancing security and connectivity while considering resource constraints and deployment knowledge.
Contribution
It introduces a novel key pre-distribution technique leveraging hierarchical grid deployment and deployment knowledge to improve security and resource efficiency.
Findings
Enhanced security level proportional to sensor deployment
Improved network connectivity compared to existing methods
Resiliency against node capture attacks
Abstract
The security of wireless sensor networks is an active topic of research where both symmetric and asymmetric key cryptography issues have been studied. Due to their computational feasibility on typical sensor nodes, symmetric key algorithms that use the same key to encrypt and decrypt messages have been intensively studied and perfectly deployed in such environment. Because of the wireless sensor's limited infrastructure, the bottleneck challenge for deploying these algorithms is the key distribution. For the same reason of resources restriction, key distribution mechanisms which are used in traditional wireless networks are not efficient for sensor networks. To overcome the key distribution problem, several key pre-distribution algorithms and techniques that assign keys or keying material for the networks nodes in an offline phase have been introduced recently. In this paper, we…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSecurity in Wireless Sensor Networks · Chaos-based Image/Signal Encryption · Wireless Communication Security Techniques
