We prove that the (d+1)-lateration graph with n(>= d+1) point, when points
are in general position in R^d, not only is universally rigid, but also admits
a rank (n-d-1) positive semi-definite stress matrix. We also prove that a
similar result holds as in the case of sensor network localization when the
graph has m(>= d+1) anchors.