Wireless Localization of Mapping Node Identifiers to Known Positions

Recently, wireless localization has attracted great interest. However, a type of localization problem has not received much attention and has not been well studied, in which all locations of nodes are predetermined, but when nodes are deployed to these positions, the relationship between identifiers and locations of nodes is unknown. Applications with such localization problems include smart lighting, structural health, smart roads and industrial monitoring, etc. In this paper, we investigate how to map node identifiers to known locations. Although the locations of nodes are given, it is still challenging to map the node identifier to known location because the combination of mapping possibilities is huge, and incorrect mapping may occur when several known locations are close to each other. To address this problem, we first propose a localization algorithm, called Q-Hop, in which the distance of two nodes is measured by a fine-grained hop count. Then, we propose a mapping method that maps the node positions estimated by Q-Hop to known locations. The simulation results demonstrate that our solution achieves satisfactory mapping accuracy, which will provide helpful insights for applications with such localization problems.