Agoston Petz
ABSTRACT
In delay-tolerant networks, end-to-end routes are rarely available, and routing protocols must take advantage of the opportunistic interactions among nodes to deliver packets. Probabilistic routing performs well in such networks and has been the dominant focus of research in this area. However, creating efficient routing protocols is challenging because to reduce latency, one often needs to replicate messages thus increasing routing overhead. Network coding has been explored as a way to increase throughput in DTNs without a significant increase in overhead, and network coded routing approaches have shown promising results. In this paper, we report on our experience integrating both erasure coded and network coded routing into the well-adopted DTN2 Reference Implementation. We implement our routing module and evaluate it via small real-world field tests.
- A. Caro and J. Zinky. DTN erasure coding protocol (preliminary notes). To appear as Internet Draft.Google Scholar
- E. Altman, F. De Pellegrini, and L. Sassatelli. Dynamic control of coding in delay tolerant networks. In Proc. of INFOCOM, 2010. Google ScholarDigital Library
- A. Balasubramanian, B. Levine, and A. Venkataramani. DTN routing as a resource allocation problem. In Proc. of SIGCOMM, 2007. Google ScholarDigital Library
- C. Boldrini, M. Conti, I. Iacopini, and A. Passarella. HiBOp: A history based routing protocol for opportunisitic networks. In Proc. of WoWMoM, 2007.Google ScholarCross Ref
- M. Chuah, P. Yang, and Y. Xi. How mobility models affect the design of network coding schemes for disruption tolerant networks. In Proc. of NetCod, 2009.Google ScholarDigital Library
- DTN external router interface. http://www.dtnrg.org/docs/code/DTN2/doc/external-router-interface.html.Google Scholar
- DTNRG. DTN bundle protocol reference implementation. http://www.dtnrg.org/wiki/Code.Google Scholar
- K. R. Fall. A delay-tolerant network architecture for challenged internets. In Proc. of SIGCOMM, 2003. Google ScholarDigital Library
- D. Hahn, G. Lee, B. Walker, M. Beecher, and P. Mundur. Using virtualization and live migration in a scalable mobile wireless testbed. SIGMETRICS Perform. Eval. Rev., 38:21--25, January 2011. Google ScholarDigital Library
- K. Harras, K. Almeroth, and E. Belding-Royer. Delay tolerant mobile networks (DTMNs): Controlled flooding in sparse mobile networks. In Proc. of Networking, pages 1180--1192, May 2005. Google ScholarDigital Library
- HBSD: An external router for DTN2. http://planete.inria.fr/HBSD_DTN2.Google Scholar
- S. Jain, K. Fall, and R. Patra. Routing in a delay tolerant network. ACM SIGCOMM Computer Comm. Rev., 34(4):145--158, October 2004. Google ScholarDigital Library
- S. Katti, H. Rahul, W. Hu, D. Katabi, M. Medard, and J. Crowcroft. XORs in the air: Practical wireless network coding. In Proc. of SIGCOMM, 2006. Google ScholarDigital Library
- Y. Kim, K. Taylor, C. Dunbar, B. Walker, and P. Mundur. Reality vs emulation: Running real mobility traces on a mobile wireless testbed. In HotPlanet 2011 (to appear), 2011. Google ScholarDigital Library
- Y. Lin, B. Li, and B. Liang. Efficient network coded data transmissions in disruption tolerant networks. In Proc. of INFOCOM, pages 1508--1516, 2008.Google ScholarCross Ref
- A. Lindgren, A. Doria, and O. Schelen. Probabilistic routing in intermittently connected networks. In Proc. of SAPIR, pages 239--254, 2004.Google ScholarCross Ref
- M4RI(e). http://m4ri.sagemath.org/.Google Scholar
- T. Matsuda and T. Takine. (p,q)-Epidemic routing for sparsely populated mobile ad hoc networks. IEEE J. on Sel. Areas in Comm., 26(5):783--793, June 2008. Google ScholarDigital Library
- A. Pentland, R. Fletcher, and A. Hasson. DakNet: Rethinking connectivity in developing nations. IEEE Comp., 37(1):78--83, January 2004. Google ScholarDigital Library
- http://mpc.ece.utexas.edu/pharos.Google Scholar
- http://proteus.ece.utexas.edu.Google Scholar
- K. Scott and S. Burleigh. Bundle Protocol Specification. RFC 5050 (Experimental), Nov. 2007.Google Scholar
- S. Sengupta, S. Rayanchu, and S. Banerjee. An analysis of wireless network coding for unicast sessions: The case for coding-aware routing. In Proc. of INFOCOM, pages 1028--1036, 2007.Google ScholarDigital Library
- S. Symington. Delay-Tolerant Networking Metadata Extension Block. RFC 6258 (Experimental), 2011.Google Scholar
- B. N. Vellambi, R. Subramanian, F. Fekri, and M. Ammar. Reliable and efficient message delivery in delay tolerant networks using rateless codes. In Proc. of MobiOpp, 2007. Google ScholarDigital Library
- Y. Wang, S. Jain, M. Martonosi, and K. Fall. Erasure-coding based routing for opportunistic networks. In Proc. of WDTN, pages 229--236, 2005. Google ScholarDigital Library
- J. Widmer and J.-Y. L. Boudec. Network coding for efficient communication in extreme networks. In Proc. of WDTN, 2005. Google ScholarDigital Library
- X. Zhang, G. Neglia, J. Kurose, and D. Towsley. On the benefits of random linear coding for unicast applications in distruption tolerant networks. In Proc. of WiOpt, pages 1--7, 2006.Google Scholar
Index Terms
- Network coded routing in delay tolerant networks: an experience report
Recommendations
Look-Ahead Routing and Message Scheduling in Delay-Tolerant Networks
Routing is one of the most challenging development issues in Delay-Tolerant Networks (DTNs) because of lack of continuous connection. Existing routing schemes for DTNs provide best effort service, but are unable to optimize QoS and support message ...
Ferry Route Design with Delay Bounds in Delay-Tolerant Networks
CIT '10: Proceedings of the 2010 10th IEEE International Conference on Computer and Information TechnologyDelay-Tolerant/Disruption-Tolerant Networks (DTNs) have been proposed to cope with the challenges of communication in some extreme or special environments. Due to the uncertainty of node mobility, application traffic demand and other factors, it is ...
Evaluating MobySpace-based routing strategies in delay-tolerant networks: Research Articles
Wireless Ad Hoc and Sensor NetworksBecause a delay-tolerant network (DTN) can often be partitioned, routing is a challenge. However, routing benefits considerably if one can take advantage of knowledge concerning node mobility. This paper addresses this problem with a generic algorithm ...
Comments