{'fraction_non_alphanumeric': 0.011650485436893204, 'fraction_numerical': 0.0, 'mean_word_length': 5.608974358974359, '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}}
Topology control for survivability enabling in ad hoc networks

Network topology survivability is an important issue especially in wireless ad hoc networks,since nodes and wireless links easily fail due to random failures and attacks.This paper shows that the survivability of topologies is not equivalent to the connectivity of the multiply connected graph by some practical examples.Then,network survivability is applied to the topology of ad hoc networks to describe the topology robustness and transmission capacity.Analytical expressions are given for the critical neighbor number for a K-vertex connected topology.A distributed neighbor-based topology control protocol is given to keep the degree of every node equal to or slightly below a specific k when nodes fail in a timely manner.The constructed topology is high probability connected and bidirectional,and can be implemented at a reasonable cost.Simulations show that the resulting topology has good network survivability in terms of invulnerability and availability.