skip to main content
10.1145/3102304.3102315acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicfndsConference Proceedingsconference-collections
research-article

Robust Localization in Wireless Sensor Networks via Low-rank and 'Sparse Matrix Decomposition

Published: 19 July 2017 Publication History

Abstract

This paper proposes a robust matrix completion method to solve the localization problem in wireless sensor networks. A novel cost function is formulated which inherently copes with missing measures and corrupted data. In particular, the proposed algorithm robustly completes the range map between pairs of sensors by casting the problem as a low-rank and sparse matrix decomposition, while constraining the solution to be close to an Euclidean Distance Matrix. Numerical accuracy and computational efficiency are demonstrated by synthetic experiments. The empirical results also show that our method outperforms state-of-the art algorithms in several scenarios.

References

[1]
Federica Arrigoni, Luca Magri, Beatrice Rossi, Pasqualina Fragneto, and Andrea Fusiello. 2014. Robust absolute rotation estimation via low-rank and sparse matrix decomposition. In 2014 2nd International Conference on 3D Vision, Vol. 1. IEEE, 491--498.
[2]
Federica Arrigoni, Beatrice Rossi, and Andrea Fusiello. 2016. Global Registration of 3D Point Sets via LRS Decomposition. In European Conference on Computer Vision. Springer, 489--504.
[3]
Laura Balzano, Robert Nowak, and Benjamin Recht. 2010. Online identification and tracking of subspaces from highly incomplete information. In Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on. IEEE, 704--711.
[4]
Heinz H Bauschke and Jonathan M Borwein. 1993. On the convergence of von Neumann's alternating projection algorithm for two sets. Set-Valued Analysis 1, 2 (1993), 185--212.
[5]
Amir Beck and Marc Teboulle. 2009. A fast iterative shrinkage-thresholding algorithm for linear inverse problems. SIAM journal on imaging sciences 2, 1 (2009), 183--202.
[6]
Pratik Biswas, Tzu-Chen Liang, Kim-Chuan Toh, Yinyu Ye, and Ta-Chung Wang. 2006. Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE transactions on automation science and engineering 3, 4 (2006), 360.
[7]
Pratik Biswas, Kim-Chuan Toh, and Yinyu Ye. 2008. A distributed SDP approach for large-scale noisy anchor-free graph realization with applications to molecular conformation. SIAM Journal on Scientific Computing 30, 3 (2008), 1251--1277.
[8]
Ingwer Borg and Patrick JF Groenen. 2005. Modern multidimensional scaling: Theory and applications. Springer Science & Business Media.
[9]
Thierry Bouwmans, Necdet Serhat Aybat, and El-hadi Zahzah. 2016. Handbook of Robust Low-Rank and Sparse Matrix Decomposition: Applications in Image and Video Processing. (2016).
[10]
Jian-Feng Cai, Emmanuel J Candès, and Zuowei Shen. 2010. A singular value thresholding algorithm for matrix completion. SIAM Journal on Optimization 20, 4 (2010), 1956--1982.
[11]
Robert Connelly. 2005. Generic global rigidity. Discrete & Computational Geometry 33, 4 (2005), 549--563.
[12]
Jon Dattorro. 2010. Convex optimization & Euclidean distance geometry. Lulu. com.
[13]
Jan De Leeuw, In JR Barra, F Brodeau, G Romier, B Van Cutsem, and others. 1977. Applications of convex analysis to multidimensional scaling. In Recent Developments in Statistics. Citeseer.
[14]
Richard L Dykstra. 1983. An algorithm for restricted least squares regression. J. Amer. Statist. Assoc. 78, 384 (1983), 837--842.
[15]
Shimon Even. 2011. Graph algorithms. Cambridge University Press.
[16]
Haw-ren Fang and Dianne P O'Leary. 2012. Euclidean distance matrix completion problems. Optimization Methods and Software 27, 4--5 (2012), 695--717.
[17]
Colin Goodall. 1991. Procrustes methods in the statistical analysis of shape. Journal of the Royal Statistical Society. Series B (Methodological) (1991), 285--339.
[18]
Craig Gotsman and Yehuda Koren. 2004. Distributed graph layout for sensor networks. In Graph Drawing. Springer, 273--284.
[19]
Nathan Halko, Per-Gunnar Martinsson, and Joel A Tropp. 2009. Finding structure with randomness: Stochastic algorithms for constructing approximate matrix decompositions. (2009).
[20]
Christoph Helmberg, Franz Rendl, Robert J Vanderbei, and Henry Wolkowicz. 1996. An interior-point method for semidefinite programming. SIAM Journal on Optimization 6, 2 (1996), 342--361.
[21]
Bruce Hendrickson. 1992. Conditions for unique graph realizations. SIAM J. Comput. 21, 1 (1992), 65--84.
[22]
Bill Jackson and Tibor Jordán. 2005. Connected rigidity matroids and unique realizations of graphs. Journal of Combinatorial Theory, Series B 94, 1 (2005), 1--29.
[23]
Raghunandan H Keshavan, Sewoong Oh, and Andrea Montanari. 2009. Matrix completion from a few entries. In 2009 IEEE International Symposium on Information Theory. IEEE, 324--328.
[24]
Monique Laurent. 2009. Matrix Completion Problems. Encyclopedia of Optimization 3 (2009), 221--229.
[25]
Zhouchen Lin, Minming Chen, and Yi Ma. 2010. The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices. arXiv preprint arXiv:1009.5055 (2010).
[26]
Bamdev Mishra, Gilles Meyer, and Rodolphe Sepulchre. 2011. Low-rank optimization for distance matrix completion. In 2011 50th IEEE Conference on Decision and Control and European Control Conference. IEEE, 4455--4460.
[27]
Kim-Chuan Toh, Michael J Todd, and Reha H Tütüncü. 2012. On the implementation and usage of SDPT3--a Matlab software package for semidefinite-quadratic-linear programming, version 4.0. In Handbook on semidefinite, conic and polynomial optimization. Springer, 715--754.
[28]
Kim-Chuan Toh and Sangwoon Yun. 2010. An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems. Pacific Journal of Optimization 6, 615--640 (2010), 15.
[29]
Warren S Torgerson. 1952. Multidimensional scaling: I. Theory and method. Psychometrika 17, 4 (1952), 401--419.
[30]
Tianyi Zhou and Dacheng Tao. 2011. Godec: Randomized low-rank & sparse matrix decomposition in noisy case. (2011).

