{'fraction_non_alphanumeric': 0.01954732510288066, 'fraction_numerical': 0.0, 'mean_word_length': 5.08125, '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}}
Energy-efficient Traffic-aware Detour Trees for Geographical 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 pattern and residual energy of the network. Therefore is likely to create trees with poor routing performance. In this paper, we propose a novel routing tree, namely Energy-Efficient Traffic-Aware Detour Tree, which is constructed completely in a bottom-up fashion, with the consideration of both traffic load and residual energy. The simulation shows that our detour tree rarely encounters the problem of conflicting hulls, has much higher average path residual energy and throughput than other detour trees, leading to a better routing performance.