A robust key predistribution scheme for wireless sensor networks

  • Qu H
  • Liu W
  • 1

    Readers

    Mendeley users who have this article in their library.
  • N/A

    Citations

    Citations of this article.

Abstract

Key management is one of the most challenging security issues in wireless sensor networks where sensor nodes are randomly deployed in a hostile territory However, due to the resource constraints, achieving such key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key-based schemes, are not suitable for wireless sensor networks. Several exiting key management schemes have been proposed in literature to establish pairwise keys for wireless sensor networks, but they either can not offer strong resilience against node capture attacks or have overly large memory requirement to achieve high degree of connectivity. In this paper, we prose a novel pairwise key management scheme to enhancing the security. In the proposed scheme, part of keys in the key pool are computed by using hash function and the hash value are as new keys and put back into the key pool. Comparison to the existing approaches, this proposed scheme provides a stronger resilience against node capture attack.

Author-supplied keywords

  • key management
  • network security
  • wirless sensor networks

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

Authors

  • HongShan Qu

  • Wen Liu

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free