Activating anonymous ad hoc radio networks

Distributed Computing

Volumn 19, Issue 5-6, 2007, Pages 361-371

  Pelc, Andrzej ^a  

^a UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

Author keywords

Activating; Ad hoc network; Algorithm; Anonymous; Asynchronous; Broadcasting; Radio network; Synchronous

Indexed keywords

ALGORITHMS; MESSAGE PASSING; RADIO BROADCASTING; TOPOLOGY;

DETERMINISTIC ALGORITHMS; RADIO NETWORKS; SYNCHRONOUS COMMUNICATION;

AD HOC NETWORKS;

EID: 33947651047     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00446-007-0021-5     Document Type: Article

References (26)

1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. I Comput. Syst. Sci. 43, 290-298 (1991)
2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of 12th Symposium on the Theory of Computing, pp. 82-93 (1980)
3. Attiya, H., Snir, M., Warmuth, M.: Computing on an anonymous ring. J. ACM 35, 845-875 (1988)
4. Bar-Yehuda, R., Goldreich, Q, Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. I Comput. Syst. Sci. 45, 104-126 (1992)
5. Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proceedings of 18th ACM Symposium on Principles of Distributed Computing (1999)
6. Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput. 10, 129-135 (1997)
7. Chlamtac, I., Kutten, S.: On broadcasting in radio networksproblem analysis and protocol design. IEEE Trans. Commun. 33, 1240-1246 (1985)
8. Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Trans. Commun. 39, 426-433 (1991)
9. Chlebus, B., Gasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distrib. Comput. 15, 27-38 (2002)
10. Chlebus, B., Gasieniec, L., Östlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Proceedings of 27th International Colloquium on Automata, Languages and Programming (ICALP'2000). LNCS, vol. 1853, pp. 717-728
11. Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proceedings of 23rd Annual Symposium on Principles of Distributed Computing (PODC 2004)
12. Chlebus, B., Rokicki, M.: Asynchronous broadcast in radio networks. In: Proceedings of 11th International Collaboration on Structural Information and Communication Complexity, (SIROCCO'2004). LNCS, vol. 3104, pp. 57-68
13. Chrobak, M., Ga̧sieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In: Proceedings of 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 985-993
14. Chrobak, M., Ga̧sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proceedings of 41st Symposium on Foundations of Computer Science (FOCS'2000), pp. 575-581
15. Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings of 12th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'200.1), pp. 709-718
16. Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proceedings of 44th Symposium on Foundations of Computer Science (FOCS'2003), pp. 492-501
17. Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proceedings of 16th ACM-SIAM Symposium on Discrete Algorithms (SODA 2005)
18. Gaber, I., Mansour, Y.: Centralized broadcast in multihop radio networks. J. Algorithms 46(1), 1-20 (2003)
19. Ga̧sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM I Discret. Math. 14, 207-222 (2001)
20. Ga̧sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings of 24th Annual ACM Symposium on Principles Of Distributed Computing (PODC 2005)
21. Jurdzinski, T., Stachowiak, G: Probabilistic algorithms for the wakeup problem in single-hop radio networks. In: Proceedings of 13th International Symposium on Algorithms and Computation (ISAAC 2002). LNCS, vol. 2518, pp. 535-549
22. Kowalski, D., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci. 333, 355-371 (2005)
23. Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distrib. Comput. 18, 43-57 (2005)
24. Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. (to appear)
25. Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean functions on anonymous networks. Inf. Comput. 114, 214-236 (1994)
26. Kushilevitz, E., Mansour, Y.: An Ω (D log(N/JD)) lower bound for broadcast in radio networks. SIAM J. Comput. 27, 702-712 (1998)