Key Distribution Scheme without Deployment Knowledge
Pranav Agrawal, Joy Kuri

TL;DR
This paper introduces a post-deployment key distribution scheme for wireless sensor networks that does not require predeployment location knowledge and improves upon existing methods in connectivity, security, and efficiency.
Contribution
It proposes a novel scheme that forms groups after deployment based on physical locations, enhancing security and performance without predeployment location data.
Findings
Better connectivity than basic schemes
Reduced storage requirements
Faster key generation process
Abstract
Many basic key distribution schemes specifically tuned to wireless sensor networks have been proposed in the literature. Recently, several researchers have proposed schemes in which they have used group-based deployment models and assumed predeployment knowledge of the expected locations of nodes. They have shown that these schemes achieve better performance than the basic schemes, in terms of connectivity, resilience against node capture and storage requirements. But in many situations expected locations of nodes are not available. In this paper we propose a solution which uses the basic scheme, but does not use group-based deployment model and predeployment knowledge of the locations of nodes, and yet performs better than schemes which make the aforementioned assumptions. In our scheme, groups are formed after deployment of sensor nodes, on the basis of their physical locations, and…
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 · Energy Efficient Wireless Sensor Networks · Smart Grid Security and Resilience
