Target tracking in wireless sensor networks using compressed Kalman filter
by Jianyong Lin, Lihua Xie, Wendong Xiao
International Journal of Sensor Networks (IJSNET), Vol. 6, No. 3/4, 2009

Abstract: Sensor nodes in Wireless Sensor Network (WSN) need to communicate with other sensor nodes and/or a fusion centre in order to accomplish target tracking task. The limited onboard energy and wireless bandwidth are critical issues in many WSNs. In this paper, we propose a Compressed Kalman Filtering (CKF) algorithm to reduce the totality of transmitted data, hence the total energy consumption as well as the wireless bandwidth. Based on the well-known Kalman Filtering (KF) algorithm, the proposed method introduces an additional operation which replaces the state error covariance matrix in the KF algorithm by a diagonal matrix. This diagonal matrix is chosen to be an upper bound of the original covariance matrix to prevent the divergence of the proposed algorithm. A suboptimal solution is derived for general case, i.e. for a system with arbitrary dimension. The derived suboptimal solution does not require much more computation than the standard KF and can be easily implemented in cheap simple sensor nodes. Better solutions are derived for the cases where target is travelling in either 1D space or 2D space. Simulation results show that our proposed algorithm can improve energy efficiency significantly with comparable tracking performance, as compared to the original KF algorithm.

Online publication date: Sun, 29-Nov-2009

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email