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
The cricket compass for context-aware mobile applications
Proceedings of the 7th annual international conference on Mobile computing and networking
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
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
SIAM Journal on Optimization
Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
SIAM Journal on Optimization
Global Continuation for Distance Geometry Problems
SIAM Journal on Optimization
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
Localization from Connectivity in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Distributed weighted-multidimensional scaling for node localization in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Scalable sensor localization algorithms for wireless sensor networks
Scalable sensor localization algorithms for wireless sensor networks
SpaseLoc: An Adaptive Subproblem Algorithm for Scalable Wireless Sensor Network Localization
SIAM Journal on Optimization
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
Sensor network localization, euclidean distance matrix completions, and graph realization
Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments
Distributed localization for anisotropic sensor networks
ACM Transactions on Sensor Networks (TOSN)
Distributed Localization of Modular Robot Ensembles
International Journal of Robotics Research
IEEE Transactions on Signal Processing
Semidefinite programming approach for range-difference based source localization
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Normalized incremental subgradient algorithm and its application
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Distributed algorithm for node localization in wireless ad-hoc networks
ACM Transactions on Sensor Networks (TOSN)
Weighing strategy for network localization under scarce ranging information
IEEE Transactions on Wireless Communications
High accuracy localization method using AoA in sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Successive and asymptotically efficient localization of sensor nodes in closed-form
IEEE Transactions on Signal Processing
Efficient weighted multidimensional scaling for wireless sensor network localization
IEEE Transactions on Signal Processing
Ranging energy optimization for robust sensor positioning based on semidefinite programming
IEEE Transactions on Signal Processing
Bio-inspired node localization in wireless sensor networks
SMC'09 Proceedings of the 2009 IEEE international conference on Systems, Man and Cybernetics
Distributed wireless sensor network localization using stochastic proximity embedding
Computer 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
Sequential greedy localization in wireless sensor networks with inaccurate anchor positions
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Distributed wireless sensor network localization via sequential greedy optimization algorithm
IEEE Transactions on Signal Processing
The power of convex relaxation: near-optimal matrix completion
IEEE Transactions on Information Theory
Universal rigidity: towards accurate and efficient localization of wireless networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Reformulating the least-square source localization problem with contracted distances
Asilomar'09 Proceedings of the 43rd Asilomar conference on Signals, systems and computers
Mobile element assisted cooperative localization for wireless sensor networks with obstacles
IEEE Transactions on Wireless Communications
Sensor network localization using sensor perturbation
ACM Transactions on Sensor Networks (TOSN)
Bio-inspired algorithms for autonomous deployment and localization of sensor nodes
IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews
SIAM Journal on Optimization
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
SIAM Journal on Optimization
Universal Rigidity and Edge Sparsification for Sensor Network Localization
SIAM Journal on Optimization
Network measurement based modeling and optimization for IP geolocation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Sensor network localization by eigenvector synchronization over the euclidean group
ACM Transactions on Sensor Networks (TOSN)
ACM Transactions on Mathematical Software (TOMS)
Accurate sequential self-localization of sensor nodes in closed-form
Signal Processing
The discretizable molecular distance geometry problem
Computational Optimization and Applications
Understanding the limits of RF-based collaborative localization
IEEE/ACM Transactions on Networking (TON)
Computational Optimization and Applications
Manifold-based canonical correlation analysis for wireless sensor network localization
Wireless Communications & Mobile Computing
A flexible semi-definite programming approach for source localization problems
Digital Signal Processing
Refining hop-count for localisation in wireless sensor networks
International Journal of Sensor Networks
A framework based on barycentric coordinates for localization in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
On the number of realizations of certain Henneberg graphs arising in protein conformation
Discrete Applied Mathematics
Hi-index | 0.09 |
An SDP relaxation based method is developed to solve the localization problem in sensor networks using incomplete and inaccurate distance information. The problem is set up to find a set of sensor positions such that given distance constraints are satisfied. The nonconvex constraints in the formulation are then relaxed in order to yield a semidefinite program that can be solved efficiently.The basic model is extended in order to account for noisy distance information. In particular, a maximum likelihood based formulation and an interval based formulation are discussed. The SDP solution can then also be used as a starting point for steepest descent based local optimization techniques that can further refine the SDP solution.We also describe the extension of the basic method to develop an iterative distributed SDP method for solving very large scale semidefinite programs that arise out of localization problems for large dense networks and are intractable using centralized methods.The performance evaluation of the technique with regard to estimation accuracy and computation time is also presented by the means of extensive simulations.Our SDP scheme also seems to be applicable to solving other Euclidean geometry problems where points are locally connected.