The SDP-based algorithm for localization problem in wireless sensor networks

MaRDI QIDQ2941307zbMATH OpenFDO

Authors Maria A. Jivulescu, Ruxandra I. Rusnac, Mircea M. Jivulescu

Publication date 27 August 2015

zbMATH Keywords

semidefinite programmingsensor networksdual problem

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Semidefinite programming (90C22) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10)

Recommendations

• A distributed method for solving semidefinite programs arising from ad hoc wireless sensor network localization
• SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
• Theory of semidefinite programming for sensor network localization
• Theory of semidefinite programming for sensor network localization
• Nodes locating algorithm based on local semi-definite programming for large scale wireless sensor networks

Cited in

(5)

• A survey on distributed network localization from a graph Laplacian perspective
• Hierarchical greedy matching pursuit for multi-target localization in wireless sensor networks using compressive sensing
• Nodes locating algorithm based on local semi-definite programming for large scale wireless sensor networks
• A linear programming algorithm for indoor localization in wireless sensor networks
• SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization

This page was built for publication: The SDP-based algorithm for localization problem in wireless sensor networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2941307)