We study the network localization problem, i.e., problem of determining node positions a wireless sensor modeled as unit disk graph. In an arbitrarily deployed network, all nodes may not be uniquely determined. Computational complexity results suggest that even if corresponds to unique solution, polynomial-time algorithm is unlikely exist. So we are interested in algorithms efficiently localize...