Tuyển tập báo cáo các nghiên cứu khoa học quốc tế ngành hóa học dành cho các bạn yêu hóa học tham khảo đề tài: Research Article Distributed Range-Free Localization Algorithm Based on Self-Organizing Maps | Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010 Article ID 692513 9 pages doi 2010 692513 Research Article Distributed Range-Free Localization Algorithm Based on Self-Organizing Maps Pham Doan Tinh and Makoto Kawai Graduate School of Science and Engineering Ritsumeikan University 1-1-1 Noji Higashi Kusatsu Shiga 525-8577 Japan Correspondence should be addressed to Pham Doan Tinh gr036088@ Received 28 August 2009 Accepted 21 September 2009 Academic Editor Benyuan Liu Copyright 2010 P. D. Tinh and M. Kawai. This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use distribution and reproduction in any medium provided the original work is properly cited. In Mobile Ad Hoc Networks MANETs determining the physical location of nodes localization is very important for many network services and protocols. This paper proposes a new Distributed Range-Free Localization Algorithm Based on SelfOrganizing Maps SOMs to deal with this issue. Our proposed algorithm utilizes only connectivity information to determine the location of nodes. By utilizing the intersection areas between radio coverage of neighboring nodes the algorithm has maximized the correlation between neighboring nodes in distributed implementation of SOM and reduced the SOM learning time. An implementation of the algorithm on Network Simulator 2 NS-2 was done with the mobility consideration to verify the performance of the proposed algorithm. From our intensive simulations the results show that the proposed scheme achieves very good accuracy in most cases. 1. Introduction Recently mobile ad-hoc network localization has received attention from many researchers 1 . Many algorithms and solutions have been presented so far. These algorithms are ranging from simple to complicated schemes but they can be categorized as range-based and range-free algorithms. Range-free algorithms .
