Compartir
Título
On dynamic network security: A random decentering algorithm on graphs
Autor
Facultad/Centro
Área de conocimiento
Título de la revista
Open Mathematics
Número de la revista
1
Datos de la obra
Open Mathematics, 2018, vol. 16
Editor
De Gruyter
Fecha
2018-06
ISSN
2391-5455
Résumé
Random Decentering Algorithm (RDA) on a undirected unweighted graph is defined and tested over several concrete scale-free networks. RDA introduces ancillary nodes to the given network following basic principles of minimal cost, density preservation, centrality reduction and randomness. First simulations over scale-free networks show that RDA gives a significant decreasing of both betweenness centrality and closeness centrality and hence topological protection of network is improved. On the other hand, the procedure is performed without significant change of the density of connections of the given network. Thus ancillae are not distinguible from real nodes (in a straightforward way) and hence network is obfuscated to potential adversaries by our manipulation.
Materia
Palabras clave
Network analysis
Cybersecurity
Scale-free graph
Centrality
Algorithms
Análisis de red
Ciberseguridad
Gráfico sin escala
Centralidad
Algoritmos
Algoritmo de descentramiento aleatorio (RDA)
Cybersecurity
Scale-free graph
Centrality
Algorithms
Análisis de red
Ciberseguridad
Gráfico sin escala
Centralidad
Algoritmos
Algoritmo de descentramiento aleatorio (RDA)
Peer review
SI
URI
DOI
Versión del editor
Aparece en las colecciones
- Untitled [2807]
Fichier(s) constituant ce document
Tamaño:
1.885
xmlui.dri2xhtml.METS-1.0.size-megabytes
Formato:
Adobe PDF
Descripción:
PDF editor