An improved harmony search based energy-efficient routing algorithm for wireless sensor networks

摘要: Graphical abstractDisplay Omitted HighlightsA new encoding of harmony memory for routing in WSNs has been proposed.A generation method a proposed.The dynamic adaptation is introduced the parameter HMCR to improve performance proposed algorithm.An effective local search strategy convergence speed and accuracy energy efficient objective function model proposed. Wireless sensor networks (WSNs) one most important technologies this century. As nodes have limited resources, designing energy-efficient algorithms become research focus. And because maximizing network lifetime NP-hard problem, many researchers try optimize it with meta-heuristics. However, due uncertain variable number strong constraints meta-heuristics are inappropriate WSNs. This paper proposes an Improved Harmony Search Based Energy Efficient Routing Algorithm (IHSBEER) WSNs, which based on (HS) algorithm (a meta-heuristic). To address problem HS algorithm, several key improvements put forward: First all, improved characteristics Secondly, improvisation also improved. We avoid prematurity early generations strengthen its ability late generations. Meanwhile, adjustment process discarded make containing less parameters. Thirdly, enhance ability, so as algorithm. In addition, that considers both consumption length path developed. The detailed descriptions test results approach included. experimental clearly show advantages