Advertisement

A Novel Mobility-Based Routing Protocol for Semi-Predictable Disruption Tolerant Networks

  • Saeid Iranmanesh
  • Kwan-Wu Chin
Article

Abstract

This letter considers routing in delay tolerant networks whereby nodes have semi-predictable mobility patterns within a time period. We propose a mobility-based routing protocol (MBRP) where nodes construct a space–time graph dynamically. As the space–time graph may be incomplete, MBRP presents a heuristic that evaluates encountered nodes based on their recorded mobility patterns in order to disseminate a finite number of bundle replicas. Simulation results, over a service quality metric comprising of delivery, delay and overhead, show that MBRP achieves up to 105 % improvement as compared to four well-known routing protocols. Finally, MBRP is capable of achieving 50 % of the performance attained by the optimal algorithm, whereby all nodes are preloaded with a space–time graph.

Keywords

Delay tolerant networks Vehicular communications Mobility models Space–time graph Time evolving graph 

References

  1. 1.
    M. Z. Araki and K.-W. Chin, TrainNet: A Novel Transport System for Delivering Non Real Time Video, Elsevier Computer Communications, Vol. 33, No. 15, pp. 1850–1863, 2010.CrossRefGoogle Scholar
  2. 2.
    M. Huang, S. Chen, Y. Zhu, B. Xu and Y. Wang, Topology Control for Time-Evolving and Predictable Delay-Tolerant Networks, IEEE MASSValencia, 2011.CrossRefGoogle Scholar
  3. 3.
    L. Huai-En, C. Chen, J. Chang, C. Shen, and R. Jan, “Shortest path routing with reliability requirement in delay tolerant networks”, IEEE First International Conference on Future Information Networks (ICFIN), Beijing, China, 2009.Google Scholar
  4. 4.
    M. Huang, S. Chen, Y. Zhu and Y. Wang, Cost-Efficient Topology Design Problem in Time-Evolving Delay-Tolerant Networks, IEEE GLOBECOMMiami, FL, USA, 2010.CrossRefGoogle Scholar
  5. 5.
    J. Leguay, T. Friedman, and V. Conon, “DTN routing in a mobility pattern space”, Proceedings of the workshop on Delay-tolerant networking, Philadelphia, Pennsylvania, USA, 2005.Google Scholar
  6. 6.
    S. Jain, K. Fall and R. Patra, Routing in a delay tolerant network, ACM SIGCOMM Computer Communication Review, Vol. 34, No. 4, pp. 145–158, 2004.CrossRefGoogle Scholar
  7. 7.
    B. B. Xuan, A. Ferreira and A. Jarry, Computing Sortest, Fastest, and Foremost Journey in Dynamic Networks, International Journal of Foundations of Computer Science, Vol. 14, No. 2, pp. 267–285, 2003.CrossRefMATHMathSciNetGoogle Scholar
  8. 8.
    S. Merugu, M. Ammar, and E. Zegura, “Routing in Space and Time in Networks with Predictable Mobility”, Georgia Institute of Technology, Technical Report, GIT-CC-04-07, 2004.Google Scholar
  9. 9.
    D. Hay and P. Giaccone, “Optimal routing and scheduling for deterministic delay tolerant networks”, IEEE Sixth International Conference on Wireless On-Demand Network Systems and Services, Snowbird, UT, 2009.Google Scholar
  10. 10.
    C. Liu and J. Wu, Practical Routing in a Cyclic MobiSpace, IEEE, Transactions on Networking, Vol. 19, No. 2, pp. 369–382, 2011.CrossRefGoogle Scholar
  11. 11.
    R. Handorean, C. Gill and G.-C. Roman, Accommodating Transient Connectivity in Ad Hoc and Mobile Settings, Elsevier Pervasive Computing, Vol. 3001, pp. 305–322, 2004.CrossRefGoogle Scholar
  12. 12.
    Z. Zhang, Routing in intermittently connected mobile ad hoc networks and delay tolerant networks: overview and challenges, IEEE Communications Surveys & Tutorials, Vol. 8, No. 1, pp. 24–37, 2006.CrossRefGoogle Scholar
  13. 13.
    A. Keränen, J. Ott, and T. Kärkkäinen, “The ONE simulator for DTN protocol evaluation”, Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Rome, Italy, 2009.Google Scholar
  14. 14.
    A. Keränen, and J. Ott, “Increasing Reality for DTN Protocol Simulations”, Helsinki University of Technology, Technical Report, July, 2007.Google Scholar
  15. 15.
    F. Bai, N. Sadagopan and A. Helmy, IMPORTANT: a framework to systematically analyze the Impact of Mobility on Performance of Routing Protocols for Adhoc Networks, IEEE INFOCOMSan Francisco, CA, USA, 2003.Google Scholar
  16. 16.
    T. Camp, J. Boleng and V. Davies, A survey of mobility models for ad hoc network research, Wireless Communications and Mobile Computing, Vol. 2, No. 5, pp. 483–502, 2002.CrossRefGoogle Scholar
  17. 17.
    S. C. Nelson, M. Bakht, R. Kravets and A. Harris, Encounter: based routing in DTNs, ACM SIGMOBILE Mobile Computing Communications Review, Vol. 13, No. 1, pp. 56–59, 2009.CrossRefGoogle Scholar
  18. 18.
    A. Vahdat, D. Becker, “Epidemic routing for partially connected ad hoc networks”, Technical Report, CS-200006, Department of Computer Science, Duke University, Durham, NC, 2000.Google Scholar
  19. 19.
    J. Burgess, B. Gallaghe, D. Jensen, and B. N. Levine, “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks”, IEEE INFOCOM, Barcelona, Spain, 2006.Google Scholar
  20. 20.
    A. Lindgren, A. Doria and O. Schelen, Probabilistic routing in intermittently connected networks, ACM SIGMOBILE Mobile Computing Communications Revie, Vol. 7, No. 3, pp. 19–20, 2003.CrossRefGoogle Scholar
  21. 21.
    S. Iranmanesh, R. Raad, and K-W Chin, “A Novel Destination-Based Routing Protocol (DBRP) in DTNs”, IEEE, The International Symposium on Communications and Information Technologies (ISCIT), pp. 325–330, QLD, Australia, 2012.Google Scholar

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.School of Electrical, Computer and Telecommunications EngineeringUniversity of WollongongWollongongAustralia

Personalised recommendations