{'fraction_non_alphanumeric': 0.01689933872152829, 'fraction_numerical': 0.0, 'mean_word_length': 6.05699481865285, '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': 1, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Face-to-face with facebook friends: Using online friendlists for routing in opportunistic networks

Opportunistic networks are a generalization of Delay Tolerant Networks (DTNs) where communication is challenged by frequent disconnections and encounter patterns between mobile devices are unpredictable. Opportunistic routing protocols attempt to enable the forwarding of messages via encounters between devices, while dealing with the problems of large delays and lack of end-to-end connectivity. To save energy in mobile environments, such routing protocols must minimize unnecessary message replication. This paper presents FSF (Friendlist-based Social Forwarding), an opportunistic routing scheme that exploits both social network information detected through encounters between mobile devices and pre-existing online social network information. To select an effective forwarding node, FSF measures the forwarding capability of a node when compared to an encountered node in terms of node degree cen-trality measured on the temporal encounter network and online tie strength. Simulations with experimental datasets containing encounter records with corresponding Facebook friendlists of the participants show that the proposed routing scheme allows mobile users to achieve good delivery ratio, while forwarding fewer messages than other existing algorithms.