Fast radio broadcasting with advice

We study deterministic broadcasting in radio networks in the recently introduced framework of network algorithms with advice. We concentrate on the problem of trade-offs between the number of bits of information (size of advice) available to nodes and the time in which broadcasting can be accomplished. In particular, we ask what is the minimum number of bits of information that must be available to nodes of the network, in order to broadcast very fast. For networks in which constant time broadcast is possible under a complete knowledge of the network we give a tight answer to the above question: O(n) bits of advice are sufficient but o(n) bits are not, in order to achieve constant broadcasting time in all these networks. This is in sharp contrast with geometric radio networks of constant broadcasting time: we show that in these networks a constant number of bits suffices to broadcast in constant time. For arbitrary radio networks we present a broadcasting algorithm whose time is inverse-proportional to the size of the advice.

[1]  Andrzej Pelc,et al.  Trade-offs between the size of advice and broadcasting time in trees , 2008, SPAA '08.

[2]  Pierre Fraigniaud,et al.  Local MST computation with short advice , 2007, SPAA.

[3]  Eyal Kushilevitz,et al.  An Omega(D log (N/D)) Lower Bound for Broadcast in Radio Networks , 1998, SIAM J. Comput..

[4]  Imrich Chlamtac,et al.  The wave expansion approach to broadcasting in multihop radio networks , 1991, IEEE Trans. Commun..

[5]  Eyal Kushilevitz,et al.  An Ω(D log(N/D)) lower bound for broadcast in radio networks , 1993, PODC '93.

[6]  Krzysztof Diks,et al.  The impact of information on broadcasting time in linear radio networks , 2002, Theor. Comput. Sci..

[7]  Andrzej Pelc,et al.  Broadcasting in undirected ad hoc radio networks , 2005, Distributed Computing.

[8]  Andrzej Pelc,et al.  The Wakeup Problem in Synchronous Broadcast Systems , 2000, SIAM J. Discret. Math..

[9]  C. SIAMJ..  AN Ω(D log(N/D)) LOWER BOUND FOR BROADCAST IN RADIO NETWORKS∗ , 1998 .

[10]  Reuven Bar-Yehuda,et al.  On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization , 1987, PODC '87.

[11]  Andrzej Pelc,et al.  Upper Bounds on Broadcasting Time in UDG Radio Networks with Unknown Topology , 2006 .

[12]  Guy Kortsarz,et al.  Improved schedule for radio broadcast , 2005, SODA '05.

[13]  Andrzej Pelc,et al.  Oracle size: a new measure of difficulty for communication tasks , 2006, PODC '06.

[14]  Andrzej Pelc,et al.  Tree exploration with advice , 2008, Inf. Comput..

[15]  Andrea E. F. Clementi,et al.  Selective families, superimposed codes, and broadcasting on unknown radio networks , 2001, SODA '01.

[16]  Wojciech Rytter,et al.  Deterministic broadcasting in ad hoc radio networks , 2002, Distributed Computing.

[17]  Suresh Singh,et al.  Broadcasting on [0, L] , 1994, Discret. Appl. Math..

[18]  Danilo Bruschi,et al.  Lower bounds for the broadcast problem in mobile radio networks , 1997, Distributed Computing.

[19]  Eli Gafni,et al.  An Information Theoretic Lower Bound for Broadcasting in Radio Networks , 2004, STACS.

[20]  Anna Pagh,et al.  Deterministic Radio Broadcasting , 2000, ICALP.

[21]  Marek Chrobak,et al.  The wake-up problem in multi-hop radio networks , 2004, SODA '04.

[22]  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..

[23]  Gianluca De Marco.  Distributed broadcast in unknown radio networks , 2008, SODA '08.

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

[25]  Nicolas Nisse,et al.  Graph searching with advice , 2007, Theor. Comput. Sci..

[26]  Wojciech Rytter,et al.  Fast broadcasting and gossiping in radio networks , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[27]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[28]  Yishay Mansour,et al.  Centralized broadcast in multihop radio networks , 2003, J. Algorithms.

[29]  Andrzej Pelc,et al.  Broadcasting in udg radio networks with unknown topology , 2007, PODC.

[30]  Andrzej Pelc,et al.  Time of Deterministic Broadcasting in Radio Networks with Local Knowledge , 2004, SIAM J. Comput..

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

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

[33]  Andrzej Pelc,et al.  Tree Exploration with an Oracle , 2006, MFCS.

[34]  Imrich Chlamtac,et al.  On Broadcasting in Radio Networks - Problem Analysis and Protocol Design , 1985, IEEE Transactions on Communications.

[35]  Krzysztof Diks,et al.  The Impact of Knowledge on Broadcasting Time in Radio Networks , 1999, ESA.

[36]  Nicolas Nisse,et al.  Graph searching with advice , 2009, Theor. Comput. Sci..

[37]  Andrzej Pelc,et al.  Distributed computing with advice: information sensitivity of graph coloring , 2007, Distributed Computing.

[38]  Andrzej Pelc,et al.  Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism , 2005, Theor. Comput. Sci..

[39]  Arunabha Sen,et al.  A new model for scheduling packet radio networks , 1997, Wirel. Networks.

[40]  Andrzej Pelc,et al.  Optimal Deterministic Broadcasting in Known Topology Radio Networks , 2006, Distributed Computing.

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

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