Efficient dynamic network flow algorithms
Efficient dynamic network flow algorithms
Faster approximation schemes for fractional multicommodity flow problems
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Multicommodity Flows: A Survey of Recent Research
ISAAC '93 Proceedings of the 4th International Symposium on Algorithms and Computation
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Pocket switched networks and human mobility in conference environments
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Scalable routing in delay tolerant networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Quantifying content consistency improvements through opportunistic contacts
Proceedings of the 4th ACM workshop on Challenged networks
Resource-aware capacity evaluation for heterogeneous, disruption-tolerant networks
Proceedings of the 9th Asian Internet Engineering Conference
Benefits of network coding for unicast application in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Delay Tolerant Networks (DTNs), in which contacts between nodes come and go over time, is a promising approach to model communications in mobile ad-hoc networks, where scenarios of network partitioning and node disconnections are likely to happen. One of the most important challenges in such networks is how to route information and schedule transmissions, coping with the continuously changing network topology. In this paper, we focus on a deterministic and centralized DTN in which the contact times between nodes are known in advance or can be predicted; this model is applicable for various real-life scenarios. We provide a general framework for devising optimal routing algorithms to such networks under different objective functions and various real-life constraints (such as the available buffer and energy). The key insight is to model the DTN as an equivalent time-independent graph; this allows the usage of well-known algorithms and techniques to achieve optimal results. These algorithms can be also used as approximation for less certain settings or as benchmarks to evaluate other routing algorithms. In addition, we extended our framework to deal with long-lived DTNs in which contacts are periodic. Our algorithms are demonstrated by simulations, based directly on real-life traces, showing capacity-delay tradeoffs and the influence of the constraints and periodicity on the achievable throughput of the network.