We study the problem of cooperative localization of a large network of nodes
in integer-coordinated unit disk graphs, a simplified but useful version of
general random graph. Exploiting the property that the radius $r$ sets clear
cut on the connectivity of two nodes, we propose an essential philosophy that
"no connectivity is also useful information just like the information being
connected" in unit disk graphs.