{'fraction_non_alphanumeric': 0.016748768472906402, 'fraction_numerical': 0.0049261083743842365, 'mean_word_length': 5.195121951219512, '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}}
An algorithm to distribute and load balance shared-fate tasks in mobile ad hoc networks

The pace of mobile networking is rapidly changing. Each year, waves of new smartphones, tablets, netbooks, and laptops are being released to consumers and subsequently being adopted in greater numbers than ever before. The effect is a much denser environment, rich with mobile devices able to keep people connected throughout their daily activities. With these advances come new problems. Devices are becoming so dense in social environments that there is increasing redundancy in computational efforts, wasting energy. Tasks including 802.11 neighbor discovery and GPS location among others have deterministic results for devices in close proximity, as is common in dense environments. It is the objective of this thesis to design an algorithm to allow varied devices in dense mobile ad hoc networks to distribute and load balance these tasks among each other, ultimately leading to energy savings through reduced redundancy.