Skip to main content
Log in

Mobility-aware routing in delay tolerant networks

  • Original Article
  • Published:
Personal and Ubiquitous Computing Aims and scope Submit manuscript

Abstract

Delay tolerant networks (DTNs) make use of opportunistic encounters of nodes for communication. The characteristics of high mobility of nodes, frequent link variation and long communication delays in DTNs result in an absence of an instantaneous end-to-end path from any source to a destination, making routing a challenge in DTNs. To deal with this issue, a lot of routing schemes have been proposed, in which future contacts of nodes are predicted based on node mobility traces and contact information. However, the previous works did not consider the spatial information of nodes, such as dwelling time at a location, and the transitivity of contacts in the prediction process of future encounter opportunities of nodes. In this paper, a novel mobility prediction-based routing (MPR) scheme is proposed for DTNs, in which the spatial information of nodes and contact transitivity are both taken into account. Specifically, a time-homogeneous semi-Markov process model is proposed to describe node mobility. By employing the semi-Markov model, we formulate the probability of a node destined to an area subject to the remaining time period constraint. The simulation results show that the proposed MPR scheme substantially improves delivery ratio and reduces delivery latency compared with traditional DTN routing schemes.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Balasubramanian A, Levine BN, Venkataramani A (2010) Replication routing in dtns: a resource allocation approach. IEEE/ACM Trans Netw 18(2):596–609

    Article  Google Scholar 

  2. Bulut E, Szymanski BK (2010) Friendship based routing in delay tolerant mobile social networks. In: IEEE Global Telecommunications Conference (GLOBECOM 2010). Miami, USA, pp 1–5

  3. Burgess J, Gallagher B, Jensen D, Levine B (2006) Maxprop: Routing for vehicle-based disruption-tolerant networks. In: IEEE INFOCOM 2006. Barcelona, Spain

  4. Cai Z, Chen ZZ, Lin G (2008) A 3.4713-approximation algorithm for the capacitated multicast tree routing problem. Theor Comput Sci 410(52):5415–5424

    Article  MathSciNet  MATH  Google Scholar 

  5. Cai Z, Duan Y, Bourgeois A (2015) Delay efficient opportunistic routing in asynchronous multi-channel cognitive radio networks. J Comb Optim 4(29):815–835

    Article  MathSciNet  MATH  Google Scholar 

  6. Cai Z, Goebel R, Lin G (2011) Size-constrained tree partitioning: a story on approximating the multicast k-tree routing problem. Theor Comput Sci 3(412):240–245

    Article  MathSciNet  MATH  Google Scholar 

  7. Cai Z, Lin G, Xue G (2005) Improved approximation algorithms for the capacitated multicast routing problem. In: COCOON. Kunming, China, pp 136–145

  8. Cheng S, Cai Z, Li J (2014) Curve query processing in wireless sensor networks. IEEE Trans Veh Technol. doi:10.1109/TVT.2014.2375330

  9. Cheng S, Cai Z, Li J, Fang X (2015) Drawing dominant dataset from big sensory data in wireless sensor networks. In: The 34rd Annual IEEE International Conference on Computer Communications

  10. Conti M, Kumar M (2010) Opportunities in opportunistic computing. Computer 43(1):42–50

    Article  Google Scholar 

  11. Daly EM, Haahr M (2009) Social network analysis for information flow in disconnected delay-tolerant manets. IEEE Trans Mobile Comput 8(5):606–621

    Article  Google Scholar 

  12. Dang F, Yang X, Long K (2012) Spray and forward: efficient routing based on the markov location prediction model for dtns. Sci China Inf Sci 55(2):433–440

    Article  Google Scholar 

  13. Fawal AE, Boudec JYL, Salamatian K (2007) Self-limiting epidemic forwarding. Tech. rep., In The First IEEE WoWMoM Workshop on Autonomic and Opportunistic Communications (AOC)

  14. Gao W, Cao G, Porta TL, Han J (2013) On exploiting transient social contact patterns for data forwarding in delay-tolerant networks. IEEE Trans Mobile Comput 12(1):151–165

    Article  Google Scholar 

  15. Guo L, Li Y, Cai Z (2015) Minimum-latency aggregation scheduling in wireless sensor network. J Combin Optim. doi:10.1007/s10878-014-9748-7

    MathSciNet  MATH  Google Scholar 

  16. He Z, Cai Z, Cheng S, Wang X (2014) Approximate aggregation for tracking quantiles in wireless sensor networks. In: COCOA 2014. Maui, Hawaii, USA, pp 161–172

  17. He Z, Cai Z, Wang X (2015) Modeling propagation dynamics and optimal countermeasures of the social network rumors. In: IEEE ICDCS 2015. Columbus, Ohio, USA

  18. Hui P, Crowcroft J, Yoneki E (2011) Bubblerap: social-based forwarding in delay-tolerant networks. IEEE Trans Mobile Comput 10(11):1576–1589

    Article  Google Scholar 

  19. Jain S, Fall K, Patra R (2004) Routing in a delay tolerant network. ACM SIGCOMM 34(4):145–158

    Article  Google Scholar 

  20. Karp B, Kung HT (2000) Gpsr: greedy perimeter stateless routing for wireless networks. In: ACM Mobicom. New York, USA, pp 243–254

  21. Keränen AO, Kärkkäinen T (2009) The one for dtn protocol evaluation. In: Proceedings of 2nd SIMUTools 2009. Rome, Italy

  22. Kim E, Helal S, Cook D (2010) Human activity recognition and pattern discovery. IEEE Pervasive Comput 9(1):48–53

    Article  Google Scholar 

  23. Lee KC, Lee U, Gerla M (2010) Geo-opportunistic routing for vehicular networks. IEEE Commun Mag 48(5):164–170

    Article  Google Scholar 

  24. Li F, Zhao L, Zhang C, Gao Z, Wang Y (2014) Routing with multi-level cross-community social groups in mobile opportunistic networks. Pers Ubiquitous Comput 18(2):385–396

    Article  Google Scholar 

  25. Li J, Cheng S, Gao H, Cai Z (2014) Approximate physical world reconstruction algorithms in sensor networks. IEEE Trans Parallel Distrib Syst. doi:10.1109/TPDS.2013.2297121

  26. Lindgren A, Doria A, Schelén O (2003) Probabilistic routing in intermittently connected networks. ACM SIGMOBILE 7(3):19–20

    Article  Google Scholar 

  27. Lu J, Wang X, Zhang L (2014) Signal power random fading based interference-aware routing for wireless sensor networks. Wirel Netw 20(7):1715–1727

    Article  Google Scholar 

  28. Lu S, Liu Y, Liu Y, Kumar M (2012) Loop: a location based routing scheme for opportunistic networks. In: IEEE Mobile Ad hoc and Sensor Systems (MASS). Las Vegas, USA, pp 118–126

  29. Modiano E, Shah D, Zussman G (2006) Maximizing throughput in wireless networks via gossiping. In: ACM SIGMETRICS/IFIP Performance’06. Saint Malo, France, pp 27–38

  30. Nelson SC, Bakht M, Kravets R (2009) Encounter-based routing dtns. In: IEEE INFOCOM. Rio de Janeiro, Brazil, pp 846–854

  31. Spyropoulos T, Psounis K, Raghavendra CS (2005) Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In: Proceedings of ACM SIGCOMM workshop on Delay-tolerant networking. Philadelphia, PA, USA, pp 252–259

  32. Spyropoulos T, Psounis K, Raghavendra CS (2007) Spray and focus: efficient mobility-assisted routing for heterogeneous and correlated mobility. In: IEEE Pervasive Computing and Communications Workshops (PerCom Workshops’ 07). New York, USA, pp 79–85

  33. Tan G, Bertier M, Kermarrec A (2009) Visibility-graph-based shortest-path geographic routing in sensor networks. In: IEEE INFOCOM. Rio, Brazil, pp 1719–1727

  34. Thilakarathna K, Viana AC, Seneviratne A, Petander H (2013) Mobile social networking through friend-to-friend opportunistic content dissemination. In: IEEE MobiHoc. Bangalore, India, pp 263–266

  35. Tian C, Li F, Jiang L, Wang Z, Wang Y (2014) Energy efficient social-based routing for delay tolerant networks. In: Proceedings of 9th International Conference, WASA 2014, Harbin, China, pp 290-301

  36. Vahdat A, Becker D (2000) Epidemic routing for partially connected ad hoc networks. Tech. rep., Duke University. CS-200006

  37. Wang S, Liu M, Cheng X, Li Z, Huang J, Chen B (2013) Opportunistic routing in intermittently connected mobile p2p networks. IEEE J Sel Areas Commun 31(9):369–378

    Article  Google Scholar 

  38. Wang S, Liu M, Cheng X, Song M (2012) Routing in pocket switched networks. IEEE J Sel Areas Commun 19(2):67–73

    Google Scholar 

  39. Wang X, He Z, Zhao X, Lin C, Pan Y, Cai Z (2013) Reaction-diffusion modeling of malware propagation in mobile wireless sensor networks. Sci China Inf Sci 56(9):1–18

    Google Scholar 

  40. Wang S, Wang X, Cheng X, Huang J, Bie R (2014) The tempo-spatial information dissemination properties of mobile opportunistic networks with levy mobility. In: IEEE ICDCS 2014. Madrid, Spain, pp 124–133

  41. Wei K, Liang X, Xu K (2014) A survey of social-aware routing protocols in delay tolerant networks: applications, taxonomy and design-related issues. IEEE Commun Surv Tutor 16(1):556–578

    Article  Google Scholar 

  42. Xiao M, Wu J, Liu C, Huang L (2013) Tour: time-sensitive opportunistic utility-based routing in delay tolerant networks. In: IEEE INFOCOM. Turin, Italy, pp 2085–2091

  43. Yuan P, Ma H, Duan P (2013) Impact of strangers on opportunistic routing performance. J Comput Sci Technol 28(3):574–582

    Article  Google Scholar 

  44. Yuan Q, Cardei I, Wu J (2012) An efficient prediction-based routing in disruption-tolerant networks. IEEE Trans Parallel Distrib Syst 23(1):19–31

    Article  Google Scholar 

  45. Zhang B, Teng J, Bai X, Yang Z, Xuan D (2011) P\(^3\)-coupon: a probabilistic system for prompt and privacy-preserving electronic coupon distribution. In: IEEE Percom. Seattle, USA, pp 93–101

  46. Zhang L, Cai Z, Lu J, Wang X (2014) Spacial mobility prediction based routing scheme in delay/disruption-tolerant networks. In: In Proceedings of International Conference on Identification, Information and Knowledge in the Internet of Things 2014 (IIKI 2014). Beijing, China

  47. Zhang L, Wang X, Lu J, Ren M, Duan Z, Cai Z (2014) A novel contact prediction based routing scheme for dtns. Trans Emerg Telecommun Technol. http://onlinelibrary.wiley.com/doi/10.1002/ett.2889/abstract

  48. Zhang L, Yu B, Pan J (2014) Geomob: a mobility-aware geocast scheme in metropolitans via taxicabs and buses. In: IEEE INFOCOM 2014. Toroto, Canada, pp 1779–1787

  49. Zhu Y, Xu B, Shi X, Wang Y (2013) A survey of social-based routing in delay tolerant networks: positive and negative social effects. IEEE Commun Surv Tutor 15(1):387–401

    Article  Google Scholar 

Download references

Acknowledgments

This work is partly supported by the NSF of US under grant No. CNS-1252292, the NSF of China under Grant Nos. 61373083 and 61402273, the Natural Science Basis Research Plan in Shaanxi Province under Grant No. 2014JQ8353, the Program of Shaanxi Science and Technology Innovation Team under Grant No. 2014KTC-18, and the Fundamental Research Funds for the Central Universities under Grant Nos. GK201302024 and GK 201401002.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhipeng Cai.

Additional information

The short version of this manuscript is in IIKI 2014 [46].

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, L., Cai, Z., Lu, J. et al. Mobility-aware routing in delay tolerant networks. Pers Ubiquit Comput 19, 1111–1123 (2015). https://doi.org/10.1007/s00779-015-0880-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00779-015-0880-x

Keywords

Navigation