An Efficient Semidefinite Relaxation Method for Energy-Based Source Localization in Sensor Networks

This paper addresses the energy-based localization problem in wireless sensor networks. Since the objective function of the weighted least squares (WLS) formulation is nonconvex, its global solution is hard to obtain without a good initial estimate. In this paper, An approximate solution to the (WLS) problem is presented, by relaxing the minimization problem into semidefinite programming form. One can obtain an optimal solution of the (SDP) by rank-one decomposition of matrices. Numerical results show that the proposed method is indeed efficient.