{'fraction_non_alphanumeric': 0.016098484848484848, 'fraction_numerical': 0.001893939393939394, 'mean_word_length': 5.254437869822485, '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}}
Probabilistic Replica Allocation in Multihop Networks

In this paper, we propose a probabilistic replica allocation scheme for reducing the total number of messages in multi hop networks. When data is distributed uniformly into the network such that every node has its own data, there are per-node and a network-wide problems caused by increasing the network traffic. To overcome the problems, although the traditional method accepts all incoming and relaying data for replication, the proposed method randomly accepts the data for replication so as to minimize the probabilistic distances between the data holders and the data requesters, and is supposed to reduce approximately 10% of the total number of messages in the network. We believe that our method requires less computing and communication resources, because our method is a sort of randomized algorithm, easy to implement, and has no communication overhead. The simulation results on wireless ad hoc networks using the JiST/SWANS network simulator show the effectiveness of the proposed method.