2004
DOI: 10.1049/el:20045686
|View full text |Cite
|
Sign up to set email alerts
|

Algorithm for TOA-based indoor geolocation

Abstract: A new indoor geolocation algorithm based on time-of-arrival (TOA) range measurements in a wireless network is presented. The algorithm, referred to as closest neighbour with TOA grid (CN-TOAG), is described and its performance compared with traditional least-squares (LS) methods.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
6
0
2

Year Published

2006
2006
2017
2017

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 12 publications
(8 citation statements)
references
References 6 publications
0
6
0
2
Order By: Relevance
“…In [19] centralized localization techniques and distributed localization techniques such as approximate point in triangle, DV hop, multi hop, centroid and gradient techniques are reviewed. In [20] a localization objective function has been defined and a closed neighbor time of arrival grid algorithm has been introduced to minimize the objective function. In [21] another localization objective function has been defined and a Davidson least squares algorithm has been introduced to minimize the objective function.…”
Section: Related Workmentioning
confidence: 99%
“…In [19] centralized localization techniques and distributed localization techniques such as approximate point in triangle, DV hop, multi hop, centroid and gradient techniques are reviewed. In [20] a localization objective function has been defined and a closed neighbor time of arrival grid algorithm has been introduced to minimize the objective function. In [21] another localization objective function has been defined and a Davidson least squares algorithm has been introduced to minimize the objective function.…”
Section: Related Workmentioning
confidence: 99%
“…The algorithm derives an objective function f(P) based on network topology and decreasing the objective function with the known coordinates of the node k and the obtained delay estimate at the node k, the unknown coordinates of the tag can be estimated. We define an error function [6], where, N is the number of reference nodes, d k is the range measurement performed by k th reference node, and (X k ,Y k ,Zk) represents the location of the k th reference node in Cartesian co-ordinates. The true location of the mobile can then be obtained by finding the point (x, y, z) that minimizes e(x, y, ;).…”
Section: The Dfp Algorithmmentioning
confidence: 99%
“…As an illustration of the use of the MSE Profile, we investigate the performance of two algorithms using simulations: the Closest-Neighbor with TOA Grid (CN-TOAG)( [14], [15]), and the Davidon LS algorithm [16].…”
Section: Algorithmsmentioning
confidence: 99%
“…In essence, the CN-TOAG algorithm ( [15], [14]) estimates the location of the sensor S, by minimizing the following objective function:…”
Section: A Cn-toag Algorithmmentioning
confidence: 99%
See 1 more Smart Citation