The Wakeup Problem in Synchronous Broadcast Systems

This paper studies the differences between two levels of synchronization in a distributed broadcast system (or a multiple-access channel). In the globally synchronous model, all processors have access to a global clock. In the locally synchronous model, processors have local clocks ticking at the same rate, but each clock starts individually when the processor wakes up. We consider the fundamental problem of waking up all n processors of a completely connected broadcast system. Some processors wake up spontaneously, while others have to be woken up. Only awake processors can send messages; a sleeping processor is woken up upon hearing a message. The processors hear a message in a given round if and only if exactly one processor sends a message in that round. Our goal is to wake up all processors as fast as possible in the worst case, assuming an adversary controls which processors wake up and when. We analyze the problem in both the globally synchronous and locally synchronous models with or without the assumption that n is known to the processors. We propose randomized and deterministic algorithms for the problem, as well as lower bounds in some of the cases. These bounds establish a gap between the globally synchronous and locally synchronous models.

[1]  Howard Frank,et al.  Routing in Packet-Switching Broadcast Radio Networks , 1976, IEEE Trans. Commun..

[2]  S.A. Gronemeyer,et al.  Advances in packet radio technology , 1978, Proceedings of the IEEE.

[3]  Peter March,et al.  On the stability of the Ethernet , 1985, STOC '85.

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

[5]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[6]  Imrich Chlamtac,et al.  Tree-Based Broadcasting in Multihop Radio Networks , 1987, IEEE Transactions on Computers.

[7]  Philippe Flajolet,et al.  Estimating the multiplicities of conflicts to speed their resolution in multiple access channels , 1987, JACM.

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

[9]  Frank Thomson Leighton,et al.  Analysis of backoff protocols for multiple access channels , 1987, STOC '87.

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

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

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

[13]  Michael J. Fischer,et al.  The Wakeup Problem , 1996, SIAM J. Comput..

[14]  Bruce M. Kapron,et al.  Limits on the Power of Parallel Random Access Machines with Weak Forms of Write Conflict Resolution , 1996, J. Comput. Syst. Sci..

[15]  Jacques Mazoyer.  On Optimal Solutions to the Firing Squad Synchronization Problem , 1996, Theor. Comput. Sci..

[16]  Eyal Kushilevitz,et al.  Computation in noisy radio networks , 2005, SODA '98.

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

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