title: Matrix Completion Optimization for Localization in Wireless Sensor Networks for Intelligent IoT.
abstract: Localization in wireless sensor networks (WSNs) is one of the primary functions of the intelligent Internet of Things (IoT) that offers automatically discoverable services, while the localization accuracy is a key issue to evaluate the quality of those services. In this paper, we develop a framework to solve the Euclidean distance matrix completion problem, which is an important technical problem for distance-based localization in WSNs. The sensor network localization problem is described as a low-rank dimensional Euclidean distance completion problem with known nodes. The task is to find the sensor locations through recovery of missing entries of a squared distance matrix when the dimension of the data is small compared to the number of data points. We solve a relaxation optimization problem using a modification of Newton's method, where the cost function depends on the squared distance matrix. The solution obtained in our scheme achieves a lower complexity and can perform better if we use it as an initial guess for an interactive local search of other higher precision localization scheme. Simulation results show the effectiveness of our approach.
authors.affiliation: School of Electronic Engineering, Soongsil University, Seoul 156-743, Korea. thunguyen@ssu.ac.kr.
authors.forename: Thu L N
authors.initials: TL
authors.lastname: Nguyen
authors.affiliation: School of Electronic Engineering, Soongsil University, Seoul 156-743, Korea. yashin@ssu.ac.kr.
authors.forename: Yoan
authors.initials: Y
authors.lastname: Shin
keywords: Euclidean distance matrix completion; Internet of Things; localization; modified Newton method; semi-definite programming; wireless sensor network