2004
DOI: 10.1109/tsp.2004.823465
|View full text |Cite
|
Sign up to set email alerts
|

Least Squares Algorithms for Time-of-Arrival-Based Mobile Location

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

1
247
0
5

Year Published

2008
2008
2018
2018

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 477 publications
(260 citation statements)
references
References 18 publications
1
247
0
5
Order By: Relevance
“…For simplicity, we assume line-of-sight propagation between the source and all sensors such that each n i is a zero-mean white process with known variance σ 2 i [14].…”
Section: Best Linear Unbiased Estimator Based Positioningmentioning
confidence: 99%
See 3 more Smart Citations
“…For simplicity, we assume line-of-sight propagation between the source and all sensors such that each n i is a zero-mean white process with known variance σ 2 i [14].…”
Section: Best Linear Unbiased Estimator Based Positioningmentioning
confidence: 99%
“…It is worthy to mention that the same weighting matrix of C −1 p has been proposed in [14], which can be considered as a constrained weighted least squares calibration (CWLSC) algorithm with utilizing the constraint of x 2 + y 2 = R. We expect that the BLUE-LSC algorithm is inferior to the CWLSC scheme as the parameter relationship in θ is not exploited.…”
Section: Blue-lsc Algorithmmentioning
confidence: 99%
See 2 more Smart Citations
“…Many proposed localization methods and algorithms were based on the computation of the time of arrival (TOA) [5][6][7], time differences of arrival (TDOA) [8], direction of arrival (DOA) [9][10][11] and the received signal strength (RSS) [12,13]. Conventional methods based on these four measurements increase in error with multipath propagation because they require LoS conditions between the access points and the mobile stations.…”
Section: Introductionmentioning
confidence: 99%