Privacy-Preserving Average Consensus over Digraphs in the Presence of Time Delays
Loading...
Access rights
openAccess
Journal Title
Journal ISSN
Volume Title
A4 Artikkeli konferenssijulkaisussa
This publication is imported from Aalto University research portal.
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
View publication in the Research portal
View/Open full text file from the Research portal
Other link related to publication
Date
2019-09-01
Major/Subject
Mcode
Degree programme
Language
en
Pages
8
238-245
238-245
Series
Proceedings of the 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019
Abstract
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.Description
Keywords
Asymptotic exact average consensus, Distributed coordination, Privacy preservation
Other note
Citation
Charalambous, T, Manitara, N E & Hadjicostis, C N 2019, Privacy-Preserving Average Consensus over Digraphs in the Presence of Time Delays . in Proceedings of the 57th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2019 ., 8919746, IEEE, pp. 238-245, Allerton Conference on Communication, Control, and Computing, Monticello, Illinois, United States, 29/09/2015 . https://doi.org/10.1109/ALLERTON.2019.8919746
