Recursive Privacy-Preserving Estimation Over Markov Fading Channels
원문 초록
In industrial applications, the presence of moving machinery, vehicles, and personnel, contributes to the dynamic nature of the wireless channel. This time variability induces channel fading, which can be effectively modeled using a Markov fading channel (MFC). In this paper, we investigate the problem of secure state estimation for systems that communicate over a MFC in the presence of an eavesdropper. The objective is to enable a remote authorized user to accurately estimate the states of a dynamic system, while considering the potential interception of the sensor's packet through a wiretap channel. To prevent information leakage, a novel co-design strategy is established, which combines a privacy-preserving mechanism with a state estimator. To implement our encoding scheme, a nonlinear mapping of the innovation is introduced based on the weighted reconstructed innovation previously received by the legitimate user. Corresponding to this encoding scheme, we design a recursive privacy-preserving filtering algorithm to achieve accurate estimation. The boundedness of estimation error dynamics at the legitimate user's side is discussed and the divergence of the eavesdropper's estimation error is analyzed, which demonstrates the effectiveness of our co-design strategy in ensuring secrecy. Furthermore, a simulation example of a three-tank system is provided to demonstrate the effectiveness and feasibility of our privacy-preserving estimation method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Privacy-Preserving Fusion for Multi-Sensor Systems Under Multiple Packet Dropouts
Differentially Private Federated Low Rank Adaptation Beyond Fixed-Matrix
Domain Borders Are There to Be Crossed With Federated Few-Shot Adaptation
Geo-ORBIT: A Federated Digital Twin Framework for Scene-Adaptive Lane Geometry Detection
S2FGL: Spatial Spectral Federated Graph Learning
FedSC: Federated Learning with Semantic-Aware Collaboration
토론
이 논문과 연결된 포럼 글이 아직 없습니다.