{'fraction_non_alphanumeric': 0.017112299465240642, 'fraction_numerical': 0.0053475935828877, 'mean_word_length': 5.038709677419355, '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}}
Weighted Epidemic Routing for disruption tolerant networks

Epidemic Routing is an original and effective multicopy routing algorithm in disruption tolerant networks. However, its performance degrades significantly when network resources are limited. In this paper, we proposed a new routing scheme, called Weighted Epidemic Routing (WER). WER appropriately arranges the priority of messages for forwarding or deleting through assigning a weight for each of them when the buffer size of nodes and contact duration are limited. The weight of a message is determined by TTL and replications density that is a novel metric to estimate the amount of copies around an infected node. Meanwhile, an ACK vector exchange mechanism is employed by WER to purge the redundant messages. Simulation results show that WER outperforms Epidemic with Drop-tail and FIFO drop policy by a factor of about 6.8 and 0.66 respectively when buffer size is low.