arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.06248cs.NI
收藏

恶意软件在城市D2D网络中的传播

Malware propagation in urban D2D networks

Alexander Hinsen, Benedikt Jahnel, Elie Cali, Jean-Philippe Wary

摘要:

我们介绍和分析的纯D2 D网络中的恶意软件的传播模型,通过固定Cox-Gilbert图。这里,设备形成具有随机强度测量$λΛ$的泊松点过程,其中$Λ$是静止的并且例如由表示城市街道系统的泊松-沃罗诺伊镶嵌的实现的边长测量给出。我们假设,在初始时间,网络中心的典型设备携带恶意软件,并在随机等待时间后开始感染相邻设备。在这里,我们专注于马尔可夫模型,其中的等待时间是指数随机变量,和非马尔可夫模型,其中的等待时间功能严格正最小和有限的最大等待时间。我们提出的数值结果的传播速度取决于系统参数。在第二步中,我们介绍并分析了由称为白骑士的特殊设备提供的恶意软件传播的对策,这些设备一旦受到攻击,就有能力从受感染的设备中消除恶意软件,并将它们变成白骑士。基于模拟,我们隔离参数制度中的恶意软件生存或消除,无论是在马尔可夫和非马尔可夫设置。

英文摘要:

We introduce and analyze models for the propagation of malware in pure D2D networks given via stationary Cox-Gilbert graphs. Here, the devices form a Poisson point process with random intensity measure $λΛ$, where $Λ$ is stationary and given, for example, by the edge-length measure of a realization of a Poisson-Voronoi tessellation that represents an urban street system. We assume that, at initial time, a typical device at the center of the network carries a malware and starts to infect neighboring devices after random waiting times. Here we focus on Markovian models, where the waiting times are exponential random variables, and non-Markovian models, where the waiting times feature strictly positive minimal and finite maximal waiting times. We present numerical results for the speed of propagation depending on the system parameters. In a second step, we introduce and analyze a counter measure for the malware propagation given by special devices called white knights, which have the ability, once attacked, to eliminate the malware from infected devices and turn them into white knights. Based on simulations, we isolate parameter regimes in which the malware survives or is eliminated, both in the Markovian and non-Markovian setting.

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

↑