Distributed Lossy Averaging

In this paper, an information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We assume a network with m nodes each observing a white Gaussian noise (WGN) source. The nodes communicate and perform local processing with the g...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on information theory Ročník 56; číslo 7; s. 3422 - 3437
Hlavní autoři: Han-I Su, El Gamal, Abbas
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.07.2010
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
ISSN:0018-9448, 1557-9654
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract In this paper, an information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We assume a network with m nodes each observing a white Gaussian noise (WGN) 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. The network rate distortion function R* (D) for a two-node network with correlated Gaussian sources is established. A general cutset lower bound on R*(D) is established and shown to be achievable to within a factor of 2 via a centralized protocol over a star network. A lower bound on the network rate distortion function for distributed weighted-sum protocols, which is larger in order than the cutset bound by a factor of log m, is established. An upper bound on the network rate distortion function for gossip-base weighted-sum protocols, which is only log log m larger in order than the lower bound for a complete graph network, is established. The results suggest that using distributed protocols results in a factor of log m increase in order relative to centralized protocols.
AbstractList In this paper, an information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We assume a network with $m$ nodes each observing a white Gaussian noise (WGN) 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. The network rate distortion function $R^{ast }(D)$ for a two-node network with correlated Gaussian sources is established. A general cutset lower bound on $R^{ast }(D)$ is established and shown to be achievable to within a factor of $2$ via a centralized protocol over a star network. A lower bound on the network rate distortion function for distributed weighted-sum protocols, which is larger in order than the cutset bound by a factor of $log m$, is established. An upper bound on the network rate distortion function for gossip-base weighted-sum protocols, which is only $log log m$ larger in order than the lower bound for a complete graph network, is established. The results suggest that using distributed protocols results in a factor of $log m$ increase in order relative to centralized protocols. [PUBLICATION ABSTRACT]
In this paper, an information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We assume a network with m nodes each observing a white Gaussian noise (WGN) 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. The network rate distortion function R* (D) for a two-node network with correlated Gaussian sources is established. A general cutset lower bound on R*(D) is established and shown to be achievable to within a factor of 2 via a centralized protocol over a star network. A lower bound on the network rate distortion function for distributed weighted-sum protocols, which is larger in order than the cutset bound by a factor of log m, is established. An upper bound on the network rate distortion function for gossip-base weighted-sum protocols, which is only log log m larger in order than the lower bound for a complete graph network, is established. The results suggest that using distributed protocols results in a factor of log m increase in order relative to centralized protocols.
In this paper, an information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We assume a network with m nodes each observing a white Gaussian noise (WGN) 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. The network rate distortion function R ast ( D ) for a two-node network with correlated Gaussian sources is established. A general cutset lower bound on R ast ( D ) is established and shown to be achievable to within a factor of 2 via a centralized protocol over a star network. A lower bound on the network rate distortion function for distributed weighted-sum protocols, which is larger in order than the cutset bound by a factor of log m , is established. An upper bound on the network rate distortion function for gossip-base weighted-sum protocols, which is only log log m larger in order than the lower bound for a complete graph network, is established. The results suggest that using distributed protocols results in a factor of log m increase in order relative to centralized protocols.
Author Han-I Su
El Gamal, Abbas
Author_xml – sequence: 1
  surname: Han-I Su
  fullname: Han-I Su
  email: hanisu@stanford.edu
  organization: Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
– sequence: 2
  givenname: Abbas
  surname: El Gamal
  fullname: El Gamal, Abbas
  email: abbas@ee.stanford.edu
  organization: Dept. of Electr. Eng., Stanford Univ., Stanford, CA, USA
BookMark eNp9kEtrAjEUhUOxULXdF9xIN12NTSbvpVjbCkI3dh0ymTsSGWdsMlPw3zeidOGiq8vhfuc-zggNmrYBhB4JnhGC9ctmtZnlOKkcM8Uku0FDwrnMtOBsgIYYE5VpxtQdGsW4S5Jxkg_R5NXHLvii76CcrtsYj9P5DwS79c32Ht1Wto7wcKlj9PW23Cw-svXn-2oxX2eO5nmXWUWx4xWtBBOlLIh1lSQFo4AZpg6UrEqNKajC0hI4444UTlmlJCtcVUJJx-j5PPcQ2u8eYmf2Pjqoa9tA20cjORWKCMYT-XRF7to-NOk4I7DWmuK0aYzEGXIh_ROgMs53tvNt0wXra0OwOSVmUmLmlJi5JJaM-Mp4CH5vw_E_y-Rs8QDwh_PU1FrSXweLdvk
CODEN IETTAW
CitedBy_id crossref_primary_10_1109_TCNS_2018_2813926
crossref_primary_10_1109_TIT_2017_2710059
crossref_primary_10_1109_JSAC_2013_130402
Cites_doi 10.1109/CDC.2003.1272421
10.1109/ISIT.2009.5205989
10.1145/984622.984625
10.1109/CDC.2005.1583486
10.1109/CDC.2006.376899
10.1109/SFCS.2003.1238221
10.1109/TC.2003.1176982
10.1016/j.automatica.2007.01.002
10.1109/TAC.2003.812781
10.1109/TIT.1985.1057118
10.1109/TSP.2008.919636
10.1016/j.jpdc.2006.08.010
10.1145/1127777.1127791
10.1109/ISIT.2004.1365154
10.1109/SSP.2007.4301337
10.1016/j.automatica.2009.10.032
10.1109/TIT.1976.1055508
10.1007/978-3-540-70701-1_2
10.1109/INFCOM.2005.1498447
10.1109/TIT.2005.850110
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2010
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) Jul 2010
DBID 97E
RIA
RIE
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TIT.2010.2048474
DatabaseName IEEE Xplore (IEEE)
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database

