Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
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
Adaptive Routing for Intermittently Connected Mobile Ad Hoc Networks
WOWMOM '05 Proceedings of the Sixth IEEE International Symposium on World of Wireless Mobile and Multimedia Networks
Erasure-coding based routing for opportunistic 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
DTN routing in a mobility pattern space
Proceedings of the 2005 ACM SIGCOMM workshop on Delay-tolerant 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
Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN)
Proceedings of the 2006 international conference on Wireless communications and mobile computing
An Agenda Based Mobility Model21
ANSS '06 Proceedings of the 39th annual Symposium on Simulation
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
Analysis of simple counting protocols for delay-tolerant networks
Proceedings of the second ACM workshop on Challenged networks
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
Reasonable routing in delay/disruption tolerant networks
Frontiers of Computer Science in China
| Hi-index | 0.00 |
It is challenging to deliver messages in a network where no instant end-to-end path exists, so called delay-tolerant network (DTN). Node encounters are used for message forwarding. In this paper, we propose a DTN routing protocol SMART. SMART utilizes the travel companions of the destinations (i.e. nodes that frequently meet the destination) to increase the delivery opportunities while limiting message overhead to a bounded number. Our approach differs from related work in that it does not propagate node encounter history nor the delivery probabilities derived from the encounter history. In SMART, a message source injects a fixed number of message copies into the network to forward the message to a companion of the destination, which only forwards the message to a fixed number of the destination's companions. Our analysis and simulation results show that SMART has a higher delivery ratio and a smaller delivery latency than the schemes that only use controlled opportunistically-forwarding mechanism and has a significantly smaller routing overhead than a pure flooding scheme.