{'fraction_non_alphanumeric': 0.02476780185758514, 'fraction_numerical': 0.0007739938080495357, 'mean_word_length': 4.798206278026906, '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}}
Kad-D: An Improved Model Based on Kademlia

In this paper, we describe an improved model Kad-D based on Kademlia[1]. The networks based on Kademlia are not stabilized at all times, for all kinds of nodes in the networks connected to the networks can be cut out of networks frequently. And in mobile environments that are made of intermittent connections and unsettled networks bandwidths, the Kademlia has good performance but the hops, delay and transmission quantity of Kademlia are higher, especially under high churn. In Kad-D, one field added to the routing message, it is used to hold the quantity of returning nodes' information. The node of received message returns only nodes information request in the message. Furthermore, based on this model, a mechanism has been established and the quantity of needed nodes information can be changed by it. According to node's requirement that the hop, delay and transmission the node expected and performance of networks, the node can suitably adjusts to these performance using the mechanism. In addition, the parameter of Kad-D can be factitiously changed as well. The simulation experiments in this paper show that the Kad-D not only decreases the hop and delay of routing, but also the transmission amount of inquiry is less than Kademlia.