This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Theory of Network Localization
December 2006 (vol. 5 no. 12)
pp. 1663-1678
In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly.

[1] J. Albowicz, A. Chen, and L. Zhang, “Recursive Position Estimation in Sensor Networks,” Proc. Ninth Int'l Conf. Network Protocols (ICNP '01), pp. 35-41, Nov. 2001.
[2] A.Y. Alfakih, A. Khandani, and H. Wolkowicz, “Solving Euclidean Distance Matrix Completion Problems via Semidefinite Programming,” Computational Optimization and Applications, vol. 12, nos. 1-3, pp. 13-30, 1999.
[3] B.D.O. Anderson, P. Belhumeur, T. Eren, D. Goldenberg, A.S. Morse, W. Whiteley, and Y.R. Yang, Graph Properties of Easily Localizable Networks. Preprint Australian Nat'l Univ., 2005.
[4] M. Appel and R. Russo, “The Maximum Vertex Degree of a Graph on Uniform Points in $[0,1]^{2}$ ,” Advances in Applied Probability, vol. 29, pp. 567-581, 1997.
[5] J. Aspnes, D. Goldenberg, and Y.R. Yang, “On the Computational Complexity of Sensor Network Localization,” Proc. First Int'l Workshop Algorithmic Aspects of Wireless Sensor Networks, July 2004.
[6] A. Berg and T. Jordan, “A Proof of Connelly's Conjecture on 3-Connected Generic Cycles,” J. Combinatorial Theory B, 2002.
[7] P. Biswas and Y. Ye, “Semidefinite Programming for Ad Hoc Wireless Sensor Network Localization,” Proc. Third Int'l Workshop Information Processing in Sensor Networks (IPSN '04), F. Zhao and L.Guibas, eds., Apr. 2004.
[8] B. Bollobás, Random Graph Theory. Academic Press, 1985.
[9] H. Breu and D.G. Kirkpatrick, “Unit Disk Graph Recognition is NP-Hard,” Computational Geometry, vol. 9, nos. 1-2, pp. 3-24, 1998.
[10] N. Bulusu, J. Heidemann, and D. Estrin, “GPS-Less Low-Cost Outdoor Localization for Very Small Devices,” IEEE Personal Comm. Magazine, vol. 7, no. 5, pp. 28-34, Oct. 2000.
[11] S. Capkun, M. Hamdi, and J.-P. Hubaux, “GPS-Free Positioning in Mobile Ad-Hoc Networks,” Proc. Hawaii Int'l Conf. System Sciences, 2001.
[12] K. Chintalapudi, R. Govindan, G. Sukhatme, and A. Dhariwal, “Ad-Hoc Localization Using Ranging and Sectoring,” Proc. IEEE INFOCOM '04, Apr. 2004.
[13] R. Connelly, Generic Global Rigidity, http://www.math.cornell. edu~connelly/, Oct. 2003.
[14] R. Connelly, “Generic Global Rigidity,” Discrete and Computational Geometry, vol. 33, 2005.
[15] G. Crippen and T. Havel, Distance Geometry and Molecular Conformation. John Wiley & Sons, 1988.
[16] J. Díaz, J. Petit, and M. Serna, “A Random Graph Model for Optical Networks of Sensors,” Technical Report LSI-02-72-R, Dept. de Llenguatges i Sistemes Informátics, Univ. Politécnica de Catalunya, Dec. 2002.
[17] J. Díaz, J. Petit, and M. Serna, “Random Scaled Sector Graphs,” Technical Report LSI-02-47-R, Dept. de Llenguatges i Sistemes Informátics, Univ. Politécnica de Catalunya, June 2002.
[18] L. Doherty, K.S.J. Pister, and L.E. Ghaoui, “Convex Position Estimation in Wireless Sensor Networks,” Proc. IEEE INFOCOM '01, pp. 1655-1633, Apr. 2001.
[19] T. Eren, P. Belhumeur, B.D.O. Anderson, and A.S. Morse, “A Framework for Maintaining Formations Based on Rigidity,” Proc. 15th Int'l Federation of Automatic Control World Congress, July 2002.
[20] T. Eren, D. Goldenberg, W. Whitley, Y.R. Yang, A.S. Morse, B.D.O. Anderson, and P.N. Belhumeur, “Rigidity, Computation, and Randomization in Network Localization,” Proc. IEEE INFOCOM '04, Apr. 2004.
[21] T. Eren, W. Whiteley, A.S. Morse, and P. Belhumeur, “Sensor Network Topologies of Formations with Distance—Direction —Angle Constraints,” Proc. 42nd IEEE Conf. Decision and Control, Mar. 2003.
[22] A. Farago, “Scalable Analysis and Design of Ad Hoc Networks via Random Graph Theory,” Proc. Sixth Int'l Workshop Discrete Algorithms and Methods for Mobile Computing and Comm., pp. 43-50, 2002.
[23] G.H. Forman and J. Zahorjan, “The Challenges of Mobile Computing,” Computer, vol. 27, no. 4, pp. 38-47, Apr. 1994.
[24] M. Garey and D. Johnson, Computers and Intractability. W.H. Freeman and Co., 1979.
[25] J. Gill, “Computational Complexity of Probabilistic Turing Machines,” SIAM J. Computing, vol. 6, no. 4, pp. 675-695, 1977.
[26] D. Goldenberg, A. Krishnamurthy, W. Maness, Y.R. Yang, A. Young, A.S. Morse, A. Savvides, and B.D.O. Anderson, “Network Localization in Partially Localizable Networks,” Proc. IEEE INFOCOM '05, Apr. 2005.
[27] J. Graver, B. Servatius, and H. Servatius, Combinatorial Rigidity, vol. 2. Am. Math. Soc., 1993.
[28] T. He, C. Huang, B. Blum, J. Stankovic, and T. Abdelzaher, “Range-Free Localization Schemes in Large Scale Sensor Networks,” Proc. Ninth Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 81-95, Sept. 2003.
[29] B. Hendrickson, “Conditions for Unique Graph Realizations,” SIAM J. Computing, vol. 21, no. 1, pp. 65-84, 1992.
[30] B. Hendrickson, “The Molecule Problem: Exploiting Structure in Global Optimization,” SIAM J. Optimization, vol. 5, no. 4, pp. 835-857, 1995.
[31] L. Henneberg, Die Graphische Statik der starren Systeme. Johnson Reprint, 1911.
[32] B. Hofmann-Wellenhof, H. Lichtenegger, and J. Collins, Global Positioning System: Theory and Practice, fourth ed. Springer-Verlag, 1997.
[33] J.E. Hopcroft and R. Tarjan, “Dividing a Graph into Triconnected Components,” SIAM J. Computing, vol. 3, pp. 135-158, 1973.
[34] B. Jackson and T. Jordán, “Connected Rigidity Matroids and Unique Realizations of Graphs,” J. Combinatorial Theory B, vol. 94, pp. 1-29, 2005.
[35] B. Jackson, T. Jordán, and Z. Szabadka, “Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs,” Technical Report TR-2005-07, Egerváry Research Group, 2005.
[36] D. Jacobs and B. Hendrickson, “An Algorithm for Two Dimensional Rigidity Percolation: The Pebble Game,” J. Computational Physics, vol. 137, no. 2, pp. 346-365, 1997.
[37] X. Ji, “Sensor Positioning in Wireless Ad-Hoc Sensor Networks with Multidimensional Scaling,” Proc. IEEE INFOCOM '04, Apr. 2004.
[38] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. Sixth Int'l Conf. Mobile Computing and Networking (MobiCom), Aug. 2000.
[39] B. Krishnamachari, S.B. Wicker, and R. Bejar, “Phase Transition Phenomena in Wireless Ad-Hoc Networks,” Proc. Symp. Ad-Hoc Wireless Networks (GlobeCom '01), 2001.
[40] G. Laman, “On Graphs and Rigidity of Plane Skeletal Structures,” J. Eng. Math., vol. 4, pp. 331-340, 2002.
[41] X.-Y. Li, P.-J. Wan, Y. Wang, and C.-W. Yi, “Fault Tolerant Deployment and Topology Control in Wireless Networks,” Proc. Fourth ACM Symp. Mobile Ad Hoc Networking and Computing (MobiHoc), June 2003.
[42] H. Lim and J. Hou, “Localization for Anisotropic Sensor Networks,” Proc. IEEE INFOCOM '05, Apr. 2005.
[43] G.L. Miller and V. Ramachandran, “A New Graph Triconnectivity Algorithm and Its Parallelization,” Combinatorica, vol. 12, pp. 53-76, 1992.
[44] D. Moore, J. Leonard, D. Rus, and S. Teller, “Robust Distributed Network Localization with Noisy Range Measurements,” Proc. Second ACM Conf. Embedded Networked Sensor Systems (SenSys), Nov. 2004.
[45] J. More and Z. Wu, “Global Continuation for Distance Geometry Problems,” SIAM J. Optimization, vol. 7, pp. 814-836, 1997.
[46] D. Niculescu and B. Nath, “Ad-Hoc Positioning System,” Proc. IEEE Globecom 2001, Nov. 2001.
[47] D. Niculescu and B. Nath, “Ad Hoc Positioning System (APS) Using AOA,” Proc. IEEE INFOCOM '03, Apr. 2003.
[48] M.D. Penrose, “On k-Connectivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145-164, 1999.
[49] N. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller, “Mobile-Assisted Localization in Wireless Sensor Networks,” Proc. IEEE INFOCOM '05, Apr. 2005.
[50] N.B. Priyantha, A. Chakraborty, and H. Balakrishnan, “The Cricket Location-Support System,” Proc. Sixth Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 32-43, Aug. 2000.
[51] B. Roth, “Rigid and Flexible Frameworks,” Am. Math. Monthly, vol. 88, pp. 6-21, 1981.
[52] C. Savarese, J. Rabay, and K. Langendoen, “Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks,” Proc. USENIX Technical Ann. Conf., June 2002.
[53] A. Savvides, C.-C. Han, and M.B. Strivastava, “Dynamic Fine-Grained Localization in Ad-Hoc Networks of Sensors,” Proc. Seventh Int'l Conf. Mobile Computing and Networking (MobiCom), pp.166-179, July 2001.
[54] J. Saxe, “Embeddability of Weighted Graphs in k-Space is Strongly NP-Hard,” Proc. 17th Allerton Conf. Comm., Control and Computing, pp. 480-489, 1979.
[55] B. Servatius and W. Whiteley, “Constraining Plane Configurations in CAD: Combinatorics of Lengths and Directions,” SIAM J. Discrete Math., vol. 12, pp. 136-153, 1999.
[56] Y. Shang and W. Ruml, “Improved MDS-Based Localization,” Proc. IEEE INFOCOM '04, Apr. 2004.
[57] R. Stoleru, T. He, J. Stankovic, and D. Luebke, “High-Accuracy, Low-Cost Localization System for Wireless Sensor Network,” Proc. Third ACM Conf. Embedded Networked Sensor Systems (SenSys), Nov. 2005.
[58] L.G. Valiant and V.V. Vazirani, “NP Is as Easy as Detecting Unique Solutions,” Theoretical Computer Science, vol. 47, no. 1, pp.85-93, 1986.
[59] M. Weiser, “Some Computer Science Problems in Ubiquitous Computing,” Comm. ACM, July 1993.
[60] W. Whiteley, “Some Matroids from Discrete Applied Geometry,” Contemporary Math., J.E. Bonin, J.G., Oxley, and B. Servatius, eds., vol. 197, Am. Math. Soc., 1996.
[61] W. Whiteley, “Rigidity and Scene Analysis,” Handbook of Discrete and Computational Geometry, J. Goodman and J. O'Rourke, eds., pp.1327-1354, CRC Press, 2004.

Index Terms:
Computer systems organization, communication/networking and IT, mobile computing, algorithm/protocol design and analysis, architectures, theory of computation, analysis of algorithms and problem complexity, nonnumerical algorithms and problems, geometrical problems and computation, mathematics of computing, discrete mathematics, graph theory, network problems, computer applications, mobile applications, location-dependent and sensitive, wireless sensor networks.
Citation:
James Aspnes, Tolga Eren, David K. Goldenberg, A. Stephen Morse, Walter Whiteley, Yang Richard Yang, Brian D.O. Anderson, Peter N. Belhumeur, "A Theory of Network Localization," IEEE Transactions on Mobile Computing, vol. 5, no. 12, pp. 1663-1678, Dec. 2006, doi:10.1109/TMC.2006.174
Usage of this product signifies your acceptance of the Terms of Use.