
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 16631678, December, 2006.  
BibTex  x  
@article{ 10.1109/TMC.2006.174, author = {James Aspnes and Tolga Eren and David K. Goldenberg and A. Stephen Morse and Walter Whiteley and Yang Richard Yang and Brian D.O. Anderson and Peter N. Belhumeur}, title = {A Theory of Network Localization}, journal ={IEEE Transactions on Mobile Computing}, volume = {5}, number = {12}, issn = {15361233}, year = {2006}, pages = {16631678}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.174}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  A Theory of Network Localization IS  12 SN  15361233 SP1663 EP1678 EPD  16631678 A1  James Aspnes, A1  Tolga Eren, A1  David K. Goldenberg, A1  A. Stephen Morse, A1  Walter Whiteley, A1  Yang Richard Yang, A1  Brian D.O. Anderson, A1  Peter N. Belhumeur, PY  2006 KW  Computer systems organization KW  communication/networking and IT KW  mobile computing KW  algorithm/protocol design and analysis KW  architectures KW  theory of computation KW  analysis of algorithms and problem complexity KW  nonnumerical algorithms and problems KW  geometrical problems and computation KW  mathematics of computing KW  discrete mathematics KW  graph theory KW  network problems KW  computer applications KW  mobile applications KW  locationdependent and sensitive KW  wireless sensor networks. VL  5 JA  IEEE Transactions on Mobile Computing ER   
[1] J. Albowicz, A. Chen, and L. Zhang, “Recursive Position Estimation in Sensor Networks,” Proc. Ninth Int'l Conf. Network Protocols (ICNP '01), pp. 3541, 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. 13, pp. 1330, 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. 567581, 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 3Connected 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 NPHard,” Computational Geometry, vol. 9, nos. 12, pp. 324, 1998.
[10] N. Bulusu, J. Heidemann, and D. Estrin, “GPSLess LowCost Outdoor Localization for Very Small Devices,” IEEE Personal Comm. Magazine, vol. 7, no. 5, pp. 2834, Oct. 2000.
[11] S. Capkun, M. Hamdi, and J.P. Hubaux, “GPSFree Positioning in Mobile AdHoc Networks,” Proc. Hawaii Int'l Conf. System Sciences, 2001.
[12] K. Chintalapudi, R. Govindan, G. Sukhatme, and A. Dhariwal, “AdHoc 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 LSI0272R, 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 LSI0247R, 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. 16551633, 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. 4350, 2002.
[23] G.H. Forman and J. Zahorjan, “The Challenges of Mobile Computing,” Computer, vol. 27, no. 4, pp. 3847, 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. 675695, 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, “RangeFree Localization Schemes in Large Scale Sensor Networks,” Proc. Ninth Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 8195, Sept. 2003.
[29] B. Hendrickson, “Conditions for Unique Graph Realizations,” SIAM J. Computing, vol. 21, no. 1, pp. 6584, 1992.
[30] B. Hendrickson, “The Molecule Problem: Exploiting Structure in Global Optimization,” SIAM J. Optimization, vol. 5, no. 4, pp. 835857, 1995.
[31] L. Henneberg, Die Graphische Statik der starren Systeme. Johnson Reprint, 1911.
[32] B. HofmannWellenhof, H. Lichtenegger, and J. Collins, Global Positioning System: Theory and Practice, fourth ed. SpringerVerlag, 1997.
[33] J.E. Hopcroft and R. Tarjan, “Dividing a Graph into Triconnected Components,” SIAM J. Computing, vol. 3, pp. 135158, 1973.
[34] B. Jackson and T. Jordán, “Connected Rigidity Matroids and Unique Realizations of Graphs,” J. Combinatorial Theory B, vol. 94, pp. 129, 2005.
[35] B. Jackson, T. Jordán, and Z. Szabadka, “Globally Linked Pairs of Vertices in Equivalent Realizations of Graphs,” Technical Report TR200507, 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. 346365, 1997.
[37] X. Ji, “Sensor Positioning in Wireless AdHoc 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 AdHoc Networks,” Proc. Symp. AdHoc Wireless Networks (GlobeCom '01), 2001.
[40] G. Laman, “On Graphs and Rigidity of Plane Skeletal Structures,” J. Eng. Math., vol. 4, pp. 331340, 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. 5376, 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. 814836, 1997.
[46] D. Niculescu and B. Nath, “AdHoc 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 kConnectivity for a Geometric Random Graph,” Random Structures and Algorithms, vol. 15, no. 2, pp. 145164, 1999.
[49] N. Priyantha, H. Balakrishnan, E. Demaine, and S. Teller, “MobileAssisted Localization in Wireless Sensor Networks,” Proc. IEEE INFOCOM '05, Apr. 2005.
[50] N.B. Priyantha, A. Chakraborty, and H. Balakrishnan, “The Cricket LocationSupport System,” Proc. Sixth Int'l Conf. Mobile Computing and Networking (MobiCom), pp. 3243, Aug. 2000.
[51] B. Roth, “Rigid and Flexible Frameworks,” Am. Math. Monthly, vol. 88, pp. 621, 1981.
[52] C. Savarese, J. Rabay, and K. Langendoen, “Robust Positioning Algorithms for Distributed AdHoc Wireless Sensor Networks,” Proc. USENIX Technical Ann. Conf., June 2002.
[53] A. Savvides, C.C. Han, and M.B. Strivastava, “Dynamic FineGrained Localization in AdHoc Networks of Sensors,” Proc. Seventh Int'l Conf. Mobile Computing and Networking (MobiCom), pp.166179, July 2001.
[54] J. Saxe, “Embeddability of Weighted Graphs in kSpace is Strongly NPHard,” Proc. 17th Allerton Conf. Comm., Control and Computing, pp. 480489, 1979.
[55] B. Servatius and W. Whiteley, “Constraining Plane Configurations in CAD: Combinatorics of Lengths and Directions,” SIAM J. Discrete Math., vol. 12, pp. 136153, 1999.
[56] Y. Shang and W. Ruml, “Improved MDSBased Localization,” Proc. IEEE INFOCOM '04, Apr. 2004.
[57] R. Stoleru, T. He, J. Stankovic, and D. Luebke, “HighAccuracy, LowCost 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.8593, 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.13271354, CRC Press, 2004.