Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Convex Optimization
Theory of semidefinite programming for sensor network localization
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
A semidefinite programming approach to tensegrity theory and realizability of graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Semidefinite programming based algorithms for sensor network localization
ACM Transactions on Sensor Networks (TOSN)
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
SIAM Journal on Optimization
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
SIAM Journal on Optimization
Hi-index | 0.00 |
The sensor tracking problem is an important problem studied in many different fields. But many of those studies use analysis or machine learning method rather than optimization method. Recently, several approaches have been proposed to solve the static version of the tracking problem, the sensor network localization problem, via Semi-definite Programming(SDP). In this paper, we analyze a new real-time sensor tracking scheme by combining the SDP approach and the gradient method. We show that this approach provides fast and accurate tracking for network sensors. We also discuss the problem of extracting information from the moving sensors, which could be used to predict their movements.