IDEAS home Printed from https://ideas.repec.org/a/ajp/edwast/v8y2024i6p8582-8610id3848.html
   My bibliography  Save this article

Energy-efficient clustering in wireless sensor networks using metaheuristic algorithms

Author

Listed:
  • Kadhim Hayyawi Flayyih
  • Mohsen Nickray

Abstract

Energy management in Wireless Sensor Networks (WSNs) remains a critical challenge, particularly in clustering processes. This article compares three optimization algorithms—Grasshopper Optimization Algorithm (GOA), Bat Algorithm (BA), and Whale Optimization Algorithm (WOA)—to achieve energy-efficient clustering and extend network lifetime. Initial cluster head placement is performed using K-means clustering, and a novel cost function is introduced that considers energy consumption and node distribution, enhancing the network’s efficiency and resilience. The algorithms are evaluated across three scenarios with varying base station (BS) placements. In the simplest scenario, with the BS centrally located, GOA slightly outperforms WOA in extending network lifetime, although WOA remains competitive. BA, while energy-efficient, lags behind GOA and WOA. As complexity increases with BS placement at the edge, WOA demonstrates superior energy management, delaying node death and extending network lifetime more effectively than GOA and BA. In the most challenging scenario, where the BS is placed in a remote corner, WOA emerges as the most effective algorithm, maintaining network performance and balancing energy consumption for the longest duration. GOA, while relatively strong, shows faster network lifetime decline, particularly in later stages, whereas BA faces significant challenges, leading to quicker node failures. Overall, this study highlights the importance of efficient clustering and optimization for prolonging WSN lifetimes. WOA excels in complex scenarios, while GOA leads in simpler environments. Integrating K-means clustering with the novel cost function enhances algorithm performance, contributing to the development of resource-efficient WSNs, especially in resource-constrained settings.

Suggested Citation

  • Kadhim Hayyawi Flayyih & Mohsen Nickray, 2024. "Energy-efficient clustering in wireless sensor networks using metaheuristic algorithms," Edelweiss Applied Science and Technology, Learning Gate, vol. 8(6), pages 8582-8610.
  • Handle: RePEc:ajp:edwast:v:8:y:2024:i:6:p:8582-8610:id:3848
    as

    Download full text from publisher

    File URL: https://learning-gate.com/index.php/2576-8484/article/view/3848/1453
    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:ajp:edwast:v:8:y:2024:i:6:p:8582-8610:id:3848. 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: Melissa Fernandes (email available below). General contact details of provider: https://learning-gate.com/index.php/2576-8484/ .

    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.