{'fraction_non_alphanumeric': 0.02342606149341142, 'fraction_numerical': 0.0, 'mean_word_length': 5.572115384615385, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
NTR: An efficient trajectory-based routing protocol for the vehicular delay tolerant networks

Traditional vehicular routing protocols cannot accurately foresee future location of each vehicle for efficient packet forwarding. Recently, the data mining approach has been applied to analyze huge vehicle trajectory data. In this paper, we propose a novel trajectory-based routing (NTR) protocol to improve the packet replication efficiency of vehicles in the Vehicular Delay Tolerant Network (VDTN). By integrating the data mining technique, NTR first establishes the trajectory tree of each vehicular node based on its trajectory data. With this kind of trajectory trees, NTR then predicts future location of each vehicle and derives its contact possibilities with all other vehicles. Hence, NTR creates the vehicle encounter trees and the packet delivery graphs to predict the optimal Store-CarryForward (SCF) route for spraying the optimal number of packet tokens among intermediate nodes from the packet source vehicle to the destination one. Finally, we use the Opportunistic Network Environment (ONE) simulator to perform simulations. From performance results, we conclude that NTR significantly outperforms several well-known VDTN routing protocols, in terms of the average packet delivery ratio, average end-to-end delay and average packet forwarding overhead.