{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:32Z","timestamp":1750306892540,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,30]],"date-time":"2013-09-30T00:00:00Z","timestamp":1380499200000},"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":[[2013,9,30]]},"DOI":"10.1145\/2502880.2502891","type":"proceedings-article","created":{"date-parts":[[2013,10,1]],"date-time":"2013-10-01T18:09:20Z","timestamp":1380650960000},"page":"21-24","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["CARPOOL"],"prefix":"10.1145","author":[{"given":"Ioannis","family":"Komnios","sequence":"first","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Tsaoussidis","sequence":"additional","affiliation":[{"name":"Dept. of Electrical and Computer Engineering, Democritus University of Thrace, Xanthi, Greece"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,30]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of IEEE Infocom. DOI= http:\/\/dx.doi.org\/10","author":"Burgess J.","year":"2006","unstructured":"Burgess , J. , Gallagher , B. , and Levine , B.N . 2006. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks . In Proceedings of IEEE Infocom. DOI= http:\/\/dx.doi.org\/10 .1109\/INFOCOM. 2006 .228. 10.1109\/INFOCOM.2006.228 Burgess, J., Gallagher, B., and Levine, B.N. 2006. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proceedings of IEEE Infocom. DOI= http:\/\/dx.doi.org\/10.1109\/INFOCOM.2006.228."},{"key":"e_1_3_2_1_2_1","unstructured":"Burleigh S. 2010. Contact Graph Routing. Internet Draft.  Burleigh S. 2010. Contact Graph Routing. Internet Draft."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Cerf V. Burleigh S. Hooke A. Torgerson L. Durst L. Scott K. Fall K. and Weiss H. 2007. Delay-Tolerant Networking Architecture. RFC4838.  Cerf V. Burleigh S. Hooke A. Torgerson L. Durst L. Scott K. Fall K. and Weiss H. 2007. Delay-Tolerant Networking Architecture. RFC4838.","DOI":"10.17487\/rfc4838"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2009.02.010"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Lindgren A. Doria A. Davies E. and Grasic S. 2011. Probabilistic routing protocol for intermittently connected networks. Internet Draft.  Lindgren A. Doria A. Davies E. and Grasic S. 2011. Probabilistic routing protocol for intermittently connected networks. Internet Draft.","DOI":"10.17487\/rfc6693"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Scott K. Burleigh S. 2007. Bundle protocol specification. RFC 5050.  Scott K. Burleigh S. 2007. Bundle protocol specification. RFC 5050.","DOI":"10.17487\/rfc5050"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_3_2_1_9_1","volume-title":"Technical Report CS-200006. Duke University.","author":"Vahdat A.","year":"2000","unstructured":"Vahdat , A. , and Becker , D . 2000 . Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006. Duke University. Vahdat, A., and Becker, D. 2000. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006. Duke University."}],"event":{"name":"MobiCom'13: The 19th Annual International Conference on Mobile Computing and Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Miami Florida USA","acronym":"MobiCom'13"},"container-title":["Proceedings of the 2013 ACM MobiCom workshop on Lowest cost denominator networking for universal access"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502880.2502891","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2502880.2502891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:55Z","timestamp":1750234735000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2502880.2502891"}},"subtitle":["extending free internet access over DTN in urban environment"],"short-title":[],"issued":{"date-parts":[[2013,9,30]]},"references-count":9,"alternative-id":["10.1145\/2502880.2502891","10.1145\/2502880"],"URL":"https:\/\/doi.org\/10.1145\/2502880.2502891","relation":{},"subject":[],"published":{"date-parts":[[2013,9,30]]},"assertion":[{"value":"2013-09-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}