Geometric buildup algorithms for sensor network localization
Summary: We present a geometric buildup algorithm for solving the sensor network localization problem with either accurate or noisy distance data. The algorithm determines the locations of the sensors, one at a time, by using the distances between the determined sensors and the undetermined ones. Each time, only a small system of distance equations needs to be solved and therefore, in an ideal case when the required distances are available for every sensor to be determined, the computation can be completed in \(n\) steps if \(n\) sensors are to be determined. An algorithm with two buildup phases is also implemented to handle not only noisy but also sparse distance data with for example only a few distant anchors. We show our test results and compare them with other approaches.
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A geometric build-up algorithm for solving the molecular distance geometry problem with sparse distance data
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- A linear-time algorithm for solving the molecular distance geometry problem with exact inter-atomic distances
- An updated geometric build-up algorithm for solving the molecular distance geometry problems with sparse distance data
- Explicit sensor network localization using semidefinite representations and facial reductions
- Exploiting Sparsity in SDP Relaxation for Sensor Network Localization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- scientific article; zbMATH DE number 4213315 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 841190 (Why is no real title available?)
- scientific article; zbMATH DE number 847265 (Why is no real title available?)
- scientific article; zbMATH DE number 2188749 (Why is no real title available?)
- Multidimensional scaling. I: Theory and method
- Preorderings, monotone functions, and best rank \(r\) approximations with applications to classical MDS
- Rigid versus unique determination of protein structures with geometric buildup
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Solving a generalized distance geometry problem for protein structure determination
- SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
- Sum of squares method for sensor network localization
- Universal Rigidity and Edge Sparsification for Sensor Network Localization
- Geometric algorithms for sensor networks
- A Computational Geometry Framework for Efficient Network Localization
- UNLOC: optimal unfolding localization from noisy distance data
- Sequential localization of sensor networks
- Algorithmic Aspects of Wireless Sensor Networks
- Formal theory of noisy sensor network localization
- Sensor network localization with imprecise distances
This page was built for publication: Geometric buildup algorithms for sensor network localization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1955353)
