{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T07:20:48Z","timestamp":1772608848037,"version":"3.50.1"},"reference-count":39,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":3735,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1016\/s0304-3975(02)00851-4","type":"journal-article","created":{"date-parts":[[2003,4,4]],"date-time":"2003-04-04T23:26:12Z","timestamp":1049498772000},"page":"337-364","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":109,"title":["Distributed broadcast in radio networks of unknown topology"],"prefix":"10.1016","volume":"302","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":"78","reference":[{"key":"10.1016\/S0304-3975(02)00851-4_BIB1","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/0022-0000(91)90015-W","article-title":"A lower bound for radio broadcast","volume":"43","author":"Alon","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB2","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB3","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/0022-0000(92)90042-H","article-title":"On the time-complexity of broadcast operations in multi-hop radio networks","volume":"45","author":"Bar-Yehuda","year":"1992","journal-title":"J. Comput. System Sci."},{"issue":"4","key":"10.1016\/S0304-3975(02)00851-4_BIB4","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/0222055","article-title":"Multiple communication in multi-hop radio networks","volume":"22","author":"Bar-Yehuda","year":"1993","journal-title":"SICOMP"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB5","doi-asserted-by":"crossref","first-page":"799","DOI":"10.1109\/90.811446","article-title":"A mobility-transparent deterministic broadcast for ad hoc networks","volume":"7","author":"Basagni","year":"1999","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/s004460050030","article-title":"Lower bounds for the broadcast problem in mobile radio networks","volume":"10","author":"Bruschi","year":"1997","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB7","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/90.282605","article-title":"Making transmission schedule immune to topology changes in multi-hop packet radio networks","volume":"2","author":"Chlamtac","year":"1994","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB8","doi-asserted-by":"crossref","first-page":"804","DOI":"10.1109\/90.650140","article-title":"Time-spread multiple access (TSMA) protocols for multihop mobile radio networks","volume":"5","author":"Chlamtac","year":"1997","journal-title":"IEEE\/ACM Trans. Networking"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB9","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s446-002-8028-1","article-title":"Deterministic broadcasting in unknown radio networks","volume":"15","author":"Chlebus","year":"2002","journal-title":"Distributed Comput."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB10","doi-asserted-by":"crossref","unstructured":"B.S. Chlebus, L. Ga\u0327sieniec, A. Ostlin, J.M. Robson, Deterministic radio broadcasting, 27th ICALP, Lecture Notes in Computer Science, Vol. 1853, 2000, pp. 717\u2013728.","DOI":"10.1007\/3-540-45022-X_60"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB11","doi-asserted-by":"crossref","unstructured":"M. Chrobak, L. Ga\u0327sieniec, W. Rytter, Fast broadcasting and gossiping in radio networks, 41st IEEE FOCS, 2000, pp. 575\u2013581.","DOI":"10.1109\/SFCS.2000.892325"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB12","doi-asserted-by":"crossref","unstructured":"S. Chaudhuri, J. Radhakrishnan, Deterministic restriction on circuit complexity, 28th ACM STOC, 1986, pp. 30\u201336.","DOI":"10.1145\/237814.237824"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB13","unstructured":"A.E.F. Clementi, A. Monti, R. Silvestri, Selective families, superimposed codes, and broadcasting in unknown radio networks, 12th ACM-SIAM SODA, 2001, pp. 709\u2013718."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB14","doi-asserted-by":"crossref","unstructured":"A.E.F. Clementi, A. Monti, R. Silvestri, Distributed multi-broadcast in unknown radio networks, 20th ACM PODC, 2001, pp. 255\u2013263.","DOI":"10.1145\/383962.384040"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB15","doi-asserted-by":"crossref","unstructured":"A. Clementi, A. Monti, R. Silvestri, Round robin is optimal for fault-tolerant broadcasting on wireless networks, 9th ESA, Lecture Notes in Computer Science, Vol. 2161, 2001, pp. 452\u2013463.","DOI":"10.1007\/3-540-44676-1_38"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB16","unstructured":"R. Cole, R. Hariharan, P. Indyk, Tree pattern matching and subset matching in deterministic O(nlog3n)-time, 10th ACM-SIAM SODA, 1999, pp. 245\u2013254."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB17","doi-asserted-by":"crossref","unstructured":"K. Diks, E. Kranakis, D. Krizanc, A. Pelc, The impact knowledge on broadcasting time in radio networks, 7th ESA, Lecture Notes in Computer Science, Vol. 1643, 1999, pp. 41\u201352.","DOI":"10.1007\/3-540-48481-7_5"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB18","first-page":"1","article-title":"A survey of superimposed code theory","volume":"12","author":"Dyachkov","year":"1983","journal-title":"Problems Control Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","article-title":"Families of finite sets in which no set is covered by the union of r others","volume":"51","author":"Erd\u00f6s","year":"1985","journal-title":"Israel J. Math."},{"issue":"6","key":"10.1016\/S0304-3975(02)00851-4_BIB20","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1017\/S0963548301004783","article-title":"A note on counting very different sequences","volume":"10","author":"Fachini","year":"2001","journal-title":"Combin. Probab. Comput."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB21","series-title":"Information Retrieval\u2014Data Structures and Algorithms","article-title":"Signature files","author":"Faloutsos","year":"1992"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB22","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1016\/0097-3165(85)90035-4","article-title":"Forbidding just one intersection","volume":"39","author":"Frankl","year":"1985","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB23","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1006\/jcta.1996.0012","article-title":"On r-cover-free families","volume":"73","author":"F\u00fcredi","year":"1996","journal-title":"J. Combin. Theory Ser. A"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB24","first-page":"124","article-title":"A perspective on multiaccess channels","volume":"31","author":"Gallager","year":"1985","journal-title":"IEEE Trans. Inform. Theory (special issue on random access communications)"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB25","first-page":"257","article-title":"Non-adaptive hypergeometric group testing","volume":"22","author":"Hwang","year":"1987","journal-title":"Studia Sci. Math. Hungarica"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB26","doi-asserted-by":"crossref","unstructured":"P. Indyk, Deterministic superimposed coding with application to pattern matching, 38th IEEE FOCS, 1997, pp. 127\u2013136.","DOI":"10.1109\/SFCS.1997.646101"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB27","unstructured":"P. Indyk, Explicit construction of selectors and related combinatorial structures, with applications, ACM-SIAM SODA, 2002, pp. 697\u2013704."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB28","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","article-title":"Nonrandom binary superimposed codes","volume":"10","author":"Kautz","year":"1964","journal-title":"IEEE Trans. Inform. Theory"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB29","doi-asserted-by":"crossref","unstructured":"D.R. Kowalski, A. Pelc, Deterministic broadcasting time in radio networks of unknown topology, 43rd IEEE FOCS, 2002, pp. 63\u201372.","DOI":"10.1109\/SFCS.2002.1181883"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB30","series-title":"6th ESA","first-page":"283","article-title":"Fault-tolerant broadcasting in radio networks","volume":"Vol. 1461","author":"Kranakis","year":"1998"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB31","doi-asserted-by":"crossref","first-page":"702","DOI":"10.1137\/S0097539794279109","article-title":"An \u03a9(Dlog(n\/D)) lower bound for broadcast in radio networks","volume":"27","author":"Kushilevitz","year":"1998","journal-title":"SICOMP"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB32","unstructured":"E. Kushilevitz, Y. Mansour, Computation in noisy radio networks, Ninth ACM-SIAM SODA, 1998, pp. 236\u2013243."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB33","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0221015","article-title":"Locality in distributed graph coloring","volume":"21","author":"Linial","year":"1992","journal-title":"SICOMP"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB34","series-title":"Randomized algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB35","doi-asserted-by":"crossref","unstructured":"E. Pagani, G. Rossi, Reliable broadcast in mobile multihop packet networks, Third ACM-IEEE MOBICOM, 1997, pp. 34\u201342.","DOI":"10.1145\/262116.262125"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB36","series-title":"Wireless Information Networks","author":"Pahlavan","year":"1995"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB37","series-title":"Wireless Communications: Principles and Practice","author":"Rappaport","year":"1996"},{"key":"10.1016\/S0304-3975(02)00851-4_BIB38","unstructured":"L.G. Roberts, Aloha packet system with and without slots and capture, ASS Notes 8, Advanced Research Projects Agency, Network Information Center, Stanford Research Institute, 1972."},{"key":"10.1016\/S0304-3975(02)00851-4_BIB39","doi-asserted-by":"crossref","unstructured":"J.E. Wieselthier, G.D. Nguyen, A. Ephremides, On the construction of energy-efficient broadcast and multicast trees in wireless networks, IEEE INFOCOM, 2000, pp. 585\u2013594.","DOI":"10.1109\/INFCOM.2000.832232"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008514?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397502008514?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:35Z","timestamp":1759625555000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397502008514"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":39,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["S0304397502008514"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(02)00851-4","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2003,6]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Distributed broadcast in radio networks of unknown topology","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(02)00851-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}