{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T23:37:41Z","timestamp":1768261061685,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,11]],"date-time":"2014-08-11T00:00:00Z","timestamp":1407715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,11]]},"DOI":"10.1145\/2634274.2634279","type":"proceedings-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:39Z","timestamp":1406924019000},"page":"39-46","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Dynamic multiple-message broadcast"],"prefix":"10.1145","author":[{"given":"Dariusz R.","family":"Kowalski","sequence":"first","affiliation":[{"name":"University of Liverpool, Liverpool, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Miguel A.","family":"Mosteiro","sequence":"additional","affiliation":[{"name":"Kean University, Union, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tevin","family":"Rouse","sequence":"additional","affiliation":[{"name":"Kean University, Union, NJ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings","volume":"8205","author":"Afek Y.","year":"2013","unstructured":"Y. Afek , editor. Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings , volume 8205 of Lecture Notes in Computer Science. Springer , 2013 . Y. Afek, editor. Distributed Computing - 27th International Symposium, DISC 2013, Jerusalem, Israel, October 14-18, 2013. Proceedings, volume 8205 of Lecture Notes in Computer Science. Springer, 2013."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90015-W"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1833515.1833545"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222055"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073970.1074023"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1987.1676861"},{"key":"e_1_3_2_1_7_1","volume-title":"Proc. of INFOCOM","author":"Chlamtac I.","year":"1987","unstructured":"I. Chlamtac and O. Weinstein . The wave expansion approach to broadcasting in multihop networks . In Proc. of INFOCOM , 1987 . I. Chlamtac and O. Weinstein. The wave expansion approach to broadcasting in multihop networks. In Proc. of INFOCOM, 1987."},{"key":"e_1_3_2_1_8_1","first-page":"401","volume-title":"Randomized communication in radio networks","author":"Chlebus B. S.","year":"2001","unstructured":"B. S. Chlebus . Randomized communication in radio networks , volume I , pages 401 -- 456 . Kluwer Academic Publishers , 2001 . B. S. Chlebus. Randomized communication in radio networks, volume I, pages 401 -- 456. Kluwer Academic Publishers, 2001."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"B. S.\n      Chlebus D. R.\n      Kowalski A.\n      Pelc and \n      M. A.\n      Rokicki\n  . \n  Efficient distributed communication in ad-hoc radio networks\n  . In L. Aceto M. Henzinger and J. Sgall editors ICALP (2) volume \n  6756\n   of \n  Lecture Notes in Computer Science pages \n  613\n  --\n  624\n  . \n  Springer 2011\n  .   B. S. Chlebus D. R. Kowalski A. Pelc and M. A. Rokicki. Efficient distributed communication in ad-hoc radio networks. In L. Aceto M. Henzinger and J. Sgall editors ICALP (2) volume 6756 of Lecture Notes in Computer Science pages 613--624. Springer 2011.","DOI":"10.1007\/978-3-642-22012-8_49"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-009-0086-4"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2071379.2071384"},{"key":"e_1_3_2_1_12_1","first-page":"709","volume-title":"Selective families, superimposed codes, and broadcasting on unknown radio networks","author":"Clementi A. E. F.","year":"2001","unstructured":"A. E. F. Clementi , A. Monti , and R. Silvestri . Selective families, superimposed codes, and broadcasting on unknown radio networks . In S. R. Kosaraju, editor, SODA, pages 709 -- 718 . ACM\/SIAM , 2001 . A. E. F. Clementi, A. Monti, and R. Silvestri. Selective families, superimposed codes, and broadcasting on unknown radio networks. In S. R. Kosaraju, editor, SODA, pages 709--718. ACM\/SIAM, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/946243.946320"},{"key":"e_1_3_2_1_14_1","first-page":"358","volume-title":"Afek {1}","author":"Daum S.","unstructured":"S. Daum , S. Gilbert , F. Kuhn , and C. C. Newport . Broadcast in the ad hoc sinr model . In Afek {1} , pages 358 -- 372 . S. Daum, S. Gilbert, F. Kuhn, and C. C. Newport. Broadcast in the ad hoc sinr model. In Afek {1}, pages 358--372."},{"key":"e_1_3_2_1_15_1","first-page":"208","volume-title":"S.-H","author":"Marco G. De","year":"2008","unstructured":"G. De Marco . Distributed broadcast in unknown radio networks . In S.-H . Teng, editor, SODA, pages 208 -- 217 . SIAM , 2008 . G. De Marco. Distributed broadcast in unknown radio networks. In S.-H. Teng, editor, SODA, pages 208--217. SIAM, 2008."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0011-z"},{"key":"e_1_3_2_1_17_1","volume-title":"A bound on the throughput of radio networks. CoRR, abs\/1302.0264","author":"Ghaffari M.","year":"2013","unstructured":"M. Ghaffari , B. Haeupler , and M. Khabbazian . A bound on the throughput of radio networks. CoRR, abs\/1302.0264 , 2013 . M. Ghaffari, B. Haeupler, and M. Khabbazian. A bound on the throughput of radio networks. CoRR, abs\/1302.0264, 2013."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484248"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_44"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_8"},{"key":"e_1_3_2_1_21_1","first-page":"373","volume-title":"Afek {1}","author":"Jurdzinski T.","unstructured":"T. Jurdzinski , D. R. Kowalski , M. Rozanski , and G. Stachowiak . Distributed randomized broadcasting in wireless networks under the sinr model . In Afek {1} , pages 373 -- 387 . T. Jurdzinski, D. R. Kowalski, M. Rozanski, and G. Stachowiak. Distributed randomized broadcasting in wireless networks under the sinr model. In Afek {1}, pages 373--387."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40164-0_20"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2332432.2332487"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1888781.1888803"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993884"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073843"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0126-7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0007-8"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794279109"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374632"}],"event":{"name":"MobiHoc'14: The Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","location":"Philadelphia Pennsylvania USA","acronym":"MobiHoc'14","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the 10th ACM international workshop on Foundations of mobile computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2634274.2634279","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2634274.2634279","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:19:27Z","timestamp":1750231167000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2634274.2634279"}},"subtitle":["bounding throughput in the affectance model"],"short-title":[],"issued":{"date-parts":[[2014,8,11]]},"references-count":30,"alternative-id":["10.1145\/2634274.2634279","10.1145\/2634274"],"URL":"https:\/\/doi.org\/10.1145\/2634274.2634279","relation":{},"subject":[],"published":{"date-parts":[[2014,8,11]]},"assertion":[{"value":"2014-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}