Geometric Buildup Algorithms for Sensor Network Localization

We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed in n steps if n sensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.

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

[2]  Zhijun Wu,et al.  Solving a Generalized Distance Geometry Problem for Protein Structure Determination , 2011, Bulletin of mathematical biology.

[3]  Ting-Hua Yi,et al.  Optimal Sensor Placement for Health Monitoring of High-Rise Structure Based on Genetic Algorithm , 2011 .

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

[5]  W. Torgerson.  Multidimensional scaling: I. Theory and method , 1952 .

[6]  Nathan Krislock,et al.  Semidefinite Facial Reduction for Low-Rank Euclidean Distance Matrix Completion , 2010 .

[7]  Qunfeng Dong,et al.  A Geometric Build-Up Algorithm for Solving the Molecular Distance Geometry Problem with Sparse Distance Data , 2003, J. Glob. Optim..

[8]  Nathan Krislock,et al.  Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions , 2010, SIAM J. Optim..

[9]  Di Wu,et al.  Rigid versus unique determination of protein structures with geometric buildup , 2008, Optim. Lett..

[10]  M. Welsh,et al.  Vital Signs Monitoring and Patient Tracking Over a Wireless Network , 2005, 2005 IEEE Engineering in Medicine and Biology 27th Annual Conference.

[11]  Yinyu Ye,et al.  Semidefinite programming for ad hoc wireless sensor network localization , 2004, Third International Symposium on Information Processing in Sensor Networks, 2004. IPSN 2004.

[12]  E. Aronson,et al.  Theory and method , 1985 .

[13]  Jorge J. Moré,et al.  E-optimal solutions to distance geometry problems via global continuation , 1995, Global Minimization of Nonconvex Energy Functions: Molecular Conformation and Protein Folding.

[14]  Robert E. Tarjan,et al.  Finding a Maximum Independent Set , 1976, SIAM J. Comput..

[15]  Kate Wong.  Small wonders. , 2013, Scientific American.

[16]  Paul Tseng,et al.  Second-Order Cone Programming Relaxation of Sensor Network Localization , 2007, SIAM J. Optim..

[17]  Michael A. Saunders,et al.  SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization , 2006, SIAM J. Optim..

[18]  Trevor F. Cox,et al.  Metric multidimensional scaling , 2000 .

[19]  Masakazu Kojima,et al.  Exploiting Sparsity in SDP Relaxation for Sensor Network Localization , 2009, SIAM J. Optim..

[20]  Stephen P. Boyd,et al.  Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization , 2008, SIAM J. Optim..

[21]  Davide Brunelli,et al.  Wireless Sensor Networks , 2012, Lecture Notes in Computer Science.

[22]  Ian F. Akyildiz,et al.  Wireless sensor networks , 2007 .

[23]  Gordon M. Crippen,et al.  Distance Geometry and Molecular Conformation , 1988 .

[24]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[25]  Zhijun Wu,et al.  A Geometric Buildup Algorithm for the Solution of the Distance Geometry Problem Using Least-Squares Approximation , 2009, Bulletin of mathematical biology.

[26]  Di Wu,et al.  An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data , 2003, J. Glob. Optim..

[27]  Anthony Man-Cho So,et al.  Universal Rigidity and Edge Sparsification for Sensor Network Localization , 2010, SIAM J. Optim..

[28]  Qunfeng Dong,et al.  A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances , 2002, J. Glob. Optim..

[29]  Paul Tseng,et al.  (Robust) Edge-based semidefinite programming relaxation of sensor network localization , 2011, Math. Program..

[30]  Trevor Darrell,et al.  MULTIMODAL INTERFACES THAT Flex, Adapt, and Persist , 2004 .

[31]  Preorderings, monotone functions, and best rank r approximations with applications to classical MDS , 1993 .