Sequential greedy localization in wireless sensor networks with inaccurate anchor positions

Authors:
Qingjiang Shi;Chen He;Hongyang Chen;Lingge Jiang;Wei Wang
Affiliations:
Shanghai Jiao Tong University, Shanghai, P. R. China;Shanghai Jiao Tong University, Shanghai, P. R. China;The University of Tokyo, Japan;Shanghai Jiao Tong University, Shanghai, P. R. China;Shanghai Jiao Tong University, Shanghai, P. R. China
Venue:
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Year:
2009

Citing 12
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
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
Distributed localization in wireless sensor networks: a quantitative comparison

Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue: Wireless sensor networks
Semidefinite programming for ad hoc wireless sensor network localization

Proceedings of the 3rd international symposium on Information processing in sensor networks
Convex Optimization

Convex Optimization
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)
Second-Order Cone Programming Relaxation of Sensor Network Localization

SIAM Journal on Optimization
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider the range-based sensor network localization with inaccurate anchor position information. First, a novel optimization algorithm named sequential greedy optimization (SGO) algorithm is proposed, and then two distributed localization algorithms are obtained: the first is obtained by applying the SGO algorithm to a convex formulation of the localization problem, named CSGLA; while the second is obtained by applying the SGO algorithm to a nonconvex formulation of the localization problem, named NCSGLA. The CSGLA must converge globally while the NCSGLA may converge locally. Both algorithms are partially asynchronous and can be implemented in a distributed fashion in networks. We demonstrate the localization performance via simulations. Simulation results show that, 1) the CSGLA algorithm works faster than the synchronous algorithm [16] with the same localization accuracy; 2) with a reasonably good initialization, the NCSGLA can work much better than the CSGLA.