Reliable Broadcast in Radio Networks with Locally Bounded Failures

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.

[1]  Rachid Guerraoui,et al.  Of Malicious Motes and Suspicious Sensors , 2006 .

[2]  Nitin H. Vaidya,et al.  Reliable Broadcast in Wireless Networks with Probabilistic Failures , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[3]  Andrzej Pelc,et al.  Fault-Tolerant Broadcasting in Radio Networks , 2001, J. Algorithms.

[4]  Murat Demirbas,et al.  Consensus and collision detectors in wireless Ad Hoc networks , 2005, PODC '05.

[5]  Nitin H. Vaidya,et al.  Reliable broadcast in radio networks: the bounded collision case , 2006, PODC '06.

[6]  Leslie Lamport,et al.  Reaching Agreement in the Presence of Faults , 1980, JACM.

[7]  Danny Dolev,et al.  The Byzantine Generals Strike Again , 1981, J. Algorithms.

[8]  Ness B. Shroff,et al.  Correction to “Unreliable Sensor Grids: Coverage, Connectivity and Diameter” , 2005 .

[9]  Andrzej Pelc,et al.  Broadcasting with locally bounded Byzantine faults , 2005, Inf. Process. Lett..

[10]  Jeffrey Considine,et al.  Byzantine Agreement with Faulty Majority using Bounded Broadcast , 2000, ArXiv.

[11]  Rachid Guerraoui,et al.  Gossiping in a multi-channel radio network an oblivious approach to coping with malicious interference , 2007 .

[12]  Nancy A. Lynch,et al.  Reconciling the theory and practice of (un)reliable wireless broadcast , 2005, 25th IEEE International Conference on Distributed Computing Systems Workshops.

[13]  Nitin H. Vaidya,et al.  On reliable broadcast in a radio network , 2005, PODC '05.

[14]  Leslie Lamport,et al.  The Byzantine Generals Problem , 1982, TOPL.

[15]  Chiu-Yuen Koo,et al.  Broadcast in radio networks tolerating byzantine adversarial behavior , 2004, PODC '04.

[16]  D. Varberg.  Pick's Theorem Revisited , 1985 .

[17]  W. Johnson,et al.  Advanced engineering mathematics: E. Kreyszig John Wiley. 856 pp., 79s , 1963 .

[18]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[19]  Vinod Vaikuntanathan.  Brief announcement: broadcast in radio networks in the presence of byzantine adversaries , 2005, PODC '05.

[20]  Andrzej Pelc,et al.  Feasibility and complexity of broadcasting with random transmission failures , 2007, Theor. Comput. Sci..

[21]  Nitin H. Vaidya,et al.  Reliable Local Broadcast in a Wireless Network Prone to Byzantine Failures , 2007, DIALM-POMC.