We use a few cookies

Essential cookies keep the library working. With your permission, we'd also like to use analytics to see what's useful and improve the experience. Read our Privacy Policy or Cookie Policy.

Skip to main content
Home/e-Resources/Computer Science & Information Technology/Encryption–decryption-based state estimation for nonlinear complex networks subject to coupled perturbation
PeriodicalsComputer Science & Information Technology

Encryption–decryption-based state estimation for nonlinear complex networks subject to coupled perturbation

Checking your access to this record.

Abstract & Overview

This paper discusses the encryption-decryption-based state estimation (EDBSE) issue for coupled perturbation complex networks (CPCNs) in the framework of the Kalman-type filtering scheme. A uniform distributed random variable is employed to characterize the coupled perturbation among different network units. A uniform-quantization-dependent encryption-decryption (UQDED) scheme is considered here to orchestrate the transmitted data. A novel EDBSE approach is developed such that the upper bounds of prediction error (PE) covariance (PEC) and estimation error (EE) covariance (EEC) can be derived by resolving Riccati-like difference equations and the estimation parameter (EP) is determined by minimizing the trace of the upper bound of EEC. Furthermore, a uniformly bounded condition is elaborated to evaluate the algorithm performance of EDBSE. Finally, an illustrative example is conducted to verify the validity of the introduced EDBSE method.

Cite this record

Peixia Gao, Chaoqing Jia, Aozhan Zhou (2024). Encryption–decryption-based state estimation for nonlinear complex networks subject to coupled perturbation. Systems Science & Control Engineering, 12(1). https://doi.org/10.1080/21642583.2024.2357796

Copy in another style

Gao, P., Jia, C., & Zhou, A. (2024). Encryption–decryption-based state estimation for nonlinear complex networks subject to coupled perturbation. Systems Science & Control Engineering, 12(1). https://doi.org/10.1080/21642583.2024.2357796
Author names are used as deposited, so check their order before you submit.

Metadata is harvested from open-access indexes and can be incomplete. Check a citation against the published version before relying on it — see our open access & attribution policy.