{'fraction_non_alphanumeric': 0.01425438596491228, 'fraction_numerical': 0.0, 'mean_word_length': 6.077519379844961, '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}}
Self-adaptive relay station selection algorithm in cooperative communication

Analysis of real communication network's information transmits performance especially in WSN (Wireless Sensor Network) has always been the research hotpots of network communication efficiency. In this article, we adopt four different node fault generation policies to network dataset including real communication networks and simulated networks too. Experiments focus on the relationship between fault nodes and network structure indications. We found that betweenness based strategy is more harmful to network structure. After modifying traditional WSN relay station select algorithm, the self-adaptive relay station selection algorithm in cooperative communication based on node's betweenness is proposed in this paper to promote information transmit efficiency in WSN in the time of information transmit and decrease transmit time.