| This paper considers routing in Delay Tolerant Networks (DTNs) whereby nodes have predictable mobility patterns within a time period. For example, busses and trains have well-known trajectory and can be determined in advanced. Taxis have a fixed mobility pattern that corresponds to passengers’ final destination. To date, routing protocols that take advantage of scheduled contacts assume the space-time graph that represents nodes' contacts is preloaded at every node in advance. In addition, the space-time graph is fixed all the times. To this end, this paper proposes a Mobility-Based Routing Protocol (MBRP) that does not make the said assumptions. MBRP constructs a space-time graph at every node by recording the mobility pattern of nodes upon contacts. Hence, nodes do not have full knowledge of the network topology. In addition, the space-time graph is dynamic, meaning the trajectory of nodes may only be valid for a given period of time. As the space-time graph may be incomplete, MBRP presents a heuristic that evaluates encountered nodes based on their recorded mobility patterns in order to disseminate a finite number of replicas. MBRP has been evaluated over a realistic environment comprising of vehicles with both periodic and dynamic mobility patterns. The simulation results, over a service quality metric comprising of delivery, delay and overhead, show that MBRP achieves up to 105% improvement as compared to four well-known routing protocols namely, EBR, EPIDEMIC, MAXPROP, and PROPHET. Finally, MBRP is capable of achieving 50% of the performance attained by the optimal algorithm, whereby all nodes are preloaded with a space-time graph. |