Static Performance of Wireless Localization Algorithm Exploiting Self-Organizing Maps

Abstract

In wireless communications, determining the physical location of nodes (localization) is very important for many network services and protocols. This paper evaluates the static performance of wireless localization algorithm exploiting Self-Organizing Maps (SOM) to deal with this issue. Our proposed algorithm utilizes only connectivity information and information from some heard anchors in the network to determine the location of nodes. By introducing an efficient two-hop utilization scheme and the multi-hop anchor update, the algorithm has maximized the correlation between neighboring nodes and the global topology in distributed implementation of SOM. From our intensive simulations on various static network deployment scenarios, the results show that the proposed scheme achieves very good localization accuracy. It also reduces the SOM learning steps to around 15 to 30 steps to overcome the huge computational problem of the classical SOM.