Algorithm-Level Confidentiality for Average Consensus on Time-Varying Directed Graphs
Huan Gao, Yongqiang Wang
备注：
This paper has been accepted to IEEE Transactions on Network Science and Engineering as a regular paper. Please cite this paper as: Huan Gao and Yongqiang Wang, Algorithm-Level Confidentiality for Average Consensus on Time-Varying Directed Graphs. IEEE Transactions on Network Science and Engineering, doi: 10.1109/TNSE.2022.3140274
Average consensus plays a key role in distributed networks, with applications ranging from time synchronization, information fusion, load balancing, to decentralized control. Existing average consensus algorithms require individual agents to exchange explicit state values with their neighbors, which leads to the undesirable disclosure of sensitive information in the state. In this paper, we propose a novel average consensus algorithm for time-varying directed graphs that can protect the confidentiality of a participating agent against other participating agents. The algorithm injects randomness in interaction to obfuscate information on the algorithm-level and can ensure information-theoretic privacy without the assistance of any trusted third party or data aggregator. By leveraging the inherent robustness of consensus dynamics against random variations in interaction, our proposed algorithm can also guarantee the accuracy of average consensus. The algorithm is distinctly different from differential-privacy based average consensus approaches which enable confidentiality through compromising accuracy in obtained consensus value. Numerical simulations confirm the effectiveness and efficiency of our proposed approach.
Designing Distributed Fixed-Time Consensus Protocols for Linear Multi-Agent Systems Over Directed Graphs
School of Automation, Northwestern Polytechnical University（西北工业大学自动化学院）；Department of Electronic Engineering, City University of Hong Kong（香港城市大学电子工程系）
Event-triggered consensus of multi-agent systems under directed topology based on periodic sampled-data
School of Mathematics and Statistics, Qingdao University（青岛大学数学与统计学院）；College of Automation and Electrical Engineering, Qingdao University（青岛大学自动化与电气工程学院）；School of Control Science and Engineering, Shandong University（山东大学控制科学与工程学院）
Non-trivial consensus on directed signed matrix-weighted networks with compound measurement noises and time-varying topologies
School of Mathematics and Statistics, Wuhan University（武汉大学数学与统计学院）；College of Computer Science and Software Engineering, Shenzhen University（深圳大学计算机科学与软件工程学院）
Grounded Laplacians of Directed Signed Matrix-Weighted Networks: Spectral Properties and Applications to Non-Trivial Consensus
the College of Computer Science and Software Engineering, Shenzhen University（深圳大学计算机科学与软件工程学院）；the School of Mathematics and Statistics, Wuhan University（武汉大学数学与统计学院）；the Faculty of Computer Science and Control Engineering, Shenzhen University of Advanced Technology（深圳先进技术大学计算机与控制工程学院）
