The sensor network localization, SNL, problem in embedding dimension r,
consists of locating the positions of wireless sensors, given only the
distances between sensors that are within radio range and the positions of a
subset of the sensors (called anchors). Current solution techniques relax this
problem to a weighted, nearest, (positive) semidefinite programming, SDP,
completion problem, by using the linear mapping between Euclidean distance
matrices, EDM, and semidefinite matrices.