Technology Research Database
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISSN 1557-9654
EndPage 3437
ExternalDocumentID 2080645051
10_1109_TIT_2010_2048474
5484997
Genre orig-research
Feature
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
5GY
5VS
6IK
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACGFS
ACGOD
ACIWK
AENEX
AETEA
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
DU5
E.L
EBS
EJD
F5P
HZ~
H~9
IAAWW
IBMZZ
ICLAB
IDIHD
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
P2P
PQQKQ
RIA
RIE
RNS
RXW
TAE
TN5
VH1
VJK
AAYXX
CITATION
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c322t-a830c5f3f646d7b1acf71b43e0403ce87fd903e8ba3de545c1bc8a8874bcfded3
IEDL.DBID RIE
ISICitedReferencesCount 8
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000278812000031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0018-9448
IngestDate Wed Oct 01 00:12:34 EDT 2025
Sun Nov 30 05:17:00 EST 2025
Tue Nov 18 22:25:23 EST 2025
Sat Nov 29 03:53:09 EST 2025
Tue Aug 26 16:40:05 EDT 2025
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 7
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c322t-a830c5f3f646d7b1acf71b43e0403ce87fd903e8ba3de545c1bc8a8874bcfded3
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
PQID 609993090
PQPubID 36024
PageCount 16
ParticipantIDs proquest_miscellaneous_753681645
ieee_primary_5484997
proquest_journals_609993090
crossref_citationtrail_10_1109_TIT_2010_2048474
crossref_primary_10_1109_TIT_2010_2048474
PublicationCentury 2000
PublicationDate 2010-July
2010-07-00
20100701
PublicationDateYYYYMMDD 2010-07-01
PublicationDate_xml – month: 07
  year: 2010
  text: 2010-July
PublicationDecade 2010
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle IEEE transactions on information theory
PublicationTitleAbbrev TIT
PublicationYear 2010
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref14
ref11
ref10
kashyap (ref15) 2007; 43
ref1
ref17
ref16
ref18
gamal (ref8) 2010
nedic (ref19) 2007
ref24
ref23
ref26
ref22
ref21
ref7
ref4
ma (ref25) 2008
ref3
bawa (ref2) 2003
ref6
ref5
cover (ref9) 2006
ayaso (ref20) 2008
References_xml – ident: ref10
  doi: 10.1109/CDC.2003.1272421
– year: 2006
  ident: ref9
  publication-title: Elements of Information Theory
– ident: ref26
  doi: 10.1109/ISIT.2009.5205989
– year: 2010
  ident: ref8
  publication-title: ?Lecture notes on network information theory ?
– ident: ref4
  doi: 10.1145/984622.984625
– year: 2008
  ident: ref20
  article-title: Information theoretic bounds on distributed computation
  publication-title: IEEE Trans Inf Theory
– ident: ref6
  doi: 10.1109/CDC.2005.1583486
– ident: ref11
  doi: 10.1109/CDC.2006.376899
– ident: ref12
  doi: 10.1109/SFCS.2003.1238221
– ident: ref3
  doi: 10.1109/TC.2003.1176982
– volume: 43
  start-page: 1192
  year: 2007
  ident: ref15
  article-title: quantized consensus
  publication-title: Automatica
  doi: 10.1016/j.automatica.2007.01.002
– ident: ref1
  doi: 10.1109/TAC.2003.812781
– ident: ref24
  doi: 10.1109/TIT.1985.1057118
– ident: ref14
  doi: 10.1109/TSP.2008.919636
– ident: ref13
  doi: 10.1016/j.jpdc.2006.08.010
– year: 2003
  ident: ref2
  publication-title: ?Estimating aggregates on a peer-to-peer network ?
– ident: ref7
  doi: 10.1145/1127777.1127791
