Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Mobility increases the capacity of ad hoc wireless networks
IEEE/ACM Transactions on Networking (TON)
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Wearable Computers as Packet Transport Mechanisms in Highly-Partitioned Ad-Hoc Networks
ISWC '01 Proceedings of the 5th IEEE International Symposium on Wearable Computers
Routing in a delay tolerant network
Proceedings of the 2004 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
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
PERCOMW '07 Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops
DTN routing as a resource allocation problem
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
E-PROPHET: a novel routing protocol for intermittently connected wireless networks
Proceedings of the 2009 International Conference on Wireless Communications and Mobile Computing: Connecting the World Wirelessly
Contact duration aware data replication in Delay Tolerant Networks
ICNP '11 Proceedings of the 2011 19th IEEE International Conference on Network Protocols
Hi-index | 0.00 |
Delay Tolerant Networks (DTNs) provide message delivery services to users via intermittently connected nodes. In DTNs, routing is one of the most challenging issues since end-to-end connectivity between nodes may not be available most of the time. Although many routing protocols for DTNs have been proposed, they do not achieve satisfactory performance, since they exploit only some of the network characteristics. In this paper, we present a new DTN routing protocol, called the Link Contact Duration-based Routing Protocol (LCD). Like existing protocols, LCD uses the disconnect duration of a link between two nodes to find the routing path with the shortest end-to-end delay. In addition, LCD uses the contact duration of a link and the number of buffered messages to deliver as many messages as possible in a short time. Our simulation results show that LCD has better performance than existing DTN routing protocols.