IDEAS home Printed from https://ideas.repec.org/a/spr/telsys/v74y2020i3d10.1007_s11235-020-00659-9.html
   My bibliography  Save this article

Energy efficient protocol in wireless sensor network: optimized cluster head selection model

Author

Listed:
  • Turki Ali Alghamdi

    (Umm Al-Qura University)

Abstract

Energy efficiency has become a primary issue in wireless sensor networks (WSN). The sensor networks are powered by battery and thus they turn out to be dead after a particular interval. Hence, enhancing the data dissipation in energy efficient manner remains to be more challenging for increasing the life span of sensor devices. It has been already proved that the clustering method could improve or enhance the life span of WSNs. In the clustering model, the selection of cluster head (CH) in each cluster regards as the capable method for energy efficient routing, which minimizes the transmission delay in WSN. However, the main problem dealt with the selection of optimal CH that makes the network service prompt. Till now, more research works have been processing on solving this issue by considering different constraints. Under this scenario, this paper attempts to develop a new clustering model with optimal cluster head selection by considering four major criteria like energy, delay, distance, and security. Further, for selecting the optimal CHs, this paper proposes a new hybrid algorithm that hybridizes the concept of dragon fly and firefly algorithm algorithms, termed fire fly replaced position update in dragonfly. Finally, the performance of the proposed work is carried out by comparing with other conventional models in terms of number of alive nodes, network energy, delay and risk probability.

Suggested Citation

  • Turki Ali Alghamdi, 2020. "Energy efficient protocol in wireless sensor network: optimized cluster head selection model," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 74(3), pages 331-345, July.
  • Handle: RePEc:spr:telsys:v:74:y:2020:i:3:d:10.1007_s11235-020-00659-9
    DOI: 10.1007/s11235-020-00659-9
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11235-020-00659-9
    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/s11235-020-00659-9?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.

    References listed on IDEAS

    as
    1. Zhao, Bin & Ren, Yi & Gao, Diankui & Xu, Lizhi & Zhang, Yuanyuan, 2019. "Energy utilization efficiency evaluation model of refining unit Based on Contourlet neural network optimized by improved grey optimization algorithm," Energy, Elsevier, vol. 185(C), pages 1032-1044.
    2. Hintsch, Timo & Irnich, Stefan, 2018. "Large multiple neighborhood search for the clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 118-131.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Shaha Al-Otaibi & Venkatesan Cherappa & Thamaraimanalan Thangarajan & Ramalingam Shanmugam & Prithiviraj Ananth & Sivaramakrishnan Arulswamy, 2023. "Hybrid K-Medoids with Energy-Efficient Sunflower Optimization Algorithm for Wireless Sensor Networks," Sustainability, MDPI, vol. 15(7), pages 1-16, March.
    2. Han-Dong Jia & Shu-Chuan Chu & Pei Hu & LingPing Kong & XiaoPeng Wang & Václav Snášel & Tong-Bang Jiang & Jeng-Shyang Pan, 2022. "Hybrid algorithm optimization for coverage problem in wireless sensor networks," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 80(1), pages 105-121, May.
    3. Jinhai Song & Zhiyong Zhang & Kejing Zhao & Qinhai Xue & Brij B. Gupta, 2023. "A Novel CNN-LSTM Fusion-Based Intrusion Detection Method for Industrial Internet," International Journal of Information Security and Privacy (IJISP), IGI Global, vol. 17(1), pages 1-18, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    2. Pop, Petrică C., 2020. "The generalized minimum spanning tree problem: An overview of formulations, solution procedures and latest advances," European Journal of Operational Research, Elsevier, vol. 283(1), pages 1-15.
    3. Luo, Zhenmin & Kang, Xiaofeng & Wang, Tao & Su, Bin & Cheng, Fangming & Deng, Jun, 2021. "Effects of an obstacle on the deflagration behavior of premixed liquefied petroleum gas-air mixtures in a closed duct," Energy, Elsevier, vol. 234(C).
    4. Guo, Yuhan & Zhang, Yu & Boulaksil, Youssef, 2021. "Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration," European Journal of Operational Research, Elsevier, vol. 288(3), pages 810-828.
    5. Sadati, Mir Ehsan Hesam & Çatay, Bülent, 2021. "A hybrid variable neighborhood search approach for the multi-depot green vehicle routing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 149(C).
    6. Ouyang, Zhiyuan & Leung, Eric K.H. & Huang, George Q., 2023. "Community logistics and dynamic community partitioning: A new approach for solving e-commerce last mile delivery," European Journal of Operational Research, Elsevier, vol. 307(1), pages 140-156.
    7. Rui Xu & Yumiao Huang & Wei Xiao, 2023. "A Two-Level Variable Neighborhood Descent for a Split Delivery Clustered Vehicle Routing Problem with Soft Cluster Conflicts and Customer-Related Costs," Sustainability, MDPI, vol. 15(9), pages 1-22, May.
    8. Konrad Steiner, 2019. "Schedule-Based Integrated Inter-City Bus Line Planning for Multiple Timetabled Services via Large Multiple Neighborhood Search," Working Papers 1902, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Timo Hintsch & Stefan Irnich, 2018. "Exact Solution of the Soft-Clustered Vehicle Routing Problem," Working Papers 1813, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    10. Ouyang, Zhiyuan & Leung, Eric Ka Ho & Huang, George Q., 2022. "Community logistics for dynamic vehicle dispatching: The effects of community departure “time” and “space”," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 165(C).
    11. Timo Hintsch & Stefan Irnich & Lone Kiilerich, 2021. "Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem," Transportation Science, INFORMS, vol. 55(3), pages 687-705, May.
    12. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    13. Zhou, Yangming & Qu, Chenhui & Wu, Qinghua & Kou, Yawen & Jiang, Zhibin & Zhou, MengChu, 2024. "A bilevel hybrid iterated search approach to soft-clustered capacitated arc routing problems," Transportation Research Part B: Methodological, Elsevier, vol. 184(C).
    14. Han, Zhiyue & Wang, Wenjie & Du, Zhiming & Zhang, Yupeng & Yu, Yue, 2021. "Self-heating inflatable lifejacket using gas generating agent as energy source," Energy, Elsevier, vol. 224(C).
    15. Katrin Heßler & Stefan Irnich, 2020. "A Branch-and-Cut Algorithm for the Soft-Clustered Vehicle-Routing Problem," Working Papers 2001, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.

    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:telsys:v:74:y:2020:i:3:d:10.1007_s11235-020-00659-9. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.