Privacy-Preserving Quantized Average Consensus: A General State Decomposition Method

This article investigates the privacy-preserving quantized average consensus problem in multi-agent systems. That is, a distributed consensus algorithm is desired to enable each node to calculate the average value of all data under quantized communication, while protecting the privacy of each node&#...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on network science and engineering s. 1 - 14
Hlavní autoři: Zhang, Jing, Lu, Jianquan, Li, Lulu, Zheng, Wei Xing
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 2025
Témata:
Accuracy
Consensus algorithm
Convergence
Cryptography
Differential privacy
dynamic encoding/decoding scheme
Heuristic algorithms
Noise
Privacy
Privacy preservation
Protection
Quantization (signal)
quantized average consensus
state decomposition
ISSN:2327-4697, 2334-329X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This article investigates the privacy-preserving quantized average consensus problem in multi-agent systems. That is, a distributed consensus algorithm is desired to enable each node to calculate the average value of all data under quantized communication, while protecting the privacy of each node's data. This algorithm has important applications in many fields, such as distributed computing, data mining, and blockchain. To achieve this objective, a more general state decomposition method is proposed and integrated into the dynamic encoding/decoding quantization scheme to guarantee privacy-preserving accurate consensus. In this new decomposition mechanism, the number of virtual nodes generated by each node is flexible and is not determined by the network topology, but can be decomposed according to their own needs and resources, which provides a greater design freedom. Furthermore, it is strictly proved that the novel privacy-preserving quantized average consensus algorithm can achieve accurate convergence and privacy protection against both curious nodes and external eavesdroppers. Comparisons are given to show the advantage of the proposed method and obtained results. Finally, numerical simulations intuitively verify the correctness and effectiveness of the main theoretical results.
ISSN:2327-4697
2334-329X
DOI:10.1109/TNSE.2025.3619940