Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Unifying Micro Sensor Networks with the Internet via Overlay Networking
LCN '04 Proceedings of the 29th Annual IEEE International Conference on Local Computer Networks
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
Efficient routing in intermittently connected mobile networks: the single-copy case
IEEE/ACM Transactions on Networking (TON)
Routing for disruption tolerant networks: taxonomy and design
Wireless Networks
Building a reference combinatorial model for MANETs
IEEE Network: The Magazine of Global Internetworking
Performance analysis of epidemic routing in DTNs with limited forwarding times and selfish nodes
International Journal of Ad Hoc and Ubiquitous Computing
| Hi-index | 0.00 |
Current routing approaches in Delay-Tolerant Networks (DTNs) focus on the exchange of information across homogenous addressing domains without addressing DTNs constructed from a set of cooperating networks using different protocols and mobility models. We present inference-based Contact Graph Routing (iCGR), a logical-level routing method for DTN internetworks that comprise heterogeneous data link and/or network layers. iCGR constructs a time-variant 'Contact Graph' at each node in the network to describe logical contact opportunities regardless of underlying physical media access. The iCGR approach extends the established approach of graph based routing beyond static networks and provides a mechanism for multiple data link protocols to co-exist in an internetwork. This overlay-routing approach allows otherwise routing-protocol-incompatible networks to join an internetwork with little overhead. iCGR is validated through NS3 simulation of a DTN internetwork comprising manually asserted contact opportunities, a non-DTN routing protocol, and probabilistic DTN routing protocol.