Quadratic Gaussian gossiping

This paper presents an information theoretic source coding formulation of distributed averaging. We assume a network with m nodes each observing an i.i.d. Gaussian source; the nodes communicate and perform local processing with the goal of computing the average of the sources to within a prescribed mean squared error distortion. A general cutset lower bound on the network rate distortion function is established and shown to be achievable to within a factor of 2 via a centralized protocol in the star network. A lower bound on the network rate distortion function for distributed weighted-sum protocols that is larger than the cutset bound by a factor of log m is established. We also establish an upper bound on the expected network rate distortion function for gossip-based weighted-sum protocols that is only a factor of log log m larger than this lower bound. The results suggest that using distributed protocols results in a factor of log m increase in communication relative to centralized protocols.