Broadcasting with locally bounded Byzantine faults

Andrzej Pelc, David Peleg

Research output: Contribution to journalArticlepeer-review

88 Scopus citations


The study of a broadcast in the t-locally bounded model in arbitrary graphs assuming Byzantine graphs were discussed. It was assumed that the nodes knew which node was the source and it was found that the focus was on the feasibility of communication. It was also found that all nodes must transmit separately in different rounds in order to avoid collisions in the radio model. The results show that the byzantine behavior of faulty nodes was restricted to the content of messages and did not effected the schedule.

Original languageEnglish
Pages (from-to)109-115
Number of pages7
JournalInformation Processing Letters
Issue number3
StatePublished - 14 Feb 2005
Externally publishedYes

Bibliographical note

Funding Information:
* Corresponding author. E-mail addresses: (A. Pelc), (D. Peleg). 1Supported in part by NSERC grant OGP 0008136 and by the Research Chair in Distributed Computing of the Université du Québec en Outaouais.


  • Algorithms
  • Broadcast
  • Byzantine faults
  • Distributed computing
  • Fault tolerance


Dive into the research topics of 'Broadcasting with locally bounded Byzantine faults'. Together they form a unique fingerprint.

Cite this