Privacy-Preserving Average Consensus over Digraphs in the Presence of Time Delays
Privacy-Preserving Average Consensus over Digraphs in the Presence of Time Delays
复制标题
存在时间延迟的情况下有向图的隐私保护平均共识
DOI：
10.1109/allerton.2019.8919746
复制
发表时间：
2019
期刊：
影响因子：
--
通讯作者：
C. Hadjicostis
中科院分区：
文献类型：
--
作者：
Themistoklis Charalambous;Nikolas E. Manitara;C. Hadjicostis
在本文中，我们提出了一种隐私保护的离散时间渐近平均共识机制，该机制允许多组件系统的组件计算其初始值的准确平均值，而不向其他组件透露其特定值。我们假设组件(节点)通过可能的有向通信链路(边)与其他组件交互，形成一般有向通信拓扑(有向图)。所提出的分布式协议可以被任何想要对可能的多个好奇但不恶意的节点(好奇的节点试图识别其他节点的初始值，并且可以与其他好奇的节点交换信息，但不以任何其他方式干扰计算)的私密性(即，不透露其对平均值的初始值)的组件所遵循。我们设计了一种基于比率共识的分布式机制，其中每个节点通过使用恒定的正权重组合其内部邻居接收的可用信息并通过添加偏移量(仅在算法执行期间通信的两个状态中的一个状态)来更新其信息状态。我们证明了这种隐私保护版本的Ratio Consensus算法，以下称为隐私保护Ratio Consensus算法，即使在存在有界时变延迟的情况下，也收敛于节点初始值的准确平均值。算例验证了该算法的有效性和性能。
In this paper, we propose a privacy-preserving discrete-time asymptotic average consensus mechanism that allows components of a multi-component system to calculate the exact average of their initial values without revealing to other components their specific value. We assume that components (nodes) interact with other components via possibly directed communication links (edges), forming a generally directed communication topology (digraph). The proposed distributed protocol can be followed by any component that wants to maintain its privacy (i.e., not reveal the initial value it contributes to the average) to possibly multiple curious but not malicious nodes (curious nodes try to identify the initial values of other nodes, and can exchange information with other curious nodes, but do not interfere in the computation in any other way). We devise a distributed mechanism, based on ratio consensus, where each node updates its information state by combining the available information received by its in-neighbors using constant positive weights and by adding an offset (only at one of the two states communicated during the execution of the algorithm). We establish that this privacy-preserving version of ratio consensus, henceforth called the privacy-preserving ratio consensus algorithm, converges to the exact average of the nodes’ initial values, even in the presence of bounded time-varying delays. Illustrative examples demonstrate the validity and performance of our proposed algorithm.
影响因子：
6.8
作者：
Yongqiang Wang
通讯作者：
Yongqiang Wang