Localization of IoT Networks via Low-Rank Matrix Completion
- 7 May 2019
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (8) , 5833-5847
Abstract
Location awareness, providing ability to identify the location of sensor, machine, vehicle, and wearable device, is a rapidly growing trend of hyper-connected society and one of key ingredients for internet of things (IoT) era. In order to make a proper reaction to the collected information from things, location information of things should be available at the data center. One challenge for the IoT networks is to identify the location map of whole nodes from partially observed distance information. An aim of this paper is to present an algorithm to recover the Euclidean distance matrix (and eventually the location map) from partially observed distance information. By casting the low-rank matrix completion problem into the unconstrained minimization problem in a Riemannian manifold in which a notion of differentiability can be defined, we solve the low-rank matrix completion problem using a modified conjugate gradient algorithm. From the convergence analysis, we show that LRMCG converges linearly to the original Euclidean distance matrix under the extended Wolfe’s conditions. From the numerical experiments, we demonstrate that the proposed method, called localization in Riemannian manifold using conjugate gradient (LRMCG), is effective in recovering the Euclidean distance matrix.Keywords
Funding Information
- National Research Foundation of Korea
- Korean Government (MSIP) (2014R1A5A1011478)
- MSIT (Ministry of Science and ICT), Korea, under the ITRC (Information Technology Research Center) support program (IITP-2019-2017-0-01637)
- IITP (Institute for Information & communications Technology Promotion)
This publication has 31 references indexed in Scilit:
- Wireless sensor networks: a survey on recent developments and potential synergiesThe Journal of Supercomputing, 2013
- A new, globally convergent Riemannian conjugate gradient methodOptimization, 2013
- Projection-like Retractions on Matrix ManifoldsSIAM Journal on Optimization, 2012
- Localization Algorithms in Wireless Sensor Networks: Current Approaches and Future ChallengesNetwork Protocols and Algorithms, 2010
- A Singular Value Thresholding Algorithm for Matrix CompletionSIAM Journal on Optimization, 2010
- Exact Matrix Completion via Convex OptimizationFoundations of Computational Mathematics, 2009
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line SearchSIAM Journal on Optimization, 2005
- Solving semidefinite-quadratic-linear programs using SDPT3Mathematical Programming, 2003
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3Optimization Methods and Software, 1999
- Convergence Conditions for Ascent MethodsSIAM Review, 1969