A Theory of Network Localization

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]  John Zahorjan,et al.  The challenges of mobile computing , 1994, Computer.

[2]  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 .

[3]  Walter Whiteley,et al.  Constraining Plane Configurations in Computer-Aided Design: Combinatorics of Directions and Lengths , 1999, SIAM J. Discret. Math..

[4]  Andy Hopper,et al.  A new location technique for the active office , 1997, IEEE Wirel. Commun..

[5]  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 .

[6]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..

[7]  Henry Wolkowicz,et al.  Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming , 1999, Comput. Optim. Appl..

[8]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

[9]  Srdjan Capkun,et al.  GPS-free Positioning in Mobile Ad Hoc Networks , 2001, Proceedings of the 34th Annual Hawaii International Conference on System Sciences.

[10]  Maria J. Serna,et al.  A Random Graph Model for Optical Networks of Sensors , 2003, IEEE Trans. Mob. Comput..

[11]  Gary L. Miller,et al.  A new graphy triconnectivity algorithm and its parallelization , 1987, STOC.

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

[13]  A. Savvides,et al.  Network localization in partially localizable networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Jordi Petit,et al.  Random scaled sector graphs , 2002 .

[15]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[16]  James Aspnes,et al.  On the Computational Complexity of Sensor Network Localization , 2004, ALGOSENSORS.

[17]  Stephen B. Wicker,et al.  Phase transition phenomena in wireless ad hoc networks , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[18]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[19]  Gaetano Borriello,et al.  Location Systems for Ubiquitous Computing , 2001, Computer.

[20]  Walter Whiteley,et al.  Rigidity and scene analysis , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[21]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[22]  Lebrecht Henneberg,et al.  Die graphische Statik der Starren Systeme , 1911 .

[23]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[24]  Jan M. Rabaey,et al.  Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks , 2002, USENIX Annual Technical Conference, General Track.

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

[26]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[27]  András Faragó.  Scalable analysis and design of ad hoc networks via random graph theory , 2002, DIALM '02.

[28]  Lixia Zhang,et al.  Recursive position estimation in sensor networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[29]  Bruce Hendrickson,et al.  The Molecule Problem: Exploiting Structure in Global Optimization , 1995, SIAM J. Optim..

[30]  J. J. Moré,et al.  Global continuation for distance geometry problems , 1995 .

[31]  Gaetano Borriello,et al.  A Survey and Taxonomy of Location Systems for Ubiquitous Computing , 2001 .

[32]  B. Anderson,et al.  A FRAMEWORK FOR MAINTAINING FORMATIONS BASED ON RIGIDITY , 2002 .

[33]  Xiang Ji,et al.  Sensor positioning in wireless ad-hoc sensor networks using multidimensional scaling , 2004, IEEE INFOCOM 2004.

[34]  John T. Gill,et al.  Computational complexity of probabilistic Turing machines , 1974, STOC '74.

[35]  Andy Hopper,et al.  The active badge location system , 1992, TOIS.

[36]  Tian He,et al.  A high-accuracy, low-cost localization system for wireless sensor networks , 2005, SenSys '05.

[37]  Hyuk Lim,et al.  Localization for anisotropic sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[39]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless networks , 2003, MobiHoc '03.

[40]  Geoffrey Grimmett.  Random Graph Theorems , 1977 .

[41]  Alex R. Berg,et al.  A proof of Connelly's conjecture on 3-connected generic cycles , 2001 .

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

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

[44]  Gaurav S. Sukhatme,et al.  Ad-hoc localization using ranging and sectoring , 2004, IEEE INFOCOM 2004.

[45]  Erik D. Demaine,et al.  Mobile-assisted localization in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[46]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[47]  Martin J. B. Appel,et al.  The Maximum Vertex Degree of a Graph on Uniform Points in [0, 1] d , 1997, Advances in Applied Probability.

[48]  David G. Kirkpatrick,et al.  Unit disk graph recognition is NP-hard , 1998, Comput. Geom..

[49]  Deborah Estrin,et al.  Robust range estimation using acoustic and multimodal sensing , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[50]  Wheeler Ruml,et al.  Improved MDS-based localization , 2004, IEEE INFOCOM 2004.

[51]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[52]  King Lun Yiu.  Ad-hoc positioning system , 2008 .

[53]  J. Werb,et al.  Designing a positioning system for finding things and people indoors , 1998 .

[54]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[55]  L. El Ghaoui,et al.  Convex position estimation in wireless sensor networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[56]  Mark Weiser,et al.  Some computer science issues in ubiquitous computing , 1993, CACM.

[57]  Mark Weiser,et al.  Some Computer Science Problems in Ubiquitous Computing , 1993 .

[58]  Gary L. Miller,et al.  A new graph triconnectivity algorithm and its parallelization , 1992, Comb..

[59]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[60]  B. Anderson,et al.  Sensor and network topologies of formations with direction, bearing, and angle information between agents , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[61]  A. Stephen Morse,et al.  Sensor and Network Topologies of Formations with distance-direction-angle constraints , 2003 .

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

[63]  Paramvir Bahl,et al.  RADAR: an in-building RF-based user location and tracking system , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[64]  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.

[65]  Satish Kumar,et al.  Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.

[66]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[67]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[68]  Jerzy Kocinski.  Phase transition phenomena , 1983 .