Probabilistic algorithms for the wakeup problem in single-hop radio networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2518 LNCS, Issue , 2002, Pages 535-549

  Jurdziński, Tomasz ^a,b   Stachowiak, Grzegorz ^a  

^a UNIVERSITY OF WROC AW   (Poland)

^b CHEMNITZ UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BROADCAST SYSTEMS; LOCAL SYNCHRONIZATIONS; PROBABILISTIC ALGORITHM; QUADRATIC ALGORITHMS; RADIO NETWORKS; SINGLE-HOP; SYNCHRONOUS MODELS; POLYLOGARITHMIC; SINGLE HOP;

ARTIFICIAL INTELLIGENCE; COMPUTERS;

ALGORITHMS;

EID: 84878643217     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36136-7_47     Document Type: Conference Paper

References (18)

1. N. Alon, A. Bar-Noy, N. Linial, D. Peleg, A Lower Bound for Radio Broadcast, Journal of Computer Systems Sciences 43, (1991), 290-298.
2. R. Bar-Yehuda, O. Goldreich, A. Itai, On the Time-Complexity of Broadcast in Multi-hop Radio Networks: An Exponential Gap Between Determinism and Randomization. JCSS 45(1), (1992), 104-126.
3. I. Chlamtac, S. Kutten, On Broadcasting in Radio Networks - Problem Analysis and Protocol Design, IEEE Trans. on Communications 33, 1985.
4. B. S. Chlebus, Randomized communication in radio networks, a chapter in "Handbook on Randomized Computing" P. M. Pardalos, S. Rajasekaran, J. H. Reif, J. D. P. Rolim, (Eds.), Kluwer Academic Publishers, to appear.
5. B. Chlebus, L. Ga̧sieniec, A. Lingas, A.T. Pagourtzis, Oblivious gossiping in ad-hoc radio networks, in Proc., DIALM 2001, 44-51.
6. M. Chrobak, L. Ga̧sieniec, W. Rytter, Fast Broadcasting and Gossiping in Radio Networks, in Proc. FOCS, 2000, 575-581. (Pubitemid 32075926)
7. S. Even, S. Rajsbaum, Unison, canon, and sluggish clocks in networks controlled by a synchronizer, Mathematical Systems Theory 28, (1995), 421-435.
8. M.J. Fischer, S. Moran, S. Rudich, G. Taubenfeld, The Wakeup Problem, SIAM Journal of Computing 25, (1996), 1332-1357. (Pubitemid 126584674)
9. P. Fraigniaud, A. Pelc, D. Peleg, S. Perennes, Assigning labels in unknown anonymous networks, Distributed Computing 14(3), 163-183 (2001). (Pubitemid 32780315)
10. L. Ga̧sieniec, A. Pelc, D. Peleg, The wakeup problem in synchronous broadcast systems, PODC 2000, 113-121. (Pubitemid 32072900)
11. J. Goodman,A. G. Greenberg, N. Madras, P. March, On the stability of Ethernet, 17th ACM-STOC, 1985, 379-387.
12. J. Hastad, T. Leighton, B. Rogoff, Analysis of Backoff Protocols for Multiple Access Channels, 19th ACM-STOC, 1987, 241-253. (Pubitemid 18643411)
13. P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, Proc. SODA, 2002.
14. E. Kushilevitz, Y. Mansour, An Ω(Dlog(N/D)) Lower Bound for Broadcast in Radio Networks, SIAM J. Comput. 27(3), (1998), 702-712. (Pubitemid 128490835)
15. J. Mazoyer, On optimal solutions to the firing squad synchronization problem, Theoretical Computer Science 168, (1996), 367-404. (Pubitemid 126412046)
16. K. Nakano,S. Olariu, Energy-Efficient Initialization Protocols for Single-Hop Radio Networks with no Collision Detection, IEEE Trans. on Parallel and Distributed Systems, Vol. 11, No. 8, pp. 851-863, Aug. 2000.
17. D. Peleg, Deterministic radio broadcast with no topological knowledge, a manuscript, 2000.
18. D. E. Willard, Log-logarithmic selection resolution protocols in multiple access channel, SIAM Journal on Computing 15 (1986), 468-477.