Parallel and distributed computation: numerical methods
Parallel and distributed computation: numerical methods
On the convergence of the coordinate descent method for convex differentiable minimization
Journal of Optimization Theory and Applications
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Wireless sensor networks: a survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
Range-free localization schemes for large scale sensor networks
Proceedings of the 9th annual international conference on Mobile computing and networking
Semidefinite programming for ad hoc wireless sensor network localization
Proceedings of the 3rd international symposium on Information processing in sensor networks
Convex Optimization
Localization from Connectivity in Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Robust distributed node localization with error management
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Distributed weighted-multidimensional scaling for node localization in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Semidefinite programming based algorithms for sensor network localization
ACM Transactions on Sensor Networks (TOSN)
Wireless sensor network localization techniques
Computer Networks: The International Journal of Computer and Telecommunications Networking
Second-Order Cone Programming Relaxation of Sensor Network Localization
SIAM Journal on Optimization
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
SIAM Journal on Optimization
Normalized incremental subgradient algorithm and its application
IEEE Transactions on Signal Processing
IEEE Transactions on Signal Processing
Relative location estimation in wireless sensor networks
IEEE Transactions on Signal Processing
Iterative greedy algorithm for solving the FIR paraunitary approximation problem
IEEE Transactions on Signal Processing
Distributed sensor network localization using SOCP relaxation
IEEE Transactions on Wireless Communications - Part 1
Mobile Networks and Applications
A virtual square grid-based coverage algorithm of redundant node for wireless sensor network
Journal of Network and Computer Applications
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
Wireless sensor network positioning based on the unilateral side of two reference nodes
Computers and Electrical Engineering
Hi-index | 35.68 |
Node localization is essential to most applications of wireless sensor networks (WSNs). In this paper, we consider both range-based node localization and range-free node localization with uncertainties in range measurements, radio range, and anchor positions. First, a greedy optimization algorithm, named sequential greedy optimization (SGO) algorithm, is presented,which is more suitable for distributed optimization in networks than the classical nonlinear Gauss-Seidel algorithm. Then a unified optimization framework is proposed for both range-based localization and range-free localization, and two convex localization formulations are obtained based on semidefinite programming (SDP) relaxation techniques. By applying the SGO algorithm to the edge-based SDP relaxation formulation, we propose a second-order cone programming (SOCP)-based distributed node localization algorithm. Two distributed refinement algorithms are also proposed by using the SGO algorithm to nonconvex localization formulations. The proposed localization algorithms all can be implemented partially asynchronously in networks. Finally,extensive simulations are conducted to demonstrate the efficiency and accuracy of the proposed distributed localization algorithms.