{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:57Z","timestamp":1759637937524},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157622"},{"type":"electronic","value":"9783642157639"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15763-9_14","type":"book-chapter","created":{"date-parts":[[2010,8,24]],"date-time":"2010-08-24T09:48:44Z","timestamp":1282643324000},"page":"133-147","source":"Crossref","is-referenced-by-count":24,"title":["What Is the Use of Collision Detection (in Wireless Networks)?"],"prefix":"10.1007","author":[{"given":"Johannes","family":"Schneider","sequence":"first","affiliation":[]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Comput. Syst. Sci.\u00a043(2) (1991)","DOI":"10.1016\/0022-0000(91)90015-W"},{"key":"14_CR2","unstructured":"Chlebus, B., Gcasieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. In: Symp. on Discrete Algorithms, SODA (2000)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theor. Comput. Sci.\u00a0302(1-3) (2003)","DOI":"10.1016\/S0304-3975(02)00851-4"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-642-04355-0_51"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. Journal of Discrete Algorithms\u00a05 (2007)","DOI":"10.1016\/j.jda.2006.07.001"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"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.\u00a051 (1985)","DOI":"10.1007\/BF02772959"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"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\u00a032(3) (1985)","DOI":"10.1145\/3828.214125"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Ilcinkas, D., Kowalski, D.R., Pelc, A.: Fast radio broadcasting with advice. Theor. Comput. Sci.\u00a0411(14-15) (2010)","DOI":"10.1016\/j.tcs.2010.01.004"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/3-540-36136-7_47","volume-title":"Algorithms and Computation","author":"T. Jurdzi\u0144ski","year":"2002","unstructured":"Jurdzi\u0144ski, T., Stachowiak, G.: Probabilistic Algorithms for the Wakeup Problem in Single-Hop Radio Networks. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol.\u00a02518, pp. 535\u2013549. Springer, Heidelberg (2002)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting algorithms in radio networks with unknown topology. In: Distributed Computing, vol. 18 (2005)","DOI":"10.1007\/s00446-005-0126-7"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Leader election in ad hoc radio networks: A keen ear helps. In: ICALP (2) (2009)","DOI":"10.1007\/978-3-642-02930-1_43"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11561927_21","volume-title":"Distributed Computing","author":"F. Kuhn","year":"2005","unstructured":"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.\u00a03724, pp. 273\u2013287. Springer, Heidelberg (2005)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/164051.164059"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Wattenhofer, R.: Maximal Independent Sets in Radio Networks. In: Symp. on Principles of Distributed Computing, PODC (2005)","DOI":"10.1145\/1073814.1073842"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1400751.1400758"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: Coloring Unstructured Wireless Multi-Hop Networks. In: Symp. on Principles of Distributed Computing, PODC (2009)","DOI":"10.1145\/1582716.1582751"},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1007\/978-3-642-15763-9_14"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"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\u00a023(12) (1975)","DOI":"10.1109\/TCOM.1975.1092767"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM Journal on Computing\u00a015 (1986)","DOI":"10.1137\/0215032"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15763-9_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,7]],"date-time":"2021-11-07T02:57:21Z","timestamp":1636253841000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15763-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157622","9783642157639"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15763-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}