• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Øvrige samlinger
  • Publikasjoner fra CRIStin - NTNU
  • Vis innførsel
  •   Hjem
  • Øvrige samlinger
  • Publikasjoner fra CRIStin - NTNU
  • Vis innførsel
JavaScript is disabled for your browser. Some features of this site may not work without it.

Securing the Distributed Kalman Filter Against Curious Agents

Moradi, Ashkan; Dasanadoddi Venkategowda, Naveen Kumar; Talebi, Sayedpouria; Werner, Stefan
Chapter
Accepted version
Thumbnail
Åpne
FUSION2021 (534.0Kb)
Permanent lenke
https://hdl.handle.net/11250/2988496
Utgivelsesdato
2021
Metadata
Vis full innførsel
Samlinger
  • Institutt for elektroniske systemer [1837]
  • Publikasjoner fra CRIStin - NTNU [26648]
Originalversjon
2021 IEEE 24th International Conference on Information Fusion (FUSION)   10.23919/FUSION49465.2021.9627034
Sammendrag
Distributed filtering techniques have emerged as the dominant and most prolific class of filters used in modern monitoring and surveillance applications, such as smart grids. As these techniques rely on information sharing among agents, user privacy and information security have become a focus of concern. In this manuscript, a privacy-preserving distributed Kalman filter (PP-DKF) is derived that maintains privacy by decomposing the information into public and private substates, where only a perturbed version of the public substate is shared among neighbors. The derived PP-DKF provides privacy by restricting the amount of information exchanged with state decomposition and conceals private information by injecting a carefully designed perturbation sequence. A thorough analysis is performed to characterize the privacy-accuracy trade-offs involved in the distributed filter, with privacy defined as the mean squared estimation error of the private information at the honest-but-curious agent. The resulting PP-DKF improves the overall filtering performance and privacy of all agents compared to distributed Kalman filters employing contemporary privacy-preserving average consensus techniques. Several simulation examples corroborate the theoretical results.
Utgiver
IEEE
Opphavsrett
© 2021 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit