{'fraction_non_alphanumeric': 0.012958963282937365, 'fraction_numerical': 0.0, 'mean_word_length': 5.098684210526316, '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}}
Community-based heuristic routing protocol for disrupted social network

Frequent change in the topology of a disrupted social network is a barrier in using traditional routing protocols. One way to deal with this problem is to collect mobility profiles of nodes and to utilize them for future routing decisions. The solution however lacks scalability since it is difficult for nodes to keep updated information of the whole network. The paper thus devises a scalable scheme that exploits the limited social circles of the mobile device owners; i.e. it breaks network into social communities and employs a fine-grained heuristic routing scheme for intra-community communication. Moreover the paper specifies a simple method for identification of bridging nodes to transfer message to destination lying outside the community. The idea paper is expected to bring a near to optimal routing solution for disrupted social networks.