Sequential localization of sensor networks

Date

2009

Authors

Fang, J
Cao, Ming
Morse, A Stephen
Anderson, Brian

Journal Title

Journal ISSN

Volume Title

Publisher

SIAM Publications

Abstract

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.

Description

Keywords

Keywords: Distance informations; Localization; Polynomial-time algorithms; Quadratic equations; Sensor network localizations; Graph theory; Polynomial approximation; Programming theory; Rigidity; Sensors; Wireless sensor networks; Sensor networks Graph theory; Localization; Rigidity; Sensor networks

Citation

Source

Siam Journal on Control and Optimization

Type

Journal article

Book Title

Entity type

Access Statement

License Rights

Restricted until

2037-12-31