{'fraction_non_alphanumeric': 0.014844804318488529, 'fraction_numerical': 0.0, 'mean_word_length': 5.566371681415929, '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}}
Modified distributed quality-of-service routing in wireless mobile ad-hoc networks

The QoS routing is a key function for the transmission and distribution of multimedia traffic across networks. However, their application in ad hoc networks is difficult because of the ever-changing nature of the network topology, and the inherently imprecision of routing state information. In this paper an efficient distributed routing algorithm based on the ticket based probing algorithm is proposed. The proposed algorithm presents an efficient solution for the problem of message overhead through the application of two modified termination strategies and data structures. Simulation results have shown better performance over the original algorithm.