{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T14:00:32Z","timestamp":1793541632229,"version":"4.5.0"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2014,10,9]],"date-time":"2014-10-09T00:00:00Z","timestamp":1412812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Distrib. Comput."],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1007\/s00446-014-0230-7","type":"journal-article","created":{"date-parts":[[2014,10,8]],"date-time":"2014-10-08T19:24:50Z","timestamp":1412796290000},"page":"407-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Randomized broadcast in radio networks with collision detection"],"prefix":"10.1007","volume":"28","author":[{"given":"Mohsen","family":"Ghaffari","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Haeupler","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Majid","family":"Khabbazian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,10,9]]},"reference":[{"issue":"2","key":"230_CR1","doi-asserted-by":"crossref","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. Comput. Syst. Sci. 43(2), 290\u2013298 (1991)","journal-title":"J. Comput. Syst. Sci."},{"key":"230_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Ghaffari, M., Haeupler, B., Khabbazian, M.: Broadcast throughput in radio networks: routing vs. network coding. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 1831\u20131843 (2014)","DOI":"10.1137\/1.9781611973402.132"},{"key":"230_CR3","doi-asserted-by":"crossref","unstructured":"Bar-Yehuda, R., Goldreich, O., Itai, A.: On the time-complexity of broadcast in multi-hop radio networks: an exponential gap between determinism and randomization. J. Comput. Syst. Sci. 45(1), 104\u2013126 (1992)","DOI":"10.1016\/0022-0000(92)90042-H"},{"issue":"4","key":"230_CR4","doi-asserted-by":"crossref","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 multi-hop radio networks. SIAM J. Comput. 22(4), 875\u2013887 (1993)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"230_CR5","doi-asserted-by":"crossref","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. Commun. 33(12), 1240\u20131246 (1985)","journal-title":"IEEE Trans. Commun."},{"key":"230_CR6","doi-asserted-by":"crossref","unstructured":"Chlebus, B., Kowalski, D., Pelc, A., Rokicki, M.A.: Efficient distributed communication in ad-hoc radio networks. In: Proceedings of the International Conference on Automata, Languages and Programming, pp. 613\u2013624 (2011)","DOI":"10.1007\/978-3-642-22012-8_49"},{"key":"230_CR7","doi-asserted-by":"crossref","unstructured":"Czumaj, A., Rytter, W.: Broadcasting algorithms in radio networks with unknown topology. In: Proceedings of the Symposium on Foundations of Computer Science, pp. 492\u2013501 (2003)","DOI":"10.1109\/SFCS.2003.1238222"},{"key":"230_CR8","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Peleg, D., Xin, Q.: Faster communication in known topology radio networks. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 129\u2013137 (2005)","DOI":"10.1145\/1073814.1073840"},{"key":"230_CR9","doi-asserted-by":"crossref","unstructured":"Gasieniec, L., Potapov, I.: Gossiping with unit messages in known radio networks. In: IFIP TCS, pp. 193\u2013205 (2002)","DOI":"10.1007\/978-0-387-35608-2_17"},{"key":"230_CR10","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Fast structuring of radio networks for multi-message communications. In: Proceedings of the International Symposium on Distributed Computing (2013)","DOI":"10.1007\/978-3-642-41527-2_34"},{"key":"230_CR11","doi-asserted-by":"crossref","unstructured":"Ghaffari, M., Haeupler, B.: Near optimal leader election in multi-hop radio networks. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms, pp. 748\u2013766 (2013)","DOI":"10.1137\/1.9781611973105.54"},{"key":"230_CR12","doi-asserted-by":"crossref","unstructured":"Haeupler, B.: Analyzing network coding gossip made easy. In: Proceedings of the Symposium on Theory of Computing, STOC\u201911, pp. 293\u2013302 (2011)","DOI":"10.1145\/1993636.1993676"},{"key":"230_CR13","doi-asserted-by":"crossref","unstructured":"Haeupler, B., Kim, M., Medard, M.: Optimality of network coding with buffers. In: Proceedings of the IEEE Information Theory Workshop, pp. 533\u2013537 (2011)","DOI":"10.1109\/ITW.2011.6089559"},{"key":"230_CR14","doi-asserted-by":"crossref","unstructured":"Ho, T., Koetter, R., Medard, M., Karger, D., Effros, M.: The benefits of coding over routing in a randomized setting. In: Proceedings of the IEEE International Symposium on Information Theory (2003)","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"230_CR15","doi-asserted-by":"crossref","unstructured":"Khabbazian, M., Kowalski, D.: Time-efficient randomized multiple-message broadcast in radio networks. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 373\u2013380 (2011)","DOI":"10.1145\/1993806.1993884"},{"key":"230_CR16","doi-asserted-by":"crossref","unstructured":"Kowalski, D., Pelc, A.: Broadcasting in undirected ad hoc radio networks. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 73\u201382 (2003)","DOI":"10.1145\/872035.872045"},{"issue":"3","key":"230_CR17","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s00446-006-0007-8","volume":"19","author":"D Kowalski","year":"2007","unstructured":"Kowalski, D., Pelc, A.: Optimal deterministic broadcasting in known topology radio networks. Distrib. Comput. 19(3), 185\u2013195 (2007)","journal-title":"Distrib. Comput."},{"key":"230_CR18","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Mansour, Y.: An $${\\Omega }(D\\log (N\/D))$$ \u03a9 ( D log ( N \/ D ) ) lower bound for broadcast in radio networks. In: Proceedings of the ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, pp. 65\u201374 (1993)","DOI":"10.1145\/164051.164059"},{"key":"230_CR19","doi-asserted-by":"crossref","unstructured":"Manne, F., Xin, Q.: Optimal gossiping with unit size messages in known topology radio networks. In: Proceedings of the Workshop on Combinatorial and Algorithmic Aspects of Networking, pp. 125\u2013134 (2006)","DOI":"10.1007\/11922377_11"},{"key":"230_CR20","doi-asserted-by":"crossref","unstructured":"Peleg, D.: Time-efficient broadcasting in radio networks: a review. In: Proceedings of the International Conference on Distributed Computing and Internet Technologies, pp. 1\u201318 (2007)","DOI":"10.1007\/978-3-540-77115-9_1"},{"key":"230_CR21","doi-asserted-by":"crossref","unstructured":"Schneider, J., Wattenhofer, R.: What is the use of collision detection (in wireless networks)?. In: Proceedings of the 24th International Conference on Distributed Computing, pp. 133\u2013147 (2010)","DOI":"10.1007\/978-3-642-15763-9_14"},{"key":"230_CR22","unstructured":"Xin, Q.: Personal communication (2012)"}],"container-title":["Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0230-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00446-014-0230-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00446-014-0230-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,16]],"date-time":"2019-08-16T00:41:15Z","timestamp":1565916075000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00446-014-0230-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,9]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["230"],"URL":"https:\/\/doi.org\/10.1007\/s00446-014-0230-7","relation":{},"ISSN":["0178-2770","1432-0452"],"issn-type":[{"value":"0178-2770","type":"print"},{"value":"1432-0452","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,9]]}}}