Abstract
In this paper, a complex network of nodes with multidimensional dynamics is studied in terms of the minimum number of attacked nodes’ state variables for the purpose of attacking the whole network. A multidimensional node is considered as a subnetwork and the multidimensional states of the node are considered for partial attack. Maximum matching principle is performed for multidimensional complex networks to determine the minimum number of attacked nodes. Based on the exact controllability theory, an algorithm is proposed to search the optimal set of driver nodes. For networks with root strongly connected components which are perfect matching (pm-rSCC), attacking the minimum set of driver nodes does not necessarily satisfy the requirements, and there are additional strategies for the selection of attacked nodes. Finally, a general flowchart for identifying the minimum set of attacked nodes for multidimensional complex networks is given by graphical approach and exact controllability theory. The effectiveness of the scheme is demonstrated by simulation examples.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
