{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T16:10:21Z","timestamp":1774627821780,"version":"3.50.1"},"reference-count":19,"publisher":"Wiley","license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mobile Information Systems"],"published-print":{"date-parts":[[2016]]},"abstract":"<jats:p>We discuss MDTN: a delay tolerant application platform built on top of the Public Transportation System (PTS) and able to provide service access while exploiting opportunistic connectivity. Our solution adopts a carrier-based approach where buses act as data collectors for user requests requiring Internet access. Simulations based on real maps and PTS routes with state-of-the-art routing protocols demonstrate that MDTN represents a viable solution for elastic nonreal-time service delivery. Nevertheless, performance indexes of the considered routing policies show that there is no golden rule for optimal performance and a tailored routing strategy is required for each specific case.<\/jats:p>","DOI":"10.1155\/2016\/8434109","type":"journal-article","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T17:05:14Z","timestamp":1474391114000},"page":"1-14","source":"Crossref","is-referenced-by-count":5,"title":["Delay Tolerant Networking over the Metropolitan Public Transportation"],"prefix":"10.1155","volume":"2016","author":[{"given":"A.","family":"Bujari","sequence":"first","affiliation":[{"name":"Department of Mathematics, University of Padua, Via Trieste 63, 35123 Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Gaito","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of Milan, Via Comelico 39, 20135 Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Maggiorini","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of Milan, Via Comelico 39, 20135 Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8877-0848","authenticated-orcid":true,"given":"C. E.","family":"Palazzi","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of Padua, Via Trieste 63, 35123 Padova, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Quadri","sequence":"additional","affiliation":[{"name":"Computer Science Department, University of Milan, Via Comelico 39, 20135 Milan, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","reference":[{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2007.02.014"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/641865.641866"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2011.04.011"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13618-4_20"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38227-7_4"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2011.06.008"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/402705"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/mcom.2006.248176"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/mcom.2003.1204759"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1007\/s00530-013-0353-x"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.3233\/MIS-130186"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2179072"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1002\/dac.1324"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/tvt.2012.2226484"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1145\/961268.961272"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/mc.2004.1260729"},{"key":"28","volume-title":"A predicted-contact routing scheme for Brazilian rural networks","year":"2008"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/tnet.2009.2039491"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2011.12.005"}],"container-title":["Mobile Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2016\/8434109.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2016\/8434109.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/misy\/2016\/8434109.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T17:05:14Z","timestamp":1474391114000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.hindawi.com\/journals\/misy\/2016\/8434109\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"references-count":19,"alternative-id":["8434109","8434109"],"URL":"https:\/\/doi.org\/10.1155\/2016\/8434109","relation":{},"ISSN":["1574-017X","1875-905X"],"issn-type":[{"value":"1574-017X","type":"print"},{"value":"1875-905X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}