{'fraction_non_alphanumeric': 0.011741682974559686, 'fraction_numerical': 0.0, 'mean_word_length': 5.125748502994012, '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 Balanced Link Reversal Routing in Wireless Ad Hoc Networks

The link reversal routing (LRR) algorithm maintains loop free routes in mobile ad hoc wireless networks while incurring low overhead. In this paper we explore the problem of balancing the load of forwarding traffic in LRR algorithm. We make some important observations regarding the situations that lead to load unbalance in the LRR algorithm and formally define the load balancing problem. Based on our observations we propose three modifications to the LRR algorithm such that the load may be distributed in a more uniform manner. The modifications preserve all the desirable qualities of LRR algorithms such as loop free routes, local response to topology change, low overhead and are completely distributed in nature. We perform simulations in order to evaluate the performance of the proposed modifications for both single-path and multipath scenarios. It is observed that the modifications enable LRR algorithm to provide a much improved load balance.