An Improved Wireless Location Algorithm Based on Chaos Optimization Algorithm

被引：0

作者：

Luo, Junyou ^{[1
]}

Zhao, Junhui ^{[1
]}

机构：

[1] Macao Univ Sci & Technol, Fac Informat Technol, Res Lab 3G, Macao, Peoples R China

来源：

2007 INTERNATIONAL CONFERENCE ON WIRELESS COMMUNICATIONS, NETWORKING AND MOBILE COMPUTING, VOLS 1-15 | 2007年

关键词：

wireless location; NLOS; COA;

D O I：

10.1109/WICOM.2007.228

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

Chaos optimization algorithm (COA) can get the global optimization as ergodicity merit in chaos orbit. We improve the chaos optimization algorithm (ICOA) for wireless location,which is designed to get the initial value for the Taylor location algorithm. Considering the convergence problem in Taylor algorithm and the statistical property of chaotic sequence of Logistic Mapping and Kent Mapping, an improved hybrid Kent-Logistic mapping model is developed and applied for location. As MS is very close to the serving BS, the MS location can be realized directly by Kent-Logistic model. The performance of the algorithm shows better accuracy than the conventional approaches based on TDOA.

引用

页码：885 / 889

页数：5

共 13 条

[1] [Anonymous], 1999, Wireless Communications and Networking Conference
[2] GENERATING RANDOMNESS FROM CHAOS AND CONSTRUCTING CHAOS WITH DESIRED RANDOMNESS
CHUA, LO
YAO, Y
YANG, Q
[J]. INTERNATIONAL JOURNAL OF CIRCUIT THEORY AND APPLICATIONS, 1990, 18 (03) : 215 - 240
[3] GREENSTEIN LJ, 1997, IEEE T VT, V46, P177
[4] HASHEMI H, 1991, IEEE 41 VEH TECHN C, P675
[5] JAMES JC, 1999, WIRELESS LOCATION CD
[6] Kay SM, 2006, FUNDAMENTALS STAT SI
[7] Li Bing, 1997, Control Theory & Applications, V14, P613
[8] New optimization algorithm based on chaos
Lu H.-J.
Zhang H.-M.
Ma L.-H.
[J]. J Zhejiang Univ: Sci, 2006, 4 (539-542): : 539 - 542
[9] SILVENTOINEN MI, 1996, MOBILE STATION EMERG, P232
[10] Adaptive annealing for chaotic optimization
Tokuda, I
Aihara, K
Nagashima, T
[J]. PHYSICAL REVIEW E, 1998, 58 (04): : 5157 - 5160

← 1 2 →