{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,26]],"date-time":"2025-02-26T05:29:08Z","timestamp":1740547748740,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540222309"},{"type":"electronic","value":"9783540277965"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27796-5_6","type":"book-chapter","created":{"date-parts":[[2010,9,5]],"date-time":"2010-09-05T21:47:42Z","timestamp":1283723262000},"page":"57-68","source":"Crossref","is-referenced-by-count":5,"title":["Asynchronous Broadcast in Radio Networks"],"prefix":"10.1007","author":[{"given":"Bogdan S.","family":"Chlebus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mariusz A.","family":"Rokicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_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. Journal of Computer and System Sciences\u00a043, 290\u2013298 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"6_CR2","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":"6_CR3","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/0222055","volume":"22","author":"R. Bar-Yehuda","year":"1993","unstructured":"Bar-Yehuda, R., Israeli, A., Itai, A.: Multiple communication in multihop radio networks. SIAM Journal on Computing\u00a022, 875\u2013887 (1993)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s004460050030","volume":"10","author":"D. Bruschi","year":"1997","unstructured":"Bruschi, D., Del Pinto, M.: Lower bounds for the broadcast problem in mobile radio networks. Distributed Computing\u00a010, 129\u2013135 (1997)","journal-title":"Distributed Computing"},{"key":"6_CR5","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":"6_CR6","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1109\/TC.1987.1676861","volume":"36","author":"I. Chlamtac","year":"1987","unstructured":"Chlamtac, I., Kutten, S.: Tree based broadcasting in multihop radio networks. IEEE Transactions on Computers\u00a036, 1209\u20131223 (1987)","journal-title":"IEEE Transactions on Computers"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1109\/26.79285","volume":"39","author":"I. Chlamtac","year":"1991","unstructured":"Chlamtac, I., Weinstein, O.: The wave expansion approach to broadcasting in multihop radio networks. IEEE Transactions on Communications\u00a039, 426\u2013433 (1991)","journal-title":"IEEE Transactions on Communications"},{"key":"6_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., Ga\u0327sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in unknown radio networks. Distributed Computing\u00a015, 27\u201338 (2002)","journal-title":"Distributed Computing"},{"key":"6_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/3-540-45022-X_60","volume-title":"Automata, Languages and Programming","author":"B.S. Chlebus","year":"2000","unstructured":"Chlebus, B.S., Ga\u0327sieniec, L., \u00d6stlin, A., Robson, J.M.: Deterministic radio broadcasting. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol.\u00a01853, pp. 717\u2013728. Springer, Heidelberg (2000)"},{"key":"6_CR10","unstructured":"Chrobak, M., Ga\u0327sieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 985\u2013993 (2004)"},{"key":"6_CR11","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., Ga\u0327sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. Journal of Algorithms\u00a043, 177\u2013189 (2002)","journal-title":"Journal of Algorithms"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Distributed multi-broadcast in unknown radio networks. In: Proc. 20th ACM Symposium on Principles of Distributed Computing (PODC), pp. 255\u2013264 (2001)","DOI":"10.1145\/383962.384040"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Clementi, A., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0196-6774(02)00292-4","volume":"46","author":"I. Gaber","year":"2003","unstructured":"Gaber, I., Mansour, Y.: Broadcast in radio networks. J. Algorithms\u00a046, 1\u201320 (2003)","journal-title":"J. Algorithms"},{"key":"6_CR16","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/S0895480100376022","volume":"14","author":"L. Ga\u0327sieniec","year":"2001","unstructured":"Ga\u0327sieniec, 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":"6_CR18","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 697\u2013704 (2002)"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"Jurdzi\u0144ski, T., Kuty\u0142owski, M., Zatopia\u0144ski, J.: Efficient algorithms for leader election in radio networks. In: Proc. 21st ACM Symposium on Principles of Distributed Computing (PODC), pp. 51\u201357 (2002)","DOI":"10.1145\/571825.571833"},{"key":"6_CR20","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":"6_CR21","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. 43rd IEEE Symposium of Foundations of Computer Science (FOCS), pp. 63\u201372 (2002)","DOI":"10.1109\/SFCS.2002.1181883"},{"key":"6_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-36494-3_11","volume-title":"STACS 2003","author":"D.R. Kowalski","year":"2003","unstructured":"Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad-hoc radio networks. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 109\u2013120. Springer, Heidelberg (2003)"},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Deterministic broadcasting time in radio networks of unknown topology. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 73\u201382 (2003)","DOI":"10.1145\/872035.872045"},{"key":"6_CR24","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1006\/jagm.2000.1147","volume":"39","author":"E. Kranakis","year":"2001","unstructured":"Kranakis, E., Krizanc, D., Pelc, A.: Fault-tolerant broadcasting in radio networks. Journal of Algorithms\u00a039, 47\u201367 (2001)","journal-title":"Journal of Algorithms"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03a9(D log(N\/D)) lower bound for broadcast in radio networks. SIAM Journal on Computing\u00a027, 702\u2013712 (1998)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR26","unstructured":"Kushilevitz, E., Mansour, Y.: Computation in noisy radio networks. In: Proc. 9th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 236\u2013243 (1998)"},{"key":"6_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/3-540-45655-4_37","volume-title":"Computing and Combinatorics","author":"D. Liu","year":"2002","unstructured":"Liu, D., Prabhakaran, M.: On randomized broadcasting and gossiping in radio networks. In: Ibarra, O.H., Zhang, L. (eds.) COCOON 2002. LNCS, vol.\u00a02387, pp. 340\u2013349. Springer, Heidelberg (2002)"},{"key":"6_CR28","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s00453-002-1010-5","volume":"36","author":"Y. Xu","year":"2003","unstructured":"Xu, Y.: An O(n1.5) deterministic gossiping algorithm for radio networks. Algorithmica\u00a036, 93\u201396 (2003)","journal-title":"Algorithmica"},{"key":"6_CR29","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1080\/00150517.1998.12428948","volume":"36","author":"D.A. Wolfram","year":"1998","unstructured":"Wolfram, D.A.: Solving generalized Fibonacci recurrences. The Fibonacci Quarterly\u00a036, 129\u2013145 (1998)","journal-title":"The Fibonacci Quarterly"},{"key":"6_CR30","doi-asserted-by":"crossref","unstructured":"Zheng, R., Hou, J.C., Sha, L.: Asynchronous wakeup for power management in ad hoc networks. In: Proc. 4th ACM Symposium on Mobile Ad Hoc Networking and Computing (MOBIHOC), pp. 35\u201345 (2003)","DOI":"10.1145\/778415.778420"}],"container-title":["Lecture Notes in Computer Science","Structural Information and Communication Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27796-5_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,25]],"date-time":"2025-02-25T15:48:24Z","timestamp":1740498504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27796-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540222309","9783540277965"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27796-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}