{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:25:39Z","timestamp":1725701139056},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326851"},{"type":"electronic","value":"9783642326868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32686-8_25","type":"book-chapter","created":{"date-parts":[[2012,8,22]],"date-time":"2012-08-22T02:57:34Z","timestamp":1345604254000},"page":"270-279","source":"Crossref","is-referenced-by-count":1,"title":["A Risk-Reward Competitive Analysis for Online Routing Algorithms in Delay Tolerant Networks"],"prefix":"10.1007","author":[{"given":"Maziar","family":"Mirzazad Barijough","sequence":"first","affiliation":[]},{"given":"Nasser","family":"Yazdani","sequence":"additional","affiliation":[]},{"given":"Djamshid","family":"Tavangarian","sequence":"additional","affiliation":[]},{"given":"Robil","family":"Daher","sequence":"additional","affiliation":[]},{"given":"Hadi","family":"Khani","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"25_CR1","doi-asserted-by":"publisher","first-page":"1305","DOI":"10.1007\/s11276-011-0350-y","volume":"17","author":"U.G. Acer","year":"2011","unstructured":"Acer, U.G., Kalyanaraman, S., et al.: DTN routing using explicit and probabilistic routing table states. Wireless Networks\u00a017(5), 1305\u20131321 (2011)","journal-title":"Wireless Networks"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Yuan, Q., Cardei, I., et al.: Predict and relay: an efficient routing in disruption-tolerant networks. ACM (2009)","DOI":"10.1145\/1530748.1530762"},{"issue":"1","key":"25_CR3","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/PL00009285","volume":"25","author":"S. Al-Binali","year":"1999","unstructured":"Al-Binali, S.: A Risk-Reward Framework for the Competitive Analysis of Financial Games. Algorithmica\u00a025(1), 99\u2013115 (1999)","journal-title":"Algorithmica"},{"key":"25_CR4","unstructured":"Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University (2000)"},{"issue":"5","key":"25_CR5","doi-asserted-by":"publisher","first-page":"1450","DOI":"10.1109\/TNET.2010.2043113","volume":"18","author":"U.G. Acer","year":"2010","unstructured":"Acer, U.G., Kalyanaraman, S., et al.: Weak state routing for large-scale dynamic networks. IEEE\/ACM Transactions on Networking (TON)\u00a018(5), 1450\u20131463 (2010)","journal-title":"IEEE\/ACM Transactions on Networking (TON)"},{"issue":"3","key":"25_CR6","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/961268.961272","volume":"7","author":"A. Lindgren","year":"2003","unstructured":"Lindgren, A., Doria, A., et al.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review\u00a07(3), 19\u201320 (2003)","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"issue":"2","key":"25_CR7","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"D.D. Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM\u00a028(2), 202\u2013208 (1985)","journal-title":"Communications of the ACM"},{"issue":"2","key":"25_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10878-008-9156-y","volume":"18","author":"Y. Xu","year":"2009","unstructured":"Xu, Y., Hu, M., et al.: The canadian traveller problem and its competitive analysis. Journal of Combinatorial Optimization\u00a018(2), 195\u2013205 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"25_CR9","unstructured":"Krumke, S.O.: Online optimization: Competitive analysis and beyond. Habilitation Thesis, Technical University of Berlin (2001)"},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1007\/978-3-642-02026-1_31","volume-title":"Combinatorial Optimization and Applications","author":"G. Zhang","year":"2009","unstructured":"Zhang, G., Xu, Y.: A Risk-Reward Competitive Analysis for the Newsboy Problem with Range Information. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol.\u00a05573, pp. 334\u2013345. Springer, Heidelberg (2009)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-85097-7_39","volume-title":"Combinatorial Optimization and Applications","author":"B. Su","year":"2008","unstructured":"Su, B., Xu, Y., Xiao, P., Tian, L.: A Risk-Reward Competitive Analysis for the Recoverable Canadian Traveller Problem. In: Yang, B., Du, D.-Z., Wang, C.A. (eds.) COCOA 2008. LNCS, vol.\u00a05165, pp. 417\u2013426. Springer, Heidelberg (2008)"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/11496199_6","volume-title":"Algorithmic Applications in Management","author":"L. Ding","year":"2005","unstructured":"Ding, L., Xin, C., Chen, J.: A Risk-Reward Competitive Analysis of the Bahncard Problem. In: Megiddo, N., Xu, Y., Zhu, B. (eds.) AAIM 2005. LNCS, vol.\u00a03521, pp. 37\u201345. Springer, Heidelberg (2005)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Burgess, J., Gallagher, B., et al.: Maxprop: Routing for vehicle-based disruption-tolerant networks, Barcelona, Spain (2006)","DOI":"10.1109\/INFOCOM.2006.228"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1109\/COMST.2006.323440","volume":"8","author":"Z. Zhang","year":"2006","unstructured":"Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communications Surveys Tutorials\u00a08(1), 24\u201337 (2006)","journal-title":"IEEE Communications Surveys Tutorials"},{"issue":"3","key":"25_CR15","first-page":"7","volume":"8","author":"J. Kurhinen","year":"2008","unstructured":"Kurhinen, J., Janatuinen, J.: Delay Tolerant Routing In Sparse Vehicular Ad Hoc Networks. Acta Electrotechnica et Informatica\u00a08(3), 7\u201313 (2008)","journal-title":"Acta Electrotechnica et Informatica"},{"issue":"8","key":"25_CR16","doi-asserted-by":"publisher","first-page":"1538","DOI":"10.1109\/JSAC.2007.071005","volume":"25","author":"N. Wisitpongphan","year":"2007","unstructured":"Wisitpongphan, N., Bai, F., et al.: Routing in sparse vehicular ad hoc wireless networks. IEEE Journal on Selected Areas in Communications\u00a025(8), 1538\u20131556 (2007)","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. Mobile Computing, 153\u2013181 (1996)","DOI":"10.1007\/978-0-585-29603-6_5"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. IEEE (1999)","DOI":"10.1109\/MCSA.1999.749281"},{"key":"25_CR19","unstructured":"Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)"}],"container-title":["Lecture Notes in Computer Science","Internet of Things, Smart Spaces, and Next Generation Networking"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32686-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T12:11:43Z","timestamp":1620130303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32686-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326851","9783642326868"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32686-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}