ABSTRACT
Over the past decade, a lot of research has been done to develop efficient routing protocols for Delay- and Disruption Tolerant Networks (DTNs). In the course of this work, many comparative evaluation studies have been done to determine which of two proposed protocols is the better one (for a given situation). The majority of these evaluations are based on results gained from simulated network environments. In order to conduct a relevant evaluation of routing schemes, numerous conditions, policies and data need to be specified and fed into the simulation environment. The aim of our work in this paper is to discuss current DTN evaluation practices through a thorough and critical literature study. Based on the surveyed material, we show some weaknesses and lack of argumentation used in the evaluations. Through this, we hope to aid in bridging the gap between simulated and real-world DTN environments. In addition, and as a call for further research, we propose a model for evaluation of DTN routing schemes that outlines the most crucial inputs that needs to be considered in the evaluation process. This model is then projected onto evaluation practices used for evaluations of DTN routing protocols in a set of sixteen papers roughly covering a decade of DTN research.
- Kevin Fall. A delay-tolerant network architecture for challenged internets. In Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '03, pages 27--34, New York, NY, USA, 2003. ACM. Google ScholarDigital Library
- Frans Ekman, Ari Keranen, Jouni Karvo, and Jörg Ott. Working day movement model. In Proceedings of the 1st ACM SIGMOBILE workshop on Mobility models, MobilityModels '08, pages 33--40, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- Aruna Balasubramanian, Brian Neil Levine, and Arun Venkataramani. DTN Routing as a Resource Allocation Problem. In Proc. ACM SIGCOMM, August 2007. Google ScholarDigital Library
- Jihwang Yeo, David Kotz, and Tristan Henderson. Crawdad: a community resource for archiving wireless data at dartmouth. SIGCOMM Comput. Commun. Rev., 36:21--22, April 2006. Google ScholarDigital Library
- Amin Vahdat and David Becker. Epidemic routing for partially connected ad hoc networks. Technical Report CS-200006, Duke University, April 2000.Google Scholar
- Anders Lindgren, Avri Doria, and Olov Schelén. Probabilistic routing in intermittently connected networks. In Proceedings of The First International Workshop on Service Assurance with Partial and Intermittent Resources (SAPIR 2004), August 2004.Google ScholarCross Ref
- Sushant Jain, Kevin Fall, and Rabin Patra. Routing in a delay tolerant network. In Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications, SIGCOMM '04, pages 145--158, New York, NY, USA, 2004. ACM. Google ScholarDigital Library
- Jérémie Leguay, Timur Friedman, and Vania Conan. Dtn routing in a mobility pattern space. In Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking, WDTN '05, pages 276--283, New York, NY, USA, 2005. ACM. Google ScholarDigital Library
- Thrasyvoulos Spyropoulos, Konstantinos Psounis, and Cauligi S. Raghavendra. Spray and wait: an efficient routing scheme for intermittently connected mobile networks. In Proc. of ACM SIGCOMM WDTN 2005, 2005. Google ScholarDigital Library
- J. Burgess, B. Gallagher, D. Jensen, and B. N. Levine. MaxProp: Routing for Vehicle-Based Disruption-Tolerant Networks. In Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications, pages 1--11. IEEE, April 2006.Google ScholarCross Ref
- Pan Hui, Jon Crowcroft, and Eiko Yoneki. Bubble rap: social-based forwarding in delay tolerant networks. In Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing, MobiHoc '08, pages 241--250, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- G. Sandulescu and S. Nadjm-Tehrani. Opportunistic dtn routing with window-aware adaptive replication. In Proceedings of the 4th Asian Conference on Internet Engineering, 2008. Google ScholarDigital Library
- Samuel C Nelson, Mehedi Bakht, Robin Kravets, and Albert F. Harris, III. Encounter: based routing in DTNs. SIGMOBILE Mob. Comput. Commun. Rev., 13:56--59, June 2009. Google ScholarDigital Library
- Etienne C. R. de Oliveira and Célio V. N. de Albuquerque. Nectar: a dtn routing protocol based on neighborhood contact history. In Proceedings of the 2009 ACM symposium on Applied Computing, SAC '09, pages 40--46, New York, NY, USA, 2009. ACM. Google ScholarDigital Library
- Y. Li, X. Li, Q. Liu, and Z. Liu. E-PROPHET: a novel routing protocol for intermittently connected wireless networks. In Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly, 2009. Google ScholarDigital Library
- Michael Doering, Tobias Pögel, and Lars Wolf. Dtn routing in urban public transport systems. In Proceedings of the 5th ACM workshop on Challenged networks, CHANTS '10, pages 55--62, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- Jani Lakkakorpi, Mikko Pitkanen, and Jörg Ott. Adaptive routing in mobile opportunistic networks. In Proceedings of the 13th ACM international conference on Modeling, analysis, and simulation of wireless and mobile systems, MSWIM '10, pages 101--109, New York, NY, USA, 2010. ACM. Google ScholarDigital Library
- Xiaozheng Tie, Arun Venkataramani, and Aruna Balasubramanian. R3: robust replication routing in wireless networks with diverse connectivity characteristics. In Proceedings of the 17th annual international conference on Mobile computing and networking, MobiCom '11, pages 181--192, New York, NY, USA, 2011. ACM. Google ScholarDigital Library
- Utku Acer, Shivkumar Kalyanaraman, and Alhussein Abouzeid. Dtn routing using explicit and probabilistic routing table states. Wireless Networks, 17:1305--1321, 2011. 10.1007/s11276-011-0350-y. Google ScholarDigital Library
- Thrasyvoulos Spyropoulos, Rao Naveed Rais, Thierry Turletti, Katia Obraczka, and Athanasios Vasilakos. Routing for disruption tolerant networks: taxonomy and design. Wirel. Netw., 16:2349--2370, November 2010. Google ScholarDigital Library
- Ari Keranen, Jörg Ott, and Teemu Karkkainen. The one simulator for dtn protocol evaluation. In Proceedings of the 2nd International Conference on Simulation Tools and Techniques, Simutools '09, pages 55:1--55:10, ICST, Brussels, Belgium, Belgium, 2009. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering). Google ScholarDigital Library
- Jouni Karvo and Jörg Ott. Time scales and delay-tolerant routing protocols. In Proceedings of the third ACM workshop on Challenged networks, CHANTS '08, pages 33--40, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- Samo Grasic, Elwyn Davies, Anders Lindgren, and Avri Doria. The evolution of a DTN routing protocol - PRoPHETv2. In Proceedings of the 6th ACM workshop on Challenged networks, CHANTS '11, pages 27--30, New York, NY, USA, 2011. ACM. Google ScholarDigital Library
- N4C. Online, http://www.n4c.eu/, Access February 14 2012.Google Scholar
- Anders Lindgren, Avri Doria, Jan Lindblom, and Mattias Ek. Networking in the land of northern lights: two years of experiences from dtn system deployments. In Proceedings of the 2008 ACM workshop on Wireless networks and systems for developing regions, WiNS-DR '08, pages 1--8, New York, NY, USA, 2008. ACM. Google ScholarDigital Library
- Anders Lindgren, Christophe Diot, and James W. Scott. Impact of communication infrastructure on forwarding in pocket switched networks. In Proceedings of the ACM SIGCOMM workshop on Challenged Networks (CHANTS 2006), September 2006. Google ScholarDigital Library
- W. Ivancic, W. M. Eddy, D. Stewart, L. Wood, J. Northam, and C. Jackson. Experience with delay-tolerant networking from orbit. International Journal of Satellite Communications and Networking, 28(5--6):335--351, 2010.Google ScholarCross Ref
- Bong Jun Choi and Xuemin Shen. Distributed clock synchronization in delay tolerant networks. In ICC, pages 1--6, 2010.Google ScholarCross Ref
Index Terms
- An analysis of evaluation practices for DTN routing protocols
Recommendations
DTN routing as a resource allocation problem
SIGCOMM '07: Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communicationsMany DTN routing protocols use a variety of mechanisms, including discovering the meeting probabilities among nodes, packet replication, and network coding. The primary focus of these mechanisms is to increase the likelihood of finding a path with ...
The evolution of a DTN routing protocol - PRoPHETv2
CHANTS '11: Proceedings of the 6th ACM workshop on Challenged networksResearch within Delay- and Disruption Tolerant Networks (DTN) has evolved into a mature research area. PRoPHET is a routing protocol for DTNs that was developed when DTN research was in its infancy and which has been studied by many. In this paper we ...
DTN-FLOW: Inter-Landmark Data Flow for High-Throughput Routing in DTNs
IPDPS '13: Proceedings of the 2013 IEEE 27th International Symposium on Parallel and Distributed ProcessingIn this paper, we focus on the efficient routing of data among different areas in Delay Tolerant Networks (DTNs). In current algorithms, packets are forwarded gradually through nodes with higher probability of visiting the destination node or area. ...
Comments