{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T23:23:13Z","timestamp":1773098593811,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1109\/tsp.2013.2239992","type":"journal-article","created":{"date-parts":[[2013,1,14]],"date-time":"2013-01-14T19:19:25Z","timestamp":1358191165000},"page":"2137-2149","source":"Crossref","is-referenced-by-count":3,"title":["Multiscale Gossip for Efficient Decentralized Averaging in Wireless Packet Networks"],"prefix":"10.1109","volume":"61","author":[{"given":"Konstantinos I.","family":"Tsianos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael G.","family":"Rabbat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1038\/nature08891"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.908946"},{"key":"ref12","article-title":"Greedy routing with guaranteed delivery using Ricci flows","author":"sarkar","year":"2009","journal-title":"Inf Process Sens Netw"},{"key":"ref13","article-title":"Gossip along the way: Order-optimal consensus through randomized path averaging","author":"benezit","year":"2007","journal-title":"Allerton Conf Commun Contr Comput"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001"},{"key":"ref15","article-title":"Accelerated gossip algorithms for distributed computation","author":"cao","year":"2006","journal-title":"44th Ann Allerton Conf Commun Contr Comput"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2006147"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2010.2043127"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2081030"},{"key":"ref19","article-title":"Fast gossip through lifted Markov chains","author":"jung","year":"2007","journal-title":"Allerton Conf Commun Contr Comput"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.065"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/1375457.1375467"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2003.1238221"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2010.2052531"},{"key":"ref29","first-page":"39","article-title":"Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators","volume":"24","author":"margulis","year":"1988","journal-title":"Probl Inf Transm"},{"key":"ref5","author":"tsitsiklis","year":"1984","journal-title":"Problems in decentralized decision making and computation"},{"key":"ref8","author":"mallat","year":"1999","journal-title":"A Wavelet Tour of Signal Processing"},{"key":"ref7","first-page":"1106","article-title":"Critical power for asymptotic connectivity in wireless networks","author":"gupta","year":"1998","journal-title":"Proc Stochastic Anal Control Optim Appl"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874516"},{"key":"ref1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-13651-1_23","article-title":"Fast decentralized averaging via multi-scale gossip","author":"tsianos","year":"2010","journal-title":"Int Conf Distrib Comput Sens Syst"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"3549","DOI":"10.1109\/TIT.2007.905002","article-title":"Hierarchical cooperation achieves optimal capacity scaling in ad hoc networks","volume":"53","author":"l\ufffdveque","year":"2007","journal-title":"IEEE Trans Inf Theory"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034777"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1236360.1236413"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2060050"},{"key":"ref24","article-title":"Using hierarchical decomposition to speed up average consensus","author":"epstein","year":"2008","journal-title":"IFAC World Congr"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2008.4739252"},{"key":"ref26","first-page":"762","article-title":"On hierarchical routing in doubling metrics","author":"chan","year":"2005","journal-title":"Proc 17th Ann ACM-SIAM Symp Discrete Algorithm (SODA '06)"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2009.5278519"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/78\/6492148\/06410444.pdf?arnumber=6410444","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:55:57Z","timestamp":1638219357000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6410444\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":29,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2013.2239992","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5]]}}}