{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:28:25Z","timestamp":1750307305044,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,3,15]],"date-time":"2012-03-15T00:00:00Z","timestamp":1331769600000},"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":[[2012,3,15]]},"DOI":"10.1145\/2159576.2159589","type":"proceedings-article","created":{"date-parts":[[2012,3,20]],"date-time":"2012-03-20T12:04:21Z","timestamp":1332245061000},"page":"53-60","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Making the most of your contacts"],"prefix":"10.1145","author":[{"given":"Christian","family":"Rohner","sequence":"first","affiliation":[{"name":"Uppsala University, Uppsala, Sweden"}]},{"given":"Fredrik","family":"Bjurefors","sequence":"additional","affiliation":[{"name":"Uppsala University, Uppsala, Sweden"}]},{"given":"Per","family":"Gunningberg","sequence":"additional","affiliation":[{"name":"Uppsala University, Uppsala, Sweden"}]},{"given":"Liam","family":"McNamara","sequence":"additional","affiliation":[{"name":"Uppsala University, Uppsala, Sweden"}]},{"given":"Erik","family":"Nordstr\u00f6m","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, USA"}]}],"member":"320","published-online":{"date-parts":[[2012,3,15]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Haggle code project page http:\/\/haggle.googlecode.com.  Haggle code project page http:\/\/haggle.googlecode.com."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1282427.1282422"},{"key":"e_1_3_2_1_3_1","volume-title":"7th Swedish National Computer Networking Workshop","author":"Bjurefors F.","year":"2011","unstructured":"Bjurefors , F. , Gunningberg , P. , and Rohner , C . Haggle Testbed: a Testbed for Opportunistic Networks . In 7th Swedish National Computer Networking Workshop ( 2011 ). Bjurefors, F., Gunningberg, P., and Rohner, C. Haggle Testbed: a Testbed for Opportunistic Networks. In 7th Swedish National Computer Networking Workshop (2011)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018584.2018594"},{"key":"e_1_3_2_1_5_1","volume-title":"HiBOp: a History Based Routing Protocol for Opportunistic Networks","author":"Boldrini C.","year":"2007","unstructured":"Boldrini , C. , Conti , M. , Iacopini , I. , and Passarella , A . HiBOp: a History Based Routing Protocol for Opportunistic Networks . In IEEE WoWMoM ( 2007 ). Boldrini, C., Conti, M., Iacopini, I., and Passarella, A. HiBOp: a History Based Routing Protocol for Opportunistic Networks. In IEEE WoWMoM (2007)."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454503.1454541"},{"key":"e_1_3_2_1_7_1","volume-title":"INFOCOM","author":"Breslau L.","year":"1999","unstructured":"Breslau , L. , Cue , P. , Cao , P. , Fan , L. , Phillips , G. , and Shenker , S . Web Caching and Zipf-like Distributions: Evidence and Implications . In INFOCOM ( 1999 ). Breslau, L., Cue, P., Cao, P., Fan, L., Phillips, G., and Shenker, S. Web Caching and Zipf-like Distributions: Evidence and Implications. In INFOCOM (1999)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851322.1851330"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2107502.2107526"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1374618.1374652"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Hwang S. and Kim D. Markov model of link connectivity in mobile ad hoc networks. Telecommunication Systems 34 (2007)  Hwang S. and Kim D. Markov model of link connectivity in mobile ad hoc networks. Telecommunication Systems 34 (2007)","DOI":"10.1007\/s11235-006-9025-x"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030194.1015484"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/345508.345545"},{"key":"e_1_3_2_1_14_1","volume-title":"SECON","author":"Krifa A.","year":"2008","unstructured":"Krifa , A. , Baraka , C. , and Spyropoulos , T . Optimal Buffer Management Policies for Delay Tolerant Networks . In SECON ( 2008 ), IEEE. Krifa, A., Baraka, C., and Spyropoulos, T. Optimal Buffer Management Policies for Delay Tolerant Networks. In SECON (2008), IEEE."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2030652.2030663"},{"key":"e_1_3_2_1_16_1","volume-title":"Wireless Ad Hoc Podcasting","author":"Lenders V.","year":"2007","unstructured":"Lenders , V. , Karlsson , G. , and May , M . Wireless Ad Hoc Podcasting . In IEEE SECON (June 2007 ). Lenders, V., Karlsson, G., and May, M. Wireless Ad Hoc Podcasting. In IEEE SECON (June 2007)."},{"key":"e_1_3_2_1_17_1","volume-title":"INFOCOM","author":"Li Q.","year":"2010","unstructured":"Li , Q. , Zhu , S. , and Cao , G . Routing in Socially Selfish Delay Tolerant Networks . In INFOCOM ( 2010 ), IEEE. Li, Q., Zhu, S., and Cao, G. Routing in Socially Selfish Delay Tolerant Networks. In INFOCOM (2010), IEEE."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"e_1_3_2_1_19_1","volume-title":"Comsware","author":"Lindgren A.","year":"2006","unstructured":"Lindgren , A. , and Phanse , K . Evaluation of Queueing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks . In Comsware ( 2006 ). Lindgren, A., and Phanse, K. Evaluation of Queueing Policies and Forwarding Strategies for Routing in Intermittently Connected Networks. In Comsware (2006)."},{"key":"e_1_3_2_1_20_1","volume-title":"WoWMoM","author":"Moghadam A.","year":"2009","unstructured":"Moghadam , A. , and Schulzrinne , H . Interest-Aware Content Distribution Protocol for Mobile Disruption-Tolerant Networks . In WoWMoM ( 2009 ). Moghadam, A., and Schulzrinne, H. Interest-Aware Content Distribution Protocol for Mobile Disruption-Tolerant Networks. In WoWMoM (2009)."},{"key":"e_1_3_2_1_21_1","volume-title":"PeopleRank: Social Opportunistic Forwarding","author":"Mtibaa A.","year":"2010","unstructured":"Mtibaa , A. , May , M. , Diot , C. , and Ammar , M . PeopleRank: Social Opportunistic Forwarding . In IEEE INFOCOM ( 2010 ). Mtibaa, A., May, M., Diot, C., and Ammar, M. PeopleRank: Social Opportunistic Forwarding. In IEEE INFOCOM (2010)."},{"key":"e_1_3_2_1_22_1","series-title":"SIAM REVIEW 45","volume-title":"The Structure and Function of Complex Networks","author":"Newman M. E. J.","year":"2003","unstructured":"Newman , M. E. J. The Structure and Function of Complex Networks . SIAM REVIEW 45 ( 2003 ). Newman, M. E. J. The Structure and Function of Complex Networks. SIAM REVIEW 45 (2003)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247694.1247711"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080139.1080143"},{"key":"e_1_3_2_1_26_1","volume-title":"Epidemic Routing for Partially-Connected Ad Hoc Networks. Tech. rep","author":"Vahdat A.","year":"2000","unstructured":"Vahdat , A. , and Becker , D . Epidemic Routing for Partially-Connected Ad Hoc Networks. Tech. rep ., 2000 . Vahdat, A., and Becker, D. Epidemic Routing for Partially-Connected Ad Hoc Networks. Tech. rep., 2000."}],"event":{"name":"MobiOpp' 12: Workshop on Mobile Opportunistic Networking","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"location":"Z\u00fcrich Switzerland","acronym":"MobiOpp' 12"},"container-title":["Proceedings of the third ACM international workshop on Mobile Opportunistic Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2159576.2159589","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2159576.2159589","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:58Z","timestamp":1750244398000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2159576.2159589"}},"subtitle":["transfer ordering in data-centric opportunistic networks"],"short-title":[],"issued":{"date-parts":[[2012,3,15]]},"references-count":25,"alternative-id":["10.1145\/2159576.2159589","10.1145\/2159576"],"URL":"https:\/\/doi.org\/10.1145\/2159576.2159589","relation":{},"subject":[],"published":{"date-parts":[[2012,3,15]]},"assertion":[{"value":"2012-03-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}