Round Robin is optimal for fault-tolerant broadcasting on wireless networks (Extended abstract)

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

Volumn 2161, Issue , 2001, Pages 452-463

  Clementi, Andrea E F ^a   Monti, Angelo ^b   Silvestri, Riccardo ^b  

^a UNIVERSITY OF ROME TOR VERGATA   (Italy)

^b SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; FAULT TOLERANT COMPUTER SYSTEMS; WIRELESS NETWORKS;

AD HOC WIRELESS NETWORKS; ADAPTIVE PROTOCOL; BROADCAST OPERATIONS; COMPLETION TIME; DISTRIBUTED PROTOCOLS; EXTENDED ABSTRACTS; FAULT-TOLERANT; PROTOCOL CANS;

INTERNET PROTOCOLS;

EID: 84943237670     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44676-1_38     Document Type: Conference Paper

References (21)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg (1991), A lower bound for radio broadcast, JCCS, 43, 290-298 (An extended abstract appeared also in ACM-STOC 1989).
2. R. Bar-Yehuda, O. Goldreich, and A. Itai (1992), On the time-complexity of broad-cast in multi-hop radio networks: An exponential gap between determinism and randomization, JCSS, 45, 104-126 (preliminary version in 6th ACM PODC, 1987).
3. I. Chlamtac and S. Kutten (1985), On Broadcasting in Radio Networks-Problem Analysis and Protocol Design, IEEE Transactions on Communications 33, 1240-1246.
4. B.S. Chlebus, L. Gąsieniec, A.M. Gibbons, A. Pelc, and W. Rytter (2000), De-terministic broadcasting in unknown radio networks, Proc. of 11th ACM-SIAM SODA, 861-870.
5. B. S. Chlebus, L. Gąsieniec, A. Ostlin, and J. M. Robson (2000), Deterministic radio broadcasting, Proc. of 27th ICALP, LNCS 1853, 717-728.
6. M. Chrobak, L. Gąsieniec, and W. Rytter (2000), Fast Broadcasting and Gossiping in Radio Networks, Proc. of 41st IEEE FOCS.
7. A.E.F. Clementi, P. Crescenzi, A. Monti, P. Penna, and R. Silvestri (2001), On Computing Ad-Hoc Selective Families, to appear on Proc. of 5th RANDOM, LNCS.
8. A.E.F. Clementi, A. Monti, and R. Silvestri (2001), Selective Families, Superimposed Codes, and Broadcasting in Unknown Radio Networks, Proc. of 12th ACM-SIAM SODA, 709-718.
9. A.E.F. Clementi, A. Monti, and R. Silvestri (2001), Distributed Multi-Broadcast in Unknown Radio Networks, to appear in Proc. of 20th ACM-PODC.
10. R. Cole, R. Hariharan, and P. Indyk (1999), Tree Pattern matching and subset matching in deterministic O(n log3 n)-time, Proc. of 10th ACM-SIAM SODA.
11. R. Gallager (1985), A Perspective on Multiaccess Channels, IEEE Trans. Inform. Theory, 31, 124-142.
12. I. Gaber and Y. Mansour (1995), Broadcast in Radio Networks, Proc. of 6th ACM-SIAM SODA, 577-585.
13. P. Indyk (1997), Deterministic Superimposed Coding with Application to Pattern Matching, Proc. of IEEE 38th FOCS, 127-136.
14. E. Kranakis, D. Krizanc, and A. Pelc (1998), Fault-Tolerant Broadcasting in Radio Networks, Proc. of 6th ESA, LNCS 1461, 283-294.
15. E. Kushilevitz and Y. Mansour (1998), Computation in Noisy Radio Networks, Proc. of 9th ACM-SIAM SODA, 236-243.
16. R. Motwani and P. Raghavan (1995), Randomized Algorithms, Cambridge Univer-sity Press.
17. E. Pagani and G. Rossi (1997), Reliable Broadcast in Mobile Multihop Packet Networks, Proc. of 3rd ACM-IEEE MOBICOM, 34-42.
18. A. Pelc (2000), Broadcasting in Radio Networks, unpublished manuscript.
19. T. S. Rappaport (1996), Wireless Communications: Principles and Practice, Prentice Hall.
20. L.G. Roberts (1972), Aloha Packet System with and without Slots and Capture, ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute.
21. J. E. Wieselthier, G. D. Ngyuyen, and A. Ephremides (2000), "On the Construction of energy-Efficient Broadcast and Multicast Trees in Wireless Networks", Proc. of 19th IEEE INFOCOM.