Formal theory of noisy sensor network localization
Graph theory has been used to characterize t he solvability of the sensor network localization problem. If sensors correspond to vertices and edges correspond to sensor pairs between which the distance is known, a significant result in the theory of range-based sensor network localization is that if the graph underlying the sensor network is generically globally rigid and there is a suitable set of anchors at known positions, then the network can be localized, i.e., a unique set of sensor...[Show more]
|Collections||ANU Research Publications|
|Source:||SIAM Journal on Discrete Mathematics|
|01_Anderson_Formal_theory_of_noisy_sensor_2010.pdf||272.76 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.