Abstract
Delay Tolerant Networks (DTNs) suffer from frequent disruptions and partitioning. Because of dynamic environment and lack of knowledge about the whole network topology, routing is quiet challenging in DTNs. Prediction based algorithms in DTNs are able to predict nodes future contacts in the case where each node has a movement model. In this paper we suppose that a new node is added to the network which is about to send messages to a destination node and has no knowledge about the upcoming contacts. Deciding about the next node to forward the messages to, is an online problem. We are going to analyze a greedy forwarding strategy using competitive analysis and also propose a risk-reward analysis framework for the risky version of the algorithm and obtain risk and reward values for different forecasts. Risk-reward analysis can be used to develop better forwarding strategies which decide about the next hops more wisely.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Acer, U.G., Kalyanaraman, S., et al.: DTN routing using explicit and probabilistic routing table states. Wireless Networks 17(5), 1305–1321 (2011)
Yuan, Q., Cardei, I., et al.: Predict and relay: an efficient routing in disruption-tolerant networks. ACM (2009)
Al-Binali, S.: A Risk-Reward Framework for the Competitive Analysis of Financial Games. Algorithmica 25(1), 99–115 (1999)
Vahdat, A., Becker, D.: Epidemic routing for partially connected ad hoc networks, Technical Report CS-200006, Duke University (2000)
Acer, U.G., Kalyanaraman, S., et al.: Weak state routing for large-scale dynamic networks. IEEE/ACM Transactions on Networking (TON) 18(5), 1450–1463 (2010)
Lindgren, A., Doria, A., et al.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE Mobile Computing and Communications Review 7(3), 19–20 (2003)
Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Communications of the ACM 28(2), 202–208 (1985)
Xu, Y., Hu, M., et al.: The canadian traveller problem and its competitive analysis. Journal of Combinatorial Optimization 18(2), 195–205 (2009)
Krumke, S.O.: Online optimization: Competitive analysis and beyond. Habilitation Thesis, Technical University of Berlin (2001)
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. 5573, pp. 334–345. Springer, Heidelberg (2009)
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. 5165, pp. 417–426. Springer, Heidelberg (2008)
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. 3521, pp. 37–45. Springer, Heidelberg (2005)
Burgess, J., Gallagher, B., et al.: Maxprop: Routing for vehicle-based disruption-tolerant networks, Barcelona, Spain (2006)
Zhang, Z.: Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges. IEEE Communications Surveys Tutorials 8(1), 24–37 (2006)
Kurhinen, J., Janatuinen, J.: Delay Tolerant Routing In Sparse Vehicular Ad Hoc Networks. Acta Electrotechnica et Informatica 8(3), 7–13 (2008)
Wisitpongphan, N., Bai, F., et al.: Routing in sparse vehicular ad hoc wireless networks. IEEE Journal on Selected Areas in Communications 25(8), 1538–1556 (2007)
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. Mobile Computing, 153–181 (1996)
Perkins, C.E., Royer, E.M.: Ad-hoc on-demand distance vector routing. IEEE (1999)
Borodin, A., El-Yaniv, R.: Online computation and competitive analysis. Cambridge University Press (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mirzazad Barijough, M., Yazdani, N., Tavangarian, D., Daher, R., Khani, H. (2012). A Risk-Reward Competitive Analysis for Online Routing Algorithms in Delay Tolerant Networks. In: Andreev, S., Balandin, S., Koucheryavy, Y. (eds) Internet of Things, Smart Spaces, and Next Generation Networking. ruSMART NEW2AN 2012 2012. Lecture Notes in Computer Science, vol 7469. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32686-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-32686-8_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-32685-1
Online ISBN: 978-3-642-32686-8
eBook Packages: Computer ScienceComputer Science (R0)