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

Network-side mobile position location using factor graphs

Abstract: A low-complexity high-accuracy algorithm is proposed to estimate the location of a target MS based on networkside time-of-arrival (TOA) measurements. Under a factor graph framework, the proposed algorithm first constructs a graphical model for the mobile position location problem by dividing the problem into many mutually-interactive local constraints. Each local constraint is enforced by a separate local processing unit. Efficient exchange of soft-information among local processing units in the mobile switchi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
11
0

Year Published

2007
2007
2021
2021

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 46 publications
(11 citation statements)
references
References 13 publications
0
11
0
Order By: Relevance
“…Ref. [9] proposes a TOA-based FG technique which is basically the same as the technique shown in [10]. However, it takes into account that the measurement error of TOA is included in measured data of each sensor, in the process of the conversion of the parameters to the distance.…”
Section: Related Workmentioning
confidence: 99%
“…Ref. [9] proposes a TOA-based FG technique which is basically the same as the technique shown in [10]. However, it takes into account that the measurement error of TOA is included in measured data of each sensor, in the process of the conversion of the parameters to the distance.…”
Section: Related Workmentioning
confidence: 99%
“…In [5], a 'balancing' bias variable is introduced for simplification. Furthermore, given a good initial point and the Taylor series expansion technology [6,7], the highly nonlinear joint estimation problem of location and biases can be reduced to a linear least squares issue, which called TS-LQP. Although TS-LQP will result in some accuracy degradation than the sequential quadratic programming algorithm, TS-LQP has much less computation complexity.…”
Section: Related Work and Main Contributionsmentioning
confidence: 99%
“…, where m is a constant, and depended on applications. -Calculate correlation coefficient by (6) for each grid, and sort the coefficient vector.…”
Section: Framework Of the Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…Among all positioning algorithms, the FG-based technique is famous for the low computational complexity and high positioning accuracy [18]. Many FG positioning methods based on different measurement information have been developed in recent years.…”
Section: Introductionmentioning
confidence: 99%