SYSYJul 28

To What Extent Can Inherent Communication Noise Guarantee Privacy in Distributed Cooperative Control?

arXiv:2607.255647.3h-index: 1
Predicted impact top 87% in SY · last 90 daysOriginality Incremental advance
AI Analysis

For multi-agent systems requiring privacy in cooperative control, this work offers a novel approach that uses existing communication noise for privacy, potentially reducing the performance degradation caused by artificial noise.

This paper proposes a differentially private distributed cooperative control scheme for multi-agent systems that leverages inherent communication noise as a privacy mechanism, eliminating the need for artificial noise injection. The method provides bounded cumulative (ε,δ)-differential privacy guarantees for agents' control preferences while ensuring tracking errors converge to a bounded limit.

This paper proposes a differentially private distributed cooperative control scheme for multi-agent systems (MAS). Unlike conventional approaches that actively inject artificial noise for privacy protection, this work investigates whether inherent communication noise can itself serve as a natural privacy mechanism. A physically motivated communication-noise model is developed for mobile MAS by incorporating transmitter perturbation, receiver noise, path-loss attenuation, and log-normal shadowing. The resulting effective noise variance depends on inter-agent state differences, thereby capturing the distance-dependent signal perturbation arising in practice. Based on this model, a distributed finite-horizon Linear Quadratic Regulator (LQR) mechanism is designed to achieve formation tracking while protecting agents' private control preferences. Rather than protecting the full local cost function, the proposed privacy formulation focuses on the ratio of the LQR weighting matrices, which captures the trade-off between tracking accuracy and control effort when the quadratic cost structure is publicly known. A set-theoretic sensitivity analysis shows that this weighting-ratio adjacency formulation yields less conservative privacy bounds than gradient-based protection under the considered addition/removal adjacency relation. Theoretical analysis demonstrates that, under suitable design conditions, the proposed mechanism provides bounded cumulative (ε,δ)-differential privacy guarantees for the weighting ratios over an infinite horizon without artificial noise injection. Meanwhile, the cooperative tracking error is shown to converge almost surely and in mean square to a finite random limit, with its expectation remaining bounded. Numerical examples validate the theoretical results and illustrate the resulting privacy-performance trade-off.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes