{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:28:30Z","timestamp":1776439710400,"version":"3.51.2"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T00:00:00Z","timestamp":1446508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Netw"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11276-015-1105-y","type":"journal-article","created":{"date-parts":[[2015,11,3]],"date-time":"2015-11-03T07:05:57Z","timestamp":1446534357000},"page":"2403-2414","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":26,"title":["Sharing spray and wait routing algorithm in opportunistic networks"],"prefix":"10.1007","volume":"22","author":[{"given":"Nahideh","family":"Derakhshanfard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Sabaei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir Masoud","family":"Rahmani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,11,3]]},"reference":[{"key":"1105_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-3514-3","volume-title":"Routing in opportunistic networks","author":"I Woungang","year":"2013","unstructured":"Woungang, I., et al. (2013). Routing in opportunistic networks. New York: Springer."},{"key":"1105_CR2","unstructured":"Li, P., et al. (2012) CodePipe: An opportunistic feeding and routing protocol for reliable multicast with pipelined network coding. In INFOCOM, 2012 proceedings IEEE."},{"issue":"2","key":"1105_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s11036-013-0477-4","volume":"19","author":"MR Rahimi","year":"2014","unstructured":"Rahimi, M. R., et al. (2014). Mobile cloud computing: A survey, state of art and future directions. Mobile Networks and Applications, 19(2), 133\u2013143.","journal-title":"Mobile Networks and Applications"},{"issue":"4","key":"1105_CR4","doi-asserted-by":"crossref","first-page":"742","DOI":"10.1109\/TMC.2014.2331966","volume":"14","author":"XM Zhang","year":"2015","unstructured":"Zhang, X. M., et al. (2015). Interference-based topology control algorithm for delay-constrained mobile Ad hoc networks. IEEE Transactions on Mobile Computing, 14(4), 742\u2013754.","journal-title":"IEEE Transactions on Mobile Computing"},{"issue":"2","key":"1105_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s11276-012-0457-9","volume":"19","author":"Y Zeng","year":"2013","unstructured":"Zeng, Y., et al. (2013). Directional routing and scheduling for green vehicular delay tolerant networks. Wireless Networks, 19(2), 161\u2013173.","journal-title":"Wireless Networks"},{"issue":"4","key":"1105_CR6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1145\/1851275.1851233","volume":"41","author":"A Dvir","year":"2011","unstructured":"Dvir, A., & Vasilakos, A. V. (2011). Backpressure-based routing protocol for DTNs. ACM SIGCOMM Computer Communication Review, 41(4), 405\u2013406.","journal-title":"ACM SIGCOMM Computer Communication Review"},{"key":"1105_CR7","volume-title":"Delay tolerant networks: Protocols and applications","author":"AV Vasilakos","year":"2011","unstructured":"Vasilakos, A. V., Zhang, Y., & Spyropoulos, T. (2011). Delay tolerant networks: Protocols and applications. Boca Raton: CRC Press."},{"issue":"8","key":"1105_CR8","doi-asserted-by":"crossref","first-page":"2349","DOI":"10.1007\/s11276-010-0276-9","volume":"16","author":"T Spyropoulos","year":"2010","unstructured":"Spyropoulos, T., et al. (2010). Routing for disruption tolerant networks: taxonomy and design. Wireless Networks, 16(8), 2349\u20132370.","journal-title":"Wireless Networks"},{"issue":"7","key":"1105_CR9","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1049\/iet-com.2009.0164","volume":"4","author":"Y Liu","year":"2010","unstructured":"Liu, Y., et al. (2010). Multi-layer clustering routing algorithm for wireless vehicular sensor networks. IET Communications, 4(7), 810\u2013816.","journal-title":"IET Communications"},{"issue":"3","key":"1105_CR10","first-page":"819","volume":"64","author":"L Liu","year":"2015","unstructured":"Liu, L., et al. (2015). Physarum optimization: A biology-inspired algorithm for the steiner tree problem in networks. IEEE Transactions on Computers, 64(3), 819\u2013832.","journal-title":"IEEE Transactions on Computers"},{"issue":"1","key":"1105_CR11","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11036-011-0316-4","volume":"17","author":"X Wang","year":"2012","unstructured":"Wang, X., et al. (2012). A survey of green mobile networks: Opportunities and challenges. Mobile Networks and Applications, 17(1), 4\u201320.","journal-title":"Mobile Networks and Applications"},{"issue":"1","key":"1105_CR12","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1007\/s11036-014-0533-8","volume":"20","author":"M Yang","year":"2014","unstructured":"Yang, M., et al. (2014). Software-defined and virtualized future mobile and wireless networks: A survey. Mobile Networks and Applications, 20(1), 4\u201318.","journal-title":"Mobile Networks and Applications"},{"issue":"3","key":"1105_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1145\/2160803.2160857","volume":"39","author":"R Pal","year":"2011","unstructured":"Pal, R., Kosta, S., & Hui, P. (2011). Settling for less: A qos compromise mechanism for opportunistic mobile networks. ACM SIGMETRICS Performance Evaluation Review, 39(3), 49\u201351.","journal-title":"ACM SIGMETRICS Performance Evaluation Review"},{"issue":"3","key":"1105_CR14","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1109\/TNSM.2014.2346080","volume":"11","author":"Y Song","year":"2014","unstructured":"Song, Y., et al. (2014). A biology-based algorithm to minimal exposure problem of wireless sensor networks. IEEE Transactions on Network and Service Management, 11(3), 417\u2013430.","journal-title":"IEEE Transactions on Network and Service Management"},{"issue":"99","key":"1105_CR15","first-page":"1","volume":"PP","author":"T Meng","year":"2015","unstructured":"Meng, T., et al. (2015). Spatial reusability-conscious routing in multi-hop wireless networks. IEEE Transactions on\u00a0Computers, PP(99), 1.","journal-title":"IEEE Transactions on\u00a0Computers"},{"issue":"1","key":"1105_CR16","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/SURV.2013.082713.00184","volume":"16","author":"M Youssef","year":"2014","unstructured":"Youssef, M., et al. (2014). Routing metrics of cognitive radio networks: A survey. IEEE on Communications Surveys and Tutorials, 16(1), 92\u2013109.","journal-title":"IEEE on Communications Surveys and Tutorials"},{"issue":"15","key":"1105_CR17","doi-asserted-by":"crossref","first-page":"3592","DOI":"10.1016\/j.comnet.2011.06.021","volume":"55","author":"C-J Hsu","year":"2011","unstructured":"Hsu, C.-J., Liu, H.-I., & Seah, W. K. (2011). Opportunistic routing\u2014A review and the challenges ahead. Computer Networks, 55(15), 3592\u20133603.","journal-title":"Computer Networks"},{"issue":"12","key":"1105_CR18","doi-asserted-by":"crossref","first-page":"1066","DOI":"10.1016\/j.tcs.2010.12.006","volume":"412","author":"R Baldoni","year":"2011","unstructured":"Baldoni, R., et al. (2011). The impact of mobility on the geocasting problem in mobile ad-hoc networks: Solvability and cost. Theoretical Computer Science, 412(12), 1066\u20131080.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1105_CR19","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/s11277-011-0334-3","volume":"66","author":"J Zhang","year":"2012","unstructured":"Zhang, J., & Luo, G. (2012). Adaptive spraying for routing in delay tolerant networks. Wireless Personal Communications, 66(1), 217\u2013233.","journal-title":"Wireless Personal Communications"},{"issue":"12","key":"1105_CR20","doi-asserted-by":"crossref","first-page":"3264","DOI":"10.1109\/TPDS.2013.2297105","volume":"25","author":"P Li","year":"2014","unstructured":"Li, P., et al. (2014). Reliable multicast with pipelined network coding using opportunistic feeding and routing. IEEE Transactions on Parallel and Distributed Systems, 25(12), 3264\u20133273.","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"11","key":"1105_CR21","doi-asserted-by":"crossref","first-page":"2238","DOI":"10.1016\/j.mcm.2010.10.008","volume":"53","author":"Y-S Yen","year":"2011","unstructured":"Yen, Y.-S., et al. (2011). Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling, 53(11), 2238\u20132250.","journal-title":"Mathematical and Computer Modelling"},{"key":"1105_CR22","doi-asserted-by":"crossref","unstructured":"Conti, M., et al. (2009). Routing issues in opportunistic networks. In: Middleware for network eccentric and mobile applications (pp. 121\u2013147). Heidelberg: Springer Berlin.","DOI":"10.1007\/978-3-540-89707-1_6"},{"issue":"2","key":"1105_CR23","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1145\/1740600.1740604","volume":"5","author":"G Acampora","year":"2010","unstructured":"Acampora, G., et al. (2010). Interoperable and adaptive fuzzy services for ambient intelligence applications. ACM Transactions on Autonomous and Adaptive Systems (TAAS), 5(2), 8.","journal-title":"ACM Transactions on Autonomous and Adaptive Systems (TAAS)"},{"key":"1105_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jnca.2015.02.001","volume":"52","author":"AV Vasilakos","year":"2015","unstructured":"Vasilakos, A. V., et al. (2015). Information centric network: Research challenges and opportunities. Journal of Network and Computer Applications, 52, 1\u201310.","journal-title":"Journal of Network and Computer Applications"},{"key":"1105_CR25","unstructured":"Zhou, L., et al. (2010). Context-conscious middleware for multimedia D; Services in heterogeneous networks. IEEE Computer Society."},{"key":"1105_CR26","doi-asserted-by":"crossref","unstructured":"Quan, W., et al. (2014). TB2F: Tree-bitmap and bloom-filter for a scalable and efficient name lookup in content-centric networking. In networking conference, 2014 IFIP. IEEE.","DOI":"10.1109\/IFIPNetworking.2014.6857122"},{"key":"1105_CR27","unstructured":"Xia, F., et al. (2013). Socially conscious networking: A survey."},{"key":"1105_CR28","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. 2000, technical report CS-200006, Duke University."},{"key":"1105_CR29","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K.,& Raghavendra C. S. (2007). Spray and focus: Efficient mobility-assisted routing for heterogeneous and correlated mobility. In Fifth annual IEEE international conference on pervasive computing and communications workshops, 2007. PerCom workshops\u2019 07, IEEE.","DOI":"10.1109\/PERCOMW.2007.108"},{"issue":"1","key":"1105_CR30","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1109\/TNET.2007.897964","volume":"16","author":"T Spyropoulos","year":"2008","unstructured":"Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. IEEE\/ACM Transactions on Networking, 16(1), 77\u201390.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"9","key":"1105_CR31","doi-asserted-by":"crossref","first-page":"1270","DOI":"10.1109\/TC.2011.145","volume":"61","author":"C Busch","year":"2012","unstructured":"Busch, C., Kannan, R., & Vasilakos, A. V. (2012). Approximating congestion\u00a0+\u00a0dilation in networks via\u201d quality of routing\u201d; games. IEEE Transactions on Computers, 61(9), 1270\u20131283.","journal-title":"IEEE Transactions on Computers"},{"issue":"2","key":"1105_CR32","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/TMC.2008.107","volume":"8","author":"M Musolesi","year":"2009","unstructured":"Musolesi, M., & Mascolo, C. (2009). CAR: Context-conscious adaptive routing for delay-tolerant mobile networks. IEEE Transactions on Mobile Computing, 8(2), 246\u2013260.","journal-title":"IEEE Transactions on Mobile Computing"},{"key":"1105_CR33","doi-asserted-by":"crossref","unstructured":"Chachulski, S., et al. (2007). Trading structure for randomness in wireless opportunistic routing. In SigComm: Proceedings of the Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (Vol. 37). ACM.","DOI":"10.1145\/1282380.1282400"},{"issue":"3","key":"1105_CR34","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., & Schel\u00e9n, O. (2003). Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review, 7(3), 19\u201320.","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"key":"1105_CR35","doi-asserted-by":"crossref","unstructured":"Spyropoulos, T., Psounis, K., Raghavendra, & C. S. (2005). Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proceedings of the 2005 ACM SIGCOMM workshop on delay-tolerant networking. ACM.","DOI":"10.1145\/1080139.1080143"},{"issue":"3","key":"1105_CR36","doi-asserted-by":"crossref","first-page":"1819","DOI":"10.1007\/s11277-012-0912-z","volume":"71","author":"X-W Zhou","year":"2013","unstructured":"Zhou, X.-W., et al. (2013). Dynamic DTN routing strategies based on knowledge. Wireless Personal Communications, 71(3), 1819\u20131836.","journal-title":"Wireless Personal Communications"},{"key":"1105_CR37","doi-asserted-by":"crossref","unstructured":"Erramilli, V., & Crovella, M. (2008). Forwarding in opportunistic networks with resource constraints. In Proceedings of the third ACM workshop on challenged networks. ACM.","DOI":"10.1145\/1409985.1409994"},{"key":"1105_CR38","unstructured":"JebaJothi, E. J., Kavitha, V., & Kavitha, T. (2010). Contention based routing in mobile ad hoc networks with multiple copies. arXiv preprint arXiv:1005.4009 ."},{"key":"1105_CR39","doi-asserted-by":"crossref","unstructured":"Wang, G., Lu, H., & Xu, L. (2009). Nested spray and wait routing algorithm based on core nodes assisted. In International conference on Computational intelligence and software engineering, 2009. CiSE 2009, IEEE.","DOI":"10.1109\/CISE.2009.5366858"},{"key":"1105_CR40","doi-asserted-by":"crossref","unstructured":"Huang, W., Zhang, S., & Zhou, W. (2011). Spray and wait routing based on position prediction in opportunistic networks. In 2011 3rd International conference on computer research and development (ICCRD), IEEE.","DOI":"10.1109\/ICCRD.2011.5764121"},{"issue":"4","key":"1105_CR41","doi-asserted-by":"crossref","first-page":"2503","DOI":"10.1007\/s11235-011-9569-2","volume":"52","author":"L Cheng","year":"2013","unstructured":"Cheng, L., et al. (2013). Wait, focus and spray: efficient data delivery in wireless sensor networks with ubiquitous mobile data collectors. Telecommunication Systems, 52(4), 2503\u20132517.","journal-title":"Telecommunication Systems"},{"key":"1105_CR42","unstructured":"Kim, E.-H., et al. (2014) Probability-based spray and wait protocol in delay tolerant networks. In 2014 international conference on information networking (ICOIN), IEEE."},{"issue":"18","key":"1105_CR43","doi-asserted-by":"crossref","first-page":"30","DOI":"10.5120\/15088-3457","volume":"86","author":"A Mehto","year":"2014","unstructured":"Mehto, A., & Chawla, M. (2014). Modified different neighbor history spray and wait using PROPHET in delay tolerant network. International Journal of Computer Applications, 86(18), 30\u201335.","journal-title":"International Journal of Computer Applications"},{"key":"1105_CR44","unstructured":"Zhang, L., et al. (2011). An energy-conscious socially-based spray and focus routing in delay tolerant mobile sensor network."},{"key":"1105_CR45","doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, A., Ott, J., & K\u00e4rkk\u00e4inen, T (2009). The ONE simulator for DTN protocol evaluation. in Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).","DOI":"10.4108\/ICST.SIMUTOOLS2009.5674"}],"container-title":["Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-1105-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11276-015-1105-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-1105-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11276-015-1105-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T02:34:14Z","timestamp":1567305254000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11276-015-1105-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,11,3]]},"references-count":45,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["1105"],"URL":"https:\/\/doi.org\/10.1007\/s11276-015-1105-y","relation":{},"ISSN":["1022-0038","1572-8196"],"issn-type":[{"value":"1022-0038","type":"print"},{"value":"1572-8196","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,11,3]]}}}