Broadcast in radio networks tolerating Byzantine adversarial behavior

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 275-282

  Koo, Chiu Yuen ^a  

^a University of Maryland   (United States)

Author keywords

Broadcast; Fault tolerance; Radio networks

Indexed keywords

COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTATIONAL METHODS; LOCAL AREA NETWORKS; MULTICASTING; RADIO BROADCASTING; TELECOMMUNICATION NETWORKS;

BYZANTINE ADVERSARIES; MULTICAST MESSAGES; NETWORK COMMUNICATION; RADIO NETWORKS;

RADIO COMMUNICATION;

EID: 10444234209     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011807     Document Type: Conference Paper

References (13)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43(2):290-298, 1991.
2. S. Amitanand, I. Sanketh, K. Srinathant, V. Vinod, and C. P. Rangan. Distributed consensus in the presence of sectional faults. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 202-210. ACM Press, 2003.
3. J. Considine, L. A. Levin, and D. Metcalf. Byzantine agreement with faulty majority using bounded broadcast. arXiv.org e-Print archive, 2003. http://arxiv.org/abs/cs/0012024.
4. M. Fitzi and U. Maurer. From partial consistency to global broadcast. In Proceedings of the thirty-second annual A CM symposium on Theory of computing, pages 494-503. ACM Press, 2000.
5. I. Gaber and Y. Mansour. Broadcast in radio networks. In Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms, pages 577-585. Society for Industrial and Applied Mathematics, 1995.
6. D. R. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. In Proceedings of the twenty-second annual symposium on Principles of distributed computing, pages 73-82. ACM Press, 2003.
7. E. Kranakis, D. Krizanc, and A. Pelc. Fault-tolerant broadcasting in radio networks (extended abstract). In Proceedings of the 6th Annual European Symposium on Algorithms, pages 283-294. Springer-Verlag, 1998.
8. E. Kushilevitz and Y. Mansour. An ø(d log(n/d)) lower bound for broadcast in radio networks. In Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, pages 65-74. ACM Press, 1993.
9. L. Lamport, R. Shostak, and M. Pease. The byzantine generals problem. ACM Trans. Program. Lang. Syst., 4(3):382-401, 1982.
10. E. Pagani and G. P. Rossi. Reliable broadcast in mobile multihop packet networks. In Proceedings of the 3rd annual ACM/IEEE international conference on Mobile computing and networking, pages 34-42. ACM Press, 1997.
11. E. Pagani and G. P. Rossi. Broadcasting algorithms in radio networks with unknown topology. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pages 492-501, 2003.
12. M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. J. ACM, 27(2):228-234, 1980.
13. E. W. Weisstein. "Gauss's Circle Problem." From MathWorld - A Wolfram Web Resource. http://mathworld.wolfram.com/GausssCircleProblem.html