Journal
IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS
Volume 16, Issue 7, Pages 4868-4877Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TII.2019.2933596
Keywords
Complex cyber-physical networks; deception attacks; resilient consensus; robust graph; trusted edges
Categories
Funding
- National Natural Science Foundation of China [61922076, 61725304, 61873252, 61673361]
- Fok Ying-Tong Education Foundation for Young Teachers in Higher Education Institutions of China [161059]
- New South Wales Cyber Security Network in Australia [P00025091]
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available