{'fraction_non_alphanumeric': 0.025278810408921933, 'fraction_numerical': 0.0022304832713754648, 'mean_word_length': 5.763819095477387, '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}}
M-Trust: A Trust Management Scheme for Mobile P2P Networks

The rapid growth of emerging techniques for mobile resource sharing, content sharing, mobile social networks, and complex cyber-physical systems poses significant challenges for trust and security management. Several trust management schemes have been proposed recently to counter the security threat on Peer-to-Peer (P2P) systems. However, due to the difficulties caused by system mobility, wireless communications, pervasive devices and dynamic network topology, there is an increasing requirement of decentralized and distributed trust management schemes. In this paper, we first investigate and analyze various existing decentralized and distributed trust management schemes. Based on the analytical results, an efficient, accurate, robust and scalable light weight trust ratings aggregation scheme, referred to as M-trust, is proposed for mobile P2P networks. Extensive simulation results show that this proposed scheme can decrease the time required to compute the list of trust ratings and reduce the required storage space. The comparison to other schemes demonstrates that M-trust possesses the excellent overall performance in terms of accuracy, reliability, convergence speed, and detection rate under various constraints of mobility, trust threshold and network out-degree.