DocumentCode
3643937
Title
Optimal network localization by particle swarm optimization
Author
Cătălin V. Rusu;Hyo-Sung Ahn
Author_Institution
Center for Cognitive and Neural Studies (Coneural), Romanian Institute of Science and Technology, 400487 Cluj-Napoca, Romania and the Computer Science Department, Babeş
fYear
2011
Firstpage
620
Lastpage
625
Abstract
The practical and theoretical importance of network localization has determined a great focus from the scientific community. In recent years several schemes have been proposed to solve the localization problem under certain constraints. Here, we apply the particle swarm optimization (PSO) paradigm to the problem of constructing optimally localizable networks. Alternative solutions which yield non-optimal solutions are also discussed. Simulations are carried out to show the convergence properties of the proposed PSO algorithm. We conclude that optimal network localization can be achieved in an efficient way by using PSO.
Keywords
"Topology","Encoding","Convergence","Heuristic algorithms","Network topology","Educational institutions","Algorithm design and analysis"
Publisher
ieee
Conference_Titel
Intelligent Control (ISIC), 2011 IEEE International Symposium on
ISSN
2158-9860
Print_ISBN
978-1-4577-1104-6
Type
conf
DOI
10.1109/ISIC.2011.6045394
Filename
6045394
Link To Document