What is the use of collision detection (in wireless networks)?

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

Volumn 6343 LNCS, Issue , 2010, Pages 133-147

  Schneider, Johannes ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COLLISION DETECTION; COLORING PROBLEMS; DETERMINISTIC ALGORITHMS; LOWER AND UPPER BOUNDS; MAXIMAL INDEPENDENT SET; POLYLOGARITHMIC; RUNNING-IN; THREE PROBLEMS; TIME COMPLEXITY; UNIT DISK GRAPHS;

ASYMPTOTIC ANALYSIS; WIRELESS NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 78649864918     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15763-9_14     Document Type: Conference Paper

References (19)

1. Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci. 43(2) (1991)
2. Chlebus, B., Gcasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Symp. on Discrete Algorithms, SODA (2000)
3. Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci. 302(1-3) (2003)
4. Czyzowicz, J., Gasieniec, L., Kowalski, D.R., Pelc, A.: Consensus and mutual exclusion in a multiple access channel. In: Int. Symposium on Distributed Computing, DISC (2009)
5. Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms 5 (2007)
6. Erdoes, P., Frankl, P., Fiiredi, Z.: Families of finite sets in which no set is covered by the union of r others. Israel J. of Math. 51 (1985)
7. Greenberg, A.G., Winograd, S.: A lower bound on the time needed in the worst case to resolve conflicts deterministically in multiple access channels. J. ACM 32(3) (1985)
8. Ilcinkas, D., Kowalski, D.R., Pelc, A.: Fast radio broadcasting with advice. Theor. Comput. Sci. 411(14-15) (2010)
9. Jurdziński, T., Stachowiak, G.: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 535-549. Springer, Heidelberg (2002)
10. Kowalski, D.R., Pelc, A.: Broadcasting algorithms in radio networks with unknown topology. In: Distributed Computing, vol. 18 (2005)
11. Kowalski, D.R., Pelc, A.: Leader election in ad hoc radio networks: A keen ear helps. In: ICALP (2) (2009)
12. Kuhn, F., Moscibroda, T., Nieberg, T., Wattenhofer, R.: Fast Deterministic Distributed Maximal Independent Set Computation on Growth-Bounded Graphs. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 273-287. Springer, Heidelberg (2005)
13. Kushilevitz, E., Mansour, Y.: An omega(d log(n/d)) lower bound for broadcast in radio networks. In: Symp. on Principles of Distributed Computing (PODC) (1993)
14. Moscibroda, T., Wattenhofer, R.: Maximal Independent Sets in Radio Networks. In: Symp. on Principles of Distributed Computing, PODC (2005)
15. Schneider, J., Wattenhofer, R.: A Log-Star Distributed Maximal Independent Set Algorithm for Growth-Bounded Graphs. In: Symp. on Principles of Distributed Computing PODC (2008)
16. Schneider, J., Wattenhofer, R.: Coloring Unstructured Wireless Multi-Hop Networks. In: Symp. on Principles of Distributed Computing, PODC (2009)
17. Schneider, J., Wattenhofer, R.: What Is the Use of Collision Detection (in Wireless Networks). TIK Technical Report 322 (2010), ftp://ftp.tik.ee.ethz. ch/pub/publications/TIK-Report-322.pdf
18. Tobagi, F.A., Kleinrock, L.: Packet Switching in Radio Channels: Part II - The Hidden Terminal Problem in Carrier Sense Multiple Access and the Busy Tone Solution. COM 23(12) (1975)
19. Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing 15 (1986)