A Markov Chain Prediction Model for Routing in Delay Tolerant Networks

Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9196)

Abstract

In Delay Tolerant Networks (DTNs), nodes seldom keep in contact with each other because of the disorder movements of nodes. Thus many traditional routing protocols may not be applicable in this emerging network. In recent years, many routing protocols have been proposed to improve the routing performance in DTNs, however, most of them do not fully mine the inherent regular pattern of the movements of nodes. In this paper, we propose a Markov Chain Prediction (MCP) model for routing in DTNs to mine the movements of nodes property with historical contact information and use this model to improve the delivery ratio of message transferring within the network.

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Schurgot, M.R., Comaniciu, C., Jaffres-Runser, K.: Beyond traditional DTN routing: social networks for opportunistic communication. IEEE Communications Magazine 50, 155–162 (2012)CrossRefGoogle Scholar
  2. 2.
    Liu, M., Yang, Y., Qin, Z.: A survey of routing protocols and simulations in delay-tolerant networks. In: Cheng, Y., Eun, D.Y., Qin, Z., Song, M., Xing, K. (eds.) WASA 2011. LNCS, vol. 6843, pp. 243–253. Springer, Heidelberg (2011) CrossRefGoogle Scholar
  3. 3.
    Zhu, Y., Xu, B., Shi, X., Wang, Y.: A survey of social-based routing in delay tolerant networks: positive and negative social effects. Communications Surveys & Tutorials, IEEE 15(1), 387–401 (2013)CrossRefGoogle Scholar
  4. 4.
    Vahdat, A., Becker, D., et al.: Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, Tech. Rep. (2000)Google Scholar
  5. 5.
    Lindgren, A., Doria, A., Schelén, O.: Probabilistic routing in intermittently connected networks. ACM SIGMOBILE mobile computing and communications review 7(3), 19–20 (2003)CrossRefGoogle Scholar
  6. 6.
    Dubois-Ferriere, H., Grossglauser, M., Vetterli, M.: 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 & Computing, pp. 257–266. ACM (2003)Google Scholar
  7. 7.
    Erramilli, V., Chaintreau, A., Crovella, M., Diot, C.: Diversity of forwarding paths in pocket switched networks. In: Proceedings of the 7th ACM SIGCOMM Conference on Internet Measurement, pp. 161–174. ACM (2007)Google Scholar
  8. 8.
    Erramilli, V., Crovella, M., Chaintreau, A., Diot, C.: Delegation forwarding. In: Proceedings of the 9th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 251–260. ACM (2008)Google Scholar
  9. 9.
    Daly, E.M., Haahr, M.: Social network analysis for routing in disconnected delay-tolerant manets. In: Proceedings of the 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 32–40. ACM (2007)Google Scholar
  10. 10.
    Li, F., Jiang, H., Wang, Y., Li, X., Wang, M., Abdeldjalil, T.: SEBAR: Social energy based routing scheme for mobile social delay tolerant networks. In: Proceedings of the 2013 IEEE International Performance Computing and Communications Conference. IEEE (2013)Google Scholar
  11. 11.
    Scott, J., Gass, R., Crowcroft, J., Hui, P., Diot, C., Chaintreau, A.: Crawdad trace cambridge/haggle/imote/infocom2006 (v. May 29, 2009). http://crawdad.cs.dartmouth.edu/cambridge/haggle/imote/infocom2006
  12. 12.
    Kaisa, A.: CRAWDAD data set thlab/sigcomm2009 (v. July 15, 2012). http://crawdad.org/thlab/sigcomm2009
  13. 13.
    Wang, E., Yang, Y., Jia, B., Guo, T.: The DTN routing algorithm based on Markov meeting time span prediction model. International Journal of Distributed Sensor Networks, 2013, Article ID 736796 (2013)Google Scholar
  14. 14.
    Ip, Y., Lau, W., Yue, O.: Forwarding and Replication Strategies for DTN with Resource Constraints. In: IEEE 65th Vehicular Technology Conference, 2007. VTC2007-Spring (2007)Google Scholar
  15. 15.
    Tian, C., Li, F., Jiang, L., Wang, Z., Wang, Y.: Energy efficient social-based routing for delay tolerant networks. In: Cai, Z., Wang, C., Cheng, S., Wang, H., Gao, H. (eds.) WASA 2014. LNCS, vol. 8491, pp. 290–301. Springer, Heidelberg (2014) Google Scholar
  16. 16.
    Li, F., Zhao, L., Zhang, C., Gao, Z., Wang, Y.: Routing with multi-level cross-community social groups in mobile opportunistic networks. Personal and Ubiquitous Computing 18(2), 385–396 (2014)CrossRefGoogle Scholar
  17. 17.
    Liu, G., Ji, S., Cai, Z.: Credit-based incentive data dissemination in mobile social networks. In: International Workshop on Identification, Information & Knowledge in The Internat of Things (IIKI 2013) (2013)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.Beijing Engineering Research Center of High Volume Language Information Processing and Cloud Computing Applications, School of Computer ScienceBeijing Institute of TechnologyBeijingChina

Personalised recommendations