Resilient Consensus of Discrete-Time Complex Cyber-Physical Networks Under Deception Attacks

This article considers the resilient consensus problems of discrete-time complex cyber-physical networks under F-local deception attacks. A resilient consensus algorithm, where extreme values received are removed by each node, is first introduced. By utilizing the presented algorithm, a necessary and sufficient condition to ensure resilient consensus in the absence of trusted edges is then provided by means of network robustness. We further generalize the notion of network robustness and present the necessary and sufficient condition for the achievement of resilient consensus in the presence of trusted edges. In addition, we show that through appropriately assigning the trusted edges, the resilient consensus can be reached under arbitrary communication network. Finally, the validity of the theoretical findings is demonstrated by simulation examples.