An information theoretic lower bound for broadcasting in radio networks

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

Volumn 2996, Issue , 2004, Pages 534-546

  Brito, Carlos ^a   Gafni, Eli ^a   Vaya, Shailesh ^a  

^a Engineering IV   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION THEORY; RADIO BROADCASTING; TOPOLOGY;

ARBITRARY NUMBER; CONNECTIVITY INFORMATION; DETERMINISTIC BROADCASTING; DETERMINISTIC PROTOCOLS; INFORMATION-THEORETIC LOWER BOUNDS; LOWER BOUNDS; RADIO NETWORKS;

BROADCASTING;

EID: 35048886533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24749-4_47     Document Type: Article

References (26)

1. N. Alon, A. Bar-Noy, N. Linial and D. Peleg. A lower bound for radio broadcast, Journal of Computer Science and System Sciences 43(1991),290-298.
2. B. Awerbuch. A new distributed depth-first-search algorithm, Information Processing Letters 20 (1985), 147-150.
3. 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
4. Andrzej Pelc. Personal communication, November 2002.
5. A. Czumaj, W. Rytter. Broadcasting Algorithms in Radio Networks with Unknown Topology, To appear in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOGS'03), Cambridge, MA.
6. B. Bruschi and M. Del Pinto. Lower bounds for the broadcast problem in mobile radio networks, Distr. Comp. 10(1997), 129-135
7. I. Chlamtac and A. Farago. Making transmission schedule immune to topology changes in multi-hop packet radio networks, IEEE/ACM Trans, on Networking 2(1994), 23-29
8. I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop radio networks, IEEE Trans, on Communications 39(1991), 426-433.
9. B.S. Chelbus, L. Gasieniec, A. Gibbons, A. Pelc and W. Rytter. Deterministic broadcasting in unknown radio networks, 11th ACM-SIAM SODA, 861-870
10. B.S. Chelbus, L. Gasieniec, A. Gibbons, A. Ostlin and J.M. Robson. Deterministic radio broadcasting. Proc. 27th Int. Collo. on Automata, Languages and Programming (ICALP'2000),LNCS 1853, 717-728
11. M. Chrobak, L. Gasieniec and W. Rytter. Fast broadcasting and gossiping in radio networks, Proc. 41st Symposium an Foundations of Computer Science (FOGS'2000), 575-581
12. 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
13. Cruz, R., and Hajek, B., A new upper bound to the throughput of a multi-access broadcast channel., IEEE Trans. Inf. Theory IT-28, 3 (May 1982), 402-405.
14. G. De Marco and A. Pelc. Faster broadcasting in unknown radio networks, Information Processing Letter 79(2001),53-56.
15. P. Erdös, P. Frankl, and Z. Furedi. Families of finite sets in which no set is covered by the union of r others, Israel Journal of Math. 51(1985),79-89.
16. I.Gabour and Y. Mansour, Broadcast in radio networks, Proc. 6th Ann. ACMSIAM Symp. on Discrete Algorithms (SODA'1996),577-585.
17. F.K.Hwang. The time complexity of deterministic broadcast in radio networks, Discrete Applied Mathematics 60(1995),219-222.
18. P. Indyk, Explicit constructions of selector and related combinatorial structures, with applications, Proc. 13th Ann. ACM-SIAM Symposium on Disceret Algorithms (SODA'2002), 697-704.
19. W.H.Kauz and R.R.C. Singleton, Nonrandom binary superimposed codes, IEEE Trans, on Information Theory 10(1964), 363-377.
20. E. Kushilevitz and Y. Mansour, An Ω(Dlog(N/D)) lower bound for broadcast in radio networks, SIAM J. on Computing 27(1998), 702-712
21. M. MOLLE, Unifications and extensions of the multiple access communications problem. Ph.D. Thesis, University of California, Los Angeles, Los Angeles, Calif., July 1981.
22. O. Reingold, S. Vadhan and A. Wigderson, Entropy waves, the zig-zag product, and new constant degree expanders and extractors, Proc. 41st Symposium on Foundations of Computer Science (FOCS'2000)3-13
23. Dariusz R. Kowalski and Andrzej Pelc, Deterministic Broadcasting Time in Radio Networks of Unknown Topology, Accepted to Proc. 43rd Symposium on Foundations of Computer Science (FOGS'2002)
24. Ming Li, Paul Vitanyi, Introduction to Kolmogorov Complexity and it's applicalions, Springer Verlag, Second Edition
25. Thomas M. Cover, Joy A. Thomas Elements of Information Theory, Wiley Series in Telecommunications, 1990
26. Errata regarding "On the Time-Complexity of Broadcast in Radio Networks: An Exponential Gap Between Determinism and Randomization", Dec. 2002, available from http : //www.wisdom.weizmann.ac.il/oded/pbgi.html