Reachability-based Robustness of Controllability in Sparse Communication Networks

Journal article (2021)

Authors

P. Sun Network Architectures and Services - EEMCS
Robert Kooij Network Architectures and Services - EEMCS
P.F.A. Van Mieghem Network Architectures and Services - EEMCS
Research Group
Network Architectures and Services (EEMCS) (TU Delft)
Copyright: © 2021 P. Sun, Robert Kooij, P.F.A. Van Mieghem
DOI: https://doi.org/10.1109/TNSM.2021.3082283
Reachability Network robustness Network controllability Communication networks
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

In this paper, we propose closed-form analytic approximations for the number of controllable nodes in sparse communication networks from the aspect of network controllability, considering link-based random attack, targeted attack, as well as random attack under the protection of critical links. We compare our approximations with simulation results on communication networks. Results show that our approximations perform well for all three attack strategies as long as the fraction of removed links is small. Only when the fraction of removed links is large, our approximation for targeted attacks does not fit well with simulation results. Finally, we validate our approximations using 200 communication networks and some synthetic networks. Results show that our approximations perform well in most cases.