An Adaptive Task Scheduling Method for Networked UAV Combat Cloud System Based on Virtual Machine and Task Migration

This paper presents a systematic work aiming to improve the eﬃciency of task processing in a networked UAV combat cloud system. The work consists of three major aspects: (1) an architecture of UAV combat cloud systems—such a system provides the necessary resource pool for powerful computing and storage facilities and deﬁnes the attributes of the entities in the resource pool in detail; (2) an online adaptive task redistribution and scheduling algorithm—the algorithm involves task migration being performed on virtual machines on the cloud system and aims to address the problems caused by static task scheduling approaches; and (3) an online virtual machine and task migration algorithm—the algorithm considers collectively the priority type and quantity of the tasks to be migrated on virtual machines along with time constraints to determine the migration of virtual machine or task and optimize resource usages. Experimental simulation results have demonstrated that the proposed system and the relevant algorithms can signiﬁcantly improve the eﬃciency of task schedule.


Introduction
In the modern information warfare, UAVs (unmanned aerial vehicles) are playing an increasingly important role, and now the major trends in the development of UAV systems are intelligence, integration, and networking [1]. Cloud computing [2] has become one of the disruptive technologies that is reshaping IT infrastructures, network services, and various applications.
e Internet that is powered by cloud computing technology is rapidly developing. One of the prominent features of this network is its super computational power and massive data storage capabilities [3,4]. In order to take advantages of cloud computing to maximize UAVs' effectiveness in cooperative mission [5,6], a new research was conducted on integrating cloud computing with a UAV system [7]. Such a cloud-based system can connect combat units scattered in an environment through a network to form a cloud resource pool. is cloud resource pool stores all essential resources required on the battlefield, such as the number of weapons, the position of airplane, and the target damage, and therefore provides resources to the distant UAVs or missiles in the form of services. However, to make such a system functional effectively in a real environment such as in a combat environment, there are some crucial issues that need to be addressed. Among them, reasonable tasks scheduling [8] and the improvement of the efficiency of combat cloud task processing are considered prominent in the research.
After considering the combat units in a battlefield, this paper designs a networked UAV combat cloud system, aiming at providing a feasible method for a combination of cloud computing and UAV cooperative combat. In order to resolve the problems mentioned above, this paper first proposes an online adaptive task redistribution mechanism to alleviate the scramble for resources caused by difference in task priority. en, considering the diversity of UAV types and tasks in actual combat, this paper analyzes combat tasks and proposes a virtual machine and task migration algorithm based on the fine-grained task types, aiming to avoid excessive migration of virtual machines, improve the task processing efficiency, and make the system more suitable for real-world combat environment. Finally, a set of experimental simulations have been undertaken which demonstrate that the proposed method is effective in improving the performance and efficiency of cloud combat system. e reminder of this paper is organized as follows. Section 2 presents a literature review of related works in a comparative way to emphasize the major issues of the existing methods. Section 3 introduces and discusses the structure and resource entities of the proposed UAV combat cloud system. Section 4 explores the concept of task redistribution with examples, and further in Section 5, the proposed virtual machine and the task migration methods are presented with detailed procedure explained. e analysis experiments and the relevant results obtained are given in Section 6, and finally, the concluding remarks are summarized in Section 7.

