Robustness of Controllability for Networks Based on Edge-Attack

Nie, Sen; Wang, Xuwen; Zhang, Haifeng; Li, Qilang; Wang, Bing–Hong

doi:10.1371/journal.pone.0089066

Cited by 82 publications

(43 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Next, let ρ = [α T 1 , ..., α T N ]. In light of (18), (20) and (22), it can be verified that W T ρ T = 0 with α i (sI n − A) = 0, i = 1, ..., N , and α i B = 0, i ∈ ν. Therefore, by condition (iii), one has α i = 0 for all i = 1, ..., N .…”

Section: Proof (Necessity)mentioning

confidence: 99%

Controllability of Directed Networked MIMO Systems With Heterogeneous Dynamics

Xiang

Wang

Chen

et al. 2020

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

This paper studies the controllability of networked multi-input-multi-output (MIMO) systems, in which the network topology is weighted and directed, and the nodes are heterogeneous higher-dimensional linear time-invariant (LTI) dynamical systems. The primary objective is to search for controllability criteria beyond those already known for homogeneous networks. The focus is on the effects of the network topology, node dynamics, external control inputs, as well as the inner interactions on the network controllability. It is found that a network of heterogeneous systems can be controllable even if the corresponding homogeneous network topology is uncontrollable. The finding thus unravels another fundamental property that affects the network controllability-the heterogeneity of the node dynamics. A necessary and sufficient condition is derived for the controllability of heterogeneous networked MIMO LTI systems. For some typical cases, necessary and/or sufficient controllability conditions are specified and presented on the node dynamics, inner interactions, as well as the network topology.

show abstract

Section: Proof (Necessity)mentioning

confidence: 99%

Controllability of Directed Networked MIMO Systems With Heterogeneous Dynamics

Xiang

Wang

Chen

et al. 2020

IEEE Trans. Control Netw. Syst.

View full text Add to dashboard Cite

show abstract

“…Both random and intentional edge-removal attacks have also been studied by many. In [43], for example, it shows that the intentional edge-removal attack by removing highly-loaded edges is very effective in reducing the network controllability. It is further observed, in e.g.…”

Section: Introductionmentioning

confidence: 99%

Towards Optimal Robustness of Network Controllability: An Empirical Necessary Condition

Lou

Wang

Tsang

et al. 2020

IEEE Trans. Circuits Syst. I

View full text Add to dashboard Cite

To better understand the correlation between network topological features and the robustness of network controllability in a general setting, this paper suggests a practical approach to searching for optimal network topologies with given numbers of nodes and edges. Since theoretical analysis is impossible at least in the present time, exhaustive search based on optimization techniques is employed, firstly for a group of small-sized networks that are realistically workable, where exhaustive means 1) all possible network structures with the given numbers of nodes and edges are computed and compared, and 2) all possible node-removal sequences are considered. An empirical necessary condition (ENC) is observed from the results of exhaustive search, which shrinks the search space to quickly find an optimal solution. ENC shows that the maximum and minimum in-and out-degrees of an optimal network structure should be almost identical, or within a very narrow range, i.e., the network should be extremely homogeneous. Edge rectification towards the satisfaction of the ENC is then designed and evaluated. Simulation results on large-sized synthetic and realworld networks verify the effectiveness of both the observed ENC and the edge rectification scheme. As more operations of edge rectification are performed, the network is getting closer to exactly satisfying the ENC, and consequently the robustness of the network controllability is enhanced towards optimum.

show abstract

“…Recent advances in studies of complex networks motivated the researches on the features and dynamics of scale-free communication networks. [5][6][7][8][9][10][11] With the increasing demand for transmitting big data, congestion becomes a considerable challenge in many real communication systems. It will be di±cult to recover large systems from congested state to free-°ow state.…”

Section: Introductionmentioning

confidence: 99%

Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks

Bai

Liu

Zhang

2017

Int. J. Mod. Phys. C

View full text Add to dashboard Cite

In this paper, we propose a new strategy (HLS) to enhance the transport capacity of scale-free networks by adding links to the existing networks, based on the betweenness of nodes, the shortest path length and the betweenness of links. Since only slight amounts of nodes in scalefree networks have high betweenness centrality, local link-adding strategy is adopted as a part of HLS for target nodes, which can signi¯cantly reduce the load of target nodes. Moreover, in order to improve the robustness of our strategy under some extreme cases, second sorting procedure is introduced in HLS. Simulation results show that HLS outperforms the IE strategy in terms of transport capacity and delivering ability of scale-free networks. After the adding links process of HLS, the congestion can be alleviated e±ciently, which is meaningful to the realistic networks.

show abstract

Robustness of Controllability for Networks Based on Edge-Attack

Cited by 82 publications

References 36 publications

Controllability of Directed Networked MIMO Systems With Heterogeneous Dynamics

Controllability of Directed Networked MIMO Systems With Heterogeneous Dynamics

Towards Optimal Robustness of Network Controllability: An Empirical Necessary Condition

Effective hybrid link-adding strategy to enhance network transport efficiency for scale-free networks

Contact Info

Product

Resources

About