{'fraction_non_alphanumeric': 0.022872827081427266, 'fraction_numerical': 0.0036596523330283625, 'mean_word_length': 5.251428571428572, '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}}
Load Balancing Routing for Wireless Mesh Networks: An Adaptive Partitioning Approach

In this paper, we propose a novel load balancing routing algorithm for wireless mesh networks (WMNs) with multiple gateways, i.e., sink routers. As most traffic occurring in WMNs is relayed to these gateways through wireless links in a multi-hop fashion, the sink routers are easily overloaded. In such a situation, when a user initiates a communication session and the corresponding route toward the sink router cannot provide the required level of services, the session is rejected. Our objective is to achieve load balancing routing that minimizes such rejections. To this end, we take an adaptive partitioning approach, which heuristically divides the entire network into partitions and applies load balancing to between partitions and within partitions. To cope with user mobility, partitions and routes are adaptively managed. Evaluation via simulations indicates up to 25% performance gains over existing schemes in rejected requests, while the overhead in route computation costs drops by up to 27%.