The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.06 - June (2010 vol.21)
pp: 801-811
Vartika Bhandari , University of Illinois at Urbana-Champaign, Urbana
Nitin H. Vaidya , University of Illinois at Urbana-Champaign, Urbana
ABSTRACT
This paper studies the reliable broadcast problem in a radio network with locally bounded failures. We present a sufficient condition for achievability of reliable broadcast in a general graph subject to Byzantine/crash-stop failures. We then consider the problem of reliable broadcast in an infinite grid (or finite toroidal) radio network under Byzantine and crash-stop failures. We present bounds on the maximum number of failures that may occur in any given neighborhood without rendering reliable broadcast impossible. For the Byzantine failure model, we describe an algorithm which is optimal for the grid network model, as it tolerates faults up to a previously established upper bound for this model. Our results indicate that it is possible to achieve reliable broadcast if slightly less than one-fourth fraction of nodes in any neighborhood are faulty. We also show that reliable broadcast is achievable with crash-stop failures if slightly less than half the nodes in any given neighborhood may be faulty.
INDEX TERMS
Byzantine failure, crash-stop failure, broadcast, fault tolerance, radio network.
CITATION
Vartika Bhandari, Nitin H. Vaidya, "Reliable Broadcast in Radio Networks with Locally Bounded Failures", IEEE Transactions on Parallel & Distributed Systems, vol.21, no. 6, pp. 801-811, June 2010, doi:10.1109/TPDS.2009.82
REFERENCES
[1] C.-Y. Koo, "Broadcast in Radio Networks Tolerating Byzantine Adversarial Behavior," Proc. 23rd Ann. ACM Symp. Principles of Distributed Computing (PODC '04), pp. 275-282, 2004.
[2] A. Pelc and D. Peleg, "Broadcasting with Locally Bounded Byzantine Faults," Information Processing Letters, vol. 93, no. 3, pp. 109-115, Feb. 2005.
[3] V. Bhandari and N.H. Vaidya, "On Reliable Broadcast in a Radio Network," Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '05), pp. 138-147, 2005.
[4] E. Kreyszig, Advanced Engineering Mathematics, seventh ed. John Wiley & Sons, 1993.
[5] H. Attiya and J. Welch, Distributed Computing. McGraw-Hill, 1998.
[6] M. Pease, R. Shostak, and L. Lamport, "Reaching Agreement in the Presence of Faults," J. ACM, vol. 27, no. 2, pp. 228-234, 1980.
[7] L. Lamport, R. Shostak, and M. Pease, "The Byzantine Generals Problem," ACM Trans. Programming Languages and Systems, vol. 4, no. 3, pp. 382-401, 1982.
[8] D. Dolev, "The Byzantine Generals Strike Again," J. Algorithms, vol. 3, no. 1, pp. 14-30, 1982.
[9] J. Considine, L.A. Levin, and D. Metcalf, "Byzantine Agreement with Faulty Majority Using Bounded Broadcast," CoRR, vol. cs.DC/0012024, 2000.
[10] E. Kranakis, D. Krizanc, and A. Pelc, "Fault-Tolerant Broadcasting in Radio Networks," J. Algorithms, vol. 39, no. 1, pp. 47-67, 2001.
[11] V. Vaikuntanathan, "Brief Announcement: Broadcast in Radio Networks in the Presence of Byzantine Adversaries," Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '05), p. 167, 2005.
[12] C.-Y. Koo, V. Bhandari, J. Katz, and N.H. Vaidya, "Reliable Broadcast in Radio Networks: The Bounded Collision Case," Proc. ACM Symp. Principles of Distributed Computing (PODC), 2006.
[13] S. Gilbert, R. Guerraoui, and C. Newport, "Of Malicious Motes and Suspicious Sensors," Proc. Int'l Conf. Principles of Distributed Systems (OPODIS), 2006.
[14] A. Pelc and D. Peleg, "Feasibility and Complexity of Broadcasting with Random Transmission Failures," Proc. 24th Ann. ACM SIGACT-SIGOPS Symp. Principles of Distributed Computing (PODC '05), pp. 334-341, 2005.
[15] V. Bhandari and N.H. Vaidya, "Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures," Proc. DIALM-POMC Joint Workshop Foundations of Mobile Computing, 2007.
[16] G. Chockler, M. Demirbas, S. Gilbert, N. Lynch, C. Newport, and T. Nolte, "Reconciling the Theory and Practice of (un)Reliable Wireless Broadcast," Proc. Fourth Int'l Workshop Assurance in Distributed Systems and Networks (ADSN) (ICDCSW '05), pp. 42-48, 2005.
[17] G. Chockler, M. Demirbas, S. Gilbert, C. Newport, and T. Nolte, "Consensus and Collision Detectors in Wireless Ad Hoc Networks," Proc. 24th Ann. ACM Symp. Principles of Distributed Computing, pp. 197-206, 2005.
[18] S. Shakkottai, R. Srikant, and N. Shroff, "Unreliable Sensor Grids: Coverage, Connectivity, and Diameter," Proc. IEEE INFOCOM, 2003.
[19] S. Shakkottai, R. Srikant, and N. Shroff, "Correction to Unreliable Sensor Grids: Coverage, Connectivity, and Diameter," Personal Comm., 2005.
[20] V. Bhandari and N.H. Vaidya, "Reliable Broadcast in Wireless Networks with Probabilistic Failures," Proc. IEEE INFOCOM, pp. 715-723, May 2007.
[21] S. Dolev, S. Gilbert, R. Guerraoui, and C. Newport, "Gossiping in a Multi-Channel Radio Network (an Oblivious Approach to Coping with Malicious Interference)," Proc. Symp. Distributed Computing (DISC), 2007.
[22] D.E. Varberg, "Pick's Theorem Revisited," The Am. Math. Monthly, vol. 92, no. 8, pp. 584-587, Oct. 1985.
42 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool