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

A Secure Cluster Formation Scheme in Wireless Sensor Networks

Author

Listed:
  • Gicheol Wang
  • Dongkyun Kim
  • Gihwan Cho

Abstract

In wireless sensor networks, clustering expedites many desirable functions such as load balancing, energy savings, and distributed key management. For secure clustering, it is very important to find compromised nodes and remove them during the initial cluster formation process. If some nodes are compromised and survive the censorship process, they can make some nodes have a different cluster view and can split a cluster into multiple clusters to deteriorate cluster quality as a whole. To resolve these problems, we propose a robust scheme against such attacks in this paper. First, our scheme generates large-sized clusters where any two nodes are at most two hops away from each other to raise the quality of clusters. Second, our scheme employs the verification of two-hop distant nodes to preserve the quality of the large-sized clusters and refrains from splitting the clusters. Last, our scheme prefers broadcast transmissions to save the energy of nodes. Security analysis proves that our scheme can identify compromised nodes and preserves the cluster membership agreement against the compromised nodes. In addition, simulation results prove that our scheme generates fewer clusters and is more secure and energy efficient than the scheme producing only small-sized clusters.

Suggested Citation

  • Gicheol Wang & Dongkyun Kim & Gihwan Cho, 2012. "A Secure Cluster Formation Scheme in Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(10), pages 301750-3017, October.
  • Handle: RePEc:sae:intdis:v:8:y:2012:i:10:p:301750
    DOI: 10.1155/2012/301750
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2012/301750
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2012/301750?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:8:y:2012:i:10:p:301750. 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.