z-logo
open-access-imgOpen Access
Finite‐time distributed topology design for optimal network resilience
Author(s) -
Xue Dong,
Hirche Sandra
Publication year - 2019
Publication title -
iet control theory and applications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.059
H-Index - 108
eISSN - 1751-8652
pISSN - 1751-8644
DOI - 10.1049/iet-cta.2018.6117
Subject(s) - computer science , eigenvalues and eigenvectors , network topology , topology (electrical circuits) , distributed computing , graph , topological graph theory , link (geometry) , graph theory , mathematical optimization , theoretical computer science , mathematics , computer network , physics , combinatorics , quantum mechanics , voltage graph , line graph
The process of enhancing the ability of a complex network against various malicious attacks through link addition/rewiring has been the subject of extensive interest and research. The performance of existing methods often highly depends on full knowledge about the network topology. In this study, the authors devote ourselves to developing new distributed strategies to perform link manipulation sequentially using only local accessible topology information. This strategy is concerned with a matrix‐perturbation‐based approximation of the network‐based optimisation problems and a distributed algorithm to compute eigenvectors and eigenvalues of graph matrices. In addition, the development of a distributed stopping criterion, which provides the desired accuracy on the distributed estimation algorithm, enables us to solve the link‐operation problem in a finite‐time manner. Finally, all results are illustrated and validated using numerical demonstrations and examples.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here