Abstract | ||
---|---|---|
Average consensus is a widely used algorithm for distributed computing and control, where all the agents in the network constantly communicate and update their states in order to achieve an agreement. This approach could result in an undesirable disclosure of information on the initial state of agent i to the other agents. In this paper, we propose a privacy preserving average consensus algorithm to guarantee the privacy of the initial state and the convergence of the algorithm to the exact average of the initial values, by adding and subtracting random noises to the consensus process. We characterize the mean square convergence rate of our consensus algorithm and derive upper and lower bounds for the covariance matrix of the maximum likelihood estimate on the initial state. A numerical example is provided to illustrate the effectiveness of the proposed design. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1109/TAC.2016.2564339 | IEEE Trans. Automat. Contr. |
Keywords | Field | DocType |
Privacy,Signal processing algorithms,Maximum likelihood estimation,Symmetric matrices,Algorithm design and analysis,Heuristic algorithms,Databases | Convergence (routing),Consensus algorithm,Average consensus,Mathematical optimization,Computer science,Upper and lower bounds,Mean square convergence,Maximum likelihood,Covariance matrix | Conference |
Volume | Issue | ISSN |
62 | 2 | 0018-9286 |
Citations | PageRank | References |
26 | 0.85 | 12 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Yilin Mo | 1 | 891 | 51.51 |
Richard M. Murray | 2 | 12322 | 1223.70 |