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.
Unable to display preview. Download preview PDF.
- 1.Aspnes, J., Eren, T., Goldenberg, D.K., Morse, A.S., Whiteley, W., Yang, Y.R., Anderson, B.D.O., Belhumeur, P.N.: A theory of network localization. Trans. Mobile Computing (to appear)Google Scholar
- 3.Eren, T., Goldenberg, D., Whiteley, W., Yang, Y.R., Morse, A.S., Anderson, B.D.O., Belhumeur, P.N.: Rigidity, Computation, and Randomization in Network Localization. In: Proc. of the IEEE INFOCOM Conference, Hong-Kong, March 2004, pp. 2673–2684 (2004)Google Scholar
- 4.Fekete, Z., Jordán, T., Uniquely localizable networks with few anchors, EGRES TR-2006-07, http://www.egres.hu/egres/
- 11.Lovász, L.: The matroid matching problem. In: Algebraic methods in graph theory, Proc. Conf. Szeged (1978)Google Scholar
- 13.Makai, M.: Matroid matching with Dilworth truncation. In: Proc. EuroComb 2005, Berlin (2005)Google Scholar
- 14.Recski, A.: Matroid theory and its applications in electric network theory and in statics, Akadémiai Kiadó, Budapest (1989)Google Scholar
- 16.Man-Cho So, A., Ye, Y.: Theory of semidefinite programming for sensor network localization. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) (2005)Google Scholar
- 17.Whiteley, W.: Some matroids from discrete applied geometry. In: Bonin, J.E., Oxley, J.G., Servatius, B. (eds.) Matroid theory, Seattle, WA. Contemp. Math., vol. 197. Amer. Math. Soc., Providence (1996)Google Scholar