Filters

2020 - 20223

More filters

20223
Reset filters

Settings

Author: Hinsen, Alexander × Author: Jahnel, Benedikt × Start date: 2020 × End date: 2024 × Start date: 2020 × Type: Report × WGL Institute: WIAS ×

Search Results

Now showing 1 - 3 of 3
  • Thumbnail Image
    Item
    Agent-based modeling and simulation for malware spreading in D2D networks
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2022) Benomar, Ziyad; Ghribi, Chaima; Cali, Eli; Hinsen, Alexander; Jahnel, Benedikt
    This paper presents a new multi-agent model for simulating malware propagation in device-to-device (D2D) 5G networks. This model allows to understand and analyze mobile malware-spreading dynamics in such highly dynamical networks. Additionally, we present a theoretical study to validate and benchmark our proposed approach for some basic scenarios that are less complicated to model mathematically and also to highlight the key parameters of the model. Our simulations identify critical thresholds for em no propagation and for em maximum malware propagation and make predictions on the malware-spread velocity as well as device-infection rates. To the best of our knowledge, this paper is the first study applying agent-based simulations for malware propagation in D2D.
  • Thumbnail Image
    Item
    Limiting shape for first-passage percolation models on random geometric graphs
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2021) Coletti, Cristian F.; de Lima, Lucas R.; Hinsen, Alexander; Jahnel, Benedikt; Valesin, Daniel R.
    Let a random geometric graph be defined in the supercritical regime for the existence of a unique infinite connected component in Euclidean space. Consider the first-passage percolation model with independent and identically distributed random variables on the random infinite connected component. We provide sufficient conditions for the existence of the asymptotic shape and we show that the shape is an Euclidean ball. We give some examples exhibiting the result for Bernoulli percolation and the Richardson model. For the Richardson model we further show that it converges weakly to a branching process in the joint limit of large intensities and slow passing times.
  • Thumbnail Image
    Item
    Malware propagation in urban D2D networks
    (Berlin : Weierstraß-Institut für Angewandte Analysis und Stochastik, 2020) Hinsen, Alexander; Jahnel, Benedikt; Cali, Eli; Wary, Jean-Philippe
    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.