{'fraction_non_alphanumeric': 0.02184598580010923, 'fraction_numerical': 0.0016384489350081922, 'mean_word_length': 5.760147601476015, '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 novel scheme of cross‐network radio resources scheduling in SAGN based on unified resources mapping and genetic algorithm

To decrease human deaths in the disaster and ensure the efficiency of emergency aid, high accuracy logistics can play an important role. To achieve this target, anytime and anywhere communications would contribute to rapid information interaction on situation monitoring of logistics. Space‐air‐ground network (SAGN) is the network combined with satellite network, aerial network, and territorial network, which can achieve global communication coverage. That means it would be a heterogeneous network, in which each network providing with different radio communication resources. If we would like to exploit the SAGN to achieve reliable support of communication, we have to solve the problems of the unified mapping of different radio communication resources. Besides, we should further design the exact scheduling scheme for the communication service of emergency logistics with global heterogeneous networks. Therefore, we propose a novel scheme of cross‐network radio resources scheduling in SAGN based on unified resources mapping and genetic algorithm. First, we build the system model for SAGN in the scenario of emergency logistics. Second, the unified resource mapping method is proposed, which achieves global cross‐network resources virtualization by the quality of service (QoS) bearer matching. Third, the multi‐population genetic algorithm is introduced to relate with each network resource to achieve available virtual global radio communication resource scheduling. The simulation results show that the resource efficiency of this proposed scheme has a better performance compared with the other resource scheduling method, which increased by 11.8% compared with bottom‐left (BL) algorithm.