Localization with a Mobile Anchor Using ABC-GA Hybrid Algorithm in Wireless Sensor Networks
Author(s) -
Rongbin Qi,
Sijin Li,
Tianyi Ma,
Feng Qian
Publication year - 2012
Publication title -
journal of advanced computational intelligence and intelligent informatics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.172
H-Index - 20
eISSN - 1343-0130
pISSN - 1883-8014
DOI - 10.20965/jaciii.2012.p0741
Subject(s) - computer science , traverse , wireless sensor network , node (physics) , algorithm , scheme (mathematics) , convergence (economics) , genetic algorithm , wireless , hybrid algorithm (constraint satisfaction) , computer network , artificial intelligence , mathematics , telecommunications , machine learning , mathematical analysis , constraint logic programming , constraint satisfaction , geodesy , structural engineering , economic growth , probabilistic logic , engineering , economics , geography
Nodes localization plays an important role in applications of wireless sensor networks. In this paper, a localization scheme with a mobile anchor using a hybrid algorithm (ABC-GA) which combines Artificial Bee Colony (ABC) algorithm with the advantages of Genetic Algorithm (GA) is proposed. The localization scheme determines location of unknown node by the mobile anchor. It has high accuracy without any additional requirements for the hardware of unknown node. The core problem of the scheme is to find the shortest path to traverse all unknown nodes by the proposed hybrid algorithm. Simulation results show that ABC-GA hybrid algorithm has high convergence rate and strong global search capability, and the accuracy of localization scheme is satisfactory.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom