Abstract

Because of the resource constraints on sensor networks, many recent key management schemes exploit the location of nodes in order to establish pairwise keys. Despite these efforts, location discovery for sensor networks is very difficult because existing schemes have failed to consider changes in the signal range and the deployment error. As a result, network performance may accidentally decrease, whereas costs increase. In this paper, we used the theory of the signal range and deployment error knowledge to analyze sensor nodes location information. Combining with the probabilistic pre-distribution method, we proposed a scheme that provides high connectivity and secure communication with better communication overhead by defining an efficient number of adjacent cells and determining the adequate length of the cell. With such optimistic results, novel deployment knowledge is also expected to provide superior performance with different types of key distribution schemes. Copyright © 2011 John Wiley & Sons, Ltd.

Full Text
Paper version not known

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 call

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.