{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T14:56:37Z","timestamp":1761663397266},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T00:00:00Z","timestamp":1439510400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2015,12]]},"DOI":"10.1186\/s13638-015-0427-x","type":"journal-article","created":{"date-parts":[[2015,8,13]],"date-time":"2015-08-13T18:00:12Z","timestamp":1439488812000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Routing in delay tolerant networks with periodic connections"],"prefix":"10.1186","volume":"2015","author":[{"given":"Cem","family":"Mergenci","sequence":"first","affiliation":[]},{"given":"Ibrahim","family":"Korpeoglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,14]]},"reference":[{"key":"427_CR1","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/863955.863960","volume-title":"SIGCOMM \u201803: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"K Fall","year":"2003","unstructured":"K Fall, in SIGCOMM \u201803: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. A delay-tolerant network architecture for challenged internets (ACM,New York, 2003), pp. 27\u201334. doi: 10.1145\/863955.863960 ."},{"key":"427_CR2","unstructured":"B Cohen, BitTorrent Protocol (2001). http:\/\/bittorrent.org ."},{"issue":"8","key":"427_CR3","doi-asserted-by":"publisher","first-page":"2029","DOI":"10.1007\/s11276-013-0582-0","volume":"19","author":"X Sun","year":"2013","unstructured":"X Sun, Q Yu, R Wang, Q Zhang, Z Wei, J Hu, A Vasilakos, Performance of dtn protocols in space communications. Wirel. Netw. 19(8), 2029\u20132047 (2013). doi: 10.1007\/s11276-013-0582-0 .","journal-title":"Wirel. Netw"},{"key":"427_CR4","volume-title":"Delay tolerant networks: protocols and applications","author":"AV Vasilakos","year":"2011","unstructured":"AV Vasilakos, Y Zhang, T Spyropoulos, Delay tolerant networks: protocols and applications, 1st edn. (CRC Press, Inc., Boca Raton, 2011)."},{"key":"427_CR5","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/MCSA.1999.749281","volume-title":"Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA \u201899. Second IEEE Workshop On","author":"CE Perkins","year":"1999","unstructured":"CE Perkins, EM Royer, in Mobile Computing Systems and Applications, 1999. Proceedings. WMCSA \u201899. Second IEEE Workshop On. Ad-hoc on-demand distance vector routing (IEEE Computer SocietyWashington, DC, USA, 1999), pp. 90\u2013100. doi: 10.1109\/MCSA.1999.749281 ."},{"key":"427_CR6","unstructured":"T Clausen, P Jacquet, Optimized link state routing protocol (OLSR), 1\u201375 (2003). doi: 10.17487\/RFC362610.17487\/RFC3626 ."},{"key":"427_CR7","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1145\/1015467.1015484","volume-title":"SIGCOMM \u201804: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications","author":"S Jain","year":"2004","unstructured":"S Jain, K Fall, R Patra, in SIGCOMM \u201804: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications. Routing in a delay tolerant network (ACM,New York, 2004), pp. 145\u2013158. doi: 10.1145\/1015467.1015484 ."},{"key":"427_CR8","first-page":"100","volume-title":"INFOCOM, 2012 Proceedings IEEE","author":"P Li","year":"2012","unstructured":"P Li, S Guo, S Yu, AV Vasilakos, in INFOCOM, 2012 Proceedings IEEE. Codepipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding (IEEE Communications SocietyNew York, NY, USA, 2012), pp. 100\u2013108. doi: 10.1109\/INFCOM.2012.6195456 ."},{"issue":"8","key":"427_CR9","doi-asserted-by":"publisher","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"T Spyropoulos, R Rais, T Turletti, K Obraczka, A Vasilakos, Routing for disruption tolerant networks: taxonomy and design. Wirel. Netw. 16(8), 2349\u20132370 (2010). doi: 10.1007\/s11276-010-0276-9 .","journal-title":"Wirel. Netw"},{"key":"427_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3514-3","volume-title":"Routing in opportunistic networks","author":"I Woungang","year":"2013","unstructured":"I Woungang, SK Dhurandher, A Anpalagan, AV Vasilakos, Routing in opportunistic networks (Springer, Springer Science+Business Media New York, 2013)."},{"key":"427_CR11","unstructured":"A Vahdat, D Becker, Epidemic routing for partially-connected ad hoc networks. Department of Computer Science, Duke University, (Durham, North Carolina, NC, USA, 2000). http:\/\/www.cs.duke.edu\/techreports\/2000\/2000-06.ps ."},{"key":"427_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/41840.41841","volume-title":"PODC \u201887: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing","author":"A Demers","year":"1987","unstructured":"A Demers, D Greene, C Hauser, W Irish, J Larson, S Shenker, H Sturgis, D Swinehart, D Terry, in PODC \u201887: Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing. Epidemic algorithms for replicated database maintenance (ACM,New York, 1987), pp. 1\u201312. doi: 10.1145\/41840.41841 ."},{"issue":"3","key":"427_CR13","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"A Lindgren, A Doria, O Schel\u00e9n, Probabilistic routing in intermittently connected networks. SIGMOBILE Mob Comput. Commun. Rev. 7(3), 19\u201320 (2003). doi: 10.1145\/961268.961272 .","journal-title":"SIGMOBILE Mob Comput. Commun. Rev."},{"key":"427_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1109\/SAHCN.2004.1381922","volume-title":"2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE SECON 2004","author":"T Spyropoulos","year":"2004","unstructured":"T Spyropoulos, K Psounis, CS Raghavendra, in 2004 First Annual IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks, IEEE SECON 2004. Single-copy routing in intermittently connected mobile networks (IEEE Communications SocietyNew York, NY, USA, 2004), pp. 235\u2013244."},{"issue":"5","key":"427_CR15","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1109\/JSAC.2008.080604","volume":"26","author":"V Conan","year":"2008","unstructured":"V Conan, J Leguay, T Friedman, Fixed point opportunistic routing in delay tolerant networks. IEEE J. Sel. Areas Commun. 26(5), 773\u2013782 (2008). doi: 10.1109\/JSAC.2008.080604 .","journal-title":"IEEE J. Sel. Areas Commun"},{"key":"427_CR16","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1145\/1080139.1080143","volume-title":"WDTN \u201805: Proceedings of the ACM SIGCOMM Workshop on Delay-tolerant Networking","author":"T Spyropoulos","year":"2005","unstructured":"T Spyropoulos, K Psounis, CS Raghavendra, in WDTN \u201805: Proceedings of the ACM SIGCOMM Workshop on Delay-tolerant Networking. Spray and wait: an efficient routing scheme for intermittently connected mobile networks (ACM,New York, 2005), pp. 252\u2013259. doi: 10.1145\/1080139.1080143 ."},{"key":"427_CR17","first-page":"79","volume-title":"Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops","author":"T Spyropoulos","year":"2007","unstructured":"T Spyropoulos, K Psounis, CS Raghavendra, in Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops. Spray and focus: Efficient Mobility-assisted Routing for Heterogeneous and Correlated Mobility (IEEE Computer SocietyWashington, DC, USA, 2007), pp. 79\u201385. doi: 10.1109\/PERCOMW.2007.108 ."},{"key":"427_CR18","doi-asserted-by":"crossref","first-page":"846","DOI":"10.1109\/INFCOM.2009.5061994","volume-title":"INFOCOM 2009, IEEE","author":"SC Nelson","year":"2009","unstructured":"SC Nelson, M Bakht, R Kravets, in INFOCOM 2009, IEEE. Encounter-based routing in DTNs (IEEE Communications SocietyNew York, NY, USA, 2009), pp. 846\u2013854. doi: 10.1109\/INFCOM.2009.5061994 ."},{"issue":"11\u201312","key":"427_CR19","doi-asserted-by":"publisher","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"Y-S Yen","year":"2011","unstructured":"Y-S Yen, H-C Chao, R-S Chang, A Vasilakos, Flooding-limited and multi-constrained qos multicast routing based on the genetic algorithm for {MANETs}. Math. Comput. Model. 53(11\u201312), 2238\u20132250 (2011). Recent Advances in Simulation and Mathematical Modeling of Wireless Networks.","journal-title":"Math. Comput. Model"},{"issue":"5","key":"427_CR20","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1016\/j.jnca.2011.05.005","volume":"34","author":"AT Prodhan","year":"2011","unstructured":"AT Prodhan, R Das, H Kabir, GC Shoja, TTL based routing in opportunistic networks. J. Netw. Comput. Appl. 34(5), 1660\u20131670 (2011). Dependable Multimedia Communications: Systems, Services, and Applications.","journal-title":"J. Netw. Comput. Appl"},{"issue":"8","key":"427_CR21","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1007\/s11276-014-0756-4","volume":"20","author":"Z Yang","year":"2014","unstructured":"Z Yang, Q Zhang, R Wang, H Li, A Vasilakos, On storage dynamics of space delay\/disruption tolerant network node. Wirel. Netw. 20(8), 2529\u20132541 (2014). doi: 10.1007\/s11276-014-0756-4 .","journal-title":"Wirel. Netw"},{"key":"427_CR22","unstructured":"S Merugu, M Ammar, E Zegura, Routing in space and time in networks with predictable mobility. Technical report, College of Computing, Georgia Institute of Technology, (Atlanta, Georgia, GA, USA, 2004). http:\/\/hdl.handle.net\/1853\/6492 ."},{"key":"427_CR23","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/1288107.1288115","volume-title":"MobiHoc \u201807: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing","author":"C Liu","year":"2007","unstructured":"C Liu, J Wu, in MobiHoc \u201807: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. Scalable routing in delay tolerant networks (ACM,New York, 2007), pp. 51\u201360. doi: 10.1145\/1288107.1288115 ."},{"key":"427_CR24","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1145\/1530748.1530763","volume-title":"MobiHoc \u201809: Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing","author":"C Liu","year":"2009","unstructured":"C Liu, J Wu, in MobiHoc \u201809: Proceedings of the Tenth ACM International Symposium on Mobile Ad Hoc Networking and Computing. An optimal probabilistic forwarding protocol in delay tolerant networks (ACM,New York, 2009), pp. 105\u2013114. doi: 10.1145\/1530748.1530763 ."},{"key":"427_CR25","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1145\/1374618.1374665","volume-title":"Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc \u201808","author":"C Liu","year":"2008","unstructured":"C Liu, J Wu, in Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc \u201808. Routing in a cyclic mobispace (ACM,New York, 2008), pp. 351\u2013360. doi: 10.1145\/1374618.1374665 ."},{"issue":"4","key":"427_CR26","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/1851275.1851233","volume":"41","author":"A Dvir","year":"2010","unstructured":"A Dvir, AV Vasilakos, Backpressure-based routing protocol for dtns. SIGCOMM Comput. Commun. Rev. 41(4), 405\u2013406 (2010).","journal-title":"SIGCOMM Comput. Commun. Rev"},{"key":"427_CR27","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1145\/778415.778446","volume-title":"Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. MobiHoc \u201803","author":"H Dubois-Ferriere","year":"2003","unstructured":"H Dubois-Ferriere, M Grossglauser, M Vetterli, in Proceedings of the 4th ACM International Symposium on Mobile Ad Hoc Networking & Computing. MobiHoc \u201803. Age matters: efficient route discovery in mobile ad hoc networks using encounter ages (ACM,New York, 2003), pp. 257\u2013266. doi: 10.1145\/778415.778446 ."},{"key":"427_CR28","doi-asserted-by":"crossref","unstructured":"EM Daly, M Haahr, in Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc \u201807. Social network analysis for routing in disconnected delay-tolerant manets (ACM,New York, 2007), pp. 32\u201340. doi: 10.1145\/1288107.1288113 . http:\/\/doi.acm.org\/10.1145\/1288107.1288113 .","DOI":"10.1145\/1288107.1288113"},{"key":"427_CR29","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1145\/1374618.1374652","volume-title":"Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc \u201808","author":"P Hui","year":"2008","unstructured":"P Hui, J Crowcroft, E Yoneki, in Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing. MobiHoc \u201808. Bubble rap: social-based forwarding in delay tolerant networks (ACM,New York, 2008), pp. 241\u2013250. doi: 10.1145\/1374618.1374652 ."},{"key":"427_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/WOWMOM.2010.5534960","volume-title":"Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM). WOWMOM \u201810","author":"E Bulut","year":"2010","unstructured":"E Bulut, SC Geyik, BK Szymanski, in Proceedings of the 2010 IEEE International Symposium on A World of Wireless, Mobile and Multimedia Networks (WoWMoM). WOWMOM \u201810. Conditional shortest path routing in delay tolerant networks (IEEE Computer SocietyWashington, DC, 2010), pp. 1\u20136. doi: 10.1109\/WOWMOM.2010.5534960 ."},{"issue":"0","key":"427_CR31","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.jnca.2013.07.011","volume":"39","author":"Q Ayub","year":"2014","unstructured":"Q Ayub, S Rashid, MSM Zahid, AH Abdullah, Contact quality based forwarding strategy for delay tolerant network. J. Netw. Comput. Appl. 39(0), 302\u2013309 (2014). doi: 10.1016\/j.jnca.2013.07.011 .","journal-title":"J. Netw. Comput. Appl"},{"issue":"1","key":"427_CR32","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"M Youssef, M Ibrahim, M Abdelatif, L Chen, AV Vasilakos, Routing metrics of cognitive radio networks: a survey. IEEE Commun. Surv. Tutorials. 16(1), 92\u2013109 (2014). doi: 10.1109\/SURV.2013.082713.00184 .","journal-title":"IEEE Commun. Surv. Tutorials"},{"key":"427_CR33","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/1080139.1080141","volume-title":"WDTN \u201805: Proceedings of the ACM SIGCOMM Workshop on Delay-tolerant Networking","author":"EPC Jones","year":"2005","unstructured":"EPC Jones, L Li, PAS Ward, in WDTN \u201805: Proceedings of the ACM SIGCOMM Workshop on Delay-tolerant Networking. Practical routing in delay-tolerant networks (ACM,New York, 2005), pp. 237\u2013243. doi: 10.1145\/1080139.1080141 ."},{"issue":"2","key":"427_CR34","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Y Zeng, K Xiang, D Li, A Vasilakos, Directional routing and scheduling for green vehicular delay tolerant networks. Wirel. Netw. 19(2), 161\u2013173 (2013). doi: 10.1007\/s11276-012-0457-9 .","journal-title":"Wirel. Netw"},{"key":"427_CR35","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2001","unstructured":"TH Cormen, CE Leiserson, RL Rivest, C Stein, Introduction to algorithms, 2nd revised edn. (The MIT Press, Cambridge, Massachusetts, MA, USA, 2001)."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13638-015-0427-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0427-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-015-0427-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,13]],"date-time":"2023-08-13T04:24:30Z","timestamp":1691900670000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-015-0427-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,14]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,12]]}},"alternative-id":["427"],"URL":"https:\/\/doi.org\/10.1186\/s13638-015-0427-x","relation":{},"ISSN":["1687-1499"],"issn-type":[{"value":"1687-1499","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,14]]},"assertion":[{"value":"21 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"202"}}