Autonomous Positioning Techniques Based on Cramér-Rao Lower Bound Analysis

<p/> <p>We consider the problem of autonomously locating a number of asynchronous sensor nodes in a wireless network. A strong focus lies on reducing the processing resources needed to solve the relative positioning problem, an issue of great interest in resource-constrained wireless sen...

Full description

Bibliographic Details
Main Authors: Urruela Andreu, Rydstr&#246;m Mats, Str&#246;m Erik G, Svensson Arne
Format: Article
Language:English
Published: SpringerOpen 2006-01-01
Series:EURASIP Journal on Advances in Signal Processing
Online Access:http://dx.doi.org/10.1155/ASP/2006/93043
id doaj-5c6328619cc344afa1ed12f3a7cc1acb
record_format Article
spelling doaj-5c6328619cc344afa1ed12f3a7cc1acb2020-11-25T02:42:45ZengSpringerOpenEURASIP Journal on Advances in Signal Processing1687-61721687-61802006-01-0120061093043Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound AnalysisUrruela AndreuRydstr&#246;m MatsStr&#246;m Erik GSvensson Arne<p/> <p>We consider the problem of autonomously locating a number of asynchronous sensor nodes in a wireless network. A strong focus lies on reducing the processing resources needed to solve the relative positioning problem, an issue of great interest in resource-constrained wireless sensor networks. In the first part of the paper, based on a well-known derivation of the Cram&#233;r-Rao lower bound for the asynchronous sensor positioning problem, we are able to construct optimal preprocessing methods for sensor clock-offset cancellation. A cancellation of unknown clock-offsets from the asynchronous positioning problem reduces processing requirements, and, under certain reasonable assumptions, allows for statistically efficient distributed positioning algorithms. Cram&#233;r-Rao lower bound theory may also be used for estimating the performance of a positioning algorithm. In the second part of this paper, we exploit this property in developing a distributed algorithm, where the global positioning problem is solved suboptimally, using a divide-and-conquer approach of low complexity. The performance of this suboptimal algorithm is evaluated through computer simulation, and compared to previously published algorithms.</p> http://dx.doi.org/10.1155/ASP/2006/93043
collection DOAJ
language English
format Article
sources DOAJ
author Urruela Andreu
Rydstr&#246;m Mats
Str&#246;m Erik G
Svensson Arne
spellingShingle Urruela Andreu
Rydstr&#246;m Mats
Str&#246;m Erik G
Svensson Arne
Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound Analysis
EURASIP Journal on Advances in Signal Processing
author_facet Urruela Andreu
Rydstr&#246;m Mats
Str&#246;m Erik G
Svensson Arne
author_sort Urruela Andreu
title Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound Analysis
title_short Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound Analysis
title_full Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound Analysis
title_fullStr Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound Analysis
title_full_unstemmed Autonomous Positioning Techniques Based on Cram&#233;r-Rao Lower Bound Analysis
title_sort autonomous positioning techniques based on cram&#233;r-rao lower bound analysis
publisher SpringerOpen
series EURASIP Journal on Advances in Signal Processing
issn 1687-6172
1687-6180
publishDate 2006-01-01
description <p/> <p>We consider the problem of autonomously locating a number of asynchronous sensor nodes in a wireless network. A strong focus lies on reducing the processing resources needed to solve the relative positioning problem, an issue of great interest in resource-constrained wireless sensor networks. In the first part of the paper, based on a well-known derivation of the Cram&#233;r-Rao lower bound for the asynchronous sensor positioning problem, we are able to construct optimal preprocessing methods for sensor clock-offset cancellation. A cancellation of unknown clock-offsets from the asynchronous positioning problem reduces processing requirements, and, under certain reasonable assumptions, allows for statistically efficient distributed positioning algorithms. Cram&#233;r-Rao lower bound theory may also be used for estimating the performance of a positioning algorithm. In the second part of this paper, we exploit this property in developing a distributed algorithm, where the global positioning problem is solved suboptimally, using a divide-and-conquer approach of low complexity. The performance of this suboptimal algorithm is evaluated through computer simulation, and compared to previously published algorithms.</p>
url http://dx.doi.org/10.1155/ASP/2006/93043
work_keys_str_mv AT urruelaandreu autonomouspositioningtechniquesbasedoncram233rraolowerboundanalysis
AT rydstr246mmats autonomouspositioningtechniquesbasedoncram233rraolowerboundanalysis
AT str246merikg autonomouspositioningtechniquesbasedoncram233rraolowerboundanalysis
AT svenssonarne autonomouspositioningtechniquesbasedoncram233rraolowerboundanalysis
_version_ 1724771755458822144