Computationally Light Privacy Preservation of Matrix-Weighted Average Consensus

Multiagent consensus algorithms have emerged as foundational tools across a spectrum of applications, and matrix-weighted consensus ones are capable of characterizing cross-dimensional interdependence. Yet, their potential is often shadowed by a pressing concern: the privacy of agents' initial...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on control of network systems Ročník 12; číslo 2; s. 1651 - 1661
Hlavní autoři: Wang, Peng, Shao, Haibin, Pan, Lulu, Yan, Weiwu, Li, Ning
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.06.2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Accuracy
Algorithms
Consensus algorithm
Data privacy
Matrix-weighted average consensus (MAC)
Multiagent systems
Noise
peer-to-peer (P2P) transactive energy systems (TESs)
Peer-to-peer computing
Perturbation methods
Power supplies
Privacy
privacy preservation
Transactive energy
Vectors
ISSN:2325-5870, 2372-2533
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í:Multiagent consensus algorithms have emerged as foundational tools across a spectrum of applications, and matrix-weighted consensus ones are capable of characterizing cross-dimensional interdependence. Yet, their potential is often shadowed by a pressing concern: the privacy of agents' initial values, which frequently represent sensitive data or proprietary information. A computationally light privacy-preserving mechanism for matrix-weighted average consensus (MAC) algorithms is proposed in response to the concern of agents' privacy. In the mechanism, agents' states are first perturbed and then multiplied by the matrix weights before being sent to their neighbors. Both the perturbation and the matrix weight are neighbor-dependent, i.e., they may be selected to be different for different neighbors, and they can be selected independently to mask the true state of an agent. The proposed mechanism can simultaneously guarantee the privacy of initial values and accurate average consensus. The additional computational burden that an agent bears is only the addition of vectors in the same dimension as its state compared to the original MAC algorithm. Through practical case studies with a peer-to-peer transactive energy system, we demonstrate the tangible implications of safeguarding initial value privacy with the proposed mechanism.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2325-5870
2372-2533
DOI:10.1109/TCNS.2025.3526713