Distributed range-free localization algorithm based on self-organizing maps

14Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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 Self-Organizing 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. © 2010 P. D. Tinh and M. Kawai.

Cite

CITATION STYLE

APA

Tinh, P. D., & Kawai, M. (2010). Distributed range-free localization algorithm based on self-organizing maps. Eurasip Journal on Wireless Communications and Networking, 2010. https://doi.org/10.1155/2010/692513

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free