Localization of Wireless Sensor Network Based on Genetic Algorithm
Keywords:
Wireless Sensor Networks(WSNs), Genetic Algorithm(GA), LocalizationAbstract
This paper proposes a novel localization approach based on genetic algorithm for Wireless Sensor Networks. In this method, we use a new way to approximate the distance between unknown node and anchor node when anchor node is out of an unknown node’s communicate radius. In addition, we use self-adapting genetic algorithm into localization to ensure it could produce the result as similar as its real position in any environment. Our simulate experiment on various network topologies shows surprisingly good results. These demonstrate that the approach could help unknown nodes obtain high accuracy position whether in open space or the environment with obstruction even the unconnected well environment. In comparison, we find that previous anchor node free localization approach cannot work well in the unidealization environment.References
Girod, L.; Bychkovskiy, V.; Elson, J.; Estrin, D. (2002); Locating tiny sensors in time and space: A case study, In Proceedings of IEEE International Conference on Computer Design: VLSI in Computers and Processors, pp. 214-219, January 2002, ISSN 1063-6404.
Girod, L.; Estrin, D.(2001); Robust range estimation using acoustic and multimodal sens-ing, In Proceedings of 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems, pp. 1312-1320, October 2001, ISBN 0-7803-6612-3.
A. Savvides; C.C. Han; M.B. Srivastava(2001); Dynamic fine-grained localization in ad-hoc networks of sensors, In Proceedings of 7th Annual Internatonal Conference on Mobile Computing and Networking, pp. 166-199, July 2001, ISBN 1-58113-422-3 .
D. Niculescu; B. Nath.(2003); Ad hoc positioning system (APS) using AOA, In Proceedings of Twenty-Second Annual Joint Conference of the IEEE Computer and Communications, pp. 1734-1743, March 2003, ISSN 0743-166X.
N. Bulusu; J. Heidemann; D. Estrin(2000); GPS-less low-cost outdoor localization for very small devices, IEEE Personal Communications, 7, 28-34, ISSN 1070-9916.
D. Niculescu; B. Nath.(2001); Ad hoc positioning system (APS), In Proceedings of Global Telecommunications Conference, pp. 2926-2931, November 2001, ISBN 0-7803-7206-9.
R. Nagpal(1999); Organizing a global coordinate system from local information on an amor-phous computer, MIT Artificial Intelligence Laboratory memo no. 1666, August 1999, ISSN 1611-3349.
T. He; C. Huang; B.M. Blum; J.A. Stankovic; T. Abdelzaher(2003); Range-free localiza-tion schemes for large scale sensor networks, In Proceedings of 9th Annual Internatonal Conference on Mobile Computing and Networking, pp. 81-95, September 2003, ISBN 1-58113-753-2.
Y. Shang; W. Ruml; Y. Zhang; M.P.J. Fromherz(2003); Localization from mere connectivi-ty, In Proceedings of the 4th ACM international Symposium on Mobile Ad Hoc Networking
S. Lederer; Y. Wang; J. Gao(2008); Connectivity-based localization of large scale sensor networks with complex shape, In Proceedings of the 27th Annual IEEE Conference on Computer Communications, pp. 789-797, May 2008, ISSN 0743-166X.
Y. Wang; S. Lederer; J. Gao(2009); Connectivity-based sensor network localization with in-cremental delaunay refinement method, In Proceedings of the 28th Annual IEEE Conference on Computer Communications, pp. 2401-2409, April 2009, ISSN 0743-166X.
M. Jin; S. Xia; H. Wu; X. Gu(2011); Scalable and fully distributed localization with mere connectivity, In Proceedings of the 30th Annual IEEE Conference on Computer Communi-cations, pp. 3164-3172, April 2011, ISSN 0743-166X.
J.H. Holland(1962); Concerning efficient adaptive systems, Self-Organizing Systems, 215-230, ISSN 1069-0948.
J.H. Holland(1992); Adaptation in Natural and Artificial Systems, MA: MIT Press, ISBN 0-262-58111-6.
M. Srinivas; L.M. Patnaik(1994); Adaptive probabilities of crossover and mutation in ge-netic algorithms, IEEE Transactions on Systems, Man and Cybernetics, 24, 656-667, ISSN 0018-9472.
K. Deep; M. Thakur(2007); A new crossover operator for real coded genetic algorithms, Applied Mathematics and Computation, 188, 895-911, ISSN 0974-4665.
Published
Issue
Section
License
ONLINE OPEN ACCES: Acces to full text of each article and each issue are allowed for free in respect of Attribution-NonCommercial 4.0 International (CC BY-NC 4.0.
You are free to:
-Share: copy and redistribute the material in any medium or format;
-Adapt: remix, transform, and build upon the material.
The licensor cannot revoke these freedoms as long as you follow the license terms.
DISCLAIMER: The author(s) of each article appearing in International Journal of Computers Communications & Control is/are solely responsible for the content thereof; the publication of an article shall not constitute or be deemed to constitute any representation by the Editors or Agora University Press that the data presented therein are original, correct or sufficient to support the conclusions reached or that the experiment design or methodology is adequate.
