{'fraction_non_alphanumeric': 0.024608501118568233, 'fraction_numerical': 0.0, 'mean_word_length': 5.08843537414966, '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}}
QoS in ad hoc networks

For mobile ad-hoc networks, nodes must balance a variety of tasks including sensing and communications relays. Mobile nodes might thus change location or trajectory for sensing purposes, subject to constraints on disruption of network QoS. This paper maximizes the non-communication application QoS (node motion to facilitate sensing) with communication QoS constraints (packet delay, etc.). It also gives the formulation for maximizing the throughput for the newly formed links at the new position of the node, taking link capacities into consideration. Each link is shared by multiple streams of traffic from different QoS classes, and each stream traverses many links. Although these formulations are non-linear, they can be posed as geometric programs, which can be solved efficiently. We also propose a heuristic to implement the above algorithm in ad hoc networks.