Clustering Algorithms
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
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
A message ferrying approach for data delivery in sparse mobile ad hoc networks
Proceedings of the 5th ACM international symposium on Mobile ad hoc networking and computing
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
PeopleNet: engineering a wireless virtual social network
Proceedings of the 11th annual international conference on Mobile computing and networking
Message ferry route design for sparse ad hoc networks with mobile nodes
Proceedings of the 7th ACM international symposium on Mobile ad hoc networking and computing
Analysis and implications of student contact patterns derived from campus schedules
Proceedings of the 12th annual international conference on Mobile computing and networking
Logarithmic Store-Carry-Forward Routing in Mobile Ad Hoc Networks
IEEE Transactions on Parallel and Distributed Systems
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
Data forwarding in extremely low duty-cycle sensor networks with unreliable communication links
Proceedings of the 5th international conference on Embedded networked sensor systems
DTLSR: delay tolerant routing for developing regions
Proceedings of the 2007 workshop on Networked systems for developing regions
Bubble rap: social-based forwarding in delay tolerant networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Faster heuristic search algorithms for planning with uncertainty and full feedback
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Design and field experimentation of an energy-efficient architecture for DTN throwboxes
IEEE/ACM Transactions on Networking (TON)
Replication routing in DTNs: a resource allocation approach
IEEE/ACM Transactions on Networking (TON)
| 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 future connectivity information is not available, 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, whereas no prior research work has investigated the time-varying delivery probabilities of messages between nodes at different times during a repetition of motion of the nodes. We propose to use the expected minimum delay (EMD) as a new delivery probability metric in DTNs with repetitive but nondeterministic mobility. First, 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. With the state-space graph, we apply the Markov decision process to derive the EMDs of the messages. We propose an EMD-based probabilistic routing protocol, called routing in cyclic MobiSpace (RCM). To make RCM more practical, we show a simple extension that reduces routing information exchanged among nodes. We perform simulations with real and synthetic traces. Simulation results show that RCM outperforms several existing opportunistic routing protocols.