Share This Article:

Routing in Delay Tolerant Networks (DTN)
—Improved Routing with MaxProp and the Model of “Transfer by Delegation” (Custody Transfer)

Abstract Full-Text HTML Download Download as PDF (Size:843KB) PP. 53-58
DOI: 10.4236/ijcns.2011.41006    4,196 Downloads   9,210 Views   Citations

ABSTRACT

In this paper, we address the problem of routing in delay tolerant networks (DTN). In such networks there is no guarantee of finding a complete communication path connecting the source and destination at any time, especially when the destination is not in the same region as the source, which makes traditional routing protocols inefficient in that transmission of the messages between nodes. We propose to combine the routing protocol MaxProp and the model of “transfer by delegation” (custody transfer) to improve the routing in DTN networks and to exploit nodes as common carriers of messages between the network partitioned. To implement this approach and assess those improvements and changes we developed a DTN simulator. Simulation examples are illustrated in the article.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

E. Sammou and A. Abdali, "Routing in Delay Tolerant Networks (DTN)
—Improved Routing with MaxProp and the Model of “Transfer by Delegation” (Custody Transfer)," International Journal of Communications, Network and System Sciences, Vol. 4 No. 1, 2011, pp. 53-58. doi: 10.4236/ijcns.2011.41006.

References

[1] F. Warthman, “Delay Tolerant Networks,” Delay Tolerant Networking Tutorial, 2003. http://www.ipnsig.org/ reports/DTN_Tutorial11.pdf
[2] A. Vahdat and D. Becker, “Epidemic Routing for Partially Connected Ad Hoc Networks,” Technical Report CS-200006, Duke University, Durham, April 2000.
[3] J. Burgess, B. Gallagher, D. Jensen and B. N. Levine, “MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks,” Proceedings of 25th IEEE International Conference on Computer Communications, Barcelona, 23-29 April 2006, pp. 1-11. doi:10.1109/INFOCOM.2006.228
[4] F. Guidec, “Deployment and Implementation Support Services Communicating in Pervasive Computing Environments,” Université de Bretagne Sud, Lorient, June 2008, pp. 35-65.
[5] K. Fall, W. Hong and S. Madden, “Custody Transfer for Reliable Delivery in Delay Tolerant Networks,” Technical Report, Intel Research, Berkeley, 2003.
[6] M. Ibrahim, “Routing and Performance Evaluation of Disruption Tolerant Networks,” University of Nice Sophia Antipolis, Nice, November 2008.
[7] C. Bettstetter, H. Hartenstein and X. Perez-Costa, “Stochastic Properties of the Random Way-Point Mobility Model,” ACM/Kluwer Wireless Networks, Special Issue on Modeling and Analysis of Mobile Networks, Vol. 10, No. 5, September 2004, pp. 555-567.
[8] C. Bettstetter, G. Resta and P. Santi, “The Node Distribution of the Random Waypoint Mobility Model for Wireless Ad Hoc Networks,” IEEE Transactions on Mobile Computing, Vol. 2, No. 3, July 2003, pp. 257-269. doi:10.1109/TMC.2003.1233531
[9] C. Bettstetter and C. Wagner, “The Spatial Node Distribution of the Random Waypoint Mobility Model,” Proceedings of German Workshop on Mobile Ad-Hoc Networks, GI Lecture Notes in Informatics, Ulm, 25-26 March 2002, pp. 1-18.
[10] J. Leguay, T. Friedman and V. Conan, “Evaluating Mo- bility Pattern Space Routing for DTNs,” Proceedings of 25th IEEE International Conference on Computer Communications, Barcelona, 23-29 April 2006, pp. 1-10. doi:10.1109/INFOCOM.2006.299
[11] M. Musolesi, S. Hailes and C. Mascolo, “Context-Aware Adaptive Routing for Delay Tolerant Mobile Networks,” Proceedings of IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks, Taormina, 13-16 June 2005.
[12] J. Leguay, “Heterogeneity and Routing in Delay Tolerant Networks,” Ph.D. Dissertation, Universite Paris VI, Paris, July 2007.

  
comments powered by Disqus

Copyright © 2019 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.