Egerváry Research Group on Combinatorial Optimization Uniquely Localizable Networks with Few Anchors

In the network localization problem the locations of some nodes (called anchors) as well as the distances between some pairs of nodes are known, and the goal is to determine the location of all nodes. The localization problem is said to be solvable (or uniquely localizable) if there is a unique set of locations consistent with the given data. Recent results from graph rigidity theory made it possible to characterize the solvability of the localization problem in two dimensions. In this paper we address the following related optimization problem: given the set of known distances in the network, make the localization problem solvable by designating a smallest set of anchor nodes. We develop a polynomial-time 3-approximation algorithm for this problem by proving new structural results in graph rigidity and by using tools from matroid theory.

[1]  Tibor Jordán,et al.  Algorithms for Graph Rigidity and Scene Analysis , 2003, ESA.

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

[3]  Jacob T. Schwartz,et al.  Fast Probabilistic Algorithms for Verification of Polynomial Identities , 1980, J. ACM.

[4]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[5]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs , 2022 .

[6]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[7]  Brian D. O. Anderson,et al.  A Theory of Network Localization , 2006, IEEE Transactions on Mobile Computing.

[8]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[9]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[10]  Walter Whiteley,et al.  Some matroids from discrete applied geometry , 1996 .

[11]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[12]  Robert E. Tarjan,et al.  Dividing a Graph into Triconnected Components , 1973, SIAM J. Comput..

[13]  A. Recski.  Matroid theory and its applications in electric network theory and in statics , 1989 .

[14]  Márton Makai,et al.  Matroid matching with Dilworth truncation , 2006, Discret. Math..

[15]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[16]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.