{'fraction_non_alphanumeric': 0.00933609958506224, 'fraction_numerical': 0.0, 'mean_word_length': 5.225806451612903, '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}}
Improving the topological resilience of mobile ad hoc networks

In order to effectively deploy survivability techniques to improve the resilience of mobile ad hoc networks, one must be able to identify all the weak points of the network topology. The weak or critical points of the topology are those links and nodes whose failure results in partitioning of the network. Here we propose a new algorithm based on results from algebraic graph theory, that can find the critical points in the network for single and multiple failure cases. Utilizing this algorithm we present numerical results that examine how the number of critical points varies with nodal density. Secondly, we propose three localized topological control schemes to improve the network connectivity around critical points to lessen their importance and improve the network resilience. Numerical studies to evaluate the proposed schemes under node and link failure network conditions are presented.