{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:12:41Z","timestamp":1759637561954,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642043543"},{"type":"electronic","value":"9783642043550"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04355-0_51","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"512-526","source":"Crossref","is-referenced-by-count":7,"title":["Consensus and Mutual Exclusion in a Multiple Access Channel"],"prefix":"10.1007","author":[{"given":"Jurek","family":"Czyzowicz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leszek","family":"G\u0105sieniec","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dariusz R.","family":"Kowalski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrzej","family":"Pelc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"N. Alon","year":"1991","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. of Computer and System Sciences\u00a043, 290\u2013298 (1991)","journal-title":"J. of Computer and System Sciences"},{"key":"51_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471478210","volume-title":"Distributed Computing","author":"H. Attiya","year":"2004","unstructured":"Attiya, H., Welch, J.: Distributed Computing. John Wiley and Sons, Inc., Chichester (2004)"},{"key":"51_CR3","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time complexity of broadcast in radio networks: an exponential gap between determinism and randomization. Journal of Computer and System Sciences\u00a045, 104\u2013126 (1992)","journal-title":"Journal of Computer and System Sciences"},{"key":"51_CR4","doi-asserted-by":"crossref","unstructured":"Bender, M.A., Farach-Colton, M., He, S., Kuszmaul, B.C., Leiserson, C.E.: Adversarial contention resolution for simple channels. In: Proceedings, 17th Annual ACM Symposium on Parallel Algorithms (SPAA), pp. 325\u2013332 (2005)","DOI":"10.1145\/1073970.1074023"},{"key":"51_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1109\/TIT.1979.1056093","volume":"25","author":"J. Capetanakis","year":"1979","unstructured":"Capetanakis, J.: Tree algorithms for packet broadcast channels. IEEE Transactions on Information Theory\u00a025, 505\u2013515 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"key":"51_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s00446-008-0056-2","volume":"21","author":"G. Chockler","year":"2008","unstructured":"Chockler, G., Demirbas, M., Gilbert, S., Lynch, N.A., Newport, C.C., Nolte, T.: Consensus and collision detectors in radio networks. Distributed Computing\u00a021, 55\u201384 (2008)","journal-title":"Distributed Computing"},{"key":"51_CR7","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks - problem analysis and protocol design. IEEE Transactions on Communications\u00a033, 1240\u20131246 (1985)","journal-title":"IEEE Transactions on Communications"},{"key":"51_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B.S. Chlebus","year":"2002","unstructured":"Chlebus, B.S., G\u0105sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing\u00a015, 27\u201338 (2002)","journal-title":"Distributed Computing"},{"key":"51_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/11523468_29","volume-title":"Automata, Languages and Programming","author":"B.S. Chlebus","year":"2005","unstructured":"Chlebus, B.S., G\u0105sieniec, L., Kowalski, D.R., Radzik, T.: On the wake-up problem in radio networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 347\u2013359. Springer, Heidelberg (2005)"},{"key":"51_CR10","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R.: A better wake-up in radio networks. In: Proceedings, 23rd ACM Symposium on Principles of Distributed Computing (PODC), pp. 266\u2013274 (2004)","DOI":"10.1145\/1011767.1011806"},{"key":"51_CR11","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R., Rokicki, M.A.: Adversarial queuing on the multiple-access channel. In: Proceedings, 25th ACM Symposium on Principles of Distributed Computing (PODC), pp. 92\u2013101 (2006)","DOI":"10.1145\/1146381.1146398"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1137\/S0097539704442726","volume":"36","author":"M. Chrobak","year":"2007","unstructured":"Chrobak, M., G\u0105sieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. SIAM J. Comput.\u00a036, 1453\u20131471 (2007)","journal-title":"SIAM J. Comput."},{"key":"51_CR13","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/S0196-6774(02)00004-4","volume":"43","author":"M. Chrobak","year":"2002","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. J. Algorithms\u00a043, 177\u2013189 (2002)","journal-title":"J. Algorithms"},{"key":"51_CR14","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proceedings, 12th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"51_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/3-540-44676-1_38","volume-title":"Algorithms - ESA 2001","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Round robin is optimal for fault-tolerant broadcasting on wireless networks. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 452\u2013463. Springer, Heidelberg (2001)"},{"key":"51_CR16","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proceedings, 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"51_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. G\u0105sieniec","year":"2001","unstructured":"G\u0105sieniec, L., Pelc, A., Peleg, D.: The wakeup problem in synchronous broadcast systems. SIAM Journal on Discrete Mathematics\u00a014, 207\u2013222 (2001)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"51_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/978-3-540-75142-7_18","volume-title":"Distributed Computing","author":"S. Dolev","year":"2007","unstructured":"Dolev, S., Gilbert, S., Guerraoui, R., Newport, C.C.: Gossiping in a multi-channel radio network. In: Pelc, A. (ed.) DISC 2007. LNCS, vol.\u00a04731, pp. 208\u2013222. Springer, Heidelberg (2007)"},{"key":"51_CR19","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1016\/j.ipl.2008.09.011","volume":"109","author":"E.G. Fusco","year":"2008","unstructured":"Fusco, E.G., Pelc, A.: Acknowledged broadcasting in ad hoc radio networks. Information Processing Letters\u00a0109, 136\u2013141 (2008)","journal-title":"Information Processing Letters"},{"key":"51_CR20","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1016\/j.tcs.2008.10.008","volume":"410","author":"S. Gilbert","year":"2009","unstructured":"Gilbert, S., Guerraoui, R., Newport, C.C.: Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks. Theor. Comput. Sci.\u00a0410, 546\u2013569 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"51_CR21","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/S0097539700381851","volume":"33","author":"L.A. Goldberg","year":"2004","unstructured":"Goldberg, L.A., Jerrum, M., Kannan, S., Paterson, M.: A bound on the capacity of backoff and acknowledgment-based protocols. SIAM J. Comput.\u00a033, 313\u2013331 (2004)","journal-title":"SIAM J. Comput."},{"key":"51_CR22","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1145\/3828.214125","volume":"32","author":"A.G. Greenberg","year":"1985","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, 589\u2013596 (1985)","journal-title":"J. ACM"},{"key":"51_CR23","doi-asserted-by":"publisher","first-page":"1178","DOI":"10.1109\/TCOM.1978.1094204","volume":"26","author":"J.F. Hayes","year":"1978","unstructured":"Hayes, J.F.: An adaptive technique for local distribution. IEEE Transactions on Communications\u00a026, 1178\u20131186 (1978)","journal-title":"IEEE Transactions on Communications"},{"key":"51_CR24","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proceedings, 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 697\u2013704 (2002)"},{"key":"51_CR25","doi-asserted-by":"crossref","unstructured":"Jurdzinski, T., Kutylowski, M., Zatopianski, J.: Efficient algorithms for leader election in radio networks. In: Proceedings, 21st Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201357 (2002)","DOI":"10.1145\/571825.571833"},{"key":"51_CR26","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":"51_CR27","doi-asserted-by":"crossref","unstructured":"Koo, C.-Y., Bhandari, V., Katz, J., Vaidya, N.H.: Reliable broadcast in radio networks: the bounded collision case. In: Proceedings, 25th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 258\u2013264 (2006)","DOI":"10.1145\/1146381.1146420"},{"key":"51_CR28","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proceedings, 24th ACM Symposium on Principles of Distributed Computing (PODC), pp. 158\u2013166 (2005)","DOI":"10.1145\/1073814.1073843"},{"key":"51_CR29","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proceedings, 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 73\u201382 (2003)","DOI":"10.1145\/872035.872045"},{"key":"51_CR30","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"Y. Kushilevitz","year":"1998","unstructured":"Kushilevitz, Y., Mansour, Y.: An \u03a9(D log(N\/D)) lower bound for broadcast in radio networks. SIAM J. on Computing\u00a027, 702\u2013712 (1998)","journal-title":"SIAM J. on Computing"},{"key":"51_CR31","volume-title":"Distributed Algorithms","author":"N.A. Lynch","year":"1996","unstructured":"Lynch, N.A.: Distributed Algorithms. Morgan Kaufmann Publ., Inc., San Francisco (1996)"},{"key":"51_CR32","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1109\/TPDS.2002.1003864","volume":"13","author":"K. Nakano","year":"2002","unstructured":"Nakano, K., Olariu, S.: Uniform leader election protocols for radio networks. IEEE Transactions on Parallel Distributed Systems\u00a013, 516\u2013526 (2002)","journal-title":"IEEE Transactions on Parallel Distributed Systems"},{"key":"51_CR33","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00446-007-0021-5","volume":"19","author":"A. Pelc","year":"2007","unstructured":"Pelc, A.: Activating anonymous ad hoc radio networks. Distributed Computing\u00a019, 361\u2013371 (2007)","journal-title":"Distributed Computing"},{"key":"51_CR34","doi-asserted-by":"crossref","unstructured":"Pelc, A., Peleg, D.: Feasibility and complexity of broadcasting with random transmission failures. In: Proceedings, 24th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 334\u2013341 (2005)","DOI":"10.1145\/1073814.1073879"},{"key":"51_CR35","first-page":"259","volume":"14","author":"B.S. Tsybakov","year":"1978","unstructured":"Tsybakov, B.S., Mikhailov, V.A.: Free synchronous packet access in a broadcast channel with feedback. Prob. Inf. Transmission\u00a014, 259\u2013280 (1978); Translated from Russian original. Prob. Peredach. Inf. (1977)","journal-title":"Prob. Inf. Transmission"},{"key":"51_CR36","doi-asserted-by":"publisher","first-page":"468","DOI":"10.1137\/0215032","volume":"15","author":"D.E. Willard","year":"1986","unstructured":"Willard, D.E.: Log-logarithmic selection resolution protocols in a multiple access channel. SIAM J. on Computing\u00a015, 468\u2013477 (1986)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04355-0_51","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T09:04:13Z","timestamp":1739351053000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}