Home/EURASIP Journal on Advances in Signal Processing/Article Record
Peer-Reviewed Article May 2, 2006

Cramér-Rao-Type Bounds for Localization

Are you an author of this work?Link to your sovereign AfriScholar profile
Published in: EURASIP Journal on Advances in Signal Processing
Publisher: Springer Science+Business Media • Egypt • 1110-8657
DOI: https://doi.org/10.1155/asp/2006/94287

Abstract

The localization problem is fundamentally important for sensor networks. This paper, based on "Estimation bounds for localization" by the authors (2004 © IEEE), studies the Cramér-Rao lower bound (CRB) for two kinds of localization based on noisy range measurements. The first is anchored localization in which the estimated positions of at least nodes are known in global coordinates. We show some basic invariances of the CRB in this case and derive lower and upper bounds on the CRB which can be computed using only local information. The second is anchor-free localization where no absolute positions are known. Although the Fisher information matrix is singular, a CRB-like bound exists on the total estimation variance. Finally, for both cases we discuss how the bounds scale to large networks under different models of wireless signal propagation.

Download Full Text PDFView at PublisherCrossref RecordCrossref XML

Verified Citation Velocity

Recorded scholarly citations in African and international peer-reviewed literature

74
Total Citations

Citations are continuously tracked and harvested across continental OJS endpoints and OpenAlex feeds.