{'fraction_non_alphanumeric': 0.019630484988452657, 'fraction_numerical': 0.0, 'mean_word_length': 4.8979591836734695, '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}}
TART: Traffic-Aware Routing Tree for Geographic Routing

Tree routing is one of the detouring strategies employed in geographic routing to help find a detour for a packet to leave a local minimum. The effectiveness of tree routing depends on the quality of the pre-constructed routing trees. Existing tree construction methods build trees in a top-down and centralized fashion and do not consider the traffic load in the network, and therefore is likely to create trees with poor routing performance. In this paper, we propose a novel routing tree, namely traffic-aware routing tree, which is constructed completely in a bottom-up fashion and with the traffic load in mind. Simulation results show that such traffic-aware routing trees have very few conflicting hulls and much higher path throughput than other routing trees, leading to a better routing performance.