Abstract
We consider the problem of reliable broadcast tolerating Byzantine faults in a message-bounded radio network. Following the same model as in [4] and with a different assumption on the message bounds of nodes, we investigate the possibility of reliable broadcast given the communication range, message bounds of honest and dishonest nodes, and the maximum number of dishonest nodes per neighborhood.
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
References
Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proc. of ACM Symposium on Principles of Distributed Computing (PODC) (2005)
Bhandari, V., Vaidya, N.H.: Reliable broadcast in a wireless grid network with probabilistic failures. Technical Report, CSL, UIUC (October 2005)
Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Proc. of ACM Symposium on Principles of Distributed Computing (PODC) (2004)
Koo, C.-Y., Bhandari, V., Katz, J., Vaidya, N.H.: Reliable broadcast in radio networks: The bounded collision case. In: Proc. of ACM Symposium on Principles of Distributed Computing (PODC) (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bertier, M., Kermarrec, AM., Tan, G. (2008). Reliable Broadcast Tolerating Byzantine Faults in a Message-Bounded Radio Network. In: Taubenfeld, G. (eds) Distributed Computing. DISC 2008. Lecture Notes in Computer Science, vol 5218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-87779-0_43
Download citation
DOI: https://doi.org/10.1007/978-3-540-87779-0_43
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-87778-3
Online ISBN: 978-3-540-87779-0
eBook Packages: Computer ScienceComputer Science (R0)