Centralized broadcast in multihop radio networks

[1]  Andrzej Pelc,et al.  Faster broadcasting in unknown radio networks , 2001, Inf. Process. Lett..

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

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

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

[5]  Imrich Chlamtac,et al.  A mobility-transparent deterministic broadcast mechanism for ad hoc networks , 1999, TNET.

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

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

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

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

[10]  Baruch Awerbuch,et al.  Online tracking of mobile users , 1995, JACM.

[11]  Frank K. Hwang The Time Complexity of Deterministic Broadcast Radio Networks , 1995, Discret. Appl. Math..

[12]  Yishay Mansour,et al.  Broadcast in radio networks , 1995, SODA '95.

[13]  N Linial,et al.  Low diameter graph decompositions , 1993, Comb..

[14]  Yehuda Afek,et al.  Sparser: A Paradigm for Running Distributed Algorithms , 1992, J. Algorithms.

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

[16]  Baruch Awerbuch,et al.  Routing with Polynomial Communication-Space Trade-Off , 1992, SIAM J. Discret. Math..

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

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

[19]  Baruch Awerbuch,et al.  Network synchronization with polylogarithmic overhead , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[20]  Baruch Awerbuch,et al.  Sparse partitions , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

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

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