A Self-organizing Bearings-only Target Tracking Algorithm in Wireless Sensor Network  

作　　者：Xu Zhen Rui Liyang 

机构地区：[1]School of Electronics and Information Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

出　　处：《Chinese Journal of Aeronautics》2009年第6期627-636,共10页中国航空学报（英文版）

基　　金：National Natural Science Foundation of China （60532030）; National Science Fund for Distinguished Young Scholars （60625102）; Ph.D. Programs Foundation of Ministry of Education of China （200802240）

摘　　要：In the bearings-only target tracking, wireless sensor network （WSN） collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoffbetween locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot.In the bearings-only target tracking, wireless sensor network （WSN） collects observations of the target direction at various nodes and uses an adaptive filter to combine them for target tracking. An efficient network management is necessary to gain an optimal tradeoffbetween locating accuracy and energy consumption. This article proposes a self-organizing target tracking algorithm to select the most beneficial subset of nodes to track the target at every snapshot. Compared with traditional methods, this scheme avoids the need for keeping global position information of the network as in greedy selection. Each node judges its future usefulness depending on the knowledge of its own position and using simple mathematics computation. Simulations indicate that this scheme has locating accuracy comparable to the global greedy algorithm. Also, it has good robustness against node failure and autonomous adaptability to the change of the network scale. Furthermore, this algorithm consumes limited energy because only a portion of nodes partakes in the selection at every snapshot.

关 键 词：direction of arrival Kalman filtering TRACKING wireless sensor network 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术] TP212[自动化与计算机技术—计算机科学与技术]