Area coverage in wireless sensor network by using harmony search algorithm
Stojanche Panov, Sašo Koceski · 2014
The area coverage is a popular problem in wireless sensor networks and many attempts in the past several years have been made to provide an optimal solution to this particular type of problem. This paper presents a novel approach to solving the area coverage problem, namely the Harmony Search optimization algorithm. The Harmony Search algorithm is an optimization technique which is often used to solve NP-complete problems, i.e. problems which deterministic approaches to solve are not efficient for. The results have been compared to the Particle Swarm Optimization algorithm and have shown that Harmony Search gives better area coverage.