Semidefinite programming for ad hoc wireless sensor network localization

Third International Symposium on Information Processing in Sensor Networks, IPSN 2004

Volumn , Issue , 2004, Pages 46-54

  Biswas, Pratik ^a   Ye, Yinyu ^a  

^a Stanford University   (United States)

Author keywords

Semidefinite Programming; Sensor Network Localization

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA PROCESSING; ERROR DETECTION; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; WIRELESS TELECOMMUNICATION SYSTEMS;

AD HOC WIRELESS SENSOR NETWORKS; DISTANCE INFORMATION; SEMIDEFINITE PROGRAMMING; SENSOR NETWORK LOCALIZATION;

SENSOR DATA FUSION;

EID: 3042823513     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/984622.984630     Document Type: Conference Paper

References (19)

1. A. Y. Alfakih, A. Khandani, and H. Wolkowicz. Solving Euclidean distance matrix completion problems via semidefinite programming. Comput. Optim. Appl., 12(1-3):13-30, November 1999.
2. S. J. Benson, Y. Ye, and X. Zhang. Solving large-scale sparse semidefinite programs for combinatorial optimization. SIAM Journal on Optimization, 10(2):443-461, 2000.
3. D. Bertsimas and Y. Ye. Semidefinite relaxations, multivariate normal distributions, and order statistics. Handbook of Combinatorial Optimization, 3:1-19, 1998.
4. P. Biswas and Y. Ye. A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization. Technical report, Dept of Management Science and Engineering, Stanford University, October 2003.
5. S. Boyd, L. E. Ghaoui, E. Feron, and V. Balakrishnan. Linear Matrix Inequalities in System and Control Theory. SIAM., 1994.
6. N. Bulusu, J. Heidemann, and D. Estrin. Gps-less low cost outdoor localization for very small devices. Technical report, Computer science department, University of Southern California, April 2000.
7. L. Doherty, L. E. Ghaoui, and S. J. Pister. Convex position estimation in wireless sensor networks. In IEEE Infocom, volume 3, pages 1655 -1663, April 2001.
8. D. Ganesan, B. Krishnamachari, A. Woo, D. Culler, D. Estrin, and S. Wicker. An empirical study of epidemic algorithms in large scale multihop wireless networks. Technical report, University of California, Los Angeles, 2002.
9. J. Hightower and G. Borriello. Location systems for ubiquitous computing. IEEE Computer, 34(8):57-66, August 2001.
10. A. Howard, M. Mataric, and G. Sukhatme. Relaxation on a mesh: a formalism for generalized localization. In IEEE/RSJ Int'l Conf. on Intelligent Robots and Systems, volume 3, pages 1055-1060, October 2001.
11. M. Laurent. Matrix completion problems. The Encyclopedia of Optimization., 3:221-229, 2001.
12. J. Moré and Z. Wu. Global continuation for distance geometry problems. SIAM Journal on Optimization., 7:814-836, 1997.
13. D. Niculescu and B. Nath. Ad hoc positioning system (APS). In IEEE GLOBECOM (1), pages 2926-2931, 2001.
14. C. Savarese, J. Rabay, and K. Langendoen. Robust positioning algorithms for distributed ad-hoc wireless sensor networks. In USENIX Technical Annual Conference, June 2002.
15. A. Savvides, C.-C. Han, and M. B. Srivastava. Dynamic fine-grained localization in ad-hoc networks of sensors. In Mobile Computing and Networking, pages 166-179, 2001.
16. A. Savvides, H. Park, and M. B. Srivastava. The bits and flops of the n-hop multilateration primitive for node localization problems. In Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications, pages 112-121. ACM Press, 2002.
17. Y. Shang, W. Ruml, Y. Zhang, and M. P. J. Fromherz. Localization from mere connectivity, In Proceedings of the 4th ACM international symposium on Mobile Ad Hoc Networking & Computing, pages 201-212. ACM Press, 2003.
18. J. F. Sturm. Let sedumi seduce you, October 2001.
19. G. Xue and Y. Ye. An efficient algorithm for minimizing a sum of euclidean norms with applications. SIAM Journal on Optimization., 7:1017-1036, 1997.