Authors: Arsić, Aleksandra 
Tuba, Milan
Jordanski, Miloš
Title: Fireworks algorithm applied to wireless sensor networks localization problem
Journal: 2016 IEEE Congress on Evolutionary Computation, CEC 2016
First page: 4038
Last page: 4044
Conference: IEEE Congress on Evolutionary Computation, CEC 2016; Vancouver Convention CentreVancouver; Canada; 24 July 2016 through 29 July 2016
Issue Date: 14-Nov-2016
ISBN: 978-1-509-00622-9
DOI: 10.1109/CEC.2016.7744302
Wireless sensor networks are increasingly important and active research topic because of their many practical uses. Localization problem in the wireless sensor networks is significant since the information collected without location is usually unusable. Often used approach to the localization problem is to post GPS receivers on a small number of anchor nodes and then to locate the other sensor nodes using received signal strength to estimate the distance between unknown nodes and anchor nodes. Estimating positions of sensor nodes is a hard optimization problem that can be successfully solved by stochastic metaheuristics. In this paper we adapted recent swarm intelligence fireworks algorithm for the wireless sensor networks localization problem and compared it to other algorithms from literature. Fireworks algorithm, especially its new version, enhanced fireworks algorithm, proved to be uniformly superior, considering all quality indicators.
Publisher: IEEE

Show full item record


checked on Jun 13, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.