The Wake-Up Problem in Multi-Hop Radio Networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 15, Issue , 2004, Pages 985-993

  Chrobak, Marek ^a   Ga̧sieniec, Leszek ^b   Kowalski, Dariusz ^c,d  

^a University of California Riverside   (United States)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

^c UNIVERSITY OF WARSAW   (Poland)

^d MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; ELECTRIC NETWORK TOPOLOGY; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; PROBLEM SOLVING; PROGRAM PROCESSORS; RADIO BROADCASTING; SCHEDULING;

MULTI-HOP RADIO NETWORKS; WAKE-UP PROBLEM;

TELECOMMUNICATION NETWORKS;

EID: 1842434511     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Bar-Yehuda, O. Goldreich and A. Itai, On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization, Journal of Computer and System Sciences 45 (1992), 104-126.
2. R. Bar-Yehuda, A. Israeli and A. Itai, Multiple communication in multihop radio networks, SIAM J. on Computing 22 (1993), 875-887.
3. D. Bruschi and M. Del Pinto, Lower bounds for the broadcast problem in mobile radio networks, Distributed Computing 10 (1997), 129-135.
4. I. Chlamtac and O. Weinstein, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. on Communications 39 (1991), 426-433.
5. B.S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter, Deterministic broadcasting in unknown radio networks, Distributed Computing 15 (2002), 27-38.
6. B.S. Chlebus, L. Ga̧sieniec, A. Östlin and J.M. Robson, Deterministic radio broadcasting, Proc. 27th Int. Coll. on Automata, Languages and Programming (ICALP'2000), LNCS 1853, 717-728.
7. M. Chrobak, L. Ga̧sieniec and W. Rytter, Fast broadcasting and gossiping in radio networks, Proc. 41st Symposium on Foundations of Computer Science (FOCS'2000), 575-581.
8. A. Clementi, P. Crescenzi, A. Monti, P. Penna and R. Silvestri, On computing ad-hoc selective families, Proc. 5th International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM-APPROX'2001), 211-222.
9. A.E.F. Clementi, A. Monti and R. Silvestri, Selective families, superimposed codes, and broadcasting on unknown radio networks, Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2001), 709-718.
10. A. Czumaj and W. Rytter, Broadcasting Algorithms in Radio Networks with Unknown Topology, Proc. 44th Symposium on Foundations of Computer Science (FOCS'2003), to appear.
11. L. Ga̧sieniec, A. Pelc and D. Peleg, The wakeup problem in synchronous broadcast systems, SIAM Journal on Discrete Mathematics 14 (2001), 207-222.
12. P. Indyk, Explicit constructions of selectors and related combinatorial structures, with applications, Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA'2002), 697-704.
13. T. Jurdziński, G. Stachowiak, Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks, In Proceedings of 13th Annual International Symposium on Algorithms and Computation (ISAAC'2002), 535-549.
14. D. Kowalski and A. Pelc, Faster deterministic broadcasting in ad hoc radio networks, Proc. 20th Annual Symposium on Theoretical Aspects of Computer Science (STACS'2003), 109-120.
15. D. Kowalski and A. Pelc, Broadcasting in undirected ad hoc radio networks, Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC'2003), 73-82.
16. E. Kushilevitz and Y. Mansour, An Ω(D log(N/D)) lower bound for broadcast in radio networks, SLAM J. on Computing 27 (1998), 702-712.
17. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
18. D. Peleg, Deterministic radio broadcast with no topological knowledge, manuscript (2000).