Abstract
We propose two deterministic key predistribution schemes in a wireless sensor network (WSN), in which sensor nodes are deployed randomly. Both the schemes are based on combinatorial designs, called partially balanced incomplete block designs (PBIBD). An important feature of our scheme is that every pair of nodes within communication range can communicate directly, making communication faster and efficient. The number of keys per node is of the order of $\sqrt N$, where $N$ is the number of nodes in the network. Our second design has the added advantage that we can introduce new nodes in the network keeping the key pool fixed. This makes the network scalable. We study the resiliency of the network under node compromise and show that our designs give better results than the existing ones.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: International Journal of High Performance Computing and Networking
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
