{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T22:44:47Z","timestamp":1768689887516,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":91,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540771128","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77115-9_1","type":"book-chapter","created":{"date-parts":[[2007,11,29]],"date-time":"2007-11-29T10:11:56Z","timestamp":1196331116000},"page":"1-18","source":"Crossref","is-referenced-by-count":20,"title":["Time-Efficient Broadcasting in Radio Networks: A Review"],"prefix":"10.1007","author":[{"given":"David","family":"Peleg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_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. Computer and System Sciences\u00a043, 290\u2013298 (1991)","journal-title":"J. Computer and System Sciences"},{"key":"1_CR2","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/0196-6774(92)90015-5","volume":"13","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bar-Noy, A., Linial, N., Peleg, D.: Single Round Simulation on Radio Networks. J. Algorithms\u00a013, 188\u2013210 (1992)","journal-title":"J. Algorithms"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Ambuhl, C., Clementi, A., Di Ianni, M., Lev-Tov, N., Monti, A., Peleg, D., Rossi, G., Silvestri, R.: Efficient Algorithms for Low-Energy Bounded-Hop Broadcast in Ad-Hoc Wireless Networks. In: Proc. 21st Symp. on Theoretical Aspects of Computer Science, pp. 418\u2013427 (2004)","DOI":"10.1007\/978-3-540-24749-4_37"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/0020-0190(85)90083-3","volume":"20","author":"B. Awerbuch","year":"1985","unstructured":"Awerbuch, B.: A new distributed depth-first-search algorithm. Inform. Process. Lett.\u00a020, 147\u2013150 (1985)","journal-title":"Inform. Process. Lett."},{"key":"1_CR5","unstructured":"Awerbuch, B., Baratz, A., Peleg, D.: Efficient broadcast and light-weight spanners. Technical Report CS92-22, The Weizmann Institute, Rehovot, Israel (1992)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1137\/S0097539795279931","volume":"28","author":"B. Awerbuch","year":"1998","unstructured":"Awerbuch, B., Cidon, I., Kutten, S., Mansour, Y., Peleg, D.: Optimal Broadcast with Partial Knowledge. SIAM J. Computing\u00a028, 511\u2013524 (1998)","journal-title":"SIAM J. Computing"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1145\/77600.77618","volume":"37","author":"B. Awerbuch","year":"1990","unstructured":"Awerbuch, B., Goldreich, O., Peleg, D., Vainish, R.: A tradeoff between information and communication in broadcast protocols. J. ACM\u00a037, 238\u2013256 (1990)","journal-title":"J. ACM"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1002\/net.3230160405","volume":"16","author":"B. Awerbuch","year":"1986","unstructured":"Awerbuch, B., Even, S.: Reliable Broadcast Protocols in Unreliable Networks. Networks\u00a016, 381\u2013396 (1986)","journal-title":"Networks"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1109\/TCOM.1983.1095904","volume":"31","author":"B. Awerbuch","year":"1983","unstructured":"Awerbuch, B., Segall, A.: A Reliable Broadcast Protocol. IEEE Trans. Communications\u00a031, 896\u2013901 (1983)","journal-title":"IEEE Trans. Communications"},{"key":"1_CR10","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. Computer and System Sciences\u00a045, 104\u2013126 (1992)","journal-title":"J. Computer and System Sciences"},{"key":"1_CR11","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 J. Computing\u00a022, 875\u2013887 (1993)","journal-title":"SIAM J. Computing"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"799","DOI":"10.1109\/90.811446","volume":"7","author":"S. Basagni","year":"1999","unstructured":"Basagni, S., Bruschi, D., Chlamtac, I.: A mobility-transparent deterministic broadcast mechanism for ad hoc networks. IEEE\/ACM Trans. Networking\u00a07, 799\u2013807 (1999)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Basagni, S., Myers, A.D., Syrotiuk, V.R.: Mobility-independent flooding for real-time multimedia applications in ad hoc networks. In: Proc. IEEE Emerging Technologies Symp. on Wireless Communications & Systems (1999)","DOI":"10.1109\/ETWCS.1999.897338"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Berenbrink, P., Cooper, C., Hu, Z.: Energy efficient randomized communication in unknown ad hoc networks. In: Proc. 19th Symp. on Parallelism Algorithms and Architectures (2007)","DOI":"10.1145\/1248377.1248419"},{"key":"1_CR15","volume-title":"Data Networks","author":"D. Bertsekas","year":"1987","unstructured":"Bertsekas, D., Gallager, R.: Data Networks. Prantice Hall, New Jersey (1987)"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: On reliable broadcast in a radio network. In: Proc. 24th Symp. on Principles of Distributed Computing, pp. 138\u2013147 (2005)","DOI":"10.1145\/1073814.1073841"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Bhandari, V., Vaidya, N.H.: Reliable Broadcast in Wireless Networks with Probabilistic Failures. In: Proc. 26th Joint Conf. of IEEE Computer and Communication Societies (INFOCOM), pp. 715\u2013723 (2007)","DOI":"10.1109\/INFCOM.2007.89"},{"key":"1_CR18","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":"1_CR19","unstructured":"C\u01celinescu, G., Li, X.Y., Frieder, O., Wan, P.J.: Minimum-Energy Broadcast Routing in Static Ad Hoc Wireless Networks. In: Proc. 20th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), pp. 1162\u20131171 (2001)"},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"Chandra, R., Ramasubramanian, V., Birman, K.P.: Anonymous Gossip: Improving Multicast Reliability in Mobile Ad-Hoc Networks. In: Proc. 21st Conf. on Distributed Computing Systems, pp. 275\u2013283 (2001)","DOI":"10.1109\/ICDSC.2001.918957"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/90.282605","volume":"2","author":"I. Chlamtac","year":"1994","unstructured":"Chlamtac, I., Farag\u00f3, A.: Making transmission schedule immune to topology changes in multi-hop packet radio networks. IEEE\/ACM Trans. Networking\u00a02, 23\u201329 (1994)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"1_CR22","doi-asserted-by":"publisher","first-page":"804","DOI":"10.1109\/90.650140","volume":"5","author":"I. Chlamtac","year":"1997","unstructured":"Chlamtac, I., Farag\u00f3, A., Zhang, H.: Time-spread multiple access (TSMA) protocols for multihop mobile radio networks. IEEE\/ACM Trans. Networking\u00a05, 804\u2013812 (1997)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096216","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"Chlamtac, I., Kutten, S.: On broadcasting in radio networks \u2013 problem analysis and protocol design. IEEE Trans. Communications\u00a033, 1240\u20131246 (1985)","journal-title":"IEEE Trans. Communications"},{"key":"1_CR24","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 Trans. Computers\u00a036, 1209\u20131223 (1987)","journal-title":"IEEE Trans. Computers"},{"key":"1_CR25","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":"1_CR26","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":"1_CR27","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Gasieniec, L., Kowalski, D.R., Radzik, T.: On the Wake-Up Problem in Radio Networks. In: Proc. 32nd Int. Colloq. on Automata, Languages and Programming, pp. 347\u2013359 (2005)","DOI":"10.1007\/11523468_29"},{"key":"1_CR28","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., Ostlin, 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":"1_CR29","doi-asserted-by":"crossref","unstructured":"Chlebus, B.S., Kowalski, D.R.: A better wake-up in radio networks. In: Proc. 23rd Symp. on Principles of Distributed Computing, pp. 266\u2013274 (2004)","DOI":"10.1145\/1011767.1011806"},{"key":"1_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/11537311_24","volume-title":"Fundamentals of Computation Theory","author":"B.S. Chlebus","year":"2005","unstructured":"Chlebus, B.S., Kowalski, D.R.: Almost Optimal Explicit Selectors. In: Li\u015bkiewicz, M., Reischuk, R. (eds.) FCT 2005. LNCS, vol.\u00a03623, pp. 270\u2013280. Springer, Heidelberg (2005)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/978-3-540-27796-5_6","volume-title":"Structural Information and Communication Complexity","author":"B.S. Chlebus","year":"2004","unstructured":"Chlebus, B.S., 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":"1_CR32","unstructured":"Chrobak, M., Ga\u0327sieniec, L., Kowalski, D.R.: The wake-up problem in multi-hop radio networks. In: Proc. 15th ACM-SIAM Symp. on Discrete Algorithms, pp. 985\u2013993 (2004)"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Chrobak, M., Ga\u0327sieniec, L., Rytter, W.: Fast broadcasting and gossiping in radio networks. In: Proc. 41st Symp. on Foundations of Computer Science, pp. 575\u2013581 (2000)","DOI":"10.1109\/SFCS.2000.892325"},{"key":"1_CR34","doi-asserted-by":"crossref","unstructured":"Cicalese, F., Manne, F., Xin, Q.: Faster centralized communication in radio networks. In: Proc. 17th Symp. on Algorithms and Computation, pp. 339\u2013348 (2006)","DOI":"10.1007\/11940128_35"},{"key":"1_CR35","unstructured":"Clementi, A.E.F., Huiban, G., Penna, P., Rossi, G., Verhoeven, Y.C.: Some recent theoretical advances and open questions on energy consumption in ad-hoc wireless networks. In: Proc. 3rd Workshop on Approximation and Randomization Algorithms in Communication Networks, pp. 23\u201338 (2002)"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Clementi, A.E.F., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs. In: Proc. 18th Symp. on Theoretical Aspects of Computer Science, pp. 121\u2013131 (2001)","DOI":"10.1007\/3-540-44693-1_11"},{"key":"1_CR37","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 Symp. on Discrete Algorithms, pp. 709\u2013718 (2001)","DOI":"10.1145\/383962.384040"},{"key":"1_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/3-540-44666-4_24","volume-title":"Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques","author":"A.E.F. Clementi","year":"2001","unstructured":"Clementi, A.E.F., Crescenzi, P., Monti, A., Penna, P., Silvestri, R.: On Computing Ad-hoc Selective Families. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol.\u00a02129, pp. 211\u2013222. Springer, Heidelberg (2001)"},{"key":"1_CR39","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1016\/S0304-3975(02)00851-4","volume":"302","author":"A.E.F. Clementi","year":"2003","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Distributed broadcast in radio networks of unknown topology. Theoretical Computer Science\u00a0302, 337\u2013364 (2003)","journal-title":"Theoretical Computer Science"},{"key":"1_CR40","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jpdc.2003.09.002","volume":"64","author":"A.E.F. Clementi","year":"2004","unstructured":"Clementi, A.E.F., Monti, A., Silvestri, R.: Round Robin is optimal for fault-tolerant broadcasting on wireless networks. J. Parallel and Distributed Computing\u00a064, 89\u201396 (2004)","journal-title":"J. Parallel and Distributed Computing"},{"key":"1_CR41","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1137\/S0895480295292934","volume":"11","author":"A. Czumaj","year":"1998","unstructured":"Czumaj, A., Ga\u0327sieniec, L., Pelc, A.: Time and Cost Trade-Offs in Gossiping. SIAM J. Discrete Mathematics\u00a011, 400\u2013413 (1998)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"1_CR42","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.jalgor.2004.08.001","volume":"60","author":"A. Czumaj","year":"2006","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. J. Algorithms\u00a060, 115\u2013143 (2006)","journal-title":"J. Algorithms"},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.jda.2006.07.001","volume":"5","author":"A. Dessmark","year":"2007","unstructured":"Dessmark, A., Pelc, A.: Broadcasting in geometric radio networks. J. Discrete Algorithms\u00a05, 187\u2013201 (2007)","journal-title":"J. Discrete Algorithms"},{"key":"1_CR44","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1002\/net.10016","volume":"39","author":"A. Dessmark","year":"2002","unstructured":"Dessmark, A., Pelc, A.: Deterministic radio broadcasting at low cost. Networks\u00a039, 88\u201397 (2002)","journal-title":"Networks"},{"key":"1_CR45","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/S0020-0190(00)00178-2","volume":"79","author":"G. Marco De","year":"2001","unstructured":"De Marco, G., Pelc, A.: Faster broadcasting in unknown radio networks. Information Processing Letters\u00a079, 53\u201356 (2001)","journal-title":"Information Processing Letters"},{"key":"1_CR46","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1016\/S0304-3975(01)00256-0","volume":"287","author":"K. Diks","year":"2002","unstructured":"Diks, K., Kranakis, E., Krizanc, D., Pelc, A.: The impact of knowledge on broadcasting time in linear radio networks. Theoretical Computer Science\u00a0287, 449\u2013471 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1_CR47","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/j.jalgor.2003.11.004","volume":"52","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: Logarithmic inapproximability of the radio broadcast problem. J. Algorithms\u00a052(1), 8\u201325 (2004)","journal-title":"J. Algorithms"},{"key":"1_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/978-3-540-27821-4_10","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"M. Elkin","year":"2004","unstructured":"Elkin, M., Kortsarz, G.: Polylogarithmic inapproximability of the radio broadcast problem. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX 2004. LNCS, vol.\u00a03122, pp. 105\u2013116. Springer, Heidelberg (2004)"},{"key":"1_CR49","unstructured":"Elkin, M., Kortsarz, G.: Improved schedule for radio broadcast. In: Proc. 16th ACM-SIAM Symp. on Discrete Algorithms, pp. 222\u2013231 (2005)"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"Emek, Y., Ga\u0327sieniec, L., Kantor, E., Pelc, A., Peleg, D., Su, C.: Broadcasting in UDG radio networks with unknown topology. In: Proc. ACM Symp. on Principles of Distributed Computing (2007)","DOI":"10.1145\/1281100.1281130"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Emek, Y., Kantor, E., Peleg, D.: On the Effect of the Deployment Setting on Broadcasting in Euclidean Radio Networks (unpublished manuscript, 2007)","DOI":"10.1145\/1400751.1400782"},{"key":"1_CR52","unstructured":"Ephremides, A., Nguyen, G.D., Wieselthier, J.E.: On the Construction of Energy-Efficient Broadcast and Multicast Trees in Wireless Networks. In: Proc. 19th Joint Conf. of IEEE Computer and Communications Societies (INFOCOM), pp. 585\u2013594 (2000)"},{"key":"1_CR53","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1002\/net.3230090404","volume":"9","author":"A.M. Farley","year":"1979","unstructured":"Farley, A.M.: Minimal Broadcast Networks. Networks\u00a09, 313\u2013332 (1979)","journal-title":"Networks"},{"key":"1_CR54","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0012-365X(79)90022-0","volume":"25","author":"A.M. Farley","year":"1979","unstructured":"Farley, A.M., Hedetniemi, S.T., Mitchell, S., Proskurowski, A.: Minimum Broadcast Graphs. Discrete Math.\u00a025, 189\u2013193 (1979)","journal-title":"Discrete Math."},{"key":"1_CR55","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1002\/rsa.3240010406","volume":"1","author":"U. Feige","year":"1990","unstructured":"Feige, U., Peleg, D., Raghavan, P., Upfal, E.: The Complexity of Randomized Broadcast. J. on Random Structures & Algorithms\u00a01, 447\u2013460 (1990)","journal-title":"J. on Random Structures & Algorithms"},{"key":"1_CR56","doi-asserted-by":"crossref","unstructured":"Fernandez, A., Mosteiro, M.A., Thraves, C.: Deterministic Communication in the Weak Sensor Model. In: Proc. 11th Conf. On Principles Of Distributed Systems (2007)","DOI":"10.1007\/978-3-540-77096-1_9"},{"key":"1_CR57","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0166-218X(94)90180-5","volume":"53","author":"P. Fraigniaud","year":"1994","unstructured":"Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Math.\u00a053, 79\u2013133 (1994)","journal-title":"Discrete Applied Math."},{"key":"1_CR58","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. J. Algorithms\u00a046, 1\u201320 (2003)","journal-title":"J. Algorithms"},{"key":"1_CR59","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1002\/net.1022","volume":"38","author":"L. Gargano","year":"2001","unstructured":"Gargano, L., Pelc, A., P\u00e9rennes, S., Vaccaro, U.: Efficient communication in unknown networks. Networks\u00a038, 39\u201349 (2001)","journal-title":"Networks"},{"key":"1_CR60","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 J. Discrete Mathematics\u00a014, 207\u2013222 (2001)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"1_CR61","doi-asserted-by":"crossref","unstructured":"Ga\u0327sieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proc. 24th ACM Symp. on Principles Of Distributed Computing, pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"1_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/978-3-540-75142-7_21","volume-title":"Proc. 21st Symp. on Distributed Computing","author":"L. Ga\u0327sieniec","year":"2007","unstructured":"Ga\u0327sieniec, L., Kantor, E., Kowalski, D.R., Peleg, D., Su, C.: Energy and Time Efficient Broadcasting in Known Topology Radio Networks. In: Proc. 21st Symp. on Distributed Computing. LNCS, vol.\u00a04731, pp. 253\u2013267. Springer, Heidelberg (2007)"},{"key":"1_CR63","doi-asserted-by":"crossref","unstructured":"Gandhi, R., Parthasarathy, S., Mishra, A.: Minimizing broadcast latency and redundancy in ad hoc networks. In: Proc. 4th ACM Symp. on Mobile ad hoc networking and computing, pp. 222\u2013232 (2003)","DOI":"10.1145\/778415.778442"},{"key":"1_CR64","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1109\/TNET.2006.876186","volume":"14","author":"Z.J. Haas","year":"2006","unstructured":"Haas, Z.J., Halpern, J.Y., Li, L.: Gossip-based ad hoc routing. IEEE\/ACM Trans. Networking\u00a014, 479\u2013491 (2006)","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"1_CR65","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1002\/net.3230180406","volume":"18","author":"S. Hedetniemi","year":"1988","unstructured":"Hedetniemi, S., Hedetniemi, S., Liestman, A.: A Survey of Gossiping and Broadcasting in Communication Networks. Networks\u00a018, 319\u2013349 (1988)","journal-title":"Networks"},{"key":"1_CR66","first-page":"179","volume":"16","author":"P.A. Humblet","year":"1989","unstructured":"Humblet, P.A., Soloway, S.R.: Topology Broadcast Algorithms. Computer Networks\u00a016, 179\u2013186 (1989)","journal-title":"Computer Networks"},{"key":"1_CR67","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/0166-218X(94)00053-G","volume":"60","author":"F.K. Hwang","year":"1995","unstructured":"Hwang, F.K.: The time complexity of deterministic broadcast radio networks. Discrete Applied Mathematics\u00a060, 219\u2013222 (1995)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR68","unstructured":"Indyk, P.: Explicit constructions of selectors and related combinatorial structures, with applications. In: Proc. 13th ACM-SIAM Symp. on Discrete Algorithms, pp. 697\u2013704 (2002)"},{"key":"1_CR69","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/3-540-36136-7_47","volume-title":"Algorithms and Computation","author":"T. Jurdzinski","year":"2002","unstructured":"Jurdzinski, 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":"1_CR70","doi-asserted-by":"crossref","unstructured":"Kesselman, A., Kowalski, D.R.: Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks. In: Proc. 2nd Conf. on Wireless on Demand Network Systems and Service, pp. 119\u2013124 (2005)","DOI":"10.1109\/WONS.2005.17"},{"key":"1_CR71","doi-asserted-by":"crossref","unstructured":"Koo, C.-Y.: Broadcast in radio networks tolerating byzantine adversarial behavior. In: Proc. 23rd Symp. on Principles of Distributed Computing, pp. 275\u2013282 (2004)","DOI":"10.1145\/1011767.1011807"},{"key":"1_CR72","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: Proc. 25th Symp. on Principles of Distributed Computing, pp. 258\u2013264 (2006)","DOI":"10.1145\/1146381.1146420"},{"key":"1_CR73","unstructured":"Kothapalli, K., Onus, M., Richa, A., Scheideler, C.: Efficient Broadcasting and Gathering in Wireless Ad Hoc Networks. In: Proc. IEEE Symp. on Parallel Architectures, Algorithms and Networks, pp. 346\u2013351 (2005)"},{"key":"1_CR74","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S089548010342464X","volume":"18","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Faster deterministic broadcasting in ad hoc radio networks. SIAM J. Discrete Mathematics\u00a018, 332\u2013346 (2004)","journal-title":"SIAM J. Discrete Mathematics"},{"key":"1_CR75","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-540-27821-4_16","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Centralized deterministic broadcasting in undirected multi-hop radio networks. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX 2004. LNCS, vol.\u00a03122, pp. 171\u2013182. Springer, Heidelberg (2004)"},{"key":"1_CR76","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1137\/S0097539702419339","volume":"33","author":"D.R. Kowalski","year":"2004","unstructured":"Kowalski, D.R., Pelc, A.: Time of deterministic broadcasting in radio networks with local knowledge. SIAM J. Computing\u00a033, 870\u2013891 (2004)","journal-title":"SIAM J. Computing"},{"key":"1_CR77","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s00446-005-0126-7","volume":"18","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R., Pelc, A.: Broadcasting in undirected ad hoc radio networks. Distributed Computing\u00a018, 43\u201357 (2005)","journal-title":"Distributed Computing"},{"key":"1_CR78","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.tcs.2004.04.017","volume":"333","author":"D.R. Kowalski","year":"2005","unstructured":"Kowalski, D.R., 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":"1_CR79","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":"1_CR80","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. J. Algorithms\u00a039, 47\u201367 (2001)","journal-title":"J. Algorithms"},{"key":"1_CR81","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 J. Computing\u00a027, 702\u2013712 (1998)","journal-title":"SIAM J. Computing"},{"key":"1_CR82","doi-asserted-by":"crossref","unstructured":"Pagani, E., Rossi, G.P.: Reliable broadcast in mobile multihop radio networks. In: Proc. 3rd ACM\/IEEE Conf. on Mobile Computing and Networking (MOBICOM), pp. 34\u201342 (1997)","DOI":"10.1145\/262116.262125"},{"key":"1_CR83","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1002\/(SICI)1097-0037(199610)28:3<143::AID-NET3>3.0.CO;2-N","volume":"28","author":"A. Pelc","year":"1996","unstructured":"Pelc, A.: Fault-tolerant broadcasting and gossiping in communication networks. Networks\u00a028, 143\u2013156 (1996)","journal-title":"Networks"},{"key":"1_CR84","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.ipl.2004.10.007","volume":"93","author":"A. Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded Byzantine faults. Information Processing Letters\u00a093, 109\u2013115 (2005)","journal-title":"Information Processing Letters"},{"key":"1_CR85","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM (2000)","DOI":"10.1137\/1.9780898719772"},{"key":"1_CR86","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0166-218X(94)90193-7","volume":"53","author":"K. Ravishankar","year":"1994","unstructured":"Ravishankar, K., Singh, S.: Broadcasting on [0,L]. Discrete Applied Mathematics\u00a053, 299\u2013319 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"1_CR87","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1109\/TIT.1983.1056620","volume":"29","author":"A. Segall","year":"1983","unstructured":"Segall, A.: Distributed Network Protocols. IEEE Trans. Inf. Th.\u00a029, 23\u201335 (1983)","journal-title":"IEEE Trans. Inf. Th."},{"key":"1_CR88","doi-asserted-by":"crossref","unstructured":"Sen, A., Huson, M.L.: A new model for scheduling packet radio networks. In: Proc. 15th Joint Conf. of IEEE Computer and Communication Societies (INFOCOM), pp. 1116\u20131124 (1996)","DOI":"10.1109\/INFCOM.1996.493055"},{"key":"1_CR89","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1109\/TPDS.2006.53","volume":"17","author":"W.-Z. Song","year":"2006","unstructured":"Song, W.-Z., Li, X.-Y., Frieder, O., Wang, W.: Localized Topology Control for Unicast and Broadcast in Wireless Ad Hoc Networks. IEEE Trans. Parallel Distrib. Syst.\u00a017, 321\u2013334 (2006)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"1_CR90","volume-title":"Ad Hoc Mobile Wireless Networks","author":"C.K. Toh","year":"2002","unstructured":"Toh, C.K.: Ad Hoc Mobile Wireless Networks. Prentice Hall, Englewood Cliffs (2002)"},{"key":"1_CR91","doi-asserted-by":"crossref","unstructured":"Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: Proc. 3rd ACM Symp. on Mobile Ad Hoc Networking and Computing, pp. 194\u2013205 (2002)","DOI":"10.1145\/513800.513825"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77115-9_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,23]],"date-time":"2025-01-23T00:26:07Z","timestamp":1737591967000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77115-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540771128"],"references-count":91,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77115-9_1","relation":{},"subject":[]}}