Introduction to Algorithms
Age matters: efficient route discovery in mobile ad hoc networks using encounter ages
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
Dynamic Programming
Routing in a delay tolerant network
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Spray and wait: an efficient routing scheme for intermittently connected mobile networks
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant networking
Analysis and implications of student contact patterns derived from campus schedules
Proceedings of the 12th annual international conference on Mobile computing and 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
Evaluating opportunistic routing protocols with large realistic contact traces
Proceedings of the second ACM workshop on Challenged networks
Study of a bus-based disruption-tolerant network: mobility modeling and impact on routing
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Weak state routing for large scale dynamic networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Social network analysis for routing in disconnected delay-tolerant MANETs
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Scalable routing in delay tolerant networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Topological value iteration algorithm for Markov decision processes
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Faster heuristic search algorithms for planning with uncertainty and full feedback
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Predict and relay: an efficient routing in disruption-tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
An optimal probabilistic forwarding protocolin delay tolerant networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Optimal routing and scheduling for deterministic delay tolerant networks
WONS'09 Proceedings of the Sixth international conference on Wireless On-Demand Network Systems and Services
Leapfrog: optimal opportunistic routing in probabilistically contacted delay tolerant networks
Journal of Computer Science and Technology - Special section on trust and reputation management in future computing systmes and applications
Improving routing protocol performance in delay tolerant networks using extended information
Journal of Systems and Software
Efficient adaptive routing in delay tolerant networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
cTrust: trust aggregation in cyclic mobile ad hoc networks
Euro-Par'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part II
Price: Hybrid geographic and co-based forwarding in delay-tolerant networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Golay code clustering for mobility behavior similarity classification in pocket switched networks
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Practical routing in a cyclic MobiSpace
IEEE/ACM Transactions on Networking (TON)
Privacy-enhanced social-network routing
Computer Communications
A dynamic multicast tree based routing scheme without replication in delay tolerant networks
Journal of Parallel and Distributed Computing
A P2P query algorithm for opportunistic networks utilizing betweenness centrality forwarding
Mobile Information Systems
| Hi-index | 0.00 |
A key challenge of routing in delay tolerant networks (DTNs) is finding routes that have high delivery rates and low end-to-end delays. When oracles are not available for future connectivity, opportunistic routing is preferred in DTNs, in which messages are forwarded to nodes with higher delivery probabilities. We observe that real objects have repetitive motions, but no prior research work has investigated the cyclic delivery probability of messages between nodes. In this paper, we propose to use the expected minimum delay (EMD) as a new delivery probability metric in DTNs with repetitive but non-deterministic mobility. Specifically, we model the network as a probabilistic time-space graph with historical contact information or prior knowledge about the network. We then translate it into a probabilistic state-space graph in which the time dimension is removed. Finally, we apply the Markov decision process to derive the EMDs of the messages at particular times. Our proposed EMD-based routing protocol, called routing in cyclic MobiSpace (RCM), outperforms several existing opportunistic routing protocols when simulated using both real and synthetic traces.