By Topic

Improved average consensus scalable algorithm of target tracking for wireless sensor network

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Hui Long ; Sch. of Inf. Sci. & Eng., Central South Univ., Changsha, China ; Zhihua Qu ; Xiaoping Fan ; Shaoqiang Liu

Target tracking is one of the most important applications for wireless sensor networks. In this paper, a scalable dynamical average consensus algorithm of target tracking is proposed. Kalman prediction is employed to help setting tracking cluster through nearest neighbor criterion. Selected sensors, called Tasking sensor nodes, are working locally for target estimate through observation or innovation based consensus distributed kalman filter. In the algorithm, Cluster head is not fusion center, but a ordinary node for choose tasking sensor of next step and forwards current state estimate and corresponding error covariance. Each tasking sensor only requires information from neighboring nodes that will decrease communication bandwidth of overall network. Simulation results show that, compared with central kalman filter algorithm, observation and innovation based consensus distributed kalman filter will get comparable accuracy while it will be more robust due to distributed manner.

Published in:

Control and Decision Conference (CCDC), 2012 24th Chinese

Date of Conference:

23-25 May 2012