Sequential localization of sensor networks
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...[Show more]
|Collections||ANU Research Publications|
|Source:||Siam Journal on Control and Optimization|
|01_Fang_Sequential_localization_of_2009.pdf||442.34 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.