Introduction to algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Resource and performance tradeoffs in delay-tolerant wireless networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
The message delay in mobile ad hoc networks
Performance Evaluation - Performance 2005
A new networking model for biological applications of ad hoc sensor networks
IEEE/ACM Transactions on Networking (TON)
Optimal delay-power tradeoff in sparse delay tolerant networks: a preliminary study
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Performance modeling of epidemic routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Crossing over the bounded domain: from exponential to power-law inter-meeting time in MANET
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Power law and exponential decay of inter contact times between mobile devices
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Efficient routing in intermittently connected mobile networks: the multiple-copy case
IEEE/ACM Transactions on Networking (TON)
Cabernet: vehicular content delivery using WiFi
Proceedings of the 14th ACM international conference on Mobile computing and networking
IEEE Transactions on Mobile Computing
Contention-Aware Performance Analysis of Mobility-Assisted Routing
IEEE Transactions on Mobile Computing
Scaling properties of delay tolerant networks with correlated motion patterns
Proceedings of the 4th ACM workshop on Challenged networks
Impact of source counter on DTN routing control under resource constraints
MobiOpp '10 Proceedings of the Second International Workshop on Mobile Opportunistic Networking
Mobicent: a credit-based incentive system for disruption tolerant network
INFOCOM'10 Proceedings of the 29th conference on Information communications
Benefits of network coding for unicast application in disruption-tolerant networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
We study routing schemes for Disruption Tolerant Networks (DTNs) where transmission bandwidth is scarce. In such a setting, a key issue is how to schedule the transmission of packets under limited bandwidth to optimize performance. Such a scheduling consists of source control (i.e., source nodes choosing a routing scheme) and the local transmission scheduling performed by each node. Existing works typically focus on transmission scheduling and buffer management aspects, but due to theoretical and practical difficulties, only heuristics have been proposed. In this work, we explore an alternative way to improve DTN routing performance via source control. We first show through simulation that for spray-and-wait routing scheme where the source node specifies the maximum allowed number of copies of a packet in the network, there exists an optimal counter value that achieves the minimum network-wide average packet delivery delay. Then as a first step towards understanding multi-hop multi-copy DTN routing schemes such as spray-and-wait scheme, we perform modeling study of two-hop single-copy scheme and two-hop multi-copy scheme under various transmission scheduling schemes, via queuing network analysis and continuous time Markov chain model analysis. Our modeling analysis provides insights into the impact of source counter on routing performance and further suggests the existence of an optimal counter value. Relying on the insights gained via simulations and modeling studies, we propose an adaptive scheme where nodes adjust their counter values to achieve minimum packet delivery delay, in a distributed and asynchronous fashion. Simulations demonstrate the effectiveness of our scheme and suggest the potential of exploring this rich area for improving DTN routing performance.