{'fraction_non_alphanumeric': 0.013186813186813187, 'fraction_numerical': 0.0, 'mean_word_length': 5.698529411764706, '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}}
Impact of dishonesty and collusion on free riding in distributed multimedia systems

Distributed multimedia systems have attracted the attention of various research groups in recent years. Free riding in such collaborative multimedia environments create a tedious and bothersome task as well as a potential performance bottleneck. As a result, free riding filtering algorithms have been proposed by researchers to reduce the effect of such algorithms on distributed multimedia systems. Unfortunately, researchers did not consider trustworthiness, honesty, nor colluding of these free riders. In this paper, we selected a free riders' filtering algorithm and we evaluated it against honesty and collusion. Our extensive simulation experiments show that dishonest nodes and colluding nodes have a significant impact on the ability of the algorithm to successfully identify free riders in multimediabased systems.