Rumors Across Radio, Wireless, Telephone
We study the problem of computing a minimum time schedule to spread rumors in a given graph under several models: In the radio model, all neighbors of a transmitting node listen to the messages and are able to record it only when no other neighbor is transmitting; In the wireless model (also called the edge-star model), each transmitter is at a different frequency to which any neighbor can tune to, but only one neighboring transmission can be accessed in this way; In the telephone model, the set of transmitter-receiver pairs form a matching in the graph. The rumor spreading problems assume a message at one or several nodes of the graph that must reach a target node or set of nodes. The transmission proceeds in synchronous rounds under the rules of the corresponding model. The goal is to compute a schedule that completes in the minimum number of rounds.
We present a comprehensive study of approximation algorithms for these problems, and show several reductions from the harder to the easier models for special demands. We show a new hardness of approximation of Omega(n^1/2 - epsilon) for the minimum radio gossip time by a connection to maximum induced matchings. We give the first sublinear approximation algorithms for the most general case of the problem under the wireless model; we also consider various special cases such as instances with symmetric demands and give better approximation algorithms. Our work exposes the relationships across the models and opens up several new avenues for further study.
Broadcast
Gossip
Approximation algorithms
Graph algorithms
Hardness of Approximation
517-528
Regular Paper
Jennifer
Iglesias
Jennifer Iglesias
Rajmohan
Rajaraman
Rajmohan Rajaraman
R.
Ravi
R. Ravi
Ravi
Sundaram
Ravi Sundaram
10.4230/LIPIcs.FSTTCS.2015.517
N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43:290–298, 1991.
B. Awerbuch and D. Peleg. Sparse partitions. In Foundations of Computer Science, 1990. Proceedings., 31st Annual Symposium on, pages 503-513. IEEE, 1990.
A. Bar-Noy, S. Guha, J. Naor, and B. Schieber. Multicasting in heterogeneous networks. In Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, Dallas, Texas, USA, May 23-26, 1998, pages 448-453, 1998.
M. Elkin and G. Kortsarz. A combinatorial logarithmic approximation algorithm for the directed telephone broadcast problem. SIAM J. Comput., 35(3):672–-689, 2005.
M. Elkin and G. Kortsarz. Polylogarithmic additive inapproximability of the radio broadcast problem. SIAM J. Discrete Math, 19(4):881–-899, 2005.
M. Elkin and G. Kortsarz. Sublogarithmic approximation for telephone multicast. J. Comput. Syst. Sci., 72(4):648–-659, 2006.
M. Elkin and G. Kortsarz. An improved algorithm for radio broadcast. ACM Transactions on Algorithms (TALG), 3(1):8, 2007.
U. Feige and J. Kilian. Zero knowledge and the chromatic number. J. Comput. Syst. Sci., 57:187-199, 1998.
Rajiv Gandhi, Magnús M Halldórsson, Christian Konrad, Guy Kortsarz, and Hoon Oh. Radio aggregation scheduling. In Proceedings of the 11th International Symposium on Algorithms and Experiements for Wireless Sensor Networks (ALGOSENSORS), 2015.
L. Gasieniec, D. Peleg, and Q. Xin. Faster communication in known topology radio networks. Distributed Computing, 19(4):289-300, 2007.
L. Gąsieniec. On efficient gossiping in radio networks. In Shay Kutten and Janez Žerovnik, editors, Structural Information and Communication Complexity, volume 5869 of Lecture Notes in Computer Science, pages 2-14. Springer Berlin Heidelberg, 2010.
D. R. Kowalski and A. Pelc. Optimal deterministic broadcasting in known topology radio networks. Distributed Computing, 19(3):185-195, 2007.
A. Nikzad and R Ravi. Sending secrets swiftly: Approximation algorithms for generalized multicast problems. In Automata, Languages, and Programming, pages 568-607. Springer, 2014.
R Ravi. Rapid rumor ramification: Approximating the minimum broadcast time. In Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium on, pages 202-213. IEEE, 1994.
Creative Commons Attribution 3.0 Unported license
https://creativecommons.org/licenses/by/3.0/legalcode