IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i11p1550147717741103.html
   My bibliography  Save this article

IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm

Author

Listed:
  • Bing Zeng
  • Yan Dong
  • Xinyu Li
  • Liang Gao

Abstract

Clustering and routing are two key techniques to improve the energy efficiency of wireless sensor networks. As clustering and routing for improving the energy efficiency of wireless sensor networks are NP-hard problems, increasing meta-heuristic algorithms are introduced for solving them. However, due to their discreteness and strong constraints, most meta-heuristics are unsuitable or inefficient to optimize them. Harmony search algorithm is one of the most suitable meta-heuristics for solving these problems. This article proposes a new energy-efficient clustering and routing algorithm based on harmony search algorithm to improve the energy efficiency of wireless sensor networks. The proposed approach contains two parts: clustering phase and routing phase. First, a new objective function model, which has considered balancing the energy consumption of both gateways and regular nodes as well as considered routing, is established for the clustering phase. Then, a new energy-efficient clustering algorithm is designed based on several improvements made to harmony search algorithm: (1) a discrete encoding scheme of a harmony for clustering is proposed; (2) a roulette wheel selection method is designed to choose a gateway for a regular sensor node to join, which is employed by two steps (i.e. initialization of harmony and improvisation of a new harmony); (3) the dynamically changed harmony memory considering rate is designed for improvisation of a new harmony; (4) a local search scheme is proposed to improve the best harmony within the harmony memory in iterations. In addition, the improved harmony search based energy-efficient routing algorithm that we proposed previously is employed to balance the energy consumption of gateways in the routing phase. The proposed approach is compared with several popular meta-heuristic-based clustering algorithms over extensive wireless sensor networks cases. The experimental results clearly demonstrate the superiority of the proposed approach.

Suggested Citation

  • Bing Zeng & Yan Dong & Xinyu Li & Liang Gao, 2017. "IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm," International Journal of Distributed Sensor Networks, , vol. 13(11), pages 15501477177, November.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:11:p:1550147717741103
    DOI: 10.1177/1550147717741103
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717741103
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717741103?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
    ---><---

    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:sae:intdis:v:13:y:2017:i:11:p:1550147717741103. 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: SAGE Publications (email available below). General contact details of provider: .

    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.