DTN is subclass of mobile ad hoc network (MANET) where instantaneous end-to-end connectivity is not available in source and destination nodes. Nodes in DTN are sparsely distributed. Frequent disconnections along with limited resources make routing in DTN more challenging. This paper proposes two routing protocols. One is Buddy Router with Time Window, which exploits social relations to maximize delivery probability. Another variant presented is Buddy Router with Replication, where controlled replication approach is used, along with social metric for message forwarding. Detailed formulation of proposed work, along with comparative analysis, based on simulations is presented. The paper also presents impact of buffer size variation and TTL variation on routing performance of different routing protocols.

Delay Tolerant Network (DTN), Routing, Opportunistic Routing and Pocket Switched Networks (PSN)

[1] Kevin Fall, “A Delay-Tolerant Network Architecture for Challenged Internets,” Intel Research Berkley, 2003.
[2] https://irtf.org/dtnrg
[3] Maurice J. Khabbaz, Chadi M. Assi, and Wissam F. Fawaz, “Disruption-Tolerant Networking: A Comprehensive Survey on Recent Developments and Persisting Challenges” IEEE Communications Surveys & Tutorials, Vol. 14, No. 2, Second Quarter 2012
[4] Yue Cao and Zhili Sun, Member, IEEE “Routing in Delay/Disruption Tolerant Networks: A Taxonomy, Survey and Challenges” IEEE Communications Surveys & Tutorials, Accepted For Publication.
[5] R. J. D’Souza, Johny Jose,NIT Surathkal, “Routing Approaches in Delay Tolerant Networks: A Survey” 2010 International Journal of Computer Applications (0975 - 8887)
[6] Artemios G. Voyiatzis, Member, IEEE, “A Survey of Delay- and Disruption-Tolerant Networking Applications” JOURNAL of Internet Engineering, vol. 5, no. 1, June 2012
[7] Ying Zhu, Bin Xu , Xinghua Shi, and Yu Wang “A Survey of Social-Based Routing in Delay Tolerant Networks: Positive and Negative Social Effects” IEEE Communications Surveys & Tutorials, Vol. 15, No. 1, First Quarter 2013
[8] Kaimin Wei, Xiao Liang, and Ke Xu, “A Survey of Social-Aware Routing Protocols in Delay Tolerant Networks:Applications, Taxonomy and Design-Related Issues” IEEE Communications Surveys & Tutorials, Accepted For Publication
[9] Paulo Rogerio Pereira, Augusto Casaca, Joel J. P. C. Rodrigues, Vasco N. G. J. Soares, Joan Triay, and Cristina Cervello-Pastor “From Delay-Tolerant Networks to Vehicular Delay-Tolerant Networks” IEEE Communications Surveys & Tutorials, Vol. 14, No. 4, Fourth Quarter 2012
[10] Amin Vahdat and David Becker “Epidemic Routing for Partially-Connected Ad Hoc Networks” Technical Report CS-200006, Duke University, April 2000.
[11] A. Lindgren, A. Doria “Probabilistic Routing Protocol for Intermittently Connected Networks” DTN Research Group, “ ITRF 2012
[12] J. Lakkakorpi, M. Pitkanen, and J. Ott, ” Adaptive Routing in Mobile Opportunistic Networks” ACM MSWiM 2010, Bodrum, Turkey, Oct. 2010, pp. 101-109
[13] P. Basu and S. Guha, “Effect of Limited Topology Knowledge on Opportunistic Forwarding in Ad Hoc Wireless Networks,” Eighth International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks (WIOPT), Avignon, France, June 2010Buffer Management
[14] T. Spyropoulos, K. Psounis and C. S. Raghvendra "Spray and Wait Efficient routing in intermittently connected Networks," in Proceeding of Mobile Computer and Communication review Vol. 7,no. 3, July 2003.
[15] Burgess, J., Gallagher, B., Jensen, D., & Levine, B.N. (2006). MaxProp: Routing for Vehicle-based Disruption-Tolerant Networks. 25th IEEE International Conference on Computer Communications (INFOCOM 2006), 1-11.
[16] Henri Dubois-Ferriere , Matthias Grossglauser , Martin Vetterli, Age matters: efficient route discovery in mobile ad hoc networks using encounter ages, Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing, June 01-03, 2003, Annapolis, Maryland, USA [doi>10.1145/778415.778446]
[17] Pan Hui, Jon Crowcroft, and Eiko Yoneki, “BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks” IEEE Transactions on Mobile Computing, Vol. 10, No. 11, November 2011
[18] Eyuphan Bulut and Boleslaw K. Szymanski, “Exploiting Friendship Relations for Efficient Routing in Mobile Social Networks” IEEE Transactions On Parallel And Distributed Systems, Vol. 23, No. 12, December 2012
[19] Tamer Abdelkader, Kshirasagar Naik, Amiya Nayak, Nishith Goel, and Vineet Srivastava “SGBR: A Routing Protocol for Delay Tolerant Networks Using Social Grouping” IEEE Transactions On Parallel And Distributed Systems (Accepted for Final Publication)
[20] Shengling Wang And Min Liu, Xiuzhen Cheng, “Routing In Pocket Switched Networks” IEEE Wireless Communications, Feb 2012.
[21] The Opportunistic Network Environment simulator. http://www.netlab.tkk.fi/tutkimus/dtn/theone/
[22] J. Scott, R. Gass, J. Crowcroft, P. Hui, C. Diot, and A. Chaintreau, “Data set cambridge/haggle,” http://crawdad.cs.dartmouth.edu/ cambridge/haggle, may 2009.
[23] A. Pentland, R. Fletcher, and A. Hasson, “Daknet: Rethinking Connectivity In Developing Nations,” Computer, vol. 37, no. 1, pp. 78 – 83, Jan. 2004.
[24] A. Mtibaa, M. May, C. Diot and M. Ammar "Peoplerank: Social opportunistic forwarding", IEEE INFOCOM ’10, 2010
[25] Ajit Patil, Prakash Kulkarni “Buddy Router: Novel DTN Routing Algorithm using Multiparameter Composite Metric” RSC 2016