Abstract
Convex optimization techniques have been used to deal with the sensor localization problem in recent years by virtue of the high accuracy and ease of formulation. Two scenarios differ in distribution of the sensor nodes were implemented, and for each, two different deployments of anchors were executed. To calculate the unknown locations, semidefinite programs (SDPs) were used. Simulation results indicate that convex programming has nice performance in sensor positioning accuracy, which can satisfy the demand of WSN-based applications, and the deployment of anchors has certain effect on the localization precision.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., et al.: IEEE Communications Magazine 40, 102 (2002)
Bharathidasan, A., An, V., Ponduru, S.: Sensor Networks: An Overview. Department of Computer Science. University of California (2002)
Niculescu, D., Nath, B.: In: Proceedings of 2001 IEEE Global Telecommunications Conference, Texas, USA, p. 2926 (2001)
He, T., Huang, C., Blum, B.M., Stankovic, J.A., Abdelzaher, T.: In: Proceedings of the 9th Annual International Conference on Mobile Computing and Networking, San Diego, USA, p. 110 (2003)
Niculescu, D., Nath, B.: Telecommunication Systems 22, 267 (2003)
Nagpal, R.: Organizing a Global Coordinate System from Local Information on an Amorphous Computer.A.I. Memo 1666, MIT A.I. Laboratory (1999)
Doherty, L., Pister, K.S.J., Ghaoui, L.E.: In: Proceedings of the 20th Annual Joint Conference of the IEEE Computer and Communications Societies, USA, p. 1655 (2001)
Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. SIAM, USA (1994)
Karmarkar, N.: Combinatorica 4, 373 (1984)
Biswas, P., Ye, Y.: In: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, Berkeley, CA, p. 46 (2004)
Boyd, S., Ghaoui, L.E., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, USA (1994)
Information on, http://sedumi.ie.lehigh.edu/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ding, Y., Tian, H., Yang, S. (2011). Performance Comparison of Convex Programming in Different Scenarios. In: Lin, S., Huang, X. (eds) Advances in Computer Science, Environment, Ecoinformatics, and Education. CSEE 2011. Communications in Computer and Information Science, vol 218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-23357-9_87
Download citation
DOI: https://doi.org/10.1007/978-3-642-23357-9_87
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-23356-2
Online ISBN: 978-3-642-23357-9
eBook Packages: Computer ScienceComputer Science (R0)