IDEAS home Printed from https://ideas.repec.org/a/spr/ijsaem/vyid10.1007_s13198-020-01009-3.html
   My bibliography  Save this article

Recursive density-based hierarchical clustering in gaussian distributed sensor network

Author

Listed:
  • Meeta Gupta

    (Invertis University)

  • Adwitiya Sinha

    (Jaypee Institute of Information Technology)

Abstract

Sensor networks are data-centric networks constrained with limited battery power and processing capabilities. One of the crucial challenges in sensor network is energy hole problem. In order to deal with the challenge, there exists several mechanisms, of which clustering is considered an energy-efficient solution. In general, clustering refers to the technique of grouping nodes on the basis of similarity in spatial arrangement. An appropriately clustered network helps in processing and aggregation of sensed data before routing the information to destined location. This paper proposes a soft computing based recursive approach for implementing density-based hierarchical clustering, for Gaussian distributed sensor network. Our proposed probabilistic approach creates hierarchical clusters recursively, which not only addresses the problem of energy hole, but also reduces transmission delay, thereby maintaining data freshness.

Suggested Citation

  • Meeta Gupta & Adwitiya Sinha, 0. "Recursive density-based hierarchical clustering in gaussian distributed sensor network," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 0, pages 1-10.
    • Handle: RePEc:spr:ijsaem:v::y::i::d:10.1007_s13198-020-01009-3
    DOI: 10.1007/s13198-020-01009-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s13198-020-01009-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.
    File URL: https://libkey.io/10.1007/s13198-020-01009-3?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
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:spr:ijsaem:v::y::i::d:10.1007_s13198-020-01009-3. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.