Wireless Sensor Network Localization Using SDP Relaxation

In wireless sensor networks, the problem of sensor node location is a very important indicator. The accuracy of localization depends on the elimination of errors. Based on Euclidean distance, an optimization algorithm for semi-definite programming (SDP) is proposed in this paper. Combining the effective anchor node position selection and ratio range setting, the SDP algorithm was used to relax the non-convex constraints, and effectively reduced the impact of errors and get the actual position of measurement nodes. This algorithm effectively solved the problem of inaccurate estimation of nodes outside the convex hull of the anchor node. The numerical results show that the proposed SDP algorithm achieves high accuracy in the location estimation of unknown nodes.