2022-05-28T01:25:11Zhttp://buleria.unileon.es/oai/requestoai:buleria.unileon.es:10612/113472020-12-10T08:58:42Zcom_10612_17col_10612_18
Algebra
Trobajo de las Matas, María Teresa
Cifuentes Rodríguez, Jaime
Carriegos Vieira, Miguel
pp. 656-668
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.
http://hdl.handle.net/10612/11347
spa
De Gruyter
1207.03 Cibernética
1203.02 Lenguajes Algorítmicos
On dynamic network security: A random decentering algorithm on graphs
info:eu-repo/semantics/article
TEXT
BULERIA. Repositorio Institucional de la Universidad de León
Hispana