Abstract

For wireless sensor network (WSN), localization and tracking of targets are implemented extensively by means of traditional tracking algorithms like classical least-square (CLS) algorithm, extended Kalman filter (EKF) and the Bayesian algorithm. For the purpose of tracking and moving target localization of WSN, this paper proposes an improved Bayesian algorithm that combines the principles of least-square algorithm. For forming a matrix of range joint probability and using target predictive location of obtaining a sub-range probability set, an improved Bayesian algorithm is implemented. During the dormant state of the WSN testbed, an automatic update of the range joint probability matrix occurs. Further, the range probability matrix is used for the calculation and normalization of the weight of every individual measurement. Lastly, based on the weighted least-square algorithm, calculation of the target prediction position and its correction value is performed. The accuracy of positioning of the proposed algorithm is improved when compared to variational Bayes expectation maximization (VBEM), dual-factor enhanced VBAKF (EVBAKF), variational Bayesian adaptive Kalman filtering (VBAKF), the fingerprint Kalman filter (FKF), the position Kalman filter (PKF), the weighted K-nearest neighbor (WKNN) and the EKF algorithms with the values of 0.5%, 7%, 14%, 19%, 33% and 35% respectively. Along with this, when compared to Bayesian algorithm, the computation burden is reduced by the proposed algorithm by a factor of over 80%.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call