Polynomial-Based Linear Programming Relaxation of Sensor Network Localization Problem

One important task in the deployment of a wireless sensor network is solving the sensor network localization problem to assure location awareness of each sensor node in the network. The sensor network localization can be formulated as a global optimization problem that aims to minimize the squared inter–sensor distances under the constraint that such distances equal to some given numbers. The corresponding optimization formulation is generally nonsmooth, nonconvex, and NP-hard problem, and thus prior works have proposed approximate solution using relaxation methods such as semidefinite or conic programming. In this paper, a linear programming relaxation approach is proposed to solve such an optimization problem using the concept of Handelman’s representation of nonnegative polynomial functions over polytopic set. Numerical simulation results are given to illustrate the promising potential of the proposed approach.

[1]  Moe Z. Win,et al.  Cooperative Localization in Wireless Networks , 2009, Proceedings of the IEEE.

[2]  Tua Agustinus Tamba,et al.  On Handelman's Representation of Network Utility Maximization , 2018, Comput. J..

[3]  Jean-Marie Bonnin,et al.  Wireless sensor networks: a survey on recent developments and potential synergies , 2013, The Journal of Supercomputing.

[4]  Yinyu Ye,et al.  Semidefinite programming based algorithms for sensor network localization , 2006, TOSN.

[5]  G. Stengle.  A nullstellensatz and a positivstellensatz in semialgebraic geometry , 1974 .

[6]  Brian D. O. Anderson,et al.  Sensor network localization with imprecise distances , 2006, Syst. Control. Lett..

[7]  Donal O'Shea,et al.  Ideals, varieties, and algorithms - an introduction to computational algebraic geometry and commutative algebra (2. ed.) , 1997, Undergraduate texts in mathematics.

[8]  Brian D. O. Anderson,et al.  Wireless sensor network localization techniques , 2007, Comput. Networks.

[9]  Anthony Man-Cho So,et al.  Theory of semidefinite programming for Sensor Network Localization , 2005, SODA '05.

[10]  David E. Culler,et al.  The effects of ranging noise on multihop localization: an empirical study , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  David Monniaux,et al.  Polyhedral Approximation of Multivariate Polynomials Using Handelman's Theorem , 2016, VMCAI.

[12]  Jian Li,et al.  Exact and Approximate Solutions of Source Localization Problems , 2008, IEEE Transactions on Signal Processing.

[13]  M. Laurent.  Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .

[14]  Yunhao Liu,et al.  Location, Localization, and Localizability , 2010, Journal of Computer Science and Technology.

[15]  Etienne de Klerk,et al.  Error Bounds for Some Semidefinite Programming Approaches to Polynomial Minimization on the Hypercube , 2010, SIAM J. Optim..

[16]  Paul J. M. Havinga,et al.  Range-Based Localization in Mobile Sensor Networks , 2006, EWSN.

[17]  K.J.R. Liu,et al.  Signal processing techniques in network-aided positioning: a survey of state-of-the-art positioning designs , 2005, IEEE Signal Processing Magazine.

[18]  Matthew Peet,et al.  Polynomial optimization with applications to stability analysis and control - Alternatives to sum of squares , 2014, 1408.5119.

[19]  Jian Li,et al.  Lecture Notes - Source Localization from Range-Difference Measurements , 2006, IEEE Signal Processing Magazine.

[20]  Pablo A. Parrilo,et al.  Minimizing Polynomial Functions , 2001, Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science.

[21]  D. Handelman.  Representing polynomials by positive linear functions on compact convex polyhedra. , 1988 .

[22]  Daniel Lazard,et al.  A new method for solving algebraic systems of positive dimension , 1991, Discret. Appl. Math..

[23]  F. Gustafsson,et al.  Mobile positioning using wireless networks: possibilities and fundamental limitations based on available wireless network measurements , 2005, IEEE Signal Processing Magazine.

[24]  Pablo A. Parrilo,et al.  Semidefinite programming relaxations for semialgebraic problems , 2003, Math. Program..

[25]  Jiawang Nie,et al.  Sum of squares method for sensor network localization , 2006, Comput. Optim. Appl..

[26]  A.H. Sayed,et al.  Network-based wireless location: challenges faced in developing techniques for accurate wireless location information , 2005, IEEE Signal Processing Magazine.

[27]  S. Basu,et al.  Algorithmic and Quantitative Real Algebraic Geometry , 2003 .

[28]  Jean B. Lasserre,et al.  Semidefinite Programming vs. LP Relaxations for Polynomial Programming , 2002, Math. Oper. Res..

[29]  Daniel Lazard,et al.  Solving Zero-Dimensional Algebraic Systems , 1992, J. Symb. Comput..

[30]  Jean B. Lasserre,et al.  Global Optimization with Polynomials and the Problem of Moments , 2000, SIAM J. Optim..

[31]  R. Michael Buehrer,et al.  Handbook of Position Location: Theory, Practice and Advances , 2011 .