– start-page: 51
  year: 2008
  ident: ref25
  article-title: two-terminal distributed source coding with alternating messages for function computation
  publication-title: Proc IEEE Int Symp Inf Theory
– ident: ref21
  doi: 10.1109/ISIT.2004.1365154
– ident: ref16
  doi: 10.1109/SSP.2007.4301337
– year: 2007
  ident: ref19
  publication-title: ?On distributed averaging algorithms and quantization effects ?
– ident: ref17
  doi: 10.1016/j.automatica.2009.10.032
– ident: ref23
  doi: 10.1109/TIT.1976.1055508
– ident: ref18
  doi: 10.1007/978-3-540-70701-1_2
– ident: ref5
  doi: 10.1109/INFCOM.2005.1498447
– ident: ref22
  doi: 10.1109/TIT.2005.850110
SSID ssj0014512
Score 2.0257092
Snippet In this paper, an information theoretic formulation of the distributed averaging problem previously studied in computer science and control is presented. We...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 3422
SubjectTerms A stars
Computer errors
Computer networks
Computer science
Consensus
Distortion
distributed averaging
Distributed computing
Gaussian
Gaussian noise
gossip algorithms
Information processing
Information science
Information systems
interactive communication
lossy source coding
Lower bounds
Mathematical analysis
Mathematical models
Networks
Normal distribution
Peer to peer computing
Protocol
Protocol (computers)
Protocols
Rate-distortion
Source coding
Upper bound
Title Distributed Lossy Averaging
URI https://ieeexplore.ieee.org/document/5484997
https://www.proquest.com/docview/609993090
https://www.proquest.com/docview/753681645
Volume 56
WOSCitedRecordID wos000278812000031&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1557-9654
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014512
  issn: 0018-9448
  databaseCode: RIE
  dateStart: 19630101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5q8aAHq63iWpU9eBFcu4_sJjkWtSiU4qFKb8tuMguCtNKH4L93kn2gKIK3hU2W8CWTfN_OZAbgQiFPkISHF-tQe0yHiZcxEXvC-OCIbjNlgzGfx3wyEbOZfGzBVXMXBhFt8Blem0fry9cLtTG_ygbEromg8y3Y4jwp72o1HgMWB2Vm8IAMmDRH7ZL05WD6MC1juEySWsbZtyPI1lT5sRHb02XU-d-49mGvYpHusJz2A2jhvAudukKDWxlsF3a_pBvsQf_WZMk1Ba5Qu2Ma2oc7pJVs6xQdwtPobnpz71XFETxFNrj2MhH5Ki6iImGJ5nmQqYIHOYuQrDJSKHihpR-hyLNII9EkFeRKZLSlsFwVGnV0BO35Yo7H4Mow0DKTMVcoWcB1zkIjXEhK5AGyEB0Y1HilqsocbgpYvKZWQfgyJYRTg3BaIezAZdPjrcya8UfbnkG0aVeB6UC_npK0MqtVmhg-G_nSd8Bt3pI9GCdHNsfFZpWS_EoEacD45Pfv9mGnDAAwEben0F4vN3gG2-p9_bJants19QnJOsc1
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3dS8MwED_mFNQHp1Oxzo8--CJY14-0aR6HOjacw4cpewttcgVBNtmH4H_vpe2Kogi-FZqU8Esu-f16lzuAC4U8QhIeTqh97TDtR07C4tCJjQ-O6DZTeTDm84APh_F4LB5rcFXdhUHEPPgMr81j7svXU7U0v8raxK6JoPM1WA8Z893itlblM2ChV-QG98iESXWsnJKuaI_6oyKKy6SpZZx9O4Tyqio_tuL8fOk2_jeyXdgpeaTdKSZ-D2o4aUJjVaPBLk22CdtfEg7uQ-vW5Mk1Ja5Q2wMa2ofdobWcVyo6gKfu3eim55TlERxFVrhwkjhwVZgFWcQizVMvURn3UhYg2WWgMOaZFm6AcZoEGokoKS9VcUKbCktVplEHh1CfTCd4BLbwPS0SEXKFgnlcp8w30oXEROoh89GC9govqcrc4aaExavMNYQrJCEsDcKyRNiCy6rHW5E344-2-wbRql0JpgWt1ZTI0rDmMjKMNnCFa4FdvSWLMG6OZILT5VySAItiUoHh8e_fPYfN3uhhIAf94X0LtopwABN_ewL1xWyJp7Ch3hcv89lZvr4-AVHtynw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Distributed+Lossy+Averaging&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Su%2C+H-I&rft.au=El+Gamal%2C+A&rft.date=2010-07-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=56&rft.issue=7&rft.spage=3422&rft_id=info:doi/10.1109%2FTIT.2010.2048474&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=2080645051
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon