Formal theory of noisy sensor network localization
From MaRDI portal
Recommendations
- Sequential localization of sensor networks
- Theory of semidefinite programming for sensor network localization
- Theory of semidefinite programming for sensor network localization
- Geometric buildup algorithms for sensor network localization
- Sensor network localization on the group of three-dimensional displacements
Cited in
(17)- On frame and orientation localization for relative sensing networks
- Geometric buildup algorithms for sensor network localization
- A least-squares approach for discretizable distance geometry problems with inexact distances
- The expected uncertainty of range-free localization protocols in sensor networks
- Globally rigid augmentation of minimally rigid graphs in \(\mathbb{R}^2\)
- Realistic anchor positioning for sensor localization
- Rigid and globally rigid graphs with pinned vertices
- Sensor network localization on the group of three-dimensional displacements
- Distributed centroid estimation from noisy relative measurements
- Globally rigid augmentation of rigid graphs
- A survey and evaluation of graph realization algorithms
- Sequential localization of sensor networks
- Maximum Rigid Components as Means for Direction-Based Localization in Sensor Networks
- Theoretical foundations of ordinal multidimensional scaling, including internal unfolding and external unfolding
- Stability of sequential lateration and of stress minimization in the presence of noise
- Analysis of noisy angle-only network localization
- Sensor network localization with imprecise distances
This page was built for publication: Formal theory of noisy sensor network localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5392920)