Abstract

The sensor network design problem (SNDP) consists of the selection of the type, number and location of the sensors to measure a set of variables, optimizing a specified criteria, and simultaneously satisfying the information requirements. This problem is multimodal and involves several binary variables, therefore it is a complex combinatorial optimization problem. This paper presents a new Artificial Bee Colony (ABC) algorithm designed to solve high scale designs of sensor networks. For this purpose, the proposed ABC algorithm has been designed to optimize binary structured problems and also to handle constraints to fulfil information requirements. The classical version of the ABC algorithm was proposed for solving unconstrained and continuous optimization problems. Several extensions have been proposed that allow the classical ABC algorithm to work on constrained or on binary optimization problems. Therefore the proposed approach is a new version of the ABC algorithm that combines the binary and constrained optimization extensions to solve the SNDP. Finally the new algorithm is tested using different systems of incremental size to evaluate its quality, robustness, and scalability.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call