Time of deterministic broadcasting in radio networks with local knowledge

SIAM Journal on Computing

Volumn 33, Issue 4, 2004, Pages 870-891

  Kowalski, Dariusz R ^a,b   Pelc, Andrzej ^c  

^a UNIVERSITY OF WARSAW   (Poland)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

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

Author keywords

Broadcasting; Deterministic; Distributed; Radio network

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTIONS; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; RADIO BROADCASTING; SET THEORY; SIGNAL RECEIVERS; SPURIOUS SIGNAL NOISE; THEOREM PROVING; TRANSMITTERS;

DETERMINISTIC BROADCASTING; DISTRIBUTED; NODES (GRAPHS); RADIO NETWORKS;

GRAPH THEORY;

EID: 4544330060     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539702419339     Document Type: Article

References (27)

1. N. ALON, A. BAR-NOY, N. LINIAL, AND D. PELEG, A lower bound for radio broadcast, J. Comput. System Sci., 43 (1991), pp. 290-298.
2. B. AWERBUCH, A new distributed depth-first-search algorithm, Inform. Process. Lett., 20 (1985), pp. 147-150.
3. R. BAR-YEHUDA, O. GOLDREICH, AND A. ITAI, On the time complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, J. Comput. System Sci., 45 (1992), pp. 104-126.
4. R. BAR-YEHUDA, O. GOLDREICH, AND A. ITAI, Errata Regarding "On the time complexity of broadcast in radio networks: An exponential gap between determinism and randomization," http://www.wisdom.weizmann.ac.il/mathusers/ oded/p-bgi.html, 2002.
5. S. BASAGNI, D. BRUSCHI, AND I. CHLAMTAC, A mobility-transparent deterministic broadcast mechanism for ad hoc networks, IEEE/ACM Trans. on Networking, 7 (1999), pp. 799-807.
6. S. BASAGNI, A. D. MYERS, AND V. R. SYROTIUK, Mobility-independent flooding for real-time multimedia applications in ad hoc networks, in Proceedings of the IEEE Emerging Technologies Symposium on Wireless Communications & Systems, Richardson, TX, 1999.
7. D. BRUSCHI AND M. DEL PINTO, Lower bounds for the broadcast problem in mobile radio networks, Distr. Comp., 10 (1997), pp. 129-135.
8. I. CHLAMTAC AND A. FARAGÓ, Making transmission schedule immune to topology changes in multi-hop packet radio networks, IEEE/ACM Trans. on Networking, 2 (1994), pp. 23-29.
9. I. CHLAMTAC, A. FARAGÓ, AND H. ZHANG, Time-spread multiple access (TSMA) protocols for multihop mobile radio networks, IEEE/ACM Trans. on Networking, 5 (1997), pp. 804-812.
10. I. CHLAMTAC AND O. WEINSTEIN, The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans. on Communications, 39 (1991), pp. 426-433.
11. B. S. CHLEBUS, L. GASIENIEC, A. GIBBONS, A. PELC, AND W. RYTTER, Deterministic broadcasting in unknown radio networks, Distributed Computing, 15 (2002), pp. 27-38.
12. B. S. CHLEBUS, L. GA̧SIENIEC, A. ÖSTLIN, AND J. M. ROBSON, Deterministic radio broadcasting, in Proceedings of the 27th International Colloquium on Automata, Languages and Programming (ICALP'2000), Lecture Notes in Comput. Sci. 1853, Springer-Verlag, Berlin, 2000, pp. 717-728.
13. M. CHROBAK, L. GA̧SIENIEC, AND W. RYTTER, Fast broadcasting and gossiping in radio networks, in Proceedings of the 41st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Redondo Beach, CA, 2000, pp. 575-581.
14. A. E. F. CLEMENTI, A. MONTI, AND R. SILVESTRI, Selective families, superimposed codes, and broadcasting on unknown radio networks, in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2001, pp. 709-718.
15. A. CZUMAJ AND W. RYTTER, Broadcasting algorithms in radio networks with unknown topology, in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, Cambridge, MA, 2003, pp. 492-501.
16. G. DE MARCO AND A. PELC, Faster broadcasting in unknown radio networks, Inform. Process. Lett., 79 (2001), pp. 53-56.
17. P. ERDOS, P. FRANKL, AND Z. FÜREDI, Families of finite sets in which no set is covered by the union of r others, Israel J. Math., 51 (1985), pp. 79-89.
18. I. GABER AND Y. MANSOUR, Broadcast in radio networks, in Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 1995, pp. 577-585.
19. F. K. HWANG, The time complexity of deterministic broadcast radio networks, Discrete Appl. Math., 60 (1995), pp. 219-222.
20. P. INDYK, Explicit constructions of selectors and related combinatorial structures, with applications, in Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, 2002, pp. 697-704.
21. W. H. KAUTZ AND R. R. C. SINGLETON, Nonrandom binary superimposed codes, IEEE Trans. on Inform. Theory, 10 (1964), pp. 363-377.
22. D. KOWALSKI AND A. PELC, Foster deterministic broadcasting in ad hoc radio networks, in Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science, Berlin, Lecture Notes in Comput. Sci. 2607, Springer-Verlag, Berlin, 2003, pp. 109-120.
23. D. KOWALSKI AND A. PELC, Broadcasting in undirected ad hoc radio networks, in Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, Boston, 2003, pp. 73-82.
24. D. KOWALSKI AND A. PELC, Time of radio broadcasting: Adaptiveness vs. obliviousness and randomization vs. determinism, in Proceedings of the 10th Colloquium on Structural Information and Communication Complexity, Umea, Sweden, 2003, pp. 195-210.
25. E. KUSHILEVITZ AND Y. MANSOUR, An Ω(D log(N / D)) lower bound for broadcast in radio networks, SIAM J. Comput., 27 (1998), pp. 702-712.
26. D. PELEG, Deterministic Radio Broadcast with No Topological Knowledge, manuscript, 2000.
27. A. TA-SHMA, C. UMANS, AND D. ZUCKERMAN, Loss-less condensers, unbalanced expanders, and extractors, in Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, 2001, pp. 143-152.