{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:20:44Z","timestamp":1759638044174},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424932"},{"type":"electronic","value":"9783540446767"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44676-1_38","type":"book-chapter","created":{"date-parts":[[2007,5,18]],"date-time":"2007-05-18T16:43:15Z","timestamp":1179506595000},"page":"452-463","source":"Crossref","is-referenced-by-count":10,"title":["Round Robin Is Optimal for Fault-Tolerant Broadcasting on Wireless Networks"],"prefix":"10.1007","author":[{"given":"Andrea E. F.","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Angelo","family":"Monti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Riccardo","family":"Silvestri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"38_CR1","first-page":"290","volume":"43","author":"N. Alon","year":"1991","unstructured":"N. Alon, A. Bar-Noy, N. Linial, and D. Peleg (1991), A lower bound for radio broadcast, JCCS, 43, 290\u2013298 (An extended abstract appeared also in ACM-STOC1989).","journal-title":"JCCS"},{"key":"38_CR2","first-page":"104","volume":"45","author":"R. Bar-Yehuda","year":"1992","unstructured":"R. Bar-Yehuda, O. Goldreich, and A. Itai (1992), On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization, JCSS, 45, 104\u2013126 (preliminary version in 6th ACM PODC, 1987).","journal-title":"JCSS"},{"key":"38_CR3","doi-asserted-by":"publisher","first-page":"1240","DOI":"10.1109\/TCOM.1985.1096245","volume":"33","author":"I. Chlamtac","year":"1985","unstructured":"I. Chlamtac and S. Kutten (1985), On Broadcasting in Radio Networks-Problem Analysis and Protocol Design, IEEE Transactions on Communications 33, 1240\u20131246.","journal-title":"IEEE Transactions on Communications"},{"key":"38_CR4","unstructured":"B.S. Chlebus, L. G\u0105sieniec, A.M. Gibbons, A. Pelc, and W. Rytter (2000), Deterministic broadcasting in unknown radio networks, Proc. of 11th ACM-SIAM SODA, 861\u2013870."},{"key":"38_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1007\/3-540-45022-X_60","volume-title":"Proc. of 27th ICALP","author":"B. S. Chlebus","year":"2000","unstructured":"B. S. Chlebus, L. Gasieniec, A. Ostlin, and J. M. Robson (2000), Deterministic radio broadcasting, Proc. of 27th ICALP, LNCS 1853, 717\u2013728."},{"key":"38_CR6","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. Gasieniec, and W. Rytter (2000), Fast Broadcasting and Gossiping in Radio Networks, Proc. of 41st IEEE FOCS.","DOI":"10.1109\/SFCS.2000.892325"},{"key":"38_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of 5th RANDOM","author":"A.E.F. Clementi","year":"2001","unstructured":"A.E.F. Clementi, P. Crescenzi, A. Monti, P. Penna, and R. Silvestri (2001), On Computing Ad-Hoc Selective Families, to appear on Proc. of 5th RANDOM, LNCS."},{"key":"38_CR8","unstructured":"A.E.F. Clementi, A. Monti, and R. Silvestri (2001), Selective Families, Superimposed Codes, and Broadcasting in Unknown Radio Networks, Proc. of 12th ACM-SIAM SODA, 709\u2013718."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"A.E.F. Clementi, A. Monti, and R. Silvestri (2001), Distributed Multi-Broadcast in Unknown Radio Networks, to appear in Proc. of 20th ACM-PODC.","DOI":"10.1145\/383962.384040"},{"key":"38_CR10","unstructured":"R. Cole, R. Hariharan, and P. Indyk (1999), Tree Pattern matching and subset matching in deterministic O(nlog3 n)-time, Proc. of 10th ACM-SIAM SODA."},{"key":"38_CR11","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TIT.1985.1057022","volume":"31","author":"R. Gallager","year":"1985","unstructured":"R. Gallager (1985), A Perspective on Multiaccess Channels, IEEE Trans. Inform. Theory, 31, 124\u2013142.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"38_CR12","unstructured":"I. Gaber and Y. Mansour (1995), Broadcast in Radio Networks, Proc. of 6th ACM-SIAM SODA, 577\u2013585."},{"key":"38_CR13","unstructured":"P. Indyk (1997), Deterministic Superimposed Coding with Application to Pattern Matching, Proc. of IEEE 38th FOCS, 127\u2013136."},{"key":"38_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/3-540-68530-8_24","volume-title":"Proc. of 6th ESA","author":"E. Kranakis","year":"1998","unstructured":"E. Kranakis, D. Krizanc, and A. Pelc (1998), Fault-Tolerant Broadcasting in Radio Networks, Proc. of 6th ESA, LNCS 1461, 283\u2013294."},{"key":"38_CR15","unstructured":"E. Kushilevitz and Y. Mansour (1998), Computation in Noisy Radio Networks, Proc. of 9th ACM-SIAM SODA, 236\u2013243."},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"R. Motwani and P. Raghavan (1995), Randomized Algorithms, Cambridge University Press.","DOI":"10.1017\/CBO9780511814075"},{"key":"38_CR17","doi-asserted-by":"crossref","unstructured":"E. Pagani and G. Rossi (1997), Reliable Broadcast in Mobile Multihop Packet Networks, Proc. of 3rd ACM-IEEE MOBICOM, 34\u201342.","DOI":"10.1145\/262116.262125"},{"key":"38_CR18","unstructured":"A. Pelc (2000), Broadcasting in Radio Networks, unpublished manuscript."},{"key":"38_CR19","doi-asserted-by":"crossref","unstructured":"T. S. Rappaport (1996), Wireless Communications: Principles and Practice, Prentice Hall.","DOI":"10.1007\/978-1-4615-5491-2"},{"key":"38_CR20","unstructured":"L.G. Roberts (1972), Aloha Packet System with and without Slots and Capture, ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute."},{"key":"38_CR21","doi-asserted-by":"crossref","unstructured":"J. E. Wieselthier, G. D. Ngyuyen, and A. Ephremides (2000), \u201cOn the Construction of energy-Efficient Broadcast and Multicast Trees in Wireless Networks\u201d, Proc. of 19th IEEE INFOCOM.","DOI":"10.1109\/INFCOM.2000.832232"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2014 ESA 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44676-1_38","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:44:16Z","timestamp":1556426656000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44676-1_38"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424932","9783540446767"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44676-1_38","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}