Panov, Stojanche and Koceski, Saso (2014) Area coverage in wireless sensor network by using harmony search algorithm. Embedded Computing (MECO), 2014 3rd Mediterranean Conference on . pp. 210-213. ISSN 978-1-4799-4827-7
Full text not available from this repository.Abstract
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.
| Item Type: | Article |
|---|---|
| Subjects: | Natural sciences > Computer and information sciences Engineering and Technology > Electrical engineering, electronic engineering, information engineering |
| Divisions: | Faculty of Computer Science |
| Depositing User: | Saso Koceski |
| Date Deposited: | 04 Feb 2015 11:31 |
| Last Modified: | 04 Feb 2015 11:31 |
| URI: | https://eprints.ugd.edu.mk/id/eprint/12328 |
Actions (login required)
 |
View Item |