Conditions for unique graph realizations
SIAM Journal on Computing
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
Computational Optimization and Applications - Special issue on computational optimization—a tribute to Olvi Mangasarian, part I
Dynamic fine-grained localization in Ad-Hoc networks of sensors
Proceedings of the 7th annual international conference on Mobile computing and networking
The bits and flops of the n-hop multilateration primitive for node localization problems
WSNA '02 Proceedings of the 1st ACM international workshop on Wireless sensor networks and applications
Global Continuation for Distance Geometry Problems
SIAM Journal on Optimization
Interior Point Trajectories in Semidefinite Programming
SIAM Journal on Optimization
Approximation algorithm for embedding metrics into a two-dimensional space
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Robust Positioning Algorithms for Distributed Ad-Hoc Wireless Sensor Networks
ATEC '02 Proceedings of the General Track of the annual conference on USENIX Annual Technical Conference
Localization from mere connectivity
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Low-dimensional embedding with extra information
SCG '04 Proceedings of the twentieth annual symposium on Computational geometry
Distributed localization using noisy distance and angle information
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Localization and coverage for high density sensor networks
Computer Communications
Combinatorial genericity and minimal rigidity
Proceedings of the twenty-fourth annual symposium on Computational geometry
Real-time tracking for sensor networks via sdp and gradient method
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
Localization and routing in sensor networks by local angle information
ACM Transactions on Sensor Networks (TOSN)
Multiple Round Random Ball Placement: Power of Second Chance
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Connectivity-based localization of large-scale sensor networks with complex shape
ACM Transactions on Sensor Networks (TOSN)
Weighing strategy for network localization under scarce ranging information
IEEE Transactions on Wireless Communications
An as-rigid-as-possible approach to sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Understanding and solving flip-ambiguity in network localization via semidefinite programming
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Efficient and accurate localization in multihop networks
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
An SDP-Based Divide-and-Conquer Algorithm for Large-Scale Noisy Anchor-Free Graph Realization
SIAM Journal on Scientific Computing
Probabilistic behavior of sensor network localization
ISPA'05 Proceedings of the 2005 international conference on Parallel and Distributed Processing and Applications
COTA: a robust multi-hop localization scheme in wireless sensor networks
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Uniquely localizable networks with few anchors
ALGOSENSORS'06 Proceedings of the Second international conference on Algorithmic Aspects of Wireless Sensor Networks
Sensor network localization by eigenvector synchronization over the euclidean group
ACM Transactions on Sensor Networks (TOSN)
Source location with rigidity and tree packing requirements
Operations Research Letters
OFA: An optimistic approach to conquer flip ambiguity in network localization
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
We analyze the semidefinite programming (SDP) based model and method for the position estimation problem in sensor network localization and other Euclidean distance geometry applications. We use SDP duality and interior-point algorithm theories to prove that the SDP localizes any network or graph that has unique sensor positions to fit given distance measures. Therefore, we show, for the first time, that these networks can be localized in polynomial time. We also give a simple and efficient criterion for checking whether a given instance of the localization problem has a unique realization in R2 using graph rigidity theory. Finally, we introduce a notion called strong localizability and show that the SDP model will identify all strongly localizable subnetworks in the input network.