arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2211.09345cs.NI
收藏

加权网络上更有效的中心性攻击

More Effective Centrality-Based Attacks on Weighted Networks

Balume Mburano, Weisheng Si, Qing Cao, Wei Xing Zheng

摘要:

只有了解黑客的战术,我们才能挫败他们的攻击。本着这种精神,本文研究了黑客如何有效地发动所谓的“有针对性的节点攻击”,在这种攻击中,迭代攻击在网络上进行,并且在每次迭代中删除最重要的节点。在现有的加权网络攻击中,节点的重要性通常是通过与最短路径长度相关的中心度来衡量的,而攻击的有效性也主要是通过与长度相关的度量来衡量的。然而,本文认为,流量可以更好地反映网络功能比最短路径长度的那些网络承载流量作为主要功能。因此,本文提出了基于流量的度量节点的重要性和攻击的有效性,分别。我们的节点重要性度量包括三个基于流的中心性(流介数,当前流介数和当前流接近度),这还没有被提出用于加权网络的攻击。我们的攻击有效性度量是我们提出的一个新的平均网络流量的基础上。在人工网络和现实网络上进行的大量实验表明,根据我们提出的攻击有效性指标进行评估时,具有我们建议的三个中心性的攻击方法比现有的攻击方法更有效。

英文摘要:

Only when understanding hackers' tactics, can we thwart their attacks. With this spirit, this paper studies how hackers can effectively launch the so-called 'targeted node attacks', in which iterative attacks are staged on a network, and in each iteration the most important node is removed. In the existing attacks for weighted networks, the node importance is typically measured by the centralities related to shortest-path lengths, and the attack effectiveness is also measured mostly by length-related metrics. However, this paper argues that flows can better reflect network functioning than shortest-path lengths for those networks with carrying traffic as the main functionality. Thus, this paper proposes metrics based on flows for measuring the node importance and the attack effectiveness, respectively. Our node importance metrics include three flow-based centralities (flow betweenness, current-flow betweenness and current-flow closeness), which have not been proposed for use in the attacks on weighted networks yet. Our attack effectiveness metric is a new one proposed by us based on average network flow. Extensive experiments on both artificial and real-world networks show that the attack methods with our three suggested centralities are more effective than the existing attack methods when evaluated under our proposed attack effectiveness metric.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