{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T16:14:18Z","timestamp":1759335258039,"version":"3.41.0"},"publisher-location":"New York, New York, USA","reference-count":14,"publisher":"ACM Press","license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"EU TagItSmart! Project","award":["H2020-ICT30-2015-688061"],"award-info":[{"award-number":["H2020-ICT30-2015-688061"]}]},{"name":"EU-India REACH Project","award":["ICI+\/2014\/342-896"],"award-info":[{"award-number":["ICI+\/2014\/342-896"]}]},{"name":"Cisco University Research Program Fund and Silicon Valley Community Foundation","award":["2017-166478 (3696)"],"award-info":[{"award-number":["2017-166478 (3696)"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1145\/3265863.3265884","type":"proceedings-article","created":{"date-parts":[[2018,10,26]],"date-time":"2018-10-26T19:34:05Z","timestamp":1540582445000},"page":"113-117","source":"Crossref","is-referenced-by-count":7,"title":["Optimizing Message Ferry Scheduling in a DTN"],"prefix":"10.1145","author":[{"given":"Sankardas","family":"Roy","sequence":"first","affiliation":[{"name":"Bowling Green State University, Bowling Green, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniele","family":"Tomasi","sequence":"additional","affiliation":[{"name":"University of Padua, Padua, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Conti","sequence":"additional","affiliation":[{"name":"University of Padua, Padua, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shiva","family":"Bhusal","sequence":"additional","affiliation":[{"name":"Bowling Green State University, Bowling Green, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Arkajyoti","family":"Roy","sequence":"additional","affiliation":[{"name":"University of Texas at San Antonio, San Antonio, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiang","family":"Li","sequence":"additional","affiliation":[{"name":"Howard University, Washington , DC, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","reference":[{"key":"key-10.1145\/3265863.3265884-1","doi-asserted-by":"crossref","unstructured":"Kazuya Anazawa, Toshiaki Miyazaki, Peng Li, and Xiaoyan Wang. 2017. Big Data Synchronization among Isolated Data Servers in Disaster. In GLOBECOM. IEEE.","DOI":"10.1109\/GLOCOM.2017.8254994"},{"key":"key-10.1145\/3265863.3265884-2","doi-asserted-by":"crossref","unstructured":"R. Bellman. 1962. Dynamic Programming Treatment of the Travelling Salesman Problem., Vol. 9, 1 (1962).","DOI":"10.1145\/321105.321111"},{"key":"key-10.1145\/3265863.3265884-3","doi-asserted-by":"crossref","unstructured":"K Fall. 2003. A delay-tolerant network architecture for challenged internets.. In Proceedings of the Sigcomm .","DOI":"10.1145\/863955.863960"},{"key":"key-10.1145\/3265863.3265884-4","doi-asserted-by":"crossref","unstructured":"H Guo and J Li. 2007. Performance Analysis of Homing Pigeon based Delay Tolerant Networks. In Proceedings of IEEE MILCOM .","DOI":"10.1109\/MILCOM.2007.4454766"},{"key":"key-10.1145\/3265863.3265884-5","unstructured":"M. Held and R Karp. 1962. A dynamic programming approach to sequencing problems., Vol. 10, 1 (1962)."},{"key":"key-10.1145\/3265863.3265884-6","unstructured":"R Karp. 1977. Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane., Vol. 2, 3 (1977), 209--224."},{"key":"key-10.1145\/3265863.3265884-7","doi-asserted-by":"crossref","unstructured":"Ahmed Mansy, Mostafa Ammar, and Ellen Zegura. 2011. Deficit round-robin based message ferry routing. In GLOBECOM. IEEE.","DOI":"10.1109\/GLOCOM.2011.6134155"},{"key":"key-10.1145\/3265863.3265884-8","unstructured":"H Psaraftis. 1980. A dynamic programming solution to the single vehicle many-to-many immediate request dial-a-ride problem., Vol. 14 (1980), 130--154."},{"key":"key-10.1145\/3265863.3265884-9","unstructured":"M Savelsbergh and M Sol. 1995. The general pickup and delivery problem., Vol. 29 (1995), 17--29."},{"key":"key-10.1145\/3265863.3265884-10","unstructured":"M Swihart and J Papastavrou. 1999. A stochastic and dynamic model for the single-vehicle pick-up and delivery problem., Vol. 114, 3 (1999), 447--464."},{"key":"key-10.1145\/3265863.3265884-11","unstructured":"A Vahdat and D Becker. 2000. Epidemic routing for partially-connected ad-hoc networks. In Technical Report CS-200006, Duke University ."},{"key":"key-10.1145\/3265863.3265884-12","unstructured":"W Zhao and M Ammar. 2003. Message Ferrying: Proactive Routing in Highly-Partitioned Wireless Ad Hoc Networks. In Proceedings of the IEEE Workshop on Futrure Trends in Distributed Computing Systems ."},{"key":"key-10.1145\/3265863.3265884-13","unstructured":"W Zhao, M Ammar, and E Zegura. 2005. Controlling the Mobility of Multiple Data Transport Ferries in a Delay-Tolerant Network. In IEEE INFOCOM ."},{"key":"key-10.1145\/3265863.3265884-14","unstructured":"J. Zhou, S. Roy, J. Li, R. Hu, and Y. Qian. 2013. Minimizing the Average Delay of Messages in Pigeon Networks. IEEE Trans. on Comm., Vol. 61, 8 (2013)."}],"event":{"number":"16","sponsor":["SIGSIM, ACM Special Interest Group on Simulation and Modeling"],"acronym":"MobiWac'18","name":"the 16th ACM International Symposium","start":{"date-parts":[[2018,10,28]]},"location":"Montreal, QC, Canada","end":{"date-parts":[[2018,11,2]]}},"container-title":["Proceedings of the 16th ACM International Symposium on Mobility Management and Wireless Access - MobiWac'18"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3265863.3265884","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/dl.acm.org\/ft_gateway.cfm?id=3265884&ftid=2012386&dwn=1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:50Z","timestamp":1750210790000},"score":1,"resource":{"primary":{"URL":"http:\/\/dl.acm.org\/citation.cfm?doid=3265863.3265884"}},"subtitle":[],"proceedings-subject":"Mobility Management and Wireless Access","short-title":[],"issued":{"date-parts":[[2018]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1145\/3265863.3265884","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}