Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.11606 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915341453492224 |
|---|---|
| author | Zhong, Yuxing Li, Yuzhe Quevedo, Daniel E. Shi, Ling |
| author_facet | Zhong, Yuxing Li, Yuzhe Quevedo, Daniel E. Shi, Ling |
| contents | This paper considers the optimal power allocation of a jamming attacker against remote state estimation. The attacker is self-sustainable and can harvest energy from the environment to launch attacks. The objective is to carefully allocate its attack power to maximize the estimation error at the fusion center. Regarding the attacker's knowledge of the system, two cases are discussed: (i) perfect channel knowledge and (ii) unknown channel model. For both cases, we formulate the problem as a Markov decision process (MDP) and prove the existence of an optimal deterministic and stationary policy. Moreover, for both cases, we develop algorithms to compute the allocation policy and demonstrate that the proposed algorithms for both cases converge to the optimal policy as time goes to infinity. Additionally, the optimal policy exhibits certain structural properties that can be leveraged to accelerate both algorithms. Numerical examples are given to illustrate the main results. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_11606 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Harvest and Jam: Optimal Self-Sustainable Jamming Attacks against Remote State Estimation Zhong, Yuxing Li, Yuzhe Quevedo, Daniel E. Shi, Ling Systems and Control This paper considers the optimal power allocation of a jamming attacker against remote state estimation. The attacker is self-sustainable and can harvest energy from the environment to launch attacks. The objective is to carefully allocate its attack power to maximize the estimation error at the fusion center. Regarding the attacker's knowledge of the system, two cases are discussed: (i) perfect channel knowledge and (ii) unknown channel model. For both cases, we formulate the problem as a Markov decision process (MDP) and prove the existence of an optimal deterministic and stationary policy. Moreover, for both cases, we develop algorithms to compute the allocation policy and demonstrate that the proposed algorithms for both cases converge to the optimal policy as time goes to infinity. Additionally, the optimal policy exhibits certain structural properties that can be leveraged to accelerate both algorithms. Numerical examples are given to illustrate the main results. |
| title | Harvest and Jam: Optimal Self-Sustainable Jamming Attacks against Remote State Estimation |
| topic | Systems and Control |
| url | https://arxiv.org/abs/2506.11606 |