Please use this identifier to cite or link to this item: http://bura.brunel.ac.uk/handle/2438/30656
Full metadata record
DC FieldValueLanguage
dc.contributor.authorZou, L-
dc.contributor.authorWang, Z-
dc.contributor.authorShen, B-
dc.contributor.authorDong, H-
dc.date.accessioned2025-02-03T20:24:12Z-
dc.date.available2025-02-03T20:24:12Z-
dc.date.issued2025-01-31-
dc.identifierORCiD: Lei Zou https://orcid.org/0000-0002-0409-7941-
dc.identifierORCiD: Zidong Wang https://orcid.org/0000-0002-9576-7401-
dc.identifier112159-
dc.identifier.citationZou, L. et al. (2025) 'Recursive state estimation in relay channels with enhanced security against eavesdropping: An innovative encryption–decryption framework', Automatica, 174, 112159, pp. 1 - 11. doi: 10.1016/j.automatica.2025.112159.en_US
dc.identifier.issn0005-1098-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/30656-
dc.description.abstractIn this paper, the problem of secure recursive state estimation is addressed for a networked linear system over a relay channel. We consider the scenario where the transmitted signals and the internal state of the relay node might be intercepted by potential eavesdroppers. To prevent the system states from being inferred by potential eavesdroppers via overheard measurement signals, an encryption–decryption mechanism is adopted to protect the transmitted measurement signals over the communication links. Furthermore, for the purpose of preserving data privacy during the relaying process, a decryption-free relaying protocol is constructed, where a matrix-inequality-based method is proposed for the design of the desired parameters for the relaying protocol. Following this, a recursive state estimator is developed to generate state estimates through a set of recursions. Sufficient conditions are then derived to ensure the ultimate boundedness of the resultant estimation error variance matrix. Finally, the effectiveness of the proposed secure recursive state estimation scheme is demonstrated through a simulation example.en_US
dc.description.sponsorshipThis work was supported in part by the National Natural Science Foundation of China under Grants 62273087, 61933007, 62273088 and U21A2019, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany.en_US
dc.format.extent1 - 11-
dc.languageEnglish-
dc.language.isoen_USen_US
dc.publisherElsevieren_US
dc.rightsAttribution-NonCommercial-NoDerivatives 4.0 International-
dc.rights.urihttps://creativecommons.org/licenses/by-nc-nd/4.0/-
dc.subjectrecursive state estimationen_US
dc.subjectsecure estimationen_US
dc.subjectrelay-aided communicationen_US
dc.subjectencryption–decryption schemeen_US
dc.subjectanti-eavesdroppingen_US
dc.subjectultimate boundednessen_US
dc.titleRecursive state estimation in relay channels with enhanced security against eavesdropping: An innovative encryption–decryption frameworken_US
dc.typeArticleen_US
dc.identifier.doihttps://doi.org/10.1016/j.automatica.2025.112159-
dc.relation.isPartOfAutomatica-
pubs.publication-statusPublished-
pubs.volume174-
dc.identifier.eissn1873-2836-
dc.rights.licensehttps://creativecommons.org/licenses/by-nc-nd/4.0/legalcode.en-
dcterms.dateAccepted2024-12-07-
dc.rights.holderElsevier Ltd.-
Appears in Collections:Dept of Computer Science Embargoed Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfEmbargoed until 31 January 2026. Copyright © 2025 Elsevier Ltd. All rights reserved. This manuscript version is made available under the CC-BY-NC-ND 4.0 license https://creativecommons.org/licenses/by-nc-nd/4.0/ (see: https://www.elsevier.com/about/policies/sharing).331.94 kBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons