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.
| Original language | English |
|---|---|
| Article number | 9437298 |
| Pages (from-to) | 2764-2775 |
| Number of pages | 12 |
| Journal | IEEE Transactions on Network and Service Management |
| Volume | 18 |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2021 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Keywords
- Network controllability
- network robustness
- reachability
- communication networks