Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults

We study deterministic fault-tolerant gossiping protocols in directed Geometric Radio Networks (in short, directed GRN). Unpredictable node and link faults may happen during every time slot of the protocol's execution. We first consider the single-message model where every node can send at most one message per time slot. We provide a protocol that, in any directed GRNGof n nodes, completes gossiping in O(nΔ) time (where Δ is the maximal in-degree of G) and hasmessage complexity O(n2). Both bounds are then shown to be optimal. As for the combined-message model, we give a protocol working in optimal completion time O(DΔ) (where D is the maximal source eccentricity) and message complexity O(Dn). Finally, our protocol performs the (single) broadcast operation within the same optimal time and optimal message complexity O(n).

[1]  David Peleg,et al.  Faster communication in known topology radio networks , 2005, PODC '05.

[2]  Wojciech Rytter,et al.  Broadcasting algorithms in radio networks with unknown topology , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[3]  Andrzej Pelc,et al.  Broadcasting in radio networks , 2002 .

[4]  Andrzej Pelc,et al.  Deterministic Rendezvous in Graphs , 2003 .

[5]  Andrzej Pelc,et al.  Fault-Tolerant Broadcasting in Radio Networks (Extended Abstract) , 1998, ESA.

[6]  E F ClementiAndrea,et al.  Round Robin is optimal for fault-tolerant broadcasting on wireless networks , 2004 .

[7]  Christian Scheideler,et al.  Efficient Communication Strategies for Ad Hoc Wireless Networks , 2013, Theory of Computing Systems.

[8]  Reuven Bar-Yehuda,et al.  Multiple communication in multi-hop radio networks , 1989, PODC '89.

[9]  Andrea E. F. Clementi,et al.  Distributed broadcast in radio networks of unknown topology , 2003, Theor. Comput. Sci..

[10]  Anthony Ephremides,et al.  On the construction of energy-efficient broadcast and multicast trees in wireless networks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[11]  Christian Scheideler,et al.  Efficient communication strategies for ad-hoc wireless networks (extended abstract) , 1998, SPAA '98.

[12]  Reuven Bar-Yehuda,et al.  Multiple Communication in Multihop Radio Networks , 1993, SIAM J. Comput..

[13]  Reuven Bar-Yehuda,et al.  On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization , 1992, J. Comput. Syst. Sci..

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

[15]  Elena Pagani,et al.  Reliable broadcast in mobile multihop packet networks , 1997, MobiCom '97.

[16]  Christian Scheideler.  Models and Techniques for Communication in Dynamic Networks , 2002, STACS.

[17]  G. Italiano,et al.  Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings , 1998 .

[18]  Christian Scheideler,et al.  Simple routing strategies for adversarial systems , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[19]  Andrea E. F. Clementi,et al.  On the Power Assignment Problem in Radio Networks , 2004, Mob. Networks Appl..

[20]  Piotr Indyk,et al.  Deterministic superimposed coding with applications to pattern matching , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.

[21]  Andrzej Pelc,et al.  Feasibility and complexity of broadcasting with random transmission failures , 2005, PODC '05.

[22]  Ivan Stojmenovic,et al.  Handbook of Wireless Networks and Mobile Computing , 2002 .

[23]  Noga Alon,et al.  A Lower Bound for Radio Broadcast , 1991, J. Comput. Syst. Sci..

[24]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[25]  Andrea E. F. Clementi,et al.  On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs , 2001, STACS.

[26]  Theodore S. Rappaport,et al.  Wireless communications - principles and practice , 1996 .

[27]  Gruia Calinescu,et al.  Network Lifetime and Power Assignment in ad hoc Wireless Networks , 2003, ESA.

[28]  Piotr Indyk,et al.  Explicit constructions of selectors and related combinatorial structures, with applications , 2002, SODA '02.

[29]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2002, J. Algorithms.

[30]  Andrzej Lingas,et al.  On adaptive deterministic gossiping in ad hoc radio networks , 2002, SODA '02.

[31]  Wojciech Rytter,et al.  Deterministic broadcasting in unknown radio networks , 2000, SODA '00.

[32]  Andrea E. F. Clementi,et al.  Round Robin is optimal for fault-tolerant broadcasting on wireless networks , 2001, J. Parallel Distributed Comput..

[33]  Tiziana Calamoneri,et al.  The L(h, k)-Labelling Problem: A Survey and Annotated Bibliography , 2006, Comput. J..

[34]  Andrzej Pelc,et al.  Broadcasting in geometric radio networks , 2007, J. Discrete Algorithms.

[35]  Andrzej Pelc,et al.  Power consumption in packet radio networks , 2000, Theor. Comput. Sci..