Related Works
In the relevant research field about UAV cloud systems, literature [9] proposed a mixed QoS (quality of service) reassurance and energy-balanced architecture for UAV cloud system from a view of control theory. is UAV cloud system architecture intended to address the limitations of high complexity of UAV cluster and low intelligence of individual UAVs. Literature [10] introduced a new cloudsupported UAV application framework and a prototype system to implement the framework. e proposed method can be used to solve problems such as time delay in real-time data processing of UAV cloud. However, it only considers the use of UAVs for the perception of natural disasters and does not involve battlefield.
In order to improve the resource utilization and task processing efficiency of cloud computing platform, and to realize appropriate resource scheduling, many task scheduling algorithms and virtual machine migration schemes have been proposed in the field of cloud computing [11][12][13][14][15]. Literature [11] analyzed the impact of service-level agreement (SLA) default rate and power consumption of virtual machine migration on data center energy consumption and adopted virtual machine energy-saving scheduling algorithm based on energy consumption perception to reasonably deploy and migrate virtual machines. In [12], an improved particle swarm optimization algorithm was proposed to solve the task scheduling problem. Liu [13] added greedy algorithm to the resource threshold management strategy of physical machine so as to optimize the virtual machine selection algorithm and virtual machine placement algorithm. Li et al. [14] used a dual-threshold strategy, virtual machine selection strategy based on minimum migration cost, and probabilistic selection strategy of target physical node to reduce energy consumption. Chen et al. [15] proposed an online scheduling algorithm with uncertainty after considering the uncertainty of a scheduling environment, which ultimately improves the performance of cloud service platform. In terms of optimizing the migration timing and avoiding excessive migration of virtual machines, a lot of new research studies have been done based on some earlier methods [16]. e work discussed in [17] can dynamically adjust the virtual machine migration threshold through statistical analysis of physical machine historical load data. Yan et al. [18] modeled the selection of threshold as a Markov decision process, calculated the optimal threshold, and adjusted the threshold according to system performance. However, the existing approach tends to be a single virtual machine migration without taking into account the types, characteristics, and resource requirements of the tasks handled by the virtual machines, which often leads to excessive migration and results in slower information processing and higher energy costs. erefore, this paper proposes a virtual machine and task migration algorithm. By analyzing the types, characteristics, and combat missions of UAVs, the algorithm can reasonably determine the trigger time of virtual machine migration and task migration and select the target physical machine according to resource matching degree so as to finally reduce the probability of excessive migration of virtual machine. As such the algorithm can not only improve the efficiency of task processing but also make resource allocation more consistent with resource requirements and task characteristics.

Structure Design of Networked UAV Combat
Cloud System is section introduces the structure of the networked UAV combat cloud system designed in this paper and the attributes of resource entities that make up the cloud system.

System Structure.
A networked UAV combat cloud system can realize resource sharing, information exchange, task assignment, and coordination on different platforms and effectively improve the capability of situational awareness, battlefield information acquisition, and interconnection. However, with the increased diversity of UAVs in terms of types and functionality, it will become increasingly difficult for a combat cloud network to meet the needs of information communication, data exchange, and coordinated attack among UAVs, resulting in a decline in the overall combat effectiveness. erefore, in order to enable the combat cloud system to efficiently and flexibly handle task requests and scheduling [19,20], this paper proposes a structure of a networked UAV combat cloud system as shown in Figure 1.
e cloud system consists of multiple UAV combat units in a battlefield environment. Each combat unit is treated as a node and eventually forms a network through data links. Virtually, all available resources can be put together into a huge resource pool, including physical entity resources, environmental resources, situational resources, and other resources.
is resource pool will be managed and distributed uniformly to solve problems on the cloud network, such as snatching resources and virtual machine overmigration [21].
In Figure 1, communication type refers to the UAV with high communication capability, compute type refers to the UAV with powerful computing ability, data type refers to the UAV with super data processing capability, and balance type refers to the UAV with balanced ability.

Resource Entity Attributes.
e following is an introduction of the attributes of the various resource entities that make up the cloud system.
(1) Physical machine (H): a processing unit in a data center. It is a basic physical entity for information processing of the entire cloud system. (2) Virtual machine (VM): virtual computing unit.
Based on the entity resources of the physical machine, it can provide complete hardware functions through virtualization technology. (3) Data center: a resource collection that consists of various resources in the cloud system. It is responsible for controlling the physical and virtual machines, dynamically generating or destroying virtual machines based on tasks submitted by users, and deploying virtual machines on appropriate physical machines.

Adaptive Scheduling Strategies Based on Task Redistribution
is section first illustrates the time delay caused by resource grabbing between different priority tasks and then proposes an online adaptive scheduling strategy to make up for this deficiency.

