홈 › Papers

Resilient Strong Structural Controllability in Networks using Leaky Forcing in Graphs

This paper studies the problem of selecting input nodes (leaders) to make networks strong structurally controllable despite misbehaving nodes and edges. We utilize a graph-based characterization of network strong structural controllability (SSC) in terms of zero forcing in graphs, which is a dynamic coloring of nodes. We consider three types of misbehaving nodes and edges that disrupt the zero forcing process in graphs, thus, deteriorating the network SSC. Then, we examine a leader selection guaranteeing network SSC by ensuring the accuracy of the zero forcing process, despite $k$ misbehaving nodes/edges. Our main result shows that a network is resilient to $k$ misbehaving nodes/edges under one threat model if and only if it is resilient to the same number of failures under the other threat models. Thus, resilience against one threat model implies resilience against the other models. We then discuss the computational aspects of leader selection for resilient SSC and present a numerical evaluation.

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반