2006
DOI: 10.1109/tvt.2005.861207
|View full text |Cite
|
Sign up to set email alerts
|

Time-of-Arrival Based Localization Under NLOS Conditions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
207
0
1

Year Published

2006
2006
2016
2016

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 425 publications
(209 citation statements)
references
References 19 publications
0
207
0
1
Order By: Relevance
“…This algorithm is similar to a weighted nonlinear LS approach when measurement errors are zero-mean Gaussian distributed (Chan et al, 2006a). Li et al (2014) improved on an algorithm published by Chan et al (2006b) using an efficient approximate ML algorithm that included coupling with bad-measurement filters for 3D source localization.…”
Section: A Toa and Tdoa-based Algorithms With Losmentioning
confidence: 99%
See 1 more Smart Citation
“…This algorithm is similar to a weighted nonlinear LS approach when measurement errors are zero-mean Gaussian distributed (Chan et al, 2006a). Li et al (2014) improved on an algorithm published by Chan et al (2006b) using an efficient approximate ML algorithm that included coupling with bad-measurement filters for 3D source localization.…”
Section: A Toa and Tdoa-based Algorithms With Losmentioning
confidence: 99%
“…Güvenç and Chong (2009) presented an overview of different TOA NLOS localization algorithms with varying levels of computational complexity and prior information. Early researchers considered treatment methods that identify the NLOS sensors in an array using TOA measurements, then estimate the location of the source Insensitive to geometry, thus it is superior to Chan and Ho (1994) and Caffery (2000) Gives an exact ML estimate when three sensors on a straight line without using the NLOS sensors, or reduce the error in position estimates by weighting the NLOS less (Wylie and Holtzman, 1996;Chen, 1999;and Chan et al, 2006b). This approach is effective when a small number of the distributed sensors are NLOS, but become computationally intensive when there are many distributed sensors and may not be possible in situations where the signal source is moving.…”
Section: B Algorithms Dealing With Specific Scenariosmentioning
confidence: 99%
“…It was motivated by the requirement put forth by Federal Communications Commission (FCC) to cellular operators to be able to locate a mobile handset within an accuracy of 300 meters for 95% of calls [13]. In current literature [14,15,16,17,18,19,20,21] there are three general methods to deal with NLOS readings. The first method attempts to identify and use only LOS measurements.…”
Section: Localization In Cluttered Underwater Environmentsmentioning
confidence: 99%
“…The first method attempts to identify and use only LOS measurements. Distinguishing NLOS from LOS distance measurements could either be done using a time-varying hypothesis test [14], a probabilistic model [18] or residual information [15,21]. The second method incorporates both LOS and NLOS distance measurements with appropriate weighting to minimize the contribution of NLOS observations.…”
Section: Localization In Cluttered Underwater Environmentsmentioning
confidence: 99%
“…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%