Cited By

View all
  • (2017)Wireless Sensor Networks localization with outliers and structured missing data2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2017.8292346(1-7)Online publication date: Oct-2017

Index Terms

  1. Robust Localization in Wireless Sensor Networks via Low-rank and 'Sparse Matrix Decomposition

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Other conferences
      ICFNDS '17: Proceedings of the International Conference on Future Networks and Distributed Systems
      July 2017
      325 pages
      ISBN:9781450348447
      DOI:10.1145/3102304
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      In-Cooperation

      • LABSTICC: Labsticc

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 19 July 2017

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. Euclidean Distance Matrix
      2. Euclidean Distance Matrix Completion
      3. Low-rank and Sparse Decomposition
      4. Robust Matrix Completion
      5. Sensor Network Localization
      6. Wireless Sensor Networks

      Qualifiers

      • Research-article
      • Research
      • Refereed limited

      Conference

      ICFNDS '17

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)6
      • Downloads (Last 6 weeks)2
      Reflects downloads up to 17 Jan 2025

      Other Metrics

      Citations

      Cited By

      View all
      • (2017)Wireless Sensor Networks localization with outliers and structured missing data2017 IEEE 28th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)10.1109/PIMRC.2017.8292346(1-7)Online publication date: Oct-2017

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Media

      Figures

      Other

      Tables

      Share

      Share

      Share this Publication link

      Share on social media