IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v11y2015i9p691498.html
   My bibliography  Save this article

An Efficient Key Management Scheme Based on ECC and AVL Tree for Large Scale Wireless Sensor Networks

Author

Listed:
  • Zhongyuan Qin
  • Xinshuai Zhang
  • Kerong Feng
  • Qunfang Zhang
  • Jie Huang

Abstract

With the wide adoption of wireless sensor network (WSN), security problems emerge as a challenging issue because of the limited computational power and energy of the sensor nodes. Furthermore, the deployment of WSN in the hostile area with a large number of nodes also poses a threat. In this paper, we proposed a new efficient key management scheme based on Elliptic Curve Cryptography (ECC) and AVL tree for large scale WSNs. In our scheme the Elliptic Curve Paillier Encryption (ECPE) cryptography is adopted for communication and the AVL tree is used to store the neighbors' ID and public key. The number of keys used in our scheme is smaller than the proposed schemes as we store these keys using AVL tree to shorten the search time. Regular key updates are also designed to further improve the security of the whole network. Our scheme has a good scalability where the node addition and deletion are supported. Experimental results and analysis show our scheme can significantly reduce the energy consumed by the node and reduce the memory and computational overhead.

Suggested Citation

  • Zhongyuan Qin & Xinshuai Zhang & Kerong Feng & Qunfang Zhang & Jie Huang, 2015. "An Efficient Key Management Scheme Based on ECC and AVL Tree for Large Scale Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 11(9), pages 691498-6914, September.
  • Handle: RePEc:sae:intdis:v:11:y:2015:i:9:p:691498
    DOI: 10.1155/2015/691498
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2015/691498
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2015/691498?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:11:y:2015:i:9:p:691498. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.