Positioning algorithms for cooperative networks in the presence of an unknown turn-around time
Date
2011Source Title
2011 IEEE 12th International Workshop on Signal Processing Advances in Wireless Communications
Publisher
IEEE
Pages
166 - 170
Language
English
Type
Conference PaperItem Usage Stats
184
views
views
253
downloads
downloads
Abstract
This paper addresses the problem of single node positioning in cooperative network using hybrid two-way time-of-arrival and time-difference-of-arrival where, the turn-around time at the target node is unknown. Considering the turn-around time as a nuisance parameter, the derived maximum likelihood estimator (MLE) brings a difficult global optimization problem due to local minima in the cost function of the MLE. To avoid drawbacks in solving the MLE, we obtain a linear two-step estimator using non-linear pre-processing which is algebraic and closed-form in each step. To compare different methods, Cramér-Rao lower bound (CRLB) is derived. Simulation results confirm that the proposed linear estimator attains the CRLB for sufficiently high signal-to-noise ratios. © 2011 IEEE.
Keywords
Cooperative positioningGlobal optimization problems
High signal-to-noise ratio
Linear estimators
Local minimums
Lower bounds
Maximum likelihood estimator
Non-linear
Nuisance parameter
Positioning algorithms
Pre-processing
Simulation result
Target nodes
Time-difference-of-arrival
Time-of-arrival
Estimation
Fading (radio)
Global optimization
Maximum likelihood estimation
Signal processing
Signal to noise ratio
Wireless telecommunication systems
Wireless sensor networks