Problem
Description. An ideal task allocation algorithm can allocate different combat tasks to suitable virtual machines, which can balance the load of resources and improve system utilization. However, it is not guaranteed that each task can be completed within the allotted time. When there are a large number of high-priority tasks, they will be usually prioritized to access and use resources, while other lowpriority tasks are put on hold. erefore, such a single static task assignment algorithm [22][23][24] can cause a large number of low-priority tasks being denied accessing and using resources, resulting in extra wait time. Apparently, in a real battlefield environment, this can be a critical issue and can lead to deadly consequences. e following briefly describes the time delay caused by different priority tasks to access and use resources when scheduling using the static task allocation method.
Assume that a combat system has two priority tasks in total: Type A and Type B. Type A has a higher priority than Type B. e estimated time τ i,j to complete task n i in the virtual machine VM j may be expressed as where ERAT i,j represents the earliest available time of resources, S I is the size of the hard disk image for the task, bw denotes network bandwidth, S I /bw is the task transmission time, and ETM i,j represents the processing time of task n i in virtual machine vm j . As shown in Figure 2, assume that a tactical cloud contains three combat nodes. e scheduler of node A needs to allocate a task n i of Type B to the combat cloud. According to equation (1) and Figure 2, the scheduler of node A will transmit task n i to node C because it has the shortest task completion time τ. After this, the scheduler of node B needs to submit a task n j of Type A to the combat cloud, and the task requires system to reserve resources for n j . If node C happens to have a minimum time of τ for the task, node B will transmit this task to node C. Assume that two tasks are allocated to the same virtual machine; task n j will have priority to use the resources if task n i is still incomplete. In this case, task n i will be forced to suspend until task n j is completed. Imagine that if there were many tasks of Type A requesting resources, then tasks of type B would have a long wait in the queue.

Online Adaptive Task Redistribution Mechanism.
In order to alleviate the system delay caused by conflicting resources demands from tasks with different priorities and to overcome the drawbacks of the static task allocation algorithm, an online adaptive processing mechanism is proposed as discussed below. Essentially, the mechanism will repeatedly evaluate the remaining available static resources and the completion of each task within a predefined time interval. In each evaluation, the scheduler on each combat node will recalculate the expected completion time of the tasks on the node. Note that scheduler will only reevaluate tasks that have already been committed to the node, not the tasks allocated to the node. Based on the updated information, the new estimated earliest completion time τ fdi,j of task n i in virtual machine VM j is given by where ERAT updated i,j denotes the earliest resource available time after updating. e difference D τ i,j between the earliest completion time of initial estimate and the earliest completion time after the update is given by When D τ i,j meets the criterion D τ i,j >D threshold , where D threshold is a predefined threshold, the scheduler will redistribute the tasks to a virtual machine that has the smallest τ fdi,j with a predefined probability α (α refers to the task migration probability). In this paper, we assume that the scheduler reevaluates the remaining static resources before the next task n k is assigned to the same virtual machine. Based on the latest information, the scheduler also computes τ fdk,j of the task n k . Once task n k satisfies D τ i,j > D threshold , it will also be redistributed.

Method of Online Task Scheduling Based on Virtual Machine and Task Migration
is section begins with an introduction to the migration mechanism. On this basis, we further apply the existing virtual machine migration algorithm based on threshold (VMBTA) to the multilayer cloud architecture system. Finally, we propose an online virtual machine and task migration algorithm (VTMA) for combat cloud systems to improve the existing algorithms.

Virtual Machine Migration Mechanism.
ere are still some shortcomings in the method mentioned in Section 4. For example, when the number of tasks in a virtual machine reaches critical condition, tasks are allocated and redistributed more frequently, resulting in bigger energy consumption and lower efficiency. In this case, a new method is needed to tackle these issues. e core technology of cloud computing is the virtualization technology [25], and one of the main advantages of virtualization is online migration. Migrating virtual machines can reduce the workload of physical machines and effectively balance resource allocation among physical machines [26]. In this work, we use dynamic migration as the migration mode of a virtual machine aiming to develop an adaptive decision-making method for the migration.

