A Graph Embedding Method for Wireless Sensor Networks Localization

Wireless sensor location estimation is an important area and attracts considerable research interests. In this paper, we present a novel graph embedding method for the localization problem by using signal strengths. We view the wireless sensor nodes as a group of distributed devices, and employ an appropriate kernel function to measure the similarity between sensors. The kernel function can be naturally defined according to the signal strength matrix. Then we formulate the localization problem as a graph embedding problem. Finally, we use the kernel locality preserving projection (KLPP) technique to estimate the relative locations of all sensor nodes. Given sufficient number of anchors, the relative locations can be transformed into physical locations. The main advantage of formulating the localization problem as graph embedding problem is that it allows us to construct a graph to preserve the topological structure of the sensor networks. We evaluate our method based on various network topologies, and analyze its performance. We also compare our method with several existing methods, and demonstrate the high efficiency of our proposed method.