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

Aggregation Scheme with Secure Hierarchical Clustering for Wireless Sensor Networks

Author

Listed:
  • Tung-Shih Su
  • Mei-Wen Huang
  • Wei-Shou Li
  • Wen-Shyong Hsieh

Abstract

In a large-scale wireless sensor network, a topology is needed to gather state-based data from sensor network and efficiently aggregate the data given the requirements of balanced load, minimal energy consumption, and prolonged network lifetime. In this study, we proposed a ring-based hierarchical clustering scheme (RHC) consisting of four phases: predeployment, parent-child relationship building, deployment, and member join phases. Two node types are distributed throughout the network: cluster head nodes (type 1 node) and general sensor nodes (type 2 node). The type 1 node has better battery life, software capability, and hardware features than the type 2 node; therefore, the type 1 node is a better cluster head than type 2 node. Due to our IP naming rules and type 1 nodes as cluster heads, public key cryptography, such as RSA (Rivest, Shamir, Adleman), or ECC (Elliptic Curve Cryptosystem), is easily implanted to our system to strengthen our security. The sink node is the only certification authority in our system, but n level cluster heads can be extended to n level certification authorities if needed, where n is maximum number of level.

Suggested Citation

  • Tung-Shih Su & Mei-Wen Huang & Wei-Shou Li & Wen-Shyong Hsieh, 2012. "Aggregation Scheme with Secure Hierarchical Clustering for Wireless Sensor Networks," International Journal of Distributed Sensor Networks, , vol. 8(7), pages 162347-1623, July.
  • Handle: RePEc:sae:intdis:v:8:y:2012:i:7:p:162347
    DOI: 10.1155/2012/162347
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1155/2012/162347?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:7:p:162347. 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.