Download now Free registration required
The authors 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, they propose an essential philosophy that "No connectivity is also useful information just like the information being connected" in unit disk graphs. Exercising this philosophy, they show that the conventional network localization problem can be re-formulated to significantly reduce the search space, and that global rigidity, a necessary and sufficient condition for the existence of unique solution in general graphs, is no longer necessary.
- Format: PDF
- Size: 191.46 KB