The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
ITNG '06 Proceedings of the Third International Conference on Information Technology: New Generations
Artificial Bee Colony (ABC) Optimization Algorithm for Solving Constrained Optimization Problems
IFSA '07 Proceedings of the 12th international Fuzzy Systems Association world congress on Foundations of Fuzzy Logic and Soft Computing
| Hi-index | 0.00 |
In wireless sensor networks, sensor node localization is an important problem because sensor nodes are randomly scattered in the region of interest and they get connected into network on their own. Finding location without the aid of Global Positioning System (GPS) in each node of a sensor network is important in cases where GPS is either not accessible, or not practical to use due to power, cost, or line of sight conditions. The objective of this paper is to find the locations of nodes by using Particle Swarm Optimization and Artificial Bee Colony algorithm and compare the performance of these two algorithms. The term swarm is used in a general manner to refer to a collection of interacting agents or individuals. We also propose multi stage localization and compared multi stage localization performance with single stage localization.