{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:41:09Z","timestamp":1742920869884,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_49","type":"book-chapter","created":{"date-parts":[[2009,9,23]],"date-time":"2009-09-23T02:44:15Z","timestamp":1253673855000},"page":"481-495","source":"Crossref","is-referenced-by-count":2,"title":["Efficient k-Shot Broadcasting in Radio Networks"],"prefix":"10.1007","author":[{"given":"Erez","family":"Kantor","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Peleg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"49_CR1","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","volume":"43","author":"A. Alon","year":"1991","unstructured":"Alon, A., Bar-Noy, A., Linial, N., Peleg, D.: A lower bound for radio broadcast. J. Compt. Syst. Science\u00a043, 290\u2013298 (1991)","journal-title":"J. Compt. Syst. Science"},{"key":"49_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1139","DOI":"10.1007\/11523468_92","volume-title":"Automata, Languages and Programming","author":"C. Amb\u00fchl","year":"2005","unstructured":"Amb\u00fchl, C.: An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1139\u20131150. Springer, Heidelberg (2005)"},{"key":"49_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. J. Compt. Syst. Science\u00a045, 104\u2013126 (1992)","journal-title":"J. Compt. Syst. Science"},{"key":"49_CR4","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 Trans. Communications\u00a033, 1240\u20131246 (1985)","journal-title":"IEEE Trans. Communications"},{"key":"49_CR5","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 Trans. Communications\u00a039, 426\u2013433 (1991)","journal-title":"IEEE Trans. Communications"},{"key":"49_CR6","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Gasieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symp. on Foundations of Computer Science (FOCS), pp. 575\u2013581 (2000)","DOI":"10.1109\/SFCS.2000.892325"},{"key":"49_CR7","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, R., Vocca, P.: On the complexity of computing minimum energy consumption broadcast subgraphs. In: Proc. 18th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 12\u2013131 (2001)","DOI":"10.1007\/3-540-44693-1_11"},{"key":"49_CR8","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. 22nd ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"49_CR9","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unkown topology. In: Proc. 44rd IEEE Symp. on Foundations of Computer Science (FOCS), pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"49_CR10","unstructured":"De Marco, G.: Distributed broadcast in unknown radio networks. In: Proc. 29th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 208\u2013217 (2008)"},{"key":"49_CR11","unstructured":"Elkin, M., Kortsarz, G.: Improved schedule for radio broadcast. In: Proc. 26th ACM-SIAM Symp. on Discrete Algorithms (SODA), pp. 222\u2013231 (2005)"},{"issue":"1","key":"49_CR12","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":"49_CR13","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th ACM symp. on Principles of Distributed Computing (PODC), pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00446-008-0058-0","volume":"21","author":"L. Ga\u0327sieniec","year":"2008","unstructured":"Ga\u0327sieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Time efficient k-shot broadcasting in known topology radio networks. Distributed Computing\u00a021(2), 117\u2013127 (2008)","journal-title":"Distributed Computing"},{"key":"49_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1006\/inco.1998.2754","volume":"150","author":"S. Guha","year":"1999","unstructured":"Guha, S., Khuller, S.: Improved methods for approximating node-weighted steiner trees and connected dominating sets. Information and Computation\u00a0150, 57\u201374 (1999)","journal-title":"Information and Computation"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Klasing, R., Navarra, A., Papadopoulos, A., Perennes, S.: Adaptive broadcast consumption (abc), a new heuristic and new bounds for the minimum energy broadcast routing problem. In: Networking, pp. 866\u2013877 (2004)","DOI":"10.1007\/978-3-540-24693-0_71"},{"key":"49_CR17","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R.: On selection problem in radio networks. In: Proc. 24th ACM symp. on Principles of Distributed Computing (PODC), pp. 158\u2013166 (2005)","DOI":"10.1145\/1073814.1073843"},{"key":"49_CR18","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proc. 22nd ACM symp. on Principles of Distributed Computing (PODC), pp. 73\u201382 (2003)","DOI":"10.1145\/872035.872045"},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. In: Proc. 20th Symp. on Theoretical Aspects of Computer Science (STACS), pp. 109\u2013120 (2003)","DOI":"10.1007\/3-540-36494-3_11"},{"key":"49_CR20","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"D.R. Kowalski","year":"2007","unstructured":"Kowalski, D.R., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distributed Computing\u00a019, 185\u2013195 (2007)","journal-title":"Distributed Computing"},{"key":"49_CR21","doi-asserted-by":"publisher","first-page":"702","DOI":"10.1137\/S0097539794279109","volume":"27","author":"E. Kushilevitz","year":"1998","unstructured":"Kushilevitz, E., Mansour, Y.: An \u03c9(dlog(n\/d)) lower bound for broadcast in radio networks. SIAM J. on Computing\u00a027, 702\u2013712 (1998)","journal-title":"SIAM J. on Computing"},{"key":"49_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and Computing","author":"M. Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing. Cambridge University Press, Cambridge (2005)"},{"key":"49_CR23","doi-asserted-by":"crossref","unstructured":"Wan, P.J., Calinescu, G., Li, X.Y., Frieder, O.: Minimum-energy broadcast routing in static ad hoc wireless networks. In: Proc. 20th Joint Conf. of the IEEE Computer and Communications Societies (INFOCOM), pp. 1162\u20131171 (2001)","DOI":"10.1109\/INFCOM.2001.916310"}],"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_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T09:04:22Z","timestamp":1739351062000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04355-0_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642043543","9783642043550"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04355-0_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}