{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:46:22Z","timestamp":1725507982594},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/wiopt.2014.6850327","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T18:32:29Z","timestamp":1406658749000},"page":"413-420","source":"Crossref","is-referenced-by-count":1,"title":["Not always sparse: Flooding time in partially connected mobile ad hoc networks"],"prefix":"10.1109","author":[{"given":"Lorenzo","family":"Maggi","sequence":"first","affiliation":[]},{"given":"Francesco","family":"De Pellegrini","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"19","DOI":"10.1109\/TCOMM.2011.020811.090163"},{"doi-asserted-by":"publisher","key":"17","DOI":"10.1023\/A:1022175620150"},{"doi-asserted-by":"publisher","key":"18","DOI":"10.1109\/TNET.2012.2200260"},{"year":"1996","author":"ross","journal-title":"Stochastic Processes","key":"15"},{"doi-asserted-by":"publisher","key":"16","DOI":"10.1109\/TNET.2007.897964"},{"doi-asserted-by":"publisher","key":"13","DOI":"10.1109\/18.825799"},{"year":"2013","author":"maggi","journal-title":"Not Always Sparse Flooding Time in Partially Connected Mobile Ad Hoc Networks","key":"14"},{"doi-asserted-by":"publisher","key":"11","DOI":"10.1016\/j.peva.2005.07.018"},{"doi-asserted-by":"publisher","key":"12","DOI":"10.1109\/TNET.2002.801403"},{"key":"3","first-page":"121","article-title":"How to explore a fast-changing world (cover time of a simple random walk on evolving graphs","author":"avin","year":"2008","journal-title":"Proc of ICALP"},{"doi-asserted-by":"publisher","key":"20","DOI":"10.1016\/j.comnet.2006.11.028"},{"doi-asserted-by":"publisher","key":"2","DOI":"10.1137\/120865021"},{"doi-asserted-by":"publisher","key":"1","DOI":"10.1016\/j.peva.2009.09.001"},{"doi-asserted-by":"publisher","key":"10","DOI":"10.1109\/TNET.2008.2010218"},{"doi-asserted-by":"publisher","key":"7","DOI":"10.1109\/INFCOM.2007.51"},{"doi-asserted-by":"publisher","key":"6","DOI":"10.1109\/TNET.2012.2204407"},{"doi-asserted-by":"publisher","key":"5","DOI":"10.1145\/1400751.1400781"},{"year":"2001","key":"4"},{"key":"9","article-title":"Complexity of minimum spanning tree in evolving graphs and the minimum-energy broadcast routing problem","author":"ferreira","year":"2004","journal-title":"Proc WiOpt'04"},{"doi-asserted-by":"publisher","key":"8","DOI":"10.1109\/MNET.2004.1337732"}],"event":{"name":"2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)","start":{"date-parts":[[2014,5,12]]},"location":"Hammamet, Tunisia","end":{"date-parts":[[2014,5,16]]}},"container-title":["2014 12th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6847314\/6850267\/06850327.pdf?arnumber=6850327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T17:29:24Z","timestamp":1490290164000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6850327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/wiopt.2014.6850327","relation":{},"subject":[],"published":{"date-parts":[[2014,5]]}}}