On dynamic network security: A random decentering algorithm on graphs

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 simula...

Full description

Saved in:
Bibliographic Details
Published in:Open mathematics (Warsaw, Poland) Poland), 2018-06, Vol.16 (1), p.656-668
Main Authors: Trobajo, M.T., Cifuentes-Rodríguez, J., Carriegos, M.V.
Format: Article
Language:English
Subjects:
68R10
94C15
Algorithms
Centrality
Cybersecurity
Density
Network analysis
Network security
Nodes
Scale-free graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:2391-5455
2391-5455
DOI:10.1515/math-2018-0059