IDEAS home Printed from https://ideas.repec.org/a/gam/jeners/v14y2021i13p3935-d587254.html
   My bibliography  Save this article

FEHCA: A Fault-Tolerant Energy-Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks

Author

Listed:
  • Ankur Choudhary

    (Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun 248002, India)

  • Santosh Kumar

    (Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun 248002, India)

  • Sharad Gupta

    (Department of Computer Science and Engineering, Graphic Era Deemed to be University, Dehradun 248002, India)

  • Mingwei Gong

    (Faculty of Science and Technology, Mathematics and Computing, Mount Royal University, Calgary, AB T3E 6K6, Canada)

  • Aniket Mahanti

    (School of Computer Science, University of Auckland, Auckland 1010, New Zealand)

Abstract

Technological advancements have led to increased confidence in the design of large-scale wireless networks that comprise small energy constraint devices. Despite the boost in technological advancements, energy dissipation and fault tolerance are amongst the key deciding factors while designing and deploying wireless sensor networks. This paper proposes a Fault-tolerant Energy-efficient Hierarchical Clustering Algorithm (FEHCA) for wireless sensor networks (WSNs), which demonstrates energy-efficient clustering and fault-tolerant operation of cluster heads (CHs). It treats CHs as no special node but equally prone to faults as normal sensing nodes of the cluster. The proposed scheme addresses some of the limitations of prominent hierarchical clustering algorithms, such as the randomized election of the cluster heads after each round, which results in significant energy dissipation; non-consideration of the residual energy of the sensing nodes while selecting cluster heads, etc. It utilizes the capability of vector quantization to partition the deployed sensors into an optimal number of clusters and ensures that almost the entire area to be monitored is alive for most of the network’s lifetime. This supports better decision-making compared to decisions made on the basis of limited area sensing data after a few rounds of communication. The scheme is implemented for both friendly as well as hostile deployments. The simulation results are encouraging and validate the proposed algorithm.

Suggested Citation

  • Ankur Choudhary & Santosh Kumar & Sharad Gupta & Mingwei Gong & Aniket Mahanti, 2021. "FEHCA: A Fault-Tolerant Energy-Efficient Hierarchical Clustering Algorithm for Wireless Sensor Networks," Energies, MDPI, vol. 14(13), pages 1-21, July.
  • Handle: RePEc:gam:jeners:v:14:y:2021:i:13:p:3935-:d:587254
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/1996-1073/14/13/3935/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/1996-1073/14/13/3935/
    Download Restriction: no
    ---><---

    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:gam:jeners:v:14:y:2021:i:13:p:3935-:d:587254. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.