Search: onr:"swepub:oai:DiVA.org:kth-318016" >
Secured Filters Bas...
-
He, XingkangKTH,Reglerteknik
(author)
Secured Filters Based on Saturated Innovations
- Article/chapterEnglish2022
Publisher, publication year, extent ...
-
2022-01-22
-
Cham :Springer Nature,2022
-
printrdacarrier
Numbers
-
LIBRIS-ID:oai:DiVA.org:kth-318016
-
https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-318016URI
-
https://doi.org/10.1007/978-3-030-83236-0_1DOI
Supplementary language notes
-
Language:English
-
Summary in:English
Part of subdatabase
Classification
-
Subject category:vet swepub-contenttype
-
Subject category:kap swepub-publicationtype
Notes
-
QC 20220916Part of book: ISBN 978-3030832353
-
In this chapter, we study how to design secure centralized and distributed filters for linear time-invariant systems with bounded noise under false data injection attacks in sensor networks. An adversary is able to compromise a subset of sensors and manipulate the measurements arbitrarily. We provide two motivating examples for this problem setup from smart buildings and autonomous vehicles. Then we design a centralized filter based on a saturation method, which gives a small gain if the innovation is large enough, indicating the high likelihood of compromised measurements. The estimation error of the secure centralized filter is proved to be asymptotically upper-bounded. Moreover, a secure two-time-scale distributed filter is obtained by modifying the centralized filter and employing an estimate consensus approach. Boundedness of the estimation error of the distributed filter is proved. Numerical simulations are provided in the end to show the usefulness of the two filters.
Subject headings and genre
Added entries (persons, corporate bodies, meetings, titles ...)
-
Ren, X.
(author)
-
Sandberg, HenrikKTH,Reglerteknik(Swepub:kth)u1i9irki
(author)
-
Johansson, Karl H.,1967-KTH,Reglerteknik(Swepub:kth)u1h0d9k2
(author)
-
KTHReglerteknik
(creator_code:org_t)
Related titles
-
In:Security and Resilience of Control SystemsCham : Springer Nature, s. 3-29
Internet link
Find in a library
To the university's database