Bounds on minimum number of anchors for iterative localization and its connections to bootstrap percolation

@article{Vaze2012BoundsOM,
  title={Bounds on minimum number of anchors for iterative localization and its connections to bootstrap percolation},
  author={Rahul Vaze and Piyush Kumar Gupta},
  journal={2012 International Conference on Signal Processing and Communications (SPCOM)},
  year={2012},
  pages={1-5}
}
  • R. VazeP. Gupta
  • Published 22 May 2012
  • Computer Science
  • 2012 International Conference on Signal Processing and Communications (SPCOM)
Iterated localization is considered where each node of a network needs to get localized (find its location on 2-D plane), when initially only a subset of nodes have their location information. The iterated localization process proceeds as follows. Starting with a subset of nodes that have their location information, possibly using global positioning system (GPS) devices, any other node gets localized if it has three or more localized nodes in its radio range. The newly localized nodes are… 

Figures from this paper

Propagation controlled cooperative positioning in wireless networks using bootstrap percolation

A novel linear least square (LLS) estimator is obtained for the localization of agent nodes using the idea of bootstrap percolation to control the information propagation for efficient cooperative positioning in wireless networks.

Gaussian Message Passing-Based Cooperative Localisation with Bootstrap Percolation Scheme in Dense Networks

A bootstrap percolation scheme is introduced into Gaussian message passing-based cooperative localisation for precise positioning, aimed at reducing the system overhead and reducing the computational complexity.

Prioritized Mobile Robot Exploration Based on Percolation Enhanced Entropy Based Fast SLAM

A novel percolation guidance that collaborates with entropy based SLAM under a switching control setting the priority to either position or map accuracy so that the active SLAM becomes speedy, with high coverage rate of the area as well as increased accuracy in localization.

Prioritized Mobile Robot Exploration Based on Percolation Enhanced Entropy Based Fast SLAM

A novel percolation guidance that collaborates with entropy based SLAM under a switching control setting the priority to either position or map accuracy so that the active SLAM becomes speedy, with high coverage rate of the area as well as increased accuracy in localization.

Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks

The analytical and numerical results provided demonstrate the superiority of the space-time hierarchical-graph based cooperative localization scheme over the benchmarking schemes considered.

References

SHOWING 1-10 OF 16 REFERENCES

Anchor-Free Distributed Localization in Sensor Networks

A fully decentralized algorithm called AFL (Anchor-Free Localization) where nodes start from a random initial coordinate assignment and converge to a consistent solution using only local node interactions, which is superior to previously proposed methods that incrementally compute the coordinates of nodes in the network.

Mobile-assisted localization in wireless sensor networks

MAL, a mobile-assisted localization method which employs a mobile user to assist in measuring distances between node pairs until these distance constraints form a "globally rigid'* structure that guarantees a unique localization, is described.

Robust distributed network localization with noisy range measurements

A distributed, linear-time algorithm for localizing sensor network nodes in the presence of range measurement noise is described and the probabilistic notion of robust quadrilaterals is introduced as a way to avoid flip ambiguities that otherwise corrupt localization computations.

Location in distributed ad-hoc wireless sensor networks

  • Chris SavareseJ. RabaeyJ. Beutel
  • Computer Science
    2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221)
  • 2001
The algorithms presented herein rely on range measurements between pairs of nodes and the a priori coordinates of sparsely located anchor nodes to establish confident position estimates through assumptions, checks, and iterative refinements.

A Theory of Network Localization

This paper constructs grounded graphs to model network localization and applies graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks, and further study the computational complexity of network localization.

BOOTSTRAP PERCOLATION ON RANDOM GEOMETRIC GRAPHS

Random geometric graphs provide an appropriate model in settings where the neighborhood structure of each node is determined by geographical distance, as in wireless ad hoc and sensor networks as well as in contagion.

Sequential Localization of Sensor Networks

A provably correct algorithm is given which consists of solving a sequence of quadratic equations, and it is shown that the algorithm can localize any localizable network in the plane whose graph has a bilateration ordering.

Rigidity, computation, and randomization in network localization

We provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their

Sharp metastability threshold for two-dimensional bootstrap percolation

Abstract. In the bootstrap percolation model, sites in an L by L square are initially independently declared active with probability p. At each time step, an inactive site becomes active if at least

Majority bootstrap percolation on the random graph G(n,p)

Majority bootstrap percolation on the random graph $G_{n,p}$ is a process of spread of "activation" on a given realisation of the graph with a given number of initially active nodes. At each step