Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Randomized Gossiping with Unreliable Communication: Dependent or Independent Node Updates
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.
KTH, Skolan för elektro- och systemteknik (EES), Reglerteknik. KTH, Skolan för elektro- och systemteknik (EES), Centra, ACCESS Linnaeus Centre.ORCID-id: 0000-0001-9940-5929
2012 (engelsk)Inngår i: 2012 IEEE 51st Annual Conference on Decision and Control (CDC), IEEE conference proceedings, 2012, s. 4846-4851Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

This paper studies an asynchronous randomized gossip algorithm under unreliable communication. At each instance, two nodes are selected to meet with a given probability. When nodes meet, two unreliable communication links are established with communication in each direction succeeding with a time-varying probability. It is shown that two particularly interesting cases arise when these communication processes are either perfectly dependent or independent. Necessary and sufficient conditions on the success probability sequence are proposed to ensure almost sure consensus or ?-consensus. Weak connectivity is required when the communication is perfectly dependent, while double connectivity is required when the communication is independent. Moreover, it is proven that with odd number of nodes, average preserving turns from almost forever (with probability one for all initial conditions) for perfectly dependent communication, to almost never (with probability zero for almost all initial conditions) for the independent case. This average preserving property does not hold true for general number of nodes. These results indicate the fundamental role the node interactions have in randomized gossip algorithms.

sted, utgiver, år, opplag, sider
IEEE conference proceedings, 2012. s. 4846-4851
Serie
IEEE Conference on Decision and Control. Proceedings, ISSN 0191-2216
Emneord [en]
Consensus, Convergence analysis, Gossip algorithms, Unreliable communication
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-111453DOI: 10.1109/CDC.2012.6426729ISI: 000327200405030Scopus ID: 2-s2.0-84874264946ISBN: 978-1-4673-2064-1 (tryckt)OAI: oai:DiVA.org:kth-111453DiVA, id: diva2:586416
Konferanse
51st IEEE Conference on Decision and Control, CDC 2012; Maui, HI; United States; 10 December 2012 through 13 December 2012
Merknad

QC 20130215

Tilgjengelig fra: 2013-02-15 Laget: 2013-01-11 Sist oppdatert: 2013-12-19bibliografisk kontrollert

Open Access i DiVA

fulltext(368 kB)269 nedlastinger
Filinformasjon
Fil FULLTEXT02.pdfFilstørrelse 368 kBChecksum SHA-512
8aa90307f9b90182e95765f2a938b77101f11a39ee52b75670e12394f48e12890c9ab0eae660359a693d7ed593f3065375e0c55926ab2d11485c813301803d7b
Type fulltextMimetype application/pdf

Andre lenker

Forlagets fulltekstScopusIEEEXplore

Personposter BETA

Johansson, Karl Henrik

Søk i DiVA

Av forfatter/redaktør
Shi, GuodongJohansson, MikaelJohansson, Karl Henrik
Av organisasjonen

Søk utenfor DiVA

GoogleGoogle Scholar
Totalt: 269 nedlastinger
Antall nedlastinger er summen av alle nedlastinger av alle fulltekster. Det kan for eksempel være tidligere versjoner som er ikke lenger tilgjengelige

doi
isbn
urn-nbn

Altmetric

doi
isbn
urn-nbn
Totalt: 82 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • harvard1
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf