Localization for Anchoritic Sensor Networks

  title={Localization for Anchoritic Sensor Networks},
  author={Yuliy M. Baryshnikov and Jian Tan},
We introduce a class of anchoritic sensor networks, where communications between sensor nodes are undesirable or infeasible due to, e.g., harsh environments, energy constraints, or security considerations. Instead, we assume that the sensors buffer the measurements over the lifetime and report them directly to a sink without necessarily requiring communications. Upon retrieval of the reports, all sensor data measurements will be available to a central entity for post processing. Our… 

Figures and Topics from this paper

Passive Localization: Large Size Sensor Network Localization Based on Environmental Events
  • YoungMin Kwon, G. Agha
  • Computer Science
    2008 International Conference on Information Processing in Sensor Networks (ipsn 2008)
  • 2008
Simulation results suggest that the algorithm can provide a high degree of accuracy when many events are recorded, and it is suggested that it is also effective for large and sparse sensor networks.
Distributed localization and clustering using data correlation and the Occam's razor principle
This work shows how one can use sensor measurements to refine the set of possible sensor locations, to group the sensors into clusters with linearly correlated measurements, and to decide which sensors may suspend transmission without jeopardizing the consistency of the collected data.
Distributed Online Self-Localization and Tracking in Sensor Networks
Recursive maximum likelihood (RML) and expectation maximization (EM) are a popular methodologies for estimating unknown static parameters in state-space models. We describe how a completely
Distributed Maximum Likelihood for Simultaneous Self-Localization and Tracking in Sensor Networks
We show that the sensor self-localization problem can be cast as a static parameter estimation problem for Hidden Markov Models and we implement fully decentralized versions of the Recursive Maximum
Topological Localization Via Signals of Opportunity
This work considers problems of localization, disambiguation, and mapping in a domain filled with signals-of-opportunity generated by transmitters, and develops tools that demonstrate the feasibility of these ideas in practice.
Sequential decision making in general state space models
Many problems in control and signal processing can be formulated as sequential decision problems for general state space models. However, except for some simple models one cannot obtain analytical


Poster abstract: anchor-free distributed localization in sensor networks
It is shown that large networks of location-aware sensors can be made cooperatively self-configuring, that is, that each sensor can run an algorithm locally, interacting only with neighboring nodes, such that after a number of iterations all sensors will have reached a consensus about their coordinates in some coordinate system.
A high-accuracy, low-cost localization system for wireless sensor networks
This paper formally describes, design, implement and evaluates a novel localization system, called Spotlight, which uses the spatio-temporal properties of well controlled events in the network, to obtain the locations of sensor nodes.
GPS-less low-cost outdoor localization for very small devices
This work reviews localization techniques and evaluates the effectiveness of a very simple connectivity metric method for localization in outdoor environments that makes use of the inherent RF communications capabilities of these devices.
Location in distributed ad-hoc wireless sensor networks
  • Chris Savarese, J. Rabaey, J. 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.
Evolving networks of ad-hoc, wireless sensing nodes rely heavily on the ability to establish position information. The algorithms presented herein rely on range measurements between pairs of nodes
Range-free localization schemes for large scale sensor networks
This paper presents APIT, a novel localization algorithm that is range-free, and shows that the APIT scheme performs best when an irregular radio pattern and random node placement are considered, and low communication overhead is desired.
Locating tiny sensors in time and space: a case study
This paper describes a system based on COTS components that incorporates the novel time synchronization and acoustic ranging techniques and is a low-cost, readily available platform for distributed, coherent signal processing.
Localization from mere connectivity
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.
Using proximity and quantized RSS for sensor localization in wireless networks
The Cramér-Rao bound (CRB) is used to compare the minimal attainable variances of unbiased sensor location estimators for the cases of RSS and proximity measurements and results are presented which show how many bits of quantization are necessary for a QRSS-based system to nearly achieve the bounds of an unquantized RSS system.
Convex position estimation in wireless sensor networks
  • L. Doherty, K. Pister, L. El Ghaoui
  • Computer Science
    Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
  • 2001
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.