Regensburg 2013 – wissenschaftliches Programm
Bereiche | Tage | Auswahl | Suche | Aktualisierungen | Downloads | Hilfe
SOE: Fachverband Physik sozio-ökonomischer Systeme
SOE 25: Poster session
SOE 25.6: Poster
Donnerstag, 14. März 2013, 17:15–19:00, Poster C
Vulnerability of proximity graphs to failure and attacks — •Christoph Norrenbrock, Oliver Melchert, and Alexander K. Hartmann — Carl-von-Ossietzky Universität Oldenburg
We study numerically [1] different proximity graphs (Delaunay-Triangulation, Gabriel graph, relative neighborhood graph, minimum-radius graph) that are discussed as “backbones” of ad-hoc communication networks. Ad-hoc networks represent, e.g., collections of radio-devices without fixed infrastructure.
Typically, remote devices are seldom linked directly to each other, but connected indirectly via several paths composed of multiple nodes and edges.
This motivates the question how structure and information-transmission efficiency of these graphs are affected by a failure of a given fraction of nodes.
Therefore, we study and compare the influence of different node–removal strategies by considering systems up to N=4·104 and determine, using finite-size scaling techniques, the fraction of nodes (for each strategy) that yields a breakup of the respective graph in the thermodynamic limit.
Hartmann, A. K., Practical guide to computer simulations (World Scientific, 2009)