Bias-Constrained Optimal Fusion Filtering for Decentralized WSN With Correlated Noise Sources
- Authors
- Zhao, Shunyi; Shmaliy, Yuriy S.; Ahn, Choon Ki
- Issue Date
- 12월-2018
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Decentralized WSN; fusion filtering; correlated noise; unbiased FIR filter; Kalman filter; robustness
- Citation
- IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS, v.4, no.4, pp.727 - 735
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON SIGNAL AND INFORMATION PROCESSING OVER NETWORKS
- Volume
- 4
- Number
- 4
- Start Page
- 727
- End Page
- 735
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/71446
- DOI
- 10.1109/TSIPN.2018.2819079
- ISSN
- 2373-776X
- Abstract
- We propose and investigate a robust fusion optimal unbiased finite impulse response (FOUFIR) algorithm, which is composed of robust UFIR filters implemented in smart sensors and a bias-constrained optimal fusion filter (FF) implemented in a local node of a decentralized wireless sensor network (WSN). The algorithm is designed in discrete time-invariant state space for correlated sensor and node noise sources. To convert the model with correlated noise sources to that without the correlation, the method of indefinite coefficient is used. Assuming that the estimates are delivered to a node with no delay and missing data, a bias-constrained optimal FF is designed employing the linear unbiased minimum variance approach. Simulations are provided for a node operating with 12 smart sensors. Experimental verification is given for a WSN composed with 8 sensors of temperature and humidity. It is shown that the FOUFIR algorithm has better robustness against errors in the noise statistics and model uncertainties than the existing fusion and decentralized Kalman filtering algorithms.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.