Sensor Network Localization Using Sensor Perturbation
Yuanchen Zhu,Steven J. Gortler,Dylan P. Thurston +2 more
- 19 Apr 2009
- pp 2796-2800
TL;DR: If the sensors are allowed to wiggle, giving us perturbed distance data, a novel algorithm can be applied to realize arbitrary generically globally rigid (GGR) graphs (or maximal vertex subsets in non-GGR graphs whose relative positions are fixed).
read more
Abstract: Sensor network localization is an instance of the NP-HARD graph realization problem. Thus, methods used in practice are not guaranteed to find the correct localization, even if it is uniquely determined by the input distances. In this paper, we show the following: if the sensors are allowed to wiggle, giving us perturbed distance data, we can apply a novel algorithm to realize arbitrary generically globally rigid (GGR) graphs (or maximal vertex subsets in non-GGR graphs whose relative positions are fixed). And this algorithm works in any dimension. In the language of structural rigidity theory, our approach corresponds to calculating the approximate kernel of a generic stress matrix for the given graph and distance data. To make our algorithm suitable for real-world application, we present techniques for improving the robustness of the algorithm under noisy measurements, and a strategy for reducing the required number of measurements.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Efficient Coverage and Connectivity Preservation With Load Balance for Wireless Sensor Networks
TL;DR: A novel maximum connected load-balancing cover tree (MCLCT) algorithm to achieve full coverage as well as BS-connectivity of each sensing node by dynamically forming load-balanced routing cover trees and results show that the solution outperforms the existing ones in terms of energy efficiency and connectivity maintenance.
94
Localization Algorithm Based on Maximum a Posteriori in Wireless Sensor Networks
TL;DR: This algorithm uses the Baye's formula to deduce the probability density of each sensor node's distribution in the target region from RSSI values and outperforms the least-squares trilateration with respect to the average localization error.
34
Localization in Wireless Sensor Networks Using Rigid Graphs: A Review
Shamantha Rai,Shirshu Varma +1 more
TL;DR: This paper will scrutinize the sound theoretical background which defines the need of rigid graph based localization and different localization techniques, with associated algorithms which uses the concepts of rigid graphs.
18
Formation Control of Swarm Robots with Multiple Proximity Distance Sensors
TL;DR: This study designs a two-part motion controller that controls both position and attitude for continuous detection of other robots through the narrow detection angles of position sensitive detector proximity distance sensors based on light-emitting diodes (LEDs).
17
Translational velocity consensus using distance-only measurements
Bomin Jiang,Mohammad Deghat,Brian D. O. Anderson +2 more
- 01 Dec 2013
TL;DR: This paper proposes a strategy to achieve translational velocity consensus in a multi-agent formation using distance-only measurements, and postulates that agents engage in a combination of circular motion and linear motion.
13
References
Semidefinite programming
Lieven Vandenberghe,Stephen Boyd +1 more
- 01 Mar 1996
TL;DR: A survey of the theory and applications of semidefinite programs and an introduction to primaldual interior-point methods for their solution are given.
4.4K
A generalized solution of the orthogonal procrustes problem
TL;DR: In this paper, a solution for the least square problem with respect to matrices of less than full column rank is presented. But this solution is applicable to only matrices A and B and is not applicable to all matrices.
2.2K
DV Based Positioning in Ad Hoc Networks
Dragos Niculescu,Badri Nath +1 more
TL;DR: This work is proposing APS – a localized, distributed, hop by hop positioning algorithm, that works as an extension of both distance vector routing and GPS positioning in order to provide approximate position for all nodes in a network where only a limited fraction of nodes have self positioning capability.
Convex position estimation in wireless sensor networks
Lance Doherty,Kristofer S. J. Pister,L. El Ghaoui +2 more
- 22 Apr 2001
TL;DR: A method for estimating unknown node positions in a sensor network based exclusively on connectivity-induced constraints is described, and a method for placing rectangular bounds around the possible positions for all unknown nodes in the network is given.
Localization from mere connectivity
Yi Shang,Wheeler Ruml,Ying Zhang,Markus P. J. Fromherz +3 more
- 01 Jun 2003
TL;DR: An algorithm that uses connectivity information who is within communications range of whom to derive the locations of the nodes in the network is presented, based on multidimensional scaling, a data analysis technique that takes O(n3) time for a network of n nodes.