Sequential localization with inaccurate measurements
ACC'09 Proceedings of the 2009 conference on American Control Conference
Distributed localization for anisotropic sensor networks using spatial clustering
ADCONS'11 Proceedings of the 2011 international conference on Advanced Computing, Networking and Security
| Hi-index | 0.00 |
The sensor network localization problem with distance information is to determine the positions of all sensors in a network, given the positions of some of the sensors and the distances between some pairs of sensors. A definition is given for a sensor network in the plane to be “sequentially localizable.” It is shown that the graph of a sequentially localizable network must have a “bilateration ordering,” and a polynomial time algorithm is given for deciding whether or not a network's graph has such an ordering. A provably correct algorithm is given which consists of solving a sequence of quadratic equations, and it is shown that the algorithm can localize any localizable network in the plane whose graph has a bilateration ordering.