{'fraction_non_alphanumeric': 0.014154870940882597, 'fraction_numerical': 0.0, 'mean_word_length': 4.892156862745098, '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}}
Delay-constrained and bandwidth-guaranteed QoS routing in TDMA/CDMA ad hoc networks

This paper proposes a QoS routing with delay constrained and bandwidth guaranteed in TDMA/CDMA ad hoc networks. Because the wireless bandwidth is shared among adjacent nodes and the network topology changes as the nodes move, quality of service is more difficult to guarantee in ad hoc networks than in most other type of networks. QoS routing requires finding not only a route from a source to a destination, but also a route that satisfies the end-to-end QoS requirement, often given in terms of bandwidth or delay. We improve a distributed algorithm to realize the control of delays and give the method to calculate the bandwidth of a path that can be used to judge whether the bandwidth of the path satisfies the requirement. In TDMA/CDMA ad hoc networks, this is a new scheme to satisfy not only delay constrained but also bandwidth guaranteed. Some simulations have been conducted and the simulation results have demonstrated the deference of call success rate between our algorithm and other existing global algorithm or other localized algorithms that only consider delay constrained or bandwidth guaranteed.