{'fraction_non_alphanumeric': 0.013876040703052728, 'fraction_numerical': 0.0, 'mean_word_length': 5.290697674418604, '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}}
The Minimal Delay Path and Its Evolving Properties in Intermittently Connected Mobile Networks

We study the Minimal Delay Path (MDP) of message delivery and its evolving properties in social opportunistic networks where the connectivity is intermittent and evolving over time. Through in-depth analysis of the public released trace dataset from CRAWDAD community, our results show that the network connectivity is highly depended on some rare nodal contacts that occurred only few times rather than those frequently occurred nodal contacts in whole trace dataset. By constructing the Time Evolving Graph (TEG) and computing its MDPs using our modified version of the Shortest Path algorithm we illustrate how those rare contacts impact on the delay of message delivery in opportunistic network. Our results is in sharp contrast to previous work that choose the most frequent contact node as next hop forwarder (e.g. PROPHET), and we imply that the algorithms identifying those occur less frequently but important nodes as next hop will achieve better message delivery performance.