Distributed sensor network localization using SOCP relaxation

The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor node positions. This paper describes a distributed localization algorithm based on second-order cone programming relaxatio...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications Vol. 7; no. 12; pp. 4886 - 4895
Main Authors: Srirangarajan, S., Tewfik, A., Zhi-Quan Luo
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.12.2008
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Anchors
Applied sciences
Computational modeling
Computerized monitoring
Convergence of numerical methods
convex optimization
Detection, estimation, filtering, equalization, prediction
Distance measurement
Distributed algorithms
Estimates
Estimation error
Exact sciences and technology
General equipment and techniques
Global Positioning System
Information, signal and communications theory
Instruments, apparatus, components and techniques common to several branches of physics and astronomy
Intelligent sensors
Localization
Network topology
Networks
Numerical simulation
Organization and planning of networks (techniques and equipments)
Physics
Position (location)
positioning
relaxation methods
Robustness
second-order cone programming
Sensors
Sensors (chemical, optical, electrical, movement, gas, etc.); remote sensing
Signal and communications theory
Signal, noise
Studies
synchronous and asynchronous algorithms
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Wireless communication
Performance evaluation
Second order
Parameter estimation
Error estimation
Network architecture
Convex programming
Topological structure
Relaxation
Accuracy
positioning
Position sensor
Relaxation method
Robustness
Localization
Distributed algorithms
relaxation methods
Signal detection
second-order cone programming
Estimation error
Distributed system
Simulation
synchronous and asynchronous algorithms
Distributed algorithm
Position measurement
convex optimization
Distance measurement
Miniaturization
Sensor array
ISSN:1536-1276, 1558-2248
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The goal of the sensor network localization problem is to determine positions of all sensor nodes in a network given certain pairwise noisy distance measurements and some anchor node positions. This paper describes a distributed localization algorithm based on second-order cone programming relaxation. We show that the sensor nodes can estimate their positions based on local information. Unlike previous approaches, we also consider the effect of inaccurate anchor positions. In the presence of anchor position errors, the localization is performed in three steps. First, the sensor nodes estimate their positions using information from their neighbors. In the second step, the anchors refine their positions using relative distance information exchanged with their neighbors and finally, the sensors refine their position estimates. We demonstrate the convergence of the algorithm numerically. Simulation study, for both uniform and irregular network topologies, illustrates the robustness of the algorithm to anchor position and distance estimation errors, and the performance gains achievable in terms of localization accuracy, problem size reduction and computational efficiency.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/T-WC.2008.070241