Browsing by Subject "Positioning algorithms"

Now showing 1 - 2 of 2

Open Access
Hybrid TW-TOA/TDOA positioning algorithms for cooperative wireless networks
(IEEE, 2011) Gholami, M.R.; Gezici, Sinan; Ström, E.G.; Rydström, M.
The problem of positioning an unknown target is studied for a cooperative wireless sensor network using hybrid two-way time-of-arrival and time-difference-of-arrival measurements. A maximum likelihood estimator (MLE) can be employed to solve the problem. Due to the non-linear nature of the cost function in the MLE, a numerical method, e.g., an iterative search algorithm with a good initial point, should be taken to accurately estimate the target. To avoid drawbacks in a numerical method, we instead linearize the measurements and obtain a new two-step estimator that has a closed-form solution in each step. Simulation results confirm that the proposed linear estimator can attain Cramer-Rao lower bound for sufficiently high SNR. © 2011 IEEE.
Open Access
Positioning algorithms for cooperative networks in the presence of an unknown turn-around time
(IEEE, 2011) Gholami, M.R.; Gezici, Sinan; Ström, E.G.; Rydström, M.
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.