By Topic

A Fast Data Fusion Algorithm Based on Matrix Analysis for Target Recognition in Sensor Networks

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)
Li Quanlong ; Sch. of Comput. Sci. & Eng., Harbin Inst. of Technol., Harbin, China ; Xu Xiaofei ; Yan Qingjun ; Wang Zhaobo

Data fusion always be used to solve the problem of target recognition in wireless sensor networks, and Dempster-Shafer inference have been proven one of effective methods. However, the high computation complexity of D-S evidence combination usually prevent it to be used in low ability sensor networks directly, especially it may violate the requirements for real-time processing and synchronization of sensor networks. To increase the speed of target recognition in wireless sensor networks, a fast data fusion algorithm based on matrix analysis is proposed in this paper, which inherits the idea of D-S evidence theory. The algorithm holds the same recognition capability as D-S evidence combination formula, but reduces time complexity. This conclusion has been confirmed by simulation.

Published in:

Pervasive Computing Signal Processing and Applications (PCSPA), 2010 First International Conference on

Date of Conference:

17-19 Sept. 2010