摘要
The sensor network localization problem has received a lot of attention in recent years because many important applications resort to node position information. In contrast to the many interesting algorithms proposed in the literature,this paper provides a relatively straightforward procedure that can tackle localization problem for sensor network in a Least Squares Euclidean Dis-tance Matrix Approximation (LS-EDMA) framework. Simulation results reveal that our proposed algorithm is more robust than another popular Multi-Dimensional Scaling (MDS) and Semi-Definite Programming (SDP) based localization techniques,especially with inaccurate and incomplete distance measurements.
The sensor network localization problem has received a lot of attention in recent years because many important applications resort to node position information. In contrast to the many interesting algorithms proposed in the literature, this paper provides a relatively straightforward procedure that can tackle localization problem for sensor network in a Least Squares Euclidean Distance Matrix Approximation （LS-EDMA） framework. Simulation results reveal that our proposed algorithm is more robust than another popular Multi-Dimensional Scaling （MDS） and Semi-Definite Programming （SDP） based localization techniques, especially with inaccurate and incomplete distance measurements.
