{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:27:48Z","timestamp":1761611268805},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642128073"},{"type":"electronic","value":"9783642128080"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12808-0_10","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T10:12:27Z","timestamp":1284977547000},"page":"103-116","source":"Crossref","is-referenced-by-count":3,"title":["Minimum Expected *-Cast Time in DTNs"],"prefix":"10.1007","author":[{"given":"Andreea","family":"Picu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thrasyvoulos","family":"Spyropoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"10_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1017\/S002190020001946X","volume":"40","author":"I. Adler","year":"2003","unstructured":"Adler, I., Oren, S., et al.: The coupon-collector\u2019s problem revisited. J. Appl. Probab.\u00a040(2), 513\u2013518 (2003)","journal-title":"J. Appl. Probab."},{"key":"10_CR2","first-page":"171","volume-title":"STOC 2000","author":"W. Aiello","year":"2000","unstructured":"Aiello, W., Chung, F., et al.: A random graph model for massive graphs. In: STOC 2000, pp. 171\u2013180. ACM, New York (2000)"},{"issue":"1","key":"10_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1103\/RevModPhys.74.47","volume":"74","author":"R. Albert","year":"2002","unstructured":"Albert, R., Barab\u00e1si, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys.\u00a074(1), 47\u201397 (2002)","journal-title":"Rev. Mod. Phys."},{"key":"10_CR4","first-page":"1","volume-title":"ValueTools 2008","author":"E. Altman","year":"2008","unstructured":"Altman, E., Ba\u015far, T., et al.: Optimal monotone forwarding policies in delay tolerant mobile ad-hoc networks. In: ValueTools 2008, pp. 1\u201313. ICST, Brussels (2008)"},{"key":"10_CR5","first-page":"203","volume-title":"MSWiM 2008","author":"C. Boldrini","year":"2008","unstructured":"Boldrini, C., Conti, M., et al.: ContentPlace: social-aware data dissemination in opportunistic networks. In: MSWiM 2008, pp. 203\u2013210. ACM Press, New York (2008)"},{"issue":"2","key":"10_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1016\/0377-0427(95)00020-8","volume":"67","author":"S. Boneh","year":"1996","unstructured":"Boneh, S., Papanicolaou, V.: General asymptotic estimates for the coupon collector problem. J. Comput. Appl. Math.\u00a067(2), 277\u2013289 (1996)","journal-title":"J. Comput. Appl. Math."},{"key":"10_CR7","unstructured":"Borwein, J., Affleck, I., et al.: Convex? Convex! Convex II. SIAM: Problems and Solutions (2000)"},{"key":"10_CR8","first-page":"32","volume-title":"MobiHoc 2007","author":"E. Daly","year":"2007","unstructured":"Daly, E., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant MANETs. In: MobiHoc 2007, pp. 32\u201340. ACM Press, New York (2007)"},{"key":"10_CR9","first-page":"257","volume-title":"MobiHoc 2003","author":"H. Dubois-Ferriere","year":"2003","unstructured":"Dubois-Ferriere, H., Grossglauser, M., et al.: Age matters: efficient route discovery in mobile ad hoc networks using encounter ages. In: MobiHoc 2003, pp. 257\u2013266. ACM Press, New York (2003)"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N. Eagle","year":"2006","unstructured":"Eagle, N., Pentland, A.: Reality mining: sensing complex social systems. Personal Ubiquitous Comput.\u00a010(4), 255\u2013268 (2006)","journal-title":"Personal Ubiquitous Comput."},{"key":"10_CR11","volume-title":"An introduction to probability theory and its applications","author":"W. Feller","year":"1957","unstructured":"Feller, W.: An introduction to probability theory and its applications, 2nd edn., vol.\u00a02. John Wiley & Sons, Chichester (1957)","edition":"2"},{"issue":"3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0166-218X(92)90177-C","volume":"39","author":"P. Flajolet","year":"1992","unstructured":"Flajolet, P., Gardy, D., et al.: Birthday paradox, coupon collectors, caching algorithms and self-organizing search. Disc. Appl. Math.\u00a039(3), 207\u2013229 (1992)","journal-title":"Disc. Appl. Math."},{"key":"10_CR13","first-page":"299","volume-title":"MobiHoc 2009","author":"W. Gao","year":"2009","unstructured":"Gao, W., Li, Q., et al.: Multicasting in delay tolerant networks: a social network perspective. In: MobiHoc 2009, pp. 299\u2013308. ACM, New York (2009)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Hossmann, T., Legendre, F., et al.: From Contacts to Graphs: Pitfalls in Using Complex Network Analysis for DTN Routing. In: INFOCOM NetSciCom 2009, pp. 1\u20136 (2009)","DOI":"10.1109\/INFCOMW.2009.5072147"},{"key":"10_CR15","first-page":"244","volume-title":"SIGCOMM WDTN 2005","author":"P. Hui","year":"2005","unstructured":"Hui, P., Chaintreau, A., et al.: Pocket switched networks and human mobility in conference environments. In: SIGCOMM WDTN 2005, pp. 244\u2013251. ACM, New York (2005)"},{"key":"10_CR16","first-page":"241","volume-title":"MobiHoc 2008","author":"P. Hui","year":"2008","unstructured":"Hui, P., Crowcroft, J., et al.: Bubble rap: social-based forwarding in delay tolerant networks. In: MobiHoc 2008, pp. 241\u2013250. ACM Press, New York (2008)"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Leguay, J., Friedman, T., et al.: Evaluating Mobility Pattern Space Routing for DTNs. In: INFOCOM 2006, pp. 1\u201310 (2006)","DOI":"10.1109\/INFOCOM.2006.299"},{"key":"10_CR18","first-page":"519","volume-title":"WOWMOM 2006","author":"V. Lenders","year":"2006","unstructured":"Lenders, V., Wagner, J., et al.: Measurements from an 802.11b Mobile Ad Hoc Network. In: WOWMOM 2006, pp. 519\u2013524. IEEE Computer Society, Washington (2006)"},{"issue":"3","key":"10_CR19","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A. Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., et al.: Probabilistic routing in intermittently connected networks. SIGMOBILE Mob. Comput. Commun. Rev.\u00a07(3), 19\u201320 (2003)","journal-title":"SIGMOBILE Mob. Comput. Commun. Rev."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1080\/15427951.2006.10129122","volume":"3","author":"M. Mihail","year":"2006","unstructured":"Mihail, M., Saberi, A., et al.: Random walks with lookahead on power law random graphs. Internet Math.\u00a03(2), 147\u2013152 (2006)","journal-title":"Internet Math."},{"issue":"2","key":"10_CR21","first-page":"132","volume":"15","author":"H. Nath","year":"1973","unstructured":"Nath, H.: Waiting Time in the Coupon-Collector\u2019s Problem. Austr. & New Zeal. J. of Stat.\u00a015(2), 132\u2013135 (1973)","journal-title":"Austr. & New Zeal. J. of Stat."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1137\/S003614450342480","volume":"45","author":"M.E.J. Newman","year":"2003","unstructured":"Newman, M.E.J.: The structure and function of complex networks. SIAM Review\u00a045, 167 (2003)","journal-title":"SIAM Review"},{"key":"10_CR23","first-page":"252","volume-title":"SIGCOMM WDTN 2005","author":"T. Spyropoulos","year":"2005","unstructured":"Spyropoulos, T., Psounis, K., et al.: Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: SIGCOMM WDTN 2005, pp. 252\u2013259. ACM Press, New York (2005)"},{"key":"10_CR24","unstructured":"van der Hofstad, R.: Random Graphs and Complex Networks (2009)"},{"issue":"1","key":"10_CR25","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/COMST.2006.323440","volume":"8","author":"Z. Zhang","year":"2007","unstructured":"Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communications Surveys & Tutorials\u00a08(1), 24\u201337 (2007)","journal-title":"IEEE Communications Surveys & Tutorials"},{"key":"10_CR26","first-page":"268","volume-title":"SIGCOMM WDTN 2005","author":"W. Zhao","year":"2005","unstructured":"Zhao, W., Ammar, M., et al.: Multicasting in delay tolerant networks: semantic models and routing algorithms. In: SIGCOMM WDTN 2005, pp. 268\u2013275. ACM, New York (2005)"}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","Bioinspired Models of Network, Information, and Computing Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12808-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T22:45:28Z","timestamp":1559688328000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12808-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642128073","9783642128080"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12808-0_10","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2010]]}}}