2009 IEEE International Conference on
Systems, Man, and Cybernetics |
![]() |
Abstract
This study investigates distributed iterative localization in which the nodes that get localized in an iteration act as the references for the remaining nodes to localize. The problem has been addressed using the particle swarm optimization (PSO) and the bacterial foraging algorithm (BFA). A comparison of the performances of PSO and BFA in terms of the number of nodes localized, localization accuracy and computation time is presented.