GPSR: greedy perimeter stateless routing for wireless networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Proceedings of the 10th international conference on Architectural support for programming languages and operating systems
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
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
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
Very low-cost internet access using KioskNet
ACM SIGCOMM Computer Communication Review
SCORPION: a heterogeneous wireless networking testbed
ACM SIGMOBILE Mobile Computing and Communications Review
Leader Based Group Routing in Disconnected Mobile Ad Hoc Networks with Group Mobility
Wireless Personal Communications: An International Journal
| Hi-index | 0.00 |
We introduce TAROT (Trajectory-Assisted ROuTing), a DTN routing framework that detects and extracts structure in node movement in real-time. TAROT is motivated by the postulate that mobility, in particular human mobility such as vehicles, is seldom random and thus exhibits recognizable patterns. TAROT's mobility pattern extraction capabilities transcends current solutions that rely on abbreviated (in some cases, instantaneous) snapshots of mobility history. TAROT is therefore able to predict future mobility with increased accuracy. Routing decisions are guided by node mobility patterns, ultimately resulting in more efficient routing and forwarding of messages. Our approach is capable of accommodating conditions where the best node may be one that is currently moving away from the destination. In its current implementation, TAROT uses a "controlled epidemic" approach to route messages in which nodes will only be "infected" with a message if their mobility pattern takes them closer to the destination. We evaluate TAROT's performance through simulations using the QualNet network simulator. A side-by-side comparison against Epidemic Routing under a variety of mobility and workload scenarios show that TAROT is able to match Epidemic's high data delivery guarantees at substantially reduced overhead (over 60% in some of our experiments). TAROT's efficiency comes at the price of a slight increase in delivery delay (around 20% in our experiments). We argue that applications that use intermittently-connected networked environments are inherently tolerant of delay, and therefore favor slight increases in delay for increased efficiency and reduced resource consumption.