{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T15:29:14Z","timestamp":1774538954355,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T00:00:00Z","timestamp":1571961600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2020,2]]},"DOI":"10.1007\/s11277-019-06835-8","type":"journal-article","created":{"date-parts":[[2019,10,25]],"date-time":"2019-10-25T23:52:37Z","timestamp":1572047557000},"page":"2165-2177","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Erlang Based Buffer Management and Routing in Opportunistic Networks"],"prefix":"10.1007","volume":"110","author":[{"given":"Nahideh","family":"Derakhshanfard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,10,25]]},"reference":[{"issue":"2","key":"6835_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/j.ejor.2016.01.018","volume":"252","author":"C Lersteau","year":"2016","unstructured":"Lersteau, C., Rossi, A., & Sevaux, M. (2016). Robust scheduling of wireless sensor networks for target tracking under uncertainty. European Journal of Operational Research,252(2), 407\u2013417.","journal-title":"European Journal of Operational Research"},{"key":"6835_CR2","unstructured":"Huang, C.-M., Lan, K.-C., & Tsai, C.-Z. (2008). A survey of opportunistic networks. In 22nd international conference on advanced information networking and applications-workshops. AINAW 2008. New York: IEEE."},{"issue":"4","key":"6835_CR3","doi-asserted-by":"publisher","first-page":"1104","DOI":"10.1007\/s10922-014-9333-5","volume":"23","author":"H Liu","year":"2015","unstructured":"Liu, H., Yang, H., Wang, Y., Wang, B., & Gu, Y. (2015). CAR: Coding-aware opportunistic routing for unicast traffic in wireless mesh networks. Journal of Network and Systems Management,23(4), 1104\u20131124.","journal-title":"Journal of Network and Systems Management"},{"issue":"1","key":"6835_CR4","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.ejor.2016.12.006","volume":"260","author":"ME Keskin","year":"2017","unstructured":"Keskin, M. E. (2017). A column generation heuristic for optimal wireless sensor network design with mobile sinks. European Journal of Operational Research,260(1), 291\u2013304.","journal-title":"European Journal of Operational Research"},{"key":"6835_CR5","doi-asserted-by":"publisher","first-page":"1027","DOI":"10.1016\/j.future.2016.11.032","volume":"78","author":"X Wei","year":"2016","unstructured":"Wei, X., Wang, T., Tang, C., & Fan, J. (2016). Collaborative mobile jammer tracking in multi-hop wireless network. Future Generation Computer Systems,78, 1027\u20131039.","journal-title":"Future Generation Computer Systems"},{"key":"6835_CR6","unstructured":"Vahdat, A., & Becker, D. (2000). Epidemic routing for partially connected ad hoc networks. Technical report CS-200006. Duke University."},{"issue":"1","key":"6835_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/1687-1499-2013-105","volume":"2013","author":"LF Xie","year":"2013","unstructured":"Xie, L. F., Chong, P. H. J., & Guan, Y. L. (2013). Routing strategy in disconnected mobile ad hoc networks with group mobility. EURASIP Journal on Wireless Communications and Networking,2013(1), 1\u201312.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"6835_CR8","unstructured":"Psounis, K., & Raghavendra, C. S. (2004). Multiple-copy routing in intermittently connected mobile networks. Technical report CENG-2004-12, USC."},{"key":"6835_CR9","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. New York: ACM."},{"key":"6835_CR10","unstructured":"Shu, J., et al. (2010). RET: A random and encounter time based forwarding mechanism for opportunistic network. In 2010 3rd international symposium on information processing (ISIP). New York: IEEE."},{"key":"6835_CR11","unstructured":"Nelson, S. C., Bakht, M., & Kravets, R. (2009). Encounter-based routing in DTNs. In INFOCOM 2009, IEEE. New York: IEEE."},{"key":"6835_CR12","unstructured":"Dubois-Ferriere, H., Grossglauser, M., & Vetterli, M. (2003). Age matters: Efficient route discovery in mobile ad hoc networks using encounter ages. In Proceedings of the 4th ACM international symposium on mobile ad hoc networking and computing. New York: ACM."},{"issue":"1","key":"6835_CR13","doi-asserted-by":"publisher","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":"1","key":"6835_CR14","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/s11277-013-1369-4","volume":"75","author":"K Wang","year":"2014","unstructured":"Wang, K., & Guo, H. (2014). An improved routing algorithm based on social link awareness in delay tolerant networks. Wireless Personal Communications,75(1), 397\u2013414.","journal-title":"Wireless Personal Communications"},{"issue":"3","key":"6835_CR15","doi-asserted-by":"publisher","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":"6835_CR16","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). New York: IEEE."},{"issue":"5","key":"6835_CR17","doi-asserted-by":"publisher","first-page":"1660","DOI":"10.1016\/j.jnca.2011.05.005","volume":"34","author":"AT Prodhan","year":"2011","unstructured":"Prodhan, A. T., et al. (2011). TTL based routing in opportunistic networks. Journal of Network and Computer Applications,34(5), 1660\u20131670.","journal-title":"Journal of Network and Computer Applications"},{"key":"6835_CR18","doi-asserted-by":"crossref","unstructured":"Iqbal, S. M. A., & Chowdhury, A. K. (2012). Adaptation of spray phase to improve the binary spray and wait routing in delay tolerant networks. In 2012 15th international conference on computer and information technology (ICCIT).","DOI":"10.1109\/ICCITechn.2012.6509723"},{"key":"6835_CR19","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/817528","author":"D Pan","year":"2012","unstructured":"Pan, D., et al. (2012). Buffer management and hybrid probability choice routing for packet delivery in opportunistic networks. Mathematical Problems in Engineering. \nhttps:\/\/doi.org\/10.1155\/2012\/817528","journal-title":"Mathematical Problems in Engineering"},{"key":"6835_CR20","unstructured":"Lee, C., & Kim, K. I. (2014). A deadline aware DTN approach based on epidemic routing. In 2014 IEEE 13th international symposium on network computing and applications (NCA). New York: IEEE."},{"issue":"1","key":"6835_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13638-015-0427-x","volume":"2015","author":"C Mergenci","year":"2015","unstructured":"Mergenci, C., & Korpeoglu, I. (2015). Routing in delay tolerant networks with periodic connections. EURASIP Journal on Wireless Communications and Networking,2015(1), 1\u201319.","journal-title":"EURASIP Journal on Wireless Communications and Networking"},{"key":"6835_CR22","doi-asserted-by":"crossref","unstructured":"Burgess, J., et al. (2006). MaxProp: Routing for vehicle-based disruption-tolerant networks. In INFOCOM.","DOI":"10.1109\/INFOCOM.2006.228"},{"issue":"2","key":"6835_CR23","first-page":"1483","volume":"12","author":"M Tibor","year":"2012","unstructured":"Tibor, M., & Baro\u00e5, I. (2012). Packet loss probability estimation using Erlang B and M\/G\/1\/K models in modern VoIP networks. IU-Journal of Electrical and Electronics Engineering.,12(2), 1483\u20131491.","journal-title":"IU-Journal of Electrical and Electronics Engineering."},{"key":"6835_CR24","unstructured":"Diagnostic Strategies. (2003). Traffic modeling and resource allocation in call centers. Needham, MA."},{"key":"6835_CR25","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"},{"issue":"1","key":"6835_CR26","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/s11276-015-1136-4","volume":"23","author":"N Derakhshanfard","year":"2017","unstructured":"Derakhshanfard, N., Sabaei, M., & Rahmani, A. M. (2017). CPTR: Conditional probability tree based routing in opportunistic networks. Wireless Networks, 23(1), 43\u201350.","journal-title":"Wireless Networks"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-019-06835-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-019-06835-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-019-06835-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,23]],"date-time":"2020-10-23T23:22:19Z","timestamp":1603495339000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-019-06835-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,25]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,2]]}},"alternative-id":["6835"],"URL":"https:\/\/doi.org\/10.1007\/s11277-019-06835-8","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,25]]},"assertion":[{"value":"25 October 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}