A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Using redundancy to cope with failures in a delay tolerant network
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Peer-to-Peer File Sharing Based on Network Coding
ICDCS '08 Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems
Using virtualization and live migration in a scalable mobile wireless testbed
ACM SIGMETRICS Performance Evaluation Review
Analyzing network coding gossip made easy
Proceedings of the forty-third annual ACM symposium on Theory of computing
Experiments on the spatial distribution of network code diversity in segmented DTNs
CHANTS '11 Proceedings of the 6th ACM workshop on Challenged networks
IEEE Transactions on Information Theory
Stochastic analysis of network coding in epidemic routing
IEEE Journal on Selected Areas in Communications
Network coded routing in delay tolerant networks: an experience report
Proceedings of the 3rd Extreme Conference on Communication: The Amazon Expedition
Hi-index | 0.00 |
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.