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...
Main Authors: | Urruela Andreu, Rydström Mats, Strö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 |
Similar Items
-
Cramér-Rao-Type Bounds for Localization
by: Chang Cheng, et al.
Published: (2006-01-01) -
Statistical resolution limit for the multidimensional harmonic retrieval model: hypothesis test and Cramér-Rao Bound approaches
by: El Korso Mohammed, et al.
Published: (2011-01-01) -
A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks
by: Toyserkani ArashT, et al.
Published: (2009-01-01) -
Cramér-Rao Lower Bound in the Estimated Time of Arrival in a Rice Channel
by: René P. Játiva E., et al.
Published: (2012-06-01) -
A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks
by: Arash T. Toyserkani, et al.
Published: (2009-01-01)