{'fraction_non_alphanumeric': 0.014201183431952662, 'fraction_numerical': 0.0, 'mean_word_length': 5.82258064516129, '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}}
A highly reliable link scheduling strategy for WirelessHART networks

WirelessHART is a kind of wireless mesh network communication standard specially designed for industrial process automation applications and FHSS as well as TDMA mechanism guarantees its robustness. In this paper, time slots and channels are allocated for each link in WirelessHART networks by edge-coloring, and a graph route-based link scheduling algorithm with collision avoidance is proposed. By combining the optimal routing algorithm with the multi-hop retransmission mechanism, the performance of WirelessHART networks is effectively improved. The analysis shows that the proposed scheduling strategy has a higher reliability and a lower latency than previous scheduling algorithms, which meets the requirements of the real-time communication in WirelessHART networks.