{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,13]],"date-time":"2025-02-13T05:19:05Z","timestamp":1739423945436,"version":"3.37.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. Technol."],"published-print":{"date-parts":[[2009,9]]},"DOI":"10.1007\/s11390-009-9272-x","type":"journal-article","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T11:22:01Z","timestamp":1254136921000},"page":"975-986","source":"Crossref","is-referenced-by-count":3,"title":["Leapfrog: Optimal Opportunistic Routing in Probabilistically Contacted Delay Tolerant Networks"],"prefix":"10.1007","volume":"24","author":[{"given":"Ming-Jun","family":"Xiao","sequence":"first","affiliation":[]},{"given":"Liu-Sheng","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Qun-Feng","family":"Dong","sequence":"additional","affiliation":[]},{"given":"An","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Zhen-Guo","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2009,9,28]]},"reference":[{"unstructured":"Delay Tolerant Network Research Group. April 28, 2009, http:\/\/www.dtnrg.org\/ .","key":"9272_CR1"},{"doi-asserted-by":"crossref","unstructured":"Burgess J, Gallagher B, Jensen D et al. MaxProp: Routing for vehicle-based disruption-tolerant networks. In Proc. IEEE INFOCOM 2006, Barcelona, Spain, April 23\u201329, 2006, pp.1\u201311.","key":"9272_CR2","DOI":"10.1109\/INFOCOM.2006.228"},{"doi-asserted-by":"crossref","unstructured":"Burns B, Brock O, Levine B N. MV routing and capacity building in disruption tolerant networks. In Proc. IEEE IN-FOCOM 2005, Miami, USA, March 13\u201317, 2005, pp.398\u2013408.","key":"9272_CR3","DOI":"10.1109\/INFCOM.2005.1497909"},{"issue":"5","key":"9272_CR4","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1109\/JSAC.2008.080604","volume":"26","author":"V Conan","year":"2008","unstructured":"Conan V, Leguay J, Friedman T. Fixed point opportunistic routing in delay tolerant networks. IEEE Journal on Selected Areas in Communications, 2008, 26(5): 773\u2013782.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"doi-asserted-by":"crossref","unstructured":"Hui P, Crowcroft C, Yoneki E. BUBBLE rap: Social-based forwarding in delay tolerant networks. In Proc. ACM MobiHoc 2008, Hong Kong, China, May 27{30, 2008, pp.241\u2013250.","key":"9272_CR5","DOI":"10.1145\/1374618.1374652"},{"doi-asserted-by":"crossref","unstructured":"Jain S, Fall K, Patra R. Routing in a delay tolerant network. In Proc. ACM SIGCOMM 2004, Portland, USA, August 30\u2013September 3, 2004, pp.145\u2013158.","key":"9272_CR6","DOI":"10.1145\/1015467.1015484"},{"doi-asserted-by":"crossref","unstructured":"Jeremie L, Timur F, Vania C. Evaluating mobility pattern space routing for DTNs. In Proc. IEEE INFOCOM 2006, Barcelona, Spain, April 23\u201329, 2006, pp.1\u201310.","key":"9272_CR7","DOI":"10.1109\/INFOCOM.2006.299"},{"issue":"1","key":"9272_CR8","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/978-3-540-27767-5_24","volume":"3126","author":"A Lindgren","year":"2004","unstructured":"Lindgren A, Doria A, Schelen O. Probabilistic routing in intermittently connected networks. Lecture Notes in Computer Science, 2004, 3126(1): 239\u2013254.","journal-title":"Lecture Notes in Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Cong Liu, Jie Wu. Routing in a cyclic MobiSpace. In Proc. ACM MobiHoc 2008, Hong Kong, China, May 27\u201330, 2008, pp.351\u2013360.","key":"9272_CR9","DOI":"10.1145\/1374618.1374665"},{"doi-asserted-by":"crossref","unstructured":"Spyropoulos T, Psounis K, Raghavendra C. Spray and Wait: An efficient routing scheme for intermittently connected mobile networks. In Proc. ACM SIGCOMM Workshop on Delay-Tolerant Networking (WDTN) 2005, Philadelphia, USA, August 22\u201326, 2005, pp.252\u2013259.","key":"9272_CR10","DOI":"10.1145\/1080139.1080143"},{"unstructured":"Vahdate A, Becker D. Epidemic routing for partially-connected ad hoc networks. Technical Report CS-2000-06, Duke University, June 2000.","key":"9272_CR11"},{"doi-asserted-by":"crossref","unstructured":"Balazinska M, Castro P. Characterizing mobility and network usage in a corporate wireless local-area network. In Proc. ACM MobiSys 2003, San Francisco, USA, May 5\u20138, 2003, pp.303\u2013316.","key":"9272_CR12","DOI":"10.1145\/1066116.1066127"},{"doi-asserted-by":"crossref","unstructured":"Henderson T, Kotz D, Abyzov I. The changing usage of a mature campus-wide wireless network. In Proc. ACM MobiCom 2004, Philadelphia, USA, September 26\u2013October 1, 2004, pp.187\u2013201.","key":"9272_CR13","DOI":"10.1145\/1023720.1023739"},{"unstructured":"CRAWDAD data set. April 28, 2009, http:\/\/crawdad.cs.dartmouth.edu\/ .","key":"9272_CR14"},{"doi-asserted-by":"crossref","unstructured":"Srinivasan V, Motani M, Ooi W T. Analysis and implications of student contact patterns derived from campus schedules. In Proc. ACM MobiCom 2006, Los Angeles, USA, September 24\u201329, 2006, pp.86\u201397.","key":"9272_CR15","DOI":"10.1145\/1161089.1161100"},{"doi-asserted-by":"crossref","unstructured":"Tariq M M B, Ammar M, Zegura E. Message ferry route design for sparse ad hoc networks with mobile nodes. In Proc. ACM MobiHoc 2006, Florence, Italy, May 22\u201326, 2006, pp.37\u201348.","key":"9272_CR16","DOI":"10.1145\/1132905.1132910"},{"doi-asserted-by":"crossref","unstructured":"Zhao W, Ammar M, Zegura E. A message ferrying approach for data delivery in sparse mobile ad hoc networks. In Proc. ACM MobiHoc 2004, Tokyo, Japan, May 24\u201326, 2004, pp.187\u2013198.","key":"9272_CR17","DOI":"10.1145\/989459.989483"},{"doi-asserted-by":"crossref","unstructured":"Balasubramanian A, Levine B N, Venkataramani A. DTN routing as a resource allocation problem. In Proc. ACM SIGCOMM 2007, Kyoto, Japan, August 27\u201331, 2007, pp.373\u2013384.","key":"9272_CR18","DOI":"10.1145\/1282380.1282422"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-009-9272-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-009-9272-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-009-9272-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T11:24:05Z","timestamp":1739359445000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-009-9272-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["9272"],"URL":"https:\/\/doi.org\/10.1007\/s11390-009-9272-x","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"type":"print","value":"1000-9000"},{"type":"electronic","value":"1860-4749"}],"subject":[],"published":{"date-parts":[[2009,9]]}}}