A distance routing effect algorithm for mobility (DREAM)
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Dynamic Programming and Optimal Control
Dynamic Programming and Optimal Control
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
ExOR: opportunistic multi-hop routing for wireless networks
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Practical routing in delay-tolerant networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Network coding for efficient communication in extreme networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Social Network Analysis for Information Flow in Disconnected Delay-Tolerant MANETs
IEEE Transactions on Mobile Computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks
IEEE Transactions on Mobile Computing
Recognizing exponential inter-contact time in VANETs
INFOCOM'10 Proceedings of the 29th conference on Information communications
Max-contribution: on optimal resource allocation in delay tolerant networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
| Hi-index | 0.00 |
Delay Tolerant Networks (DTNs) are characterized by intermittently connected links formed by mobile nodes' probabilistic encounters. Most DTN routing techniques use the first encountered node who has smaller routing metric as a relay node. Prior work on DTN routing can be broadly classified into one which takes the minimum out of expected delays for all possible individual routing paths, referred to as MinEx, as a routing metric to decide the next hop relay node. Fundamentally, MinEx has no difference from the shortest path computation in conventional multi-hop networks, where a link weight is the expected inter-meeting time. However in DTNs, nodes meet intermittently by their mobility, hence the links formed from the meetings are probabilistic. In this environment, MinEx often fails to accurately estimate the actual delay since opportunism in nodes' intermittent meeting is not properly taken into account. In this paper, to exploit the true opportunism, we first propose a metric called ExMin which stochastically calculates the metric by taking the expectation of the minimum delays over all possible routes. We further show that ExMin can be computed online by relying only on local information sharing. Our extensive experiments involving three realistic network scenarios created by two vehicle traces (about 1500 Shanghai taxies and 500 San Francisco taxies) and one human mobility trace (93 KAIST students) show that ExMin outperforms MinEx by up to 30% under either of DTN environments allowing single-copy or multi-copies of a packet.