{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:18:00Z","timestamp":1750306680292,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"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\/2632951.2632982","type":"proceedings-article","created":{"date-parts":[[2014,8,1]],"date-time":"2014-08-01T20:13:39Z","timestamp":1406924019000},"page":"317-326","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Latency-optimized broadcast in mobile ad hoc networks without node coordination"],"prefix":"10.1145","author":[{"given":"Bin","family":"Tang","sequence":"first","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"given":"Baoliu","family":"Ye","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"given":"Sanglu","family":"Lu","sequence":"additional","affiliation":[{"name":"Nanjing University, Nanjing, China"}]},{"given":"Song","family":"Guo","sequence":"additional","affiliation":[{"name":"The University of Aizu, Aizu-Wakamatsu, Japan"}]},{"given":"Ivan","family":"Stojmenovic","sequence":"additional","affiliation":[{"name":"University of Ottawa, Ottawa, Canada"}]}],"member":"320","published-online":{"date-parts":[[2014,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2007.02.065"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90042-H"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513272"},{"key":"e_1_3_2_1_5_1","article-title":"On the role of mobility for multimessage gossip","author":"Chen Y.","year":"2013","unstructured":"Y. Chen , S. Shakkottai , and J. G. Andrews . On the role of mobility for multimessage gossip . IEEE Trans. Inf. Theory, pages 3953--3970 , 2013 . Y. Chen, S. Shakkottai, and J. G. Andrews. On the role of mobility for multimessage gossip. IEEE Trans. Inf. Theory, pages 3953--3970, 2013.","journal-title":"IEEE Trans. Inf. Theory, pages 3953--3970"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOM.1985.1096245"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2011.33"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2204407"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2075029.2075066"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2004.08.001"},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Allerton","author":"Deb S.","year":"2004","unstructured":"S. Deb and M. Medard . Algebraic gossip: a network coding approach to optimal multiple rumor mongering . In Proc. Allerton , 2004 . S. Deb and M. Medard. Algebraic gossip: a network coding approach to optimal multiple rumor mongering. In Proc. Allerton, 2004."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2005.1523338"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.874532"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.162"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.905588"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484248"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801403"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.1998.760846"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.825799"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.876186"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993676"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2003.1228459"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.881746"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.91"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061927"},{"key":"e_1_3_2_1_27_1","volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"Knuth D. E.","year":"1969","unstructured":"D. E. Knuth . The Art of Computer Programming, Volume 2: Seminumerical Algorithms . Addison Wesley , 1969 . D. E. Knuth. The Art of Computer Programming, Volume 2: Seminumerical Algorithms. Addison Wesley, 1969."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.818197"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374638"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0126-7"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-006-0007-8"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.807285"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374663"},{"key":"e_1_3_2_1_34_1","volume-title":"Probability and computing: Randomized Algorithms and Probabilistic Analysis","author":"Mitzenmacher M.","year":"2004","unstructured":"M. Mitzenmacher and E. Upfal . Probability and computing: Randomized Algorithms and Probabilistic Analysis . Cambridge University Press , 2004 . M. Mitzenmacher and E. Upfal. Probability and computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, 2004."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2006.261654"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847717"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","DOI":"10.1093\/acprof:oso\/9780198506263.001.0001","volume-title":"Random Geometric Graphs","author":"Penrose M.","year":"2003","unstructured":"M. Penrose . Random Geometric Graphs . Oxford University Press , 2003 . M. Penrose. Random Geometric Graphs. Oxford University Press, 2003."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993882"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.905154"},{"key":"e_1_3_2_1_40_1","article-title":"Order-optimal information dissemination in manets via network coding","author":"Tang B.","year":"2013","unstructured":"B. Tang , B. Ye , S. Guo , S. Lu , and D. O. Wu . Order-optimal information dissemination in manets via network coding . IEEE Trans. Parallel Distrib. Syst. , 2013 . To appear. B. Tang, B. Ye, S. Guo, S. Lu, and D. O. Wu. Order-optimal information dissemination in manets via network coding. IEEE Trans. Parallel Distrib. Syst., 2013. To appear.","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013763825347"},{"volume-title":"Poisson distribution --wikipedia, the free encyclopedia","year":"2013","key":"e_1_3_2_1_42_1","unstructured":"Wikipedia. Poisson distribution --wikipedia, the free encyclopedia , 2013 . Wikipedia. Poisson distribution --wikipedia, the free encyclopedia, 2013."},{"key":"e_1_3_2_1_43_1","article-title":"Batched sparse codes, 2012. accepted by","author":"Yang S.","unstructured":"S. Yang and R. W. Yeung . Batched sparse codes, 2012. accepted by IEEE Trans. Inf. Theory. S. Yang and R. W. Yeung. Batched sparse codes, 2012. accepted by IEEE Trans. Inf. Theory.","journal-title":"IEEE Trans. Inf. Theory."}],"event":{"name":"MobiHoc'14: The Fifteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Philadelphia Pennsylvania USA","acronym":"MobiHoc'14"},"container-title":["Proceedings of the 15th ACM international symposium on Mobile ad hoc networking and computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632951.2632982","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2632951.2632982","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:09Z","timestamp":1750230069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2632951.2632982"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,11]]},"references-count":43,"alternative-id":["10.1145\/2632951.2632982","10.1145\/2632951"],"URL":"https:\/\/doi.org\/10.1145\/2632951.2632982","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"}}]}}