Virtual Machine Migration Algorithm Based on reshold (VMBTA).
When the utilization of a virtual machine reaches a specific threshold or the virtual machine needs more resources to complete its tasks, the virtual machine must migrate to a new physical machine to continue with current or new tasks. VMBTA [17,18] is one of the most popular virtual machine migration methods to achieve load balance, reduce system load [16], and improve efficiency of the system. is method generally considers three factors when designing a mechanism for virtual machine migration.
(1) Triggering timing of virtual machine migration, that is, when the load of physical machines exceeds the threshold, the virtual machines in physical machine will be triggered to migrate. (2) Choosing the source virtual machine, that is, selecting a virtual machine that meets conditions of migration as the source virtual machine.  for the purpose of migrating the source virtual machine to that physical machine.
According to the traditional threshold-based virtual machine migration theory and the specific situation of using the task redistribution scheduling strategy, the VMBTA adopted to the cloud structure system is given. e following describes the variables involved in the VMBTA.
Let H � H 1 , H 2 , . . . , H n denote the physical machine collection in combat cloud. e resources collection of a physical machine ( where R p iused represents current usage amount of the p th resource in physical machine H i and R p itotal denotes the total amount of the p th resource in physical machine H i .

Definition 2.
Comprehensive utilization of resources in physical machine H i : where n is the total amount of resource types in physical machine H i and AvaR p i is the utilization of the p th resource in physical machine H i .

Definition 3.
e resource proportion of virtual machine V ij in physical machine H i : where n is the number of resource types in a virtual machine, Q p ij is the total amount of the p th resource in virtual machine V ij , and R p i represents the total amount of the p th resource in physical machine H i .
We define three basic factors of the VMBTA as follows: (1) Triggering timing of virtual machine migration: the comprehensive resource utilization of the physical machines in UAV combat cloud is used as the evaluation criterion of the virtual machine migration threshold. We set the threshold to φ. When the comprehensive utilization of a physical machine H i in combat cloud satisfies AvaR i > ϕ, the VMBTA will be triggered.
(2) Choosing the source virtual machine: the algorithm selects a virtual machine that occupies the largest proportion of the total resources in the source physical machine as the source virtual machine. If the source virtual machine fails to be migrated, select the virtual machine that occupies the second largest proportion of total resources as the source virtual machine and so on. (3) Choosing the target physical machine: the algorithm selects a physical machine with the lowest utilization rate in combat cloud as the target physical machine. If the source virtual machine fails to be migrated, select the physical machine with the second lowest utilization rate as the target physical machine and so on. Figure 3 shows the flowchart of the VMBTA. Since this algorithm is not the research content of this paper, only the flowchart is presented here.

Online Virtual Machine and Task Migration Algorithm (VTMA).
Each new method could be a good solution to the problem when it was applied at the beginning. However, problems change constantly with the development of technology and the increasing demand and the changes in the application field. erefore, methods would need to be improved in practice. e VMBTA has several problems in practice. is algorithm only considers a single performance indicator the trigger criterion for virtual machine migration and does not consider the various types and characteristics of tasks in the system. erefore, this section will first refine the type of tasks and categorize tasks into four categories according to the main needs of the actual battlefield environment: (1) Data-intensive tasks: it refers to a task of providing information processing services, such as data preprocessing and information fusion for a large amount of raw data collected by sensors or data that needs to be classified and summarized from various combat nodes. (2) Computation-intensive tasks: it refers to the task that requires the combat system to provide high-speed and efficient computing services and a large number of computing tools in the combat process such as target identification and fire control calculation. (3) Communication-intensive tasks: it refers to the task of information transmission and interactions between combat units, which requires high communication bandwidth and time sensitivity. (4) Load-balancing tasks: it refers to the task that has a balancing demand for computation, storage and communications, and other resources.
In general, the transmission and migration of data-intensive tasks should be minimized because of their own characteristics with large amount of data, a wide range of categories, and nonstandardization. Computation-intensive tasks should be allocated to a physical node that has strong Mathematical Problems in Engineering computing power for processing. However, the VMBTA cannot address these issues because it can cause unnecessary migration of virtual machines and increase the energy consumption of the cloud system. As such this section proposes the VTMA based on VMBTA. e purpose of the VTMA is to reduce the overmigration of virtual machines and to make resource allocation meet resource demand and task characteristics more effectively. When most of the tasks running on the source virtual machine are data-intensive tasks, the workload of a virtual machine can be reduced by migrating non-data-intensive tasks to other virtual machines, thereby reducing system delay and energy consumption due to virtual machine migration. e related variables involved in the VTMA are described as follows: migration probability threshold of virtual machines is Φ, and the demand resource vector of task n k is N k � N 1 k , N 2 k , . . . , N p k , where p is the number of categories of demand resource and Q ij � Q 1 ij , Q 2 ij , . . . , Q p ij is a demand resource vector of the virtual machine VM ij .

Definition 4. Migration probability of source virtual ma
where n data is the number of data-intensive tasks in virtual machine VM ij and n total is number of entire tasks in virtual machine VM ij . Equation (7) indicates a negative correlation between the number of data-intensive tasks in the source virtual machine and the migration probability of the source virtual machine.
where n is the number of resource types in virtual machine VM ij , Q p ijrest is the surplus of the p th resource in virtual machine VM ij , and N p k is the demand of the p th resource in task n k .

Definition 6.
e comprehensive resource proportion of task n k in virtual machine VM ij .
where n is the number of resource types in the virtual machine VM ij , p is the number of resource types in the virtual machine, Q p ij is the total amount of the p th resource in virtual machine V ij , and N p k is the demand of the p th resource in task n k .
Algorithm 1 shows the algorithm of virtual machine and task migration. e aim of this algorithm is to reduce the excessive migration of virtual machines and improve the efficiency of task processing. e input to the algorithm is a list of source virtual machines selected using the VMBTA and is stored in list P (lines 1-2). Firstly, the algorithm gets the first virtual machine in P and the tasks running on it. After that, the algorithm classifies these tasks with a classifier (such as neural networks) and marks the types of the tasks. erefore, the migration probability of the source virtual machine can be calculated according equation (7) (Lines 3-6). If the migration probability is greater than the threshold Φ, the VMBTA for virtual machine migration will be used (Lines 7-9). Otherwise, the algorithm calculates the comprehensive resource proportion of non-data-intensive tasks in the virtual machine according to equation (9) and ranks the tasks in descending order to Q according to this proportion (Lines 10-12). While Q ≠ Ø, on the entire combat cloud, except the virtual machine containing task n k , the algorithm will select the virtual machine VM mn that has the highest matching degree with task n k as target virtual machine (Lines 13-15). While R ≠ Ø, if the remaining resources of the VM mn are not enough for task n k , remove the VM mn from R and select the new VM mn from R for judgment (Lines [16][17][18]. Otherwise, the migration of n k is successful and the algorithm clears the R and Q to end its while loop (Lines [19][20][21][22]. e while loop of R ends when migration is successful or the R � Ø (Lines 16-24). e while loop of Q ends when migration is successful or the Q � Ø (Lines 13-26). e algorithm ends when all the source virtual machines complete the virtual machine or task migration (Lines 3-29).

Simulation and Analysis
is section carries out two experiments to verify the optimization effect of online adaptive task redistribution mechanism and VTMA, respectively.

Experimental Scenario.
is section provides experimental simulations to demonstrate the adaptive process for task scheduling using the proposed algorithm in networked UAV combat cloud system. is process includes search, identification, analysis, fire attack, and final damage assessment of ground targets within a designated area. e combat cloud consists of 7 UAVs in total: 3 fire UAVs, 2 storage UAVs, and 2 communication UAVs.

Experimental Environment.
e simulations were executed on Windows7 using CloudSim simulation package running on Java platform. e simulation environment is shown in Table 1.

Experimental Parameter Settings.
e combat cloud consists of a variety of heterogeneous UAVs and the resources they carry on. Different UAVs have different capabilities for processing tasks, and we use three categories of physical machine parameters to characterize different types of UAVs. ey are storage-type, compute-type, and communication-type physical machines, respectively. e range of the parameter values of the physical machines is shown in Table 2.
e system will generate different virtual machines according to the tasks. Table 3 shows the value range of the parameters of the virtual machines. Table 4 shows the value range of the main parameters of the tasks in service request submitted by users.

Experiment Design.
is experiment testified the impact of the adaptive task redistribution method on the assignment and processing efficiency of combat cloud when the networked UAV combat cloud received a large number of tasks over a period of time.
In the experiment, a data center of combat cloud that consists of 7 UAVs was generated. is center accepted 20 service requests (such as target searching, target recognizing, and situation assessing) randomly generated by the users, of which 4 service requests (such as threat assessment, fire control solution, and other service requests) were Type A, and the rest were Type B. Each service request contained 10-20 tasks. e service requests were submitted in two different ways in the experiment: (1) Service requests are evenly distributed on the timeline in order to be submitted orderly so that each service request has sufficient time and resources to be processed, and tasks do not have to compete for resources with each other in most cases. We call this situation the loose service request mode. (2) All service requests are submitted at very short intervals, which means that tasks will have to compete Mathematical Problems in Engineering for resources from each other and some tasks will have to wait for resources. We call this situation the compact service request mode.
In both the forms of submitting task, by changing the task redistribution probability α, the average completion time of service requests in combat cloud was used to evaluate Input: e VMs to Migration Ensure: Reduce the excessive migration (1) Build a new list P � Ø (2) Put the VMs into the list P (3) While P ≠ Ø do (4) Get the first VM (VM ij ) in P and get the tasks running on it (5) Recognize the classification of each task (6) Compute the β ij (7) If β ij > Φthen (8) Run the VMBTA (9) Remove the first VM (VM ij ) from P (10) Else do (11) Build a new list Q (12) Evaluate the non-data-intensive tasks' Pro k,ij and list them with descending order ⟶ Q (13) While Q�Ø (14) Build a new list R�Ø (15) Evaluate the first task's (n k 's) σ k,mn in Q with all other VMs and list them with descending order ⟶ R (16) While R≠Ø do (17) If the remaining resources of first VM (VM mn ) in R are not enough for n k then (18) Remove VM mn from R (19) Else do (20) Migrate n k to VM mn (21) Clear R (22) Clear Q (23) End If (24) End while (25) Remove the first task from Q (26) End While (27) Remove the first VM (VM ij ) from P (28) End If (29) End whiles ALGORITHM 1: VM-task migration algorithm (VTMA).   the effect of the proposed online adaptive mechanism. e completion time is defined as the time taken from receiving the service request to successfully complete the service request. Due to the randomness of generating service requests, the experiments of both service request modes were conducted 100 times, and the average value was calculated as the test result. Figure 4 shows the average completion time of requests in loose service request mode. As shown in Figure 4, the online adaptive mechanism for task scheduling has no obvious effect on the processing time of services. In the loose service request mode, the phenomenon of resource contention is not obvious, and each task has enough resources to be processed in most cases. erefore, in most cases, task reassignment was not required, which limited the effect of the adaptive mechanism for task redistribution. Figure 5 shows the average completion time of requests in compact service request mode.

Experimental Results and Analysis.
As shown in Figure 5, the online adaptive mechanism for task scheduling has a significant impact on the processing time of services. When the task reallocation probability α was in the range of (0, 0.75), the average completion time of service requests decreased notably with the increase of the task reallocation probability. When the task reallocation probability α was in the range of (0.75, 1), the average time to process services did not change significantly. In the compact service request mode, competing for resources is very frequent, and the actual completion time of tasks is usually later than the estimated completion time. For a service request consisting of multiple tasks, the delay of the task processing will be worsened. erefore, when the task reallocation probability α was in the range of (0, 0.75), the average completion time of service requests decreased significantly as α increases. However, some tasks of Type A did not take up too many resources all the time. When the task reallocation probability α continued to increase, almost all tasks that had been robbed of resources were reallocated, which made the task allocation algorithm reused a lot and ultimately affected the efficiency of the system. As a result, in the experiments, when the task reallocation probability α was in the range of (0.75, 1), the average completion time of service requests changed little and even showed the slight increase.

Verification Experiment for Virtual Machine and
Task Migration 6.3.1. Experiment Design. e experiment simulated the impact of using the VTMA on allocating tasks and processing efficiency of combat cloud. Before the experiment began, the VMBTA was used for simulation test several times. In the simulation test, the probability threshold φ of virtual machine migration in the VMBTA increased from 0% to 100% with a stepped increment of 10%. e test showed that the task processing efficiency was the highest in combat cloud when setting φ to 80%, so this experiment set φ to 80%.
In the experiment, the data center composed of seven physical machines was generated and accepted 20 service requests submitted randomly by the users, of which four service requests were Type A and the rest were Type B, and each service request contained 10-20 tasks. In the loose service request mode, the combat cloud has a low overall load and it is difficult to evaluate the performance of the  Migration probability threshold of virtual machine (%) Average time for processing task in combat cloud (s) VTMA. erefore, this experiment used the compact service request mode to prove the effectiveness of the VTMA. e experiment evaluated the impact of using the VTMA on the task processing time and the migration of virtual machines and tasks by changing the migration probability threshold Φ of virtual machine in the VTMA. e experiments were simulated 100 times and took the average as the experiment result because of the randomness of generating service requests. Figure 6 shows the time for processing tasks in UAV combat cloud when using the VTMA.

Experimental Results and Analysis.
It is evident from Figure 6 that using the VTMA improved the efficiency of processing tasks in combat cloud when using the VMBTA for adaptive task scheduling, which reduced the time of processing tasks by up to 20.1%. When the migration probability was 75%, the system had the minimum task processing time. When the migration probability was 80% to 100%, the reason for the increase in processing time is the excessive number of task migrations. Figure 7 shows the migration times of virtual machines and tasks with different thresholds of migration probability Φ when using the VTMA.
When the migration probability threshold Φ of a virtual machine was 0%, the triggering condition of the VTMA cannot be met, so the experiment process was equivalent to using the VMBTA only. As shown in Figure 7, when the migration probability was 75%, the VTMA reduced the number of the virtual machine migrations by 80%. When Φ was in (0%, 20%), only the number of task migrations decreased, so the decrease of processing time was not obvious. When the Φ was in (20%, 60%), the number of virtual machine migrations significantly reduced due to efficient task migration, which has led to a significant decrease of task processing time. When Φ was in (60%, 75%), the number of virtual machine migrations slowly decreased, resulting in a slow decline in task processing time in the combat cloud. When Φ was in (75%, 100%), task processing time has increased because the number of virtual machine migrations no longer decreases, and the number of task migrations significantly increases. It implies that this situation has led to unnecessary task migrations, leading to an increase in task completion time.

Conclusions
is paper first proposes a cloud combat system which provides a new idea for the future network-centric combat mode. en, by analyzing the assignment process of a single static method, an adaptive task redistribution mechanism is established.
is mechanism solves the problem that the system processing time exceeds the specified time and improves the efficiency of task assignment of cloud system. Finally, in order to further improve the efficiency of task processing in the cloud system, we have refined the different characteristics of the tasks and established a virtual machine and task migration mechanism. is mechanism determines whether a virtual machine/task is migrated or not based on the type and the number of tasks in the virtual machine, thus reducing excessive energy consumption caused by the migration of the virtual machine. e simulation results have shown that the migration mechanism increases the flexibility of configuration resources and therefore improves the efficiency of processing tasks in the networked UAV combat cloud system.

Data Availability
e data used to support the findings of this study are included within the article.

Conflicts of Interest
e authors declare that there are no conflicts of interest.