Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
Abstract
The sensor network localization (SNL) problem in embedding dimension r consists of locating the positions of wireless sensors, given only the distances between sensors that are within radio range and the positions of a subset of the sensors (called anchors). Current solution techniques relax this problem to a weighted, nearest, (positive) semidefinite programming (SDP) completion problem by using the linear mapping between Euclidean distance matrices (EDM) and semidefinite matrices. The resulting SDP is solved using primal-dual interior point solvers, yielding an expensive and inexact solution. This relaxation is highly degenerate in the sense that the feasible set is restricted to a low dimensional face of the SDP cone, implying that the Slater constraint qualification fails. Cliques in the graph of the SNL problem give rise to this degeneracy in the SDP relaxation. In this paper, we take advantage of the absence of the Slater constraint qualification and derive a technique for the SNL problem, with exact data, that explicitly solves the corresponding rank restricted SDP problem. No SDP solvers are used. For randomly generated instances, we are able to efficiently solve many huge instances of this NP-hard problem to high accuracy by finding a representation of the minimal face of the SDP cone that contains the SDP matrix representation of the EDM. The main work of our algorithm consists in repeatedly finding the intersection of subspaces that represent the faces of the SDP cone that correspond to cliques of the SNL problem.
[1] , Approximate and exact completion problems for Euclidean distance matrices using semidefinite programming, Linear Algebra Appl., 406 (2005), pp. 109–141. LAAPAW 0024-3795
[2]
[3] , Solving Euclidean distance matrix completion problems via semidefinite programming, Comput. Optim. Appl., 12 (1999), pp. 13–30. CPPPEF 0926-6003
[4]
[5]
[6] , Semidefinite programming approaches for sensor network localization with noisy distance measurements, IEEE Trans. Autom. Sci. Eng., 3 (2006), pp. 360–371. 1545-5955
[7] , A distributed SDP approach for large-scale noisy anchor-free graph reailzation with applications to molecular conformation, SIAM J. Sci. Comput., 30 (2008), pp. 1251–1277. SJOCE3 1064-8275
[8] , Semidefinite programming for ad hoc wireless sensor network localization, ACM Trans. Sen. Netw., 2 (2006), pp. 188–220.
[9]
[10] , SpaseLoc: An adaptive subproblem algorithm for scalable wireless sensor network localization, SIAM J. Optim., 17 (2006), pp. 1102–1128. SJOPE8 1052-6234
[11]
[12]
[13] , Sensor network localization, Euclidean distance matrix completions, and graph realization, Optim. Eng., 11 (2010), pp. 45–66. 1389-4420
[14]
[15] , Finding and certifying a large hidden clique in a semi-random graph, Random Structures Algorithms, 16 (2000), pp. 195–202. RSALFD 1042-9832
[16]
[17]
[18] , Conditions for unique graph realizations, SIAM J. Comput., 21 (1992), pp. 65–84. SMJCAT 0097-5397
[19]
[20] , Exploiting sparsity in SDP relaxation for sensor network localization, SIAM J. Optim., 20 (2009), pp. 192–215. SJOPE8 1052-6234
[21]
[22]
[23]
[24]
[25] , Theory of semidefinite programming for sensor network localization, Math. Program., 109 (2007), pp. 367–384. MHPGA4 0025-5610
[26] , Second-order cone programming relaxation of sensor network localization, SIAM J. Optim., 18 (2007), pp. 156–185. SJOPE8 1052-6234
[27] , The simplest semidefinite programs are trivial, Math. Oper. Res., 20 (1995), pp. 590–596. MOREDQ 0364-765X
[28] , Further relaxations of the semidefinite programming approach to sensor network localization, SIAM J. Optim., 19 (2008), pp. 655–673. SJOPE8 1052-6234
[29] , Explicit solutions for interval semidefinite linear programs, Linear Algebra Appl., 236 (1996), pp. 95–104. LAAPAW 0024-3795
