{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T22:10:02Z","timestamp":1736028602125,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_20","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"260-272","source":"Crossref","is-referenced-by-count":0,"title":["Waking Up Anonymous Ad Hoc Radio Networks"],"prefix":"10.1007","author":[{"given":"Andrzej","family":"Pelc","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_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":"20_CR2","doi-asserted-by":"publisher","first-page":"845","DOI":"10.1145\/48014.48247","volume":"35","author":"H. Attiya","year":"1988","unstructured":"Attiya, H., Snir, M., Warmuth, M.: Computing on an Anonymous Ring. Journal of the ACM\u00a035, 845\u2013875 (1988)","journal-title":"Journal of the ACM"},{"key":"20_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":"20_CR4","doi-asserted-by":"crossref","unstructured":"Boldi, P., Vigna, S.: Computing anonymously with arbitrary knowledge. In: Proc. 18th ACM Symp. on Principles of Distributed Computing, PODC 1999 (1999)","DOI":"10.1145\/301308.301355"},{"key":"20_CR5","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":"20_CR6","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":"20_CR7","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s446-002-8028-1","volume":"15","author":"B. Chlebus","year":"2002","unstructured":"Chlebus, B., G\u0105sieniec, L., Gibbons, A., Pelc, A., Rytter, W.: Deterministic broadcasting in ad hoc radio networks. Distributed Computing\u00a015, 27\u201338 (2002)","journal-title":"Distributed Computing"},{"key":"20_CR8","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., G\u0105sieniec, 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":"20_CR9","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Kowalski, D.: A better wake-up in radio networks. In: Proc. 23rd Annual Symp. on Principles of Distributed Computing (PODC 2004) (2004)","DOI":"10.1145\/1011767.1011806"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-27796-5_6","volume-title":"Structural Information and Communication Complexity","author":"B. Chlebus","year":"2004","unstructured":"Chlebus, B., Rokicki, M.: Asynchronous broadcast in radio networks. In: Kralovic, R., S\u00fdkora, O. (eds.) SIROCCO 2004. LNCS, vol.\u00a03104, pp. 57\u201368. Springer, Heidelberg (2004)"},{"key":"20_CR11","unstructured":"Chrobak, M., G\u0105sieniec, L., Kowalski, D.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 985\u2013993 (2004)"},{"key":"20_CR12","doi-asserted-by":"crossref","unstructured":"Chrobak, M., G\u0105sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symposium on Foundations of Computer Science (FOCS 2000), pp. 575\u2013581 (2000)","DOI":"10.1109\/SFCS.2000.892325"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Selective families, superimposed codes, and broadcasting on unknown radio networks. In: Proc. 12th Ann. ACM-SIAM Symposium on Discrete Algorithms (SODA 2001), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proc. 44th Symposium on Foundations of Computer Science (FOCS 2003), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"20_CR15","unstructured":"Elkin, M., Kortsarz, G.: Improved broadcast schedule for radio networks. In: Proc. 16th ACM-SIAM Symposium on Discrete Algorithms, SODA 2005 (2005)"},{"issue":"1","key":"20_CR16","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.: Centralized broadcast in multihop radio networks. Journal of Algorithms\u00a046(1), 1\u201320 (2003)","journal-title":"Journal of Algorithms"},{"key":"20_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":"20_CR18","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":"20_CR19","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.tcs.2004.04.017","volume":"333","author":"D. Kowalski","year":"2005","unstructured":"Kowalski, D., Pelc, A.: Time complexity of radio broadcasting: adaptiveness vs. obliviousness and randomization vs. determinism. Theoretical Computer Science\u00a0333, 355\u2013371 (2005)","journal-title":"Theoretical Computer Science"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. 22nd ACM Symposium on Principles of Distributed Computing (PODC 2003), pp. 73\u201382 (2003)","DOI":"10.1145\/872035.872045"},{"key":"20_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-27821-4_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"D. Kowalski","year":"2004","unstructured":"Kowalski, D., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) RANDOM 2004 and APPROX 2004. LNCS, vol.\u00a03122, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"20_CR22","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1006\/inco.1994.1086","volume":"114","author":"E. Kranakis","year":"1994","unstructured":"Kranakis, E., Krizanc, D., van der Berg, J.: Computing Boolean Functions on Anonymous Networks. Information and Computation\u00a0114, 214\u2013236 (1994)","journal-title":"Information and Computation"},{"key":"20_CR23","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"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T21:43:57Z","timestamp":1736027037000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11561927_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}