IDEAS home Printed from https://ideas.repec.org/a/igg/jsir00/v13y2022i1p1-14.html
   My bibliography  Save this article

Moth-Flame Optimization Algorithm for Efficient Cluster Head Selection in Wireless Sensor Networks

Author

Listed:
  • Pitchaimanickam Bose

    (Kalasalingam Academy of Research and Education, India)

Abstract

Network lifetime and energy consumption are the important requirement of wireless sensor networks. The sensor network is mainly used for the military and civil applications, habitat monitoring. These tasks consume more energy for the data processing and directly affect the network lifetime. Clustering methodology provides a better solution for prolonging the network lifetime and reducing the energy consumption. In this paper, moth flame optimization algorithm is proposed in LEACH-C algorithm for identifying the suitable cluster head in wireless sensor networks. The proposed methodology uses the navigation method of moths for balancing the exploration and exploitation phases in the optimization process. The residual energy of the node and distance between the cluster head and sensor node are utilized to calculate the fitness function. The proposed methodology is evaluated with the help of performance metrics of network lifetime, energy consumption and number of alive nodes. The proposed methodology prolongs the network lifetime and reduces the energy consumption.

Suggested Citation

  • Pitchaimanickam Bose, 2022. "Moth-Flame Optimization Algorithm for Efficient Cluster Head Selection in Wireless Sensor Networks," International Journal of Swarm Intelligence Research (IJSIR), IGI Global, vol. 13(1), pages 1-14, January.
  • Handle: RePEc:igg:jsir00:v:13:y:2022:i:1:p:1-14
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSIR.302604
    Download Restriction: no
    ---><---

    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:igg:jsir00:v:13:y:2022:i:1:p:1-14. 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: Journal Editor (email available below). General contact details of provider: https://www.igi-global.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.