Geometric buildup algorithms for sensor network localization

DOI10.1155/2012/927031MaRDI QIDQ1955353zbMATH OpenOpenAlexWikidataFDO

Authors Zhenzhen Zheng, Xinlong Luo, Zhijun Wu

Publication date 11 June 2013

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2012/927031

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Discrete location and assignment (90B80)

Recommendations

• Sequential localization of sensor networks
• Geometric algorithms for sensor networks
• Formal theory of noisy sensor network localization
• Sensor network localization with imprecise distances
• Localization from incomplete noisy distance measurements

Cites work

• 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?)
• (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
• 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

Cited in

(7)

• Sequential localization of sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• A Computational Geometry Framework for Efficient Network Localization
• Formal theory of noisy sensor network localization
• UNLOC: optimal unfolding localization from noisy distance data
• Geometric algorithms for sensor networks
• Sensor network localization with imprecise distances

Describes a project that uses

Uses Software

• SFSDP

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)