Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > eess > arXiv:2212.05500

Help | Advanced Search

Electrical Engineering and Systems Science > Systems and Control

arXiv:2212.05500 (eess)
[Submitted on 11 Dec 2022 (v1) , last revised 18 Dec 2023 (this version, v4)]

Title: Security Defense of Large Scale Networks Under False Data Injection Attacks: An Attack Detection Scheduling Approach

Title: 大规模网络在虚假数据注入攻击下的安全防御:一种攻击检测调度方法

Authors:Yuhan Suo, Senchun Chai, Runqi Chai, Zhong-Hua Pang, Yuanqing Xia, Guo-Ping Liu
Abstract: In large-scale networks, communication links between nodes are easily injected with false data by adversaries. This paper proposes a novel security defense strategy from the perspective of attack detection scheduling to ensure the security of the network. Based on the proposed strategy, each sensor can directly exclude suspicious sensors from its neighboring set. First, the problem of selecting suspicious sensors is formulated as a combinatorial optimization problem, which is non-deterministic polynomial-time hard (NP-hard). To solve this problem, the original function is transformed into a submodular function. Then, we propose an attack detection scheduling algorithm based on the sequential submodular optimization theory, which incorporates \emph{expert problem} to better utilize historical information to guide the sensor selection task at the current moment. For different attack strategies, theoretical results show that the average optimization rate of the proposed algorithm has a lower bound, and the error expectation is bounded. In addition, under two kinds of insecurity conditions, the proposed algorithm can guarantee the security of the entire network from the perspective of the augmented estimation error. Finally, the effectiveness of the developed method is verified by the numerical simulation and practical experiment.
Abstract: 在大规模网络中,节点之间的通信链路容易被攻击者注入虚假数据。 本文从攻击检测调度的角度提出了一种新的安全防御策略,以确保网络的安全性。 基于所提出的策略,每个传感器可以直接将其邻近集合中的可疑传感器排除出去。 首先,选择可疑传感器的问题被建模为一个组合优化问题,这是非确定性多项式时间难(NP-hard)问题。 为了解决这个问题,原始函数被转换为一个子模函数。 然后,我们提出了一种基于顺序子模优化理论的攻击检测调度算法,该算法结合\emph{专家问题}以更好地利用历史信息来指导当前时刻的传感器选择任务。 对于不同的攻击策略,理论结果表明,所提出算法的平均优化率有一个下界,且误差期望是有限的。 此外,在两种不安全条件下,所提出的算法可以从增强估计误差的角度保证整个网络的安全性。 最后,通过数值仿真和实际实验验证了所开发方法的有效性。
Comments: 14 pages, 13 figures
Subjects: Systems and Control (eess.SY)
Cite as: arXiv:2212.05500 [eess.SY]
  (or arXiv:2212.05500v4 [eess.SY] for this version)
  https://doi.org/10.48550/arXiv.2212.05500
arXiv-issued DOI via DataCite
Related DOI: https://doi.org/10.1109/TIFS.2023.3340098
DOI(s) linking to related resources

Submission history

From: Yuhan Suo [view email]
[v1] Sun, 11 Dec 2022 13:27:33 UTC (9,267 KB)
[v2] Sat, 16 Sep 2023 03:23:12 UTC (15,335 KB)
[v3] Fri, 1 Dec 2023 02:16:17 UTC (10,305 KB)
[v4] Mon, 18 Dec 2023 02:04:54 UTC (2,769 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
eess.SY
< prev   |   next >
new | recent | 2022-12
Change to browse by:
cs
cs.SY
eess

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号