Broadcasting in unreliable radio networks

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2010, Pages 336-345

  Kuhn, Fabian ^a   Lynch, Nancy ^b   Newport, Calvin ^b   Oshman, Rotem ^b   Richa, Andrea ^c  

^a UNIVERSITY OF LUGANO   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c Arizona State University   (United States)

Author keywords

Broadcast; Dual graphs; Unreliable networks

Indexed keywords

BROADCAST; COLLISION DETECTION; CONNECTED GRAPH; DETERMINISTIC ALGORITHMS; DUAL GRAPHS; HIGH PROBABILITY; LOWER BOUNDS; NEW MODEL; RADIO NETWORKS; RANDOMIZED ALGORITHMS; RELIABLE MODELS; THEORETICAL BOUNDS; THEORETICAL MODELS; THEORY AND PRACTICE; UNDIRECTED GRAPH; UNDIRECTED NETWORK; UNRELIABLE LINKS; UNRELIABLE NETWORK;

ALGORITHMS; DISTRIBUTED COMPUTER SYSTEMS; RADIO; RADIO BROADCASTING;

RADIO LINKS;

EID: 77956254147     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835698.1835779     Document Type: Conference Paper

References (30)

1. N. Alon, A. Bar-Noy, N. Linial, and D. Peleg. A lower bound for radio broadcast. J. Comput. Syst. Sci., 43(2):290-298, 1991.
2. R. Bar-Yehuda, O. Goldreich, and A. Itai. On the time-complexity of broadcast in radio networks: an exponential gap between determinism randomization. In PODC'87: Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, pages 98-108, New York, NY, USA, 1987. ACM.
3. D. Bruschi and M. Del Pinto. Lower bounds for the broadcast problem in mobile radio networks. Distrib. Comput., 10(3):129-135, 1997.
4. K.-W. Chin, J. Judge, A. Williams, and R. Kermode. Implementation Experience with MANET Routing Protocols. SIGCOMM Computer Communication Review, 32(5):49-59, 2002.
5. B. S. Chlebus, L. Gasieniec, A. Gibbons, A. Pelc, and W. Rytter. Deterministic broadcasting in unknown radio networks. In Symposium on Discrete Algorithms, pages 861-870, 2000.
6. M. Chlebus, L. Gasieniec, A. Ostlin, and J. Robson. Deterministic broadcasting in radio networks. In the International Colloquium on Automata, Languages and Programming (ICALP), 2000.
7. M. Chrobak, L. Gasieniec, and W. Rytter. Fast broadcasting and gossiping in radio networks. Journal of Algorithms, 43:177-189, 2002.
8. A. Clementi, A. Monti, and R. Silvestri. Selective families, superimposed codes, and broadcasting on unknown radio networks. In the annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 709-718, Philadelphia, PA, USA, 2001. Society for Industrial and Applied Mathematics.
9. A. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. Journal of Parallel Distributed Computing, 64:89-96, 2004.
10. A. E. F. Clementi, A. Monti, F. Pasquale, and R. Silvestri. Broadcasting in dynamic radio networks. J. Comput. Syst. Sci., 75(4):213-230, 2009.
11. A. E. F. Clementi, A. Monti, and R. Silvestri. Round robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel Distrib. Comput., 64(1):89-96, 2004.
12. A. Czumaj and W. Rytter. Broadcasting algorithms in radio networks with unknown topology. J. Algorithms, 60(2):115-143, 2006.
13. D. S. J. De Couto, D. Aguayo, J. Bicket, and R. Morris. A High-Throughput Path Metric for Multi-Hop Wireless Routing. Wireless Networks, 11(4):419-434, 2005.
14. P. Erdos, P. Frankl, and Z. Furedi. Familes of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79-89, 1985.
15. F. Galčík. Centralized communication in radio networks with strong interference. In SIROCCO'08: Proceedings of the 15th international colloquium on Structural Information and Communication Complexity, pages 277-290, Berlin, Heidelberg, 2008. Springer-Verlag.
16. F. Galčík, L. Gasieniec, and A. Lingas. Efficient broadcasting in known topology radio networks with long-range interference. In PODC'09: Proceedings of the 28th ACM symposium on Principles of distributed computing, pages 230-239, New York, NY, USA, 2009. ACM.
17. O. Goussevskaia, T. Moscibroda, and R. Wattenhofer. Local broadcasting in the physical interference model. In M. Segal and A. Kesselman, editors, DIALM-POMC, pages 35-44. ACM, 2008.
18. P. Gupta and P. Kumar. The capacity of wireless networks. IEEE Transactions on information theory, 46:388-404.
19. W. Kautz and R. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on Information Theory, 10(4):363-377, 1964.
20. D. R. Kowalski and A. Pelc. Broadcasting in undirected ad hoc radio networks. Distrib. Comput., 18(1):43-57, 2005.
21. D. R. Kowalski and A. Pelc. Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theor. Comput. Sci., 333(3):355-371, 2005.
22. F. Kuhn, N. Lynch, and C. Newport. Brief announcement: Hardness of broadcasting in wireless networks with unreliable communication. In The Annual ACM Symposiun on Principles of Distributed Computing (PODC), pages 330-331, 2009.
23. E. Kushilevitz and Y. Mansour. An (Dlog(N=D)) lower bound for broadcast in radio networks. SIAM J. Comput., 27(3):702-712, 1998.
24. H. Lundgren, E. Nordstro, and C. Tschudin. Coping with Communication Gray Zones in IEEE 802.11b Based Ad Hoc Networks. In the International Workshop on Wireless Mobile Multimedia, 2002.
25. T. Moscibroda and R. Wattenhofer. The complexity of connectivity in wireless networks. In INFOCOM. IEEE, 2006.
26. C. Newport, D. Kotz, Y. Yuan, R. Gray, J. Liu, and C. Elliott. Experimental Evaluation of Wireless Simulation Assumptions. Simulation, 83(9):643, 2007.
27. C. Newport and N. Lynch. Modeling Radio Networks. In the International Conference on Concurrency Theory (CONCUR), 2009.
28. D. Peleg. Time-efficient broadcasting in radio networks. In DISC'07: Proceedings of the 21st international symposium on Distributed Computing, pages 3-4, Berlin, Heidelberg, 2007. Springer-Verlag.
29. S. Schmid and R. Wattenhofer. Algorithmic models for sensor networks. In IPDPS. IEEE, 2006.
30. P. von Rickenbach, R. Wattenhofer, and A. Zollinger. Algorithmic models of interference in wireless ad hoc and sensor networks. IEEE/ACM Trans. Netw., 17(1):172-185, 2009.