对抗环境中约束图的最大代数连通度
Maximizing Algebraic Connectivity of Constrained Graphs in Adversarial Environments
摘要:
本文的目的是最大限度地提高代数连接网络的拓扑结构设计下的约束条件和对手。我们关注三个问题。首先,我们制定了凹最大化拓扑设计问题添加边的初始图,它引入了一个非凸的二元决策变量,除了服从一般凸约束的可行边集。与以前的方法不同,我们的方法是不贪婪的,能够适应这些额外的约束。我们还研究了一个场景,其中协调器必须选择性地保护网络的边缘,使其免受物理干扰或对抗性攻击造成的失败。协调员需要在不预先假定对手的可行攻击行动的情况下对对手的行动做出战略性响应。我们提出了三个启发式算法的协调员,以完成目标,并确定最坏情况下的预防性解决方案。每一种算法在仿真中被证明是有效的,我们提供了一些比较性能的讨论。
英文摘要:
This paper aims to maximize algebraic connectivity of networks via topology design under the presence of constraints and an adversary. We are concerned with three problems. First, we formulate the concave maximization topology design problem of adding edges to an initial graph, which introduces a nonconvex binary decision variable, in addition to subjugation to general convex constraints on the feasible edge set. Unlike previous methods, our method is justifiably not greedy and capable of accommodating these additional constraints. We also study a scenario in which a coordinator must selectively protect edges of the network from a chance of failure due to a physical disturbance or adversarial attack. The coordinator needs to strategically respond to the adversary's action without presupposed knowledge of the adversary's feasible attack actions. We propose three heuristic algorithms for the coordinator to accomplish the objective and identify worst-case preventive solutions. Each algorithm is shown to be effective in simulation and we provide some discussion on their compared performance.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。