Formal Theory of Noisy Sensor Network Localization

Publisher:
Society for Industrial and Applied Mathematics
Publication Type:
Journal Article
Citation:
SIAM Journal on Discrete Mathematics, 2010, 24 (2), pp. 684 - 698
Issue Date:
2010-01
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2013001680OK.pdf308.05 kB
Adobe PDF
Graph theory has been used to characterize the 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 positions can be determined that is consistent with the data. In particular, for planar problems, provided the sensor network has three or more noncollinear anchors at known points, all sensors are located at generic points, and the intersensor distances corresponding to the graph edges are precisely known rather than being subject to measurement noise, generic global rigidity of the graph is necessary and sufficient for the network to be localizable (in the absence of any further information)
Please use this identifier to cite or link to this item: