Abstract
AbstractBootstrapping secure communication among sensor nodes deployed in hostile environments is an important and challenging problem. A common approach to solve this problem is to use a key predistribution scheme in which each sensor node is assigned a subset of keys selected from some key pool. The resilience of a key pre-distribution scheme depends on the size of the key pool that the scheme uses for distributing keys among sensor nodes. After deployment, if two sensor nodes are within communication range of one and other, and share at least one common key, then they can establish a secure channel using the common key. We show that, when the key distribution is near-uniform, the maximum size of a key pool that can be used by any key pre-distribution scheme is upper-bounded by s2⁄p, wheres is the amount of space available on a sensor node for storing keys and p is the probability that two sensor nodes share a common key. We define the utilization factor of a key pre-distribution scheme to measure how e...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: International Journal of Computers and Applications
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.