Semidefinite programming based algorithms for sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Algorithm 875: DSDP5—software for semidefinite programming
ACM Transactions on Mathematical Software (TOMS)
Requirements for implementation of localization into real-world assistive environments
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
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
A note on the trackability of dynamic sensor networks
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
Localization of mobile users using trajectory matching
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Heuristic for Fair Correlation-Aware Resource Placement
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Distributed algorithm for node localization in wireless ad-hoc networks
ACM Transactions on Sensor Networks (TOSN)
Sensor network localization using sensor perturbation
ACM Transactions on Sensor Networks (TOSN)
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
SIAM Journal on Optimization
On Equivalence of Semidefinite Relaxations for Quadratic Matrix Programming
Mathematics of Operations Research
Universal Rigidity and Edge Sparsification for Sensor Network Localization
SIAM Journal on Optimization
ACM Transactions on Mathematical Software (TOMS)
Computational Optimization and Applications
| Hi-index | 0.00 |
An adaptive rule-based algorithm, SpaseLoc, is described to solve localization problems for ad hoc wireless sensor networks. A large problem is solved as a sequence of very small subproblems, each of which is solved by semidefinite programming relaxation of a geometric optimization model. The subproblems are generated according to a set of sensor/anchor selection rules. Computational results compared with existing approaches show that the SpaseLoc algorithm scales well and provides excellent localization accuracy.