pith. sign in

arxiv: 1304.6237 · v1 · pith:OZ2VLSKKnew · submitted 2013-04-23 · 🧮 math.ST · cs.IT· cs.NI· math.IT· stat.TH

Self-Localization of Asynchronous Wireless Nodes With Parameter Uncertainties

classification 🧮 math.ST cs.ITcs.NImath.ITstat.TH
keywords nodesanchorboundinvestigatelocalizationmethodpositionssequence
0
0 comments X
read the original abstract

We investigate a wireless network localization scenario in which the need for synchronized nodes is avoided. It consists of a set of fixed anchor nodes transmitting according to a given sequence and a self-localizing receiver node. The setup can accommodate additional nodes with unknown positions participating in the sequence. We propose a localization method which is robust with respect to uncertainty of the anchor positions and other system parameters. Further, we investigate the Cram\'er-Rao bound for the considered problem and show through numerical simulations that the proposed method attains the bound.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.