Spine routing in ad hoc networks
Cluster Computing
A delay-tolerant network architecture for challenged internets
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
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
Erasure-coding based routing for opportunistic networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
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
A hybrid routing approach for opportunistic networks
Proceedings of the 2006 SIGCOMM workshop on Challenged networks
Prioritized epidemic routing for opportunistic networks
Proceedings of the 1st international MobiSys workshop on Mobile opportunistic networking
Evaluating opportunistic routing protocols with large realistic contact traces
Proceedings of the second ACM workshop on Challenged networks
The ONE simulator for DTN protocol evaluation
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Delay-tolerant networking: an approach to interplanetary Internet
IEEE Communications Magazine
Information dissemination dynamics in delay tolerant network: a bipartite network approach
Proceedings of the third ACM international workshop on Mobile Opportunistic Networks
Threshold based locking routing strategy for delay tolerant network
Wireless Networks
Discovering periodic patterns of nodal encounters in mobile networks
Pervasive and Mobile Computing
| Hi-index | 0.00 |
Delay tolerant networks (DTNs) are characterized by intermittent node connectivity and unavailability of end-to-end paths for most of the time. Routing in such networks is a challenge because of these characteristics. Some existing routing protocols try to improve the delivery ratio by replicating some messages and hence perform poorly if the nodes have limited buffer space, or alternatively, if the number of messages is high. Some existing protocols also use the underlying movement pattern to improve routing efficiency. In many real life scenarios, movement patterns show repetitive contacts between nodes occurring in some time sequence. In this paper, we propose a probabilistic routing protocol that uses both the repetitive contacts and their time sequencing to improve routing. The protocol does not replicate any message and hence can work with low buffer size in mobile nodes. The novel feature of this protocol is the use of sequences of contacts which has not been used in earlier protocols. Simulation results show that the proposed protocol achieves high message delivery ratio with no message replication compared to some of the existing protocols.