Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
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
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)
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
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 probabilistic links formed among mobile nodes indicating their probabilistic encounters. Prior work on DTN routing uses expected delays as a routing metric to decide the next hop relay node for packet delivery to the destination. However, they measure the expected delays by taking the minimum of the expected delays over all possible paths from a candidate relay. This metric, denoted by MinEx, does not account for the opportunity gain enabled by having multiple paths to the destination through encountering multiple future neighbors. Since DTN routing uses as the relay the first encountered node satisfying given routing criteria, the random delays to multiple relay nodes should be aggregated. Thus, the true expected delays can be measured by taking the expectation of the minimum delays, denoted as ExMin, over all possible probabilistic paths from the candidate.