Abstract
We are interested in the problem of computing the average consensus in a distributed fashion on random geometric graphs. We describe a new algorithm called Multi-scale Gossip which employs a hierarchical decomposition of the graph to partition the computation into tractable sub-problems. Using only pairwise messages of fixed size that travel at most \(O(n^{\frac{1}{3}})\) hops, our algorithm is robust and has communication cost of O(n loglogn logε − 1) transmissions, which is order-optimal up to the logarithmic factor in n. Simulated experiments verify the good expected performance on graphs of many thousands of nodes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Tsitsiklis, J.: Problems in Decentralized Decision Making and Computation. PhD thesis, Massachusetts Institute of Tech. (November 1984)
Kempe, D., Dobra, A., Gehrke, J.: Computing aggregate information using gossip. In: Proc. Foundations of Computer Science, Cambridge, MA (October 2003)
Boyd, S., Ghosh, A., Prabhakar, B., Shah, D.: Randomized gossip algorithms. IEEE Trans. Inf. Theory 52(6), 2508–2530 (2006)
Benezit, F., Dimakis, A., Thiran, P., Vetterli, M.: Gossip along the way: Order-optimal consensus through randomized path averaging. In: Proc. Allerton Conf. on Comm., Control and Comp., Urbana-Champaign, IL (September 2007)
Dimakis, A., Sarwate, A., Wainwright, M.: Geographic gossip: Efficient averaging for sensor networks. IEEE Trans. Signal Processing 56(3), 1205–1216 (2008)
Gupta, P., Kumar, P.R.: Critical power for asymptotic connectivity in wireless networks. In: Stochastic Analysis, Control, Optimization and Applications, Boston, pp. 1106–1110 (1998)
Penrose, M.: Random Geometric Graphs. Oxford University Press, Oxford (2003)
Cao, M., Spielman, D.A., Yeh, E.M.: Accelerated gossip algorithms for distributed computation. In: Proc. 44th Annual Allerton Conf. Comm., Control and Comp., Monticello, IL (September 2006)
Kokiopoulou, E., Frossard, P.: Polynomial filtering for fast convergence in distributed consensus. IEEE Trans. Signal Processing 57(1), 342–354 (2009)
Oreshkin, B., Coates, M., Rabbat, M.: Optimization and analysis of distributed averaging with short node memory. To appear IEEE Trans. Signal Processing (2010)
Li, W., Dai, H.: Location-aided fast distributed consensus. IEEE Transactions on Information Theory (2008) (submitted)
Jung, K., Shah, D., Shin, J.: Fast gossip through lifted Markov chains. In: Proc. Allerton Conf. on Comm., Control and Comp., Urbana-Champaign, IL (September 2007)
Sarkar, R., Yin, X., Gao, J., Luo, F., Gu, X.D.: Greedy routing with guaranteed delivery using ricci flows. In: Proc. Information Processing in Sensor Networks, San Francisco (April 2009)
Sarkar, R., Zhu, X., Gao, J.: Hierarchical spatial gossip for multi-resolution representations in sensor networks. In: Proc. of the International Conference on Information Processing in Sensor Networks (IPSN 2007), April 2007, pp. 420–429 (2007)
Kim, J.H., West, M., Lall, S., Scholte, E., Banaszuk, A.: Stochastic multiscale approaches to consensus problems. In: Proc. IEEE Conf. on Decision and Control, Cancun (December 2008)
Epstein, M., Lynch, K., Johansson, K., Murray, R.: Using hierarchical decomposition to speed up average consensus. In: Proc. IFAC World Congress, Seoul (July 2008)
Cattivelli, F., Sayed, A.: Hierarchical diffusion algorithms for distributed estimation. In: Proc. IEEE Workshop on Statistical Signal Processing, Wales (August 2009)
Denantes, P., Benezit, F., Thiran, P., Vetterli, M.: Which distributed averaging algorithm should i choose for my sensor network? In: Proc. IEEE Infocom, Phoenix (April 2008)
Avin, C., Ercal, G.: On the cover time and mixing time of random geometric graphs. Theoretical Computer Science 380, 2–22 (2007)
Margulis, G.: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators. J. Probl. Inf. Transm. 24(1), 39–46 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tsianos, K.I., Rabbat, M.G. (2010). Fast Decentralized Averaging via Multi-scale Gossip. In: Rajaraman, R., Moscibroda, T., Dunkels, A., Scaglione, A. (eds) Distributed Computing in Sensor Systems. DCOSS 2010. Lecture Notes in Computer Science, vol 6131. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13651-1_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-13651-1_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13650-4
Online ISBN: 978-3-642-13651-1
eBook Packages: Computer ScienceComputer Science (R0)