{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,12]],"date-time":"2024-09-12T06:35:59Z","timestamp":1726122959194},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2015,7,1]],"date-time":"2015-07-01T00:00:00Z","timestamp":1435708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. on Mobile Comput."],"published-print":{"date-parts":[[2015,7,1]]},"DOI":"10.1109\/tmc.2014.2356466","type":"journal-article","created":{"date-parts":[[2014,9,10]],"date-time":"2014-09-10T18:51:08Z","timestamp":1410375068000},"page":"1530-1544","source":"Crossref","is-referenced-by-count":12,"title":["Towards Optimal Broadcast in Wireless Networks"],"prefix":"10.1109","volume":"14","author":[{"given":"Milen","family":"Nikolov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zygmunt J.","family":"Haas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90015-W"},{"key":"ref38","first-page":"115","article-title":"How efficient can gossip be? (on the cost of resilient information exchange)","author":"alistarh","year":"2010","journal-title":"Proc 37th Int Colloq Conf Automata Lang Program"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1999.752157"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(90)90358-O"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009201"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0903"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45655-4_37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208920"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5061995"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.72"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377675"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSEN.2010.2051326"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1002\/net.10097"},{"key":"ref2","first-page":"129","article-title":"On the reduction of broadcast redundancy in mobile ad hoc networks","author":"peng","year":"2000","journal-title":"Proc 1st ACM Int Symp Mobile Ad Hoc Netw Comput"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/313451.313525"},{"key":"ref20","first-page":"1597","article-title":"Distributed construction of connected dominating set in wireless ad hoc networks","author":"wan","year":"2002","journal-title":"Proc 21st Annu Joint Conf IEEE Comput Commun"},{"key":"ref22","first-page":"658","article-title":"An effective distributed approximation algorithm for constructing minimum connected dominating set in wireless ad hoc networks","author":"gao","year":"2004","journal-title":"Proc 4th Int Conf Comput Inf Technol"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1167935.1167941"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2004.62"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2007.06.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2005.1651669"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2008.94"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062177"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.2002.994521"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2006.17"},{"key":"ref40","first-page":"676","article-title":"Uber die dichteste Kugellagerung","volume":"48","author":"t\u00f3th","year":"1943","journal-title":"Math Zeit"},{"key":"ref12","first-page":"2084","article-title":"Double-covered broadcast (DCB): A simple reliable broadcast algorithm in MANETs","author":"lou","year":"2004","journal-title":"Proc 23rd Annu Joint Conf IEEE Comput Commun"},{"key":"ref13","first-page":"347","article-title":"Leveraging 1-hop neighborhood knowledge for efficient flooding in wireless ad hoc networks","author":"cai","year":"2005","journal-title":"Proc IEEE 24th Int Perform Comput Commun Conf"},{"key":"ref14","first-page":"34","article-title":"Selecting forwarding neighbors in wireless ad hoc networks","author":"c?linescu","year":"2004","journal-title":"Proc 5th Int Workshop Discrete Algorithms Methods Mobile Comput Commun"},{"key":"ref15","first-page":"2240","article-title":"Broadcasting in ad hoc networks based on self-pruning","author":"sun","year":"2001","journal-title":"Proc 22nd Annu Joint Conf IEEE Comput Commun"},{"key":"ref16","first-page":"1530","article-title":"A generic broadcast protocol in ad hoc networks based on self-pruning","author":"wu","year":"2003","journal-title":"Proc Int Parallel Distrib Process Symp"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/313239.313261"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2007.4292837"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2009.78"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC.2003.1200529"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019424"},{"key":"ref6","article-title":"Stochastic flooding broadcast protocols in mobile wireless networks","author":"cartigny","year":"2003"},{"key":"ref5","first-page":"158","article-title":"Dynamic probabilistic retransmission in ad hoc networks","author":"scott","year":"2004","journal-title":"Proc IEEE Int Conf Netw"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/WIOPT.2006.1666475"},{"key":"ref7","first-page":"96","article-title":"Probabilistic broadcasting based on coverage area and neighbor confirmation in mobile ad hoc networks","author":"kim","year":"2004","journal-title":"Proc IEEE Global Telecommun Conf Workshops"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/1182807.1182817"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132907"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1089444.1089457"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2011.67"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2426656.2426658"},{"key":"ref47","first-page":"73","article-title":"Efficient network flooding and time synchronization with Glossy","author":"ferrari","year":"2011","journal-title":"Proc Int Conf Inf Process Sensor Netw"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/978-3-642-10631-6_71","article-title":"Tighter approximation bounds for minimum CDS in wireless ad hoc networks","author":"li","year":"2009","journal-title":"Proc 20th Int Symp Algorithms Comput"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2005.08.037"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2006.52"},{"key":"ref43","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-3-540-87779-0_33","article-title":"Theoretical bound and practical analysis of connected dominating set in ad hoc and sensor networks","author":"vahdatpour","year":"2008","journal-title":"Proc 22nd Int Symp Distrib Comput"}],"container-title":["IEEE Transactions on Mobile Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7755\/7116677\/06895168.pdf?arnumber=6895168","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,16]],"date-time":"2022-04-16T20:42:51Z","timestamp":1650141771000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6895168\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,7,1]]},"references-count":50,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tmc.2014.2356466","relation":{},"ISSN":["1536-1233"],"issn-type":[{"value":"1536-1233","type":"print"}],"subject":[],"published":{"date-parts":[[2015,7,1]]}}}