Angela Hennessy
Abstract
In a challenged network environment, where end-to-end connectivity may be a rare occurrence, delay-tolerant routing protocols must strike a balance between the increased robustness and reliability that comes with message replication and the resulting high bandwidth and storage overhead. Network coded routing, in which a node combines messages from different sources, has been shown to increase reliability in the presence of link failures with small additional overhead. A drawback of network coded routing is the lack of a natural stopping condition to control the dissemination of data. We describe an enhanced coding router that uses the mathematical structure of the orthogonal complement, or nullspace, as an improved stopping condition to eliminate redundant transmissions, and an additional technique to balance multiple coded data flows. These changes are incorporated into the DTN2 Reference Implementation and evaluated in two types of experiments. In a simple data-mule scenario, our EBR router comes very close to perfect efficiency. In a more complicated scenario with segmented communities and occasional nodes moving between them, our solutions show a drastic improvement in delivery rates.
- R. Ahlswede, N. Cai, S. Li, and R. Yeung. Network information flow. IEEE Transactions on Information Theory, 46(4):1204--1216, 2000. Google Scholar
Digital Library
- 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
- S. Deb and M. Médard. Algebraic gossip: a network coding approach to optimal multiple rumor mongering. In Proc. 42nd Allerton Conference on Communication, Control, and Computing, 2004.Google Scholar
- DTNRG. DTN bundle protocol ref. implm. http://www.dtnrg.org/wiki/Code.Google Scholar
- http://www.emulab.net.Google Scholar
- K. R. Fall. A delay-tolerant network architecture for challenged internets. In Proc. of SIGCOMM' 03, 2003. Google ScholarDigital Library
- C. Gkantsidis and P. Rodriguez. Network coding for large scale content distribution. In Proc. of INFOCOM'05, 2005.Google ScholarCross Ref
- B. Haeupler. Analyzing network coding gossip made easy. In Proc. of the 43rd Symp. on Theory of Computing (STOC), 2011. 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
- J. Zinky and A. Caro and G. Stein. Bundle protocol erasure coding extension. Internet Draft.Google Scholar
- S. Jain, M. Demmer, R. Patra, and K. Fall. Using redundancy to cope with failures in a delay tolerant network. In Proc. ACM Sigcomm, 2005. Google ScholarDigital Library
- P. Leach, M. Mealling, and R. Salz. A Universally Unique IDentifier (UUID) URN Namespace. RFC 4122, 2005.Google Scholar
- Y. Lin, B. Li, and B. Liang. Stochastic analysis of network coding in epidemic routing. In IEEE JSAC, 26(5): 794--808, 2008. Google ScholarDigital Library
- A. Petz, C.-L. Fok, C. Julien, B. Walker, and C. Ardi. Network coded routing in delay tolerant networks: An experience report. In Proc. of ExtremeCom, 2011. Google ScholarDigital Library
- A. Petz, A. Hennessy, B. Walker, C.-L. Fok, and C. Julien. An architecture for context-aware adaptation of routing in delay-tolerant networks. In Proc. of ExtremeCom, 2011.Google ScholarDigital Library
- S. Schildt, J. Morgenroth, W.-B. Pöttner, and L. Wolf. Ibr-dtn: A lightweight, modular and highly portable bundle protocol implementation. Electronic Communications of the EASST, 37:1--11, Jan 2011.Google Scholar
- K. Scott and S. Burleigh. Bundle Protocol Specification. RFC 5050 (Experimental), Nov. 2007.Google Scholar
- A. Vahdat and D. Becker. Epidemic routing for partially connected ad hoc networks, 2000.Google Scholar
- B. Walker, C. Ardi, A. Petz, J. Ryu, and C. Julien. Experiments on the spatial distribution of network code diversity in segmented dtns. In Proc. of CHANTS'11, 2011. 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
- M. Yang and Y. Yang. Peer-to-peer file sharing based on network coding. In Proc. of IEEE ICDCS, 2008. Google ScholarDigital Library
Recommendations
Nullspace-based stopping conditions for network-coded transmissions in DTNs
CHANTS '12: Proceedings of the seventh ACM international workshop on Challenged networksIn a challenged network environment, where end-to-end connectivity may be a rare occurrence, delay-tolerant routing protocols must strike a balance between the increased robustness and reliability that comes with message replication and the resulting ...
Contact-based routing in DTNs
IMCOM '15: Proceedings of the 9th International Conference on Ubiquitous Information Management and CommunicationMulti-copy replication is an efficient approach for routing a message between a pair of source and destination nodes in a Delay Tolerant Network (DTN). However, such an approach disseminates an undesirable number of replicas of messages, which increases ...
Regional Token Based Routing for DTNs
ICOIN'09: Proceedings of the 23rd international conference on Information NetworkingIn Delay and Disruption Tolerant Networks (DTNs), there are no stable end-to-end paths because the connectivity of nodes is frequently disrupted by their mobility, power saving or other reasons. Nevertheless nodes can communicate each other by a store-...
Comments