{'fraction_non_alphanumeric': 0.0175054704595186, 'fraction_numerical': 0.0, 'mean_word_length': 5.310344827586207, '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}}
Efficient secure multicast route using genetic algorithms for wireless sensor and actor networks

Multicast routing is very important for wireless sensor and actor networks (WSANs), where the decisions or control information from actors will be delivered to sensors over each link of the WSANs only once. In the multicast route each copy should be securely send to the authenticated destinations. The relay nodes should compute and identify forwarding paths to meet packet’s security requirement. This problem can be described as degree-constrained minimum spanning tree problem, which is an NP-complete problem. This paper uses genetic algorithm to compute such multicast route. In detail, the Prüfer encoding method is adopted to encode the solutions of the problem. Two genetic operators are specifically designed. We proved the operators can avoid producing infeasible solutions and missing feasible solutions.