通过异质移动守卫守护网络
Guarding Networks Through Heterogeneous Mobile Guards
AI总结：
本文研究如何利用异质移动守卫应对多代理系统中的连续入侵攻击，提出将网络分解为集群并分配合适范围的守卫以实现永恒安全。
摘要：
本文讨论了通过移动异质守卫（具有不同范围的守卫）保护多代理系统免受连续入侵攻击的问题。文章利用图论抽象，将代理视为图中的节点，边代表代理间的连接。守卫代表在特定节点上具备检测和响应攻击能力的专用移动代理。在永恒安全问题的背景下，本文利用异质守卫解决包括守卫数量、部署和移动策略在内的所有组件。在所提出的解决方案中，将图分解为集群，并为每个集群分配合适范围的守卫，确保集群内所有节点始终受到保护，从而实现图的永恒安全。
英文摘要：
In this article, the issue of guarding multi-agent systems against a sequence of intruder attacks through mobile heterogeneous guards (guards with different ranges) is discussed. The article makes use of graph theoretic abstractions of such systems in which agents are the nodes of a graph and edges represent interconnections between agents. Guards represent specialized mobile agents on specific nodes with capabilities to successfully detect and respond to an attack within their guarding range. Using this abstraction, the article addresses the problem in the context of eternal security problem in graphs. Eternal security refers to securing all the nodes in a graph against an infinite sequence of intruder attacks by a certain minimum number of guards. This paper makes use of heterogeneous guards and addresses all the components of the eternal security problem including the number of guards, their deployment and movement strategies. In the proposed solution, a graph is decomposed into clusters and a guard with appropriate range is then assigned to each cluster. These guards ensure that all nodes within their corresponding cluster are being protected at all times, thereby achieving the eternal security in the graph.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
