IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm
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, d...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2017-11-01
|
| Series: | International Journal of Distributed Sensor Networks |
| Online Access: | https://doi.org/10.1177/1550147717741103 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832545266765398016 |
|---|---|
| author | Bing Zeng Yan Dong Xinyu Li Liang Gao |
| author_facet | Bing Zeng Yan Dong Xinyu Li Liang Gao |
| author_sort | Bing Zeng |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-d453fddf40e84a0dafa00004f6663dac |
| institution | Kabale University |
| issn | 1550-1477 |
| language | English |
| publishDate | 2017-11-01 |
| publisher | Wiley |
| record_format | Article |
| series | International Journal of Distributed Sensor Networks |
| spelling | doaj-art-d453fddf40e84a0dafa00004f6663dac2025-02-03T07:26:21ZengWileyInternational Journal of Distributed Sensor Networks1550-14772017-11-011310.1177/1550147717741103IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithmBing Zeng0Yan Dong1Xinyu Li2Liang Gao3State Key Lab of Digital Manufacturing Equipment and Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan, ChinaDepartment of Electronics and Information Engineering, Huazhong University of Science and Technology, Wuhan, ChinaState Key Lab of Digital Manufacturing Equipment and Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan, ChinaState Key Lab of Digital Manufacturing Equipment and Technology, School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan, ChinaClustering 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.https://doi.org/10.1177/1550147717741103 |
| spellingShingle | Bing Zeng Yan Dong Xinyu Li Liang Gao IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm International Journal of Distributed Sensor Networks |
| title | IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm |
| title_full | IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm |
| title_fullStr | IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm |
| title_full_unstemmed | IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm |
| title_short | IHSCR: Energy-efficient clustering and routing for wireless sensor networks based on harmony search algorithm |
| title_sort | ihscr energy efficient clustering and routing for wireless sensor networks based on harmony search algorithm |
| url | https://doi.org/10.1177/1550147717741103 |
| work_keys_str_mv | AT bingzeng ihscrenergyefficientclusteringandroutingforwirelesssensornetworksbasedonharmonysearchalgorithm AT yandong ihscrenergyefficientclusteringandroutingforwirelesssensornetworksbasedonharmonysearchalgorithm AT xinyuli ihscrenergyefficientclusteringandroutingforwirelesssensornetworksbasedonharmonysearchalgorithm AT lianggao ihscrenergyefficientclusteringandroutingforwirelesssensornetworksbasedonharmonysearchalgorithm |