{'fraction_non_alphanumeric': 0.01835985312117503, 'fraction_numerical': 0.0, 'mean_word_length': 5.704918032786885, '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}}
A Dynamic Pseudonyms Based Anonymous Routing Protocol for Wireless Ad Hoc Networks

In wireless ad hoc networks, it is an efficient approach to utilize the dynamic pseudonyms scheme to preserve the nodes' privacy. However, in the existing works, there are some problems such as weak anonymity and synchronization difficulty when updating pseudonyms. In this paper, we propose a lightweight Dynamic Pseudonyms based Anonymous Routing protocol, called DPAR. In the proposed DPAR, the security is implemented by lightweight symmetric key cryptography and hashing operations, the pseudonyms are generated by hashing operations, and dynamically updated and synchronized by elaborate message interactions. Extensive analyses show that DPAR can achieve the routing security and the nodes' anonymity with acceptable overhead.