Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks

This publication has 14 references indexed in Scilit:

• Fast broadcasting and gossiping in radio networks
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
• Oblivious gossiping in ad-hoc radio networks
  Published by Association for Computing Machinery (ACM) ,2001
• Assigning labels in an unknown anonymous network with a leader
  Distributed Computing, 2001
• Energy-efficient initialization protocols for single-hop radio networks with no collision detection
  IEEE Transactions on Parallel and Distributed Systems, 2000
• An $\Omega(D\log (N/D))$ Lower Bound for Broadcast in Radio Networks
  SIAM Journal on Computing, 1998
• The Wakeup Problem
  SIAM Journal on Computing, 1996
• On optimal solutions to the firing squad synchronization problem
  Theoretical Computer Science, 1996
• Unison, canon, and sluggish clocks in networks controlled by a synchronizer
  Theory of Computing Systems, 1995
• A lower bound for radio broadcast
  Journal of Computer and System Sciences, 1991
• Log-Logarithmic Selection Resolution Protocols in a Multiple Access Channel
  SIAM Journal on Computing, 1986