Emergency task scheduling algorithm for space-based networks

As an essential component of the space-air-ground integrated network, the space-based network has advantages such as wide coverage, high throughput, and strong disaster resilience, and is widely applied in emergency communication and other fields. In the scenario of emergency rescue, a large amount of high-time-sensitive data is generated within a short period in the disaster-stricken area. It is urgently necessary to be quickly relayed back via the space-based network to reduce losses. However, the network resources of the space-based network are limited, and data transmission needs to follow constraints such as time windows, resulting in high transmission delay and significantly reducing the emergency response capacity of the space-based network. Therefore, an emergency task scheduling mechanism for space-based networks was proposed to achieve precise matching of emergency tasks with the limited resources of the space-based network to minimize the transmission delay of emergency tasks. Firstly, the emergency task scheduling problem was modeled as an integer programming problem to minimize the maximum transmission delay of emergency tasks. Secondly, a new efficient encoding method was proposed to compress the solution space and provide a guarantee for the efficient solution of the problem. Furthermore, a high-efficiency scheduling strategy was proposed by combining global search and local search, that is, integrating the whale optimization algorithm into the framework of the genetic algorithm for local search, which reduces the maximum transmission delay of emergency tasks. Simulation results show that the proposed algorithm has good convergence and can effectively reduce the maximum transmission delay of emergency tasks, enhancing the emergency data transmission performance of the space-based network.