Performance Comparison of Convex Programming in Different Scenarios

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 WSNbased applications, and the deployment of anchors has certain effect on the localization precision.

DOI: 10.1007/978-3-642-23357-9_87

Extracted Key Phrases

4 Figures and Tables

Cite this paper

@inproceedings{Ding2011PerformanceCO, title={Performance Comparison of Convex Programming in Different Scenarios}, author={Yingqiang Ding and Hua Tian and Shouyi Yang}, booktitle={CSEE}, year={2011} }