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)
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
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
Performance modeling of epidemic routing
NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems
Fast track article: Impact of source counter on routing performance in resource constrained DTNs
Pervasive and Mobile Computing
| Hi-index | 0.00 |
We study routing schemes for resource constrained Disruption Tolerant Networks (DTNs) where transmission bandwidth is scarce resource. 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 buffer management scheme adopted by each node. Existing works typically focus on transmission buffer management, but due to theoretical and practical difficulties, only heuristics have been proposed. In this work, we explore alternative ways to improve DTN routing performance via source control. We focus on spray-and-wait counter-based routing scheme. We first show that there exists an optimal counter value to achieve minimum average network-wide packet delivery delay. Then as a first step towards understanding multi-hop multicopy DTN routing schemes, we model a two-hop multi-copy DTN routing via a continuous time Markov Chain. Our modeling analysis provides insights into the impact of counter on routing performance and further suggests the existence of optimal counter value. In this process, we derive the capacity region of DTN routing (i.e., the maximum sustainable per-node throughput), and provide an accurate analysis of the average packet delivery delay of the two-hop single copy relaying scheme. Relying on the insights gained via simulations and modeling, we propose an adaptive scheme that allow nodes to 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.