Article Outline
Keywords
Introduction
Organization
Idiosyncrasies
Formulation
Methods
Review of Solution Approaches
Semidefinite Programming Model
Conclusion
See also
References
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Aghajan H, Biswas P, Ye Y (2005) Semidefinite programming algorithms for sensor network localization using angle of arrival information. In: 39th Annual Asilomar Conference on Signals, Systems and Computers
Alfakih AY, Wolkowicz H (1998) On the embeddability of weighted graphs in Euclidean spaces, Technical Report CORR 98–12. University of Waterloo, Dept. of Combinatorics and Optimization
Alfakih AY, Wolkowicz H (2002) Euclidean distance matrices and the molecular conformation problem, Technical Report CORR 2002–17. University of Waterloo, Dept. of Combinatorics and Optimization
Alizadeh F (1995) Interior point methods in semidefinite programming with applications to combinatorial optimization. SIAM J Optim 5:13–51
Aspnes J, Goldenberg D, Yang R (2004) On the computational complexity of sensor network localization. In: Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, ALGOSENSORS 2004, Turku, Finland, July 16, 2004. Lecture Notes in Computer Science, vol 3121. Springer, 2004, pp 32–44
Beutel J (1999) Geolocation in a picoradio environment. M.S. thesis. Berkeley, ETH Zurich
Biswas P, Liang T, Toh K, Ye Y (2005) An SDP based approach for anchor-free 3d graph realization. SIAM J Sci Comp, submitted
Biswas P, Liang T, Toh K, Ye Y, Wang T (2006) Semidefinite programming approaches for sensor network localization with noisy distance measurements. IEEE Trans Autom Sci Eng 3(4):360–371
Biswas P, Lian T, Wang T, Ye Y (2006) Semidefinite programming based algorithms sensor network localization. ACM Trans Sens Netw 2(2):188–220
Boyd S, El Ghaoui L, Feron E, Balakrishnan V (1994) Linear Matrix Inequalities in System and Control Theory, vol 15 of Studies in Applied Mathematics. SIAM, Philadelphia
Bulusu N, Heidemann J, Estrin D (2000) GPS-less low cost outdoor localization for very small devices. Technical report, Computer Science Department, University of Southern California
Chong C, Kumar SP (2003) Sensor networks: Evolution, opportunities, and challenges. Proc IEEE 91(8):1247–1256
Doherty L, Ghaoui LE, Pister SJ (2001) Convex position estimation in wireless sensor networks. IEEE Infocom 3:1655–1663
Fan MKH, Gong Y (1997) Eingenvalue multiplicity estimate in semidefinite programming. J Optim Theory Appl 94(1):55–72
Fromherz M, Ruml W, Shang Y, Zhang Y (2004) Localization from connectivity in sensor networks. IEEE Trans Parallel Distrib Syst 15(11):961–974
Ganesan D, Krishnamachari B, Woo A, Culler D, Estrin D, Wicker S (2002) An empirical study of epidemic algorithms in large scale multihop wireless networks. Technical report. University of California, Los Angeles
Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman and Company, San Francisco
Hightower J, Borriello G (2001) Location systems for upbiquitous computing. Computer 34:57–66
Howard A, Matarić M, Sukhatme G (2001) Relaxation on a mesh: a formalism for generalized localization. In: IEEE/RSJ International Conference on Intelligent Robots and Systems, Wailea, Hawaii, pp 1055–1060
Jackson B, Jordán T (2005) Connected rigidity matroids and unique realizations of graphs. J Comb Theory B 94:1–29
Kaplan E (1996) Understanding GPS: Principles and Applications. Artech House, Norwood
Langendoen K, Reijers N (2003) Distributed localization in wireless sensor networks: a quantitative comparison. Comp Netw 43:499–518
Niculescu D, Nath B (2001) Ad hoc positioning system (aps). IEEE GLOBECOM 1:2926–2931
Resende MGC, Pardalos PM (2006) Handbook of Optimization in Telecommunications. Springer, New York
Savarese C, Langendoen K, Rabay J (2002) Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In: USENIX Technical Annual Conference, Monterey, June 2002, pp 317–328
Savvides A, Han CC, Srivastava MB (2001) Dynamic fine-grained localization in ad-hoc sensor networks. In: Proceedings of the Fifth International Conference on Mobile Computing and Networking (Mobicom 2001), Rome, July, pp 166–179
Savvides A, Park H, Srivastava MB (2002) The bits and flops of the n-hop multilateration primitive for node localization problems. In: Proceedings of the First International Workshop on Wireless Networks and Applications held in conjunction with Mobicom, Atlanta, 28 Sept 2002
So A, Ye Y (2006) Theory of semidefinite programming for sensor network localization. Mathematical Programming, published online, DOI: 10.1007/s10107–006-0040–1
Strang G (1998) Introduction to Linear Algebra, 3rd edn. Wellesley-Cambridge Press, Wellesley
Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38:49–95
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag
About this entry
Cite this entry
Commander, C., Ragle, M.A., Ye, Y. (2008). Semidefinite Programming and the Sensor Network Localization Problem, SNLP . In: Floudas, C., Pardalos, P. (eds) Encyclopedia of Optimization. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-74759-0_581
Download citation
DOI: https://doi.org/10.1007/978-0-387-74759-0_581
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-387-74758-3
Online ISBN: 978-0-387-74759-0
eBook Packages: Mathematics and StatisticsReference Module Computer Science and Engineering