The Recoverability of Network Controllability

Conference paper (2021)

Authors

Anqi Chen Student
P. Sun Network Architectures and Services - EEMCS
Robert Kooij Network Architectures and Services - EEMCS , TNO
Research Group
Network Architectures and Services (EEMCS) (TU Delft)
Copyright: © 2021 Anqi Chen, P. Sun, Robert Kooij
DOI: https://doi.org/10.1109/ICSRS53853.2021.9660667
More Info
expand_more

Published Date

2021

Language

English

Reuse Rights

Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.

Faculty

Electrical Engineering, Mathematics and Computer Science

Department

Quantum & Computer Engineering

Research Group

Network Architectures and Services

Abstract

Network recoverability refers to the ability of a network to recover to a desired performance level after suffering topological perturbations such as link failures. The minimum number of driver nodes is a typical metric to denote the network controllability. In this paper, we propose closed-form analytic approximations for the minimum number of driver nodes to investigate the recoverability of network controllability under link-based perturbations in two scenarios: 1) only the links which are damaged in the failure process can be recovered and 2) links can be established between any pair of nodes that have no link between them after the failure process. Results show that our approximations fit well with simulation results both in synthetic networks and real-world networks, such as swarm signaling networks and some communication networks.

Files

The_Recoverability_of_Network_... (pdf)
(pdf | 1.46 Mb)
- Embargo expired in 03-07-2022