Data link time slot distribution method, system and device based on strategic Harris eagle optimization algorithm and medium
By introducing a shrink index function into the Harris Eagle optimization algorithm, balancing global and local searches, the problem of resource waste and real-time in the time slot allocation of tactical data links is solved, and fast and accurate time slot allocation is achieved to reduce delay jitter. Improves the stability and efficiency of the data link.
Patent Information
- Application Number
- CN202411150311.6
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-21
- Publication Date
- 2024-11-22
AI Technical Summary
The existing technology has problems such as wasting resources, large computing volume, inability to meet real-time requirements, poor local search capabilities and large delay jitter in the time slot allocation of tactical data links. It cannot meet the problem of finding the optimal data link quickly and accurately. Requirements for gap allocation schemes.
The strategy-based Harris Hawk optimization algorithm (SHHO-SAA) is adopted to adjust the attenuation rate of escape energy by introducing a shrinkage exponential function, balance global and local searches, improve algorithm performance, quickly find the optimal time slot allocation scheme for data links, and reduce time Delay jitter.
It realizes the optimal solution for quickly and accurately finding the time slot allocation, reducing delay jitter, improving the combat effectiveness and information transmission stability of tactical data links, and is suitable for single node and multi-node time slot resource allocation.
Smart Images

Figure CN119012359A_ABST
Abstract
Description
Technical Field
[0001] The present invention belongs to the technical field of communication networking, and in particular relates to a time slot allocation method, system, device and medium based on a strategic Harris Hawk optimization algorithm. Background Art
[0002] The world is undergoing a major change that has not been seen in a century, with military conflicts continuing in various regions. Military strength and tactical equipment reflect a country's combat capability and also depend on the superiority of its combat methods. Link 16 data link has become the basic configuration of the main combat platforms of the US military and NATO. Link 16 is a high-speed line-of-sight tactical data link selected by the US Department of Defense, which has the characteristics of efficient transmission, high confidentiality requirements and strong anti-interference ability. The US military and its allies use Link 16 data link to perform radio communications, air surveillance, aviation combat command and control and other tasks, and can achieve seamless exchange of messages between air, ground and marine forces during their joint operations. The application of tactical data links has an increasingly greater impact on the modern information warfare situation, and many countries have also invested in the research and development of data links.
[0003] Link 16 uses time division multiple access (TDMA) for networking, and its basic time unit is a time slot of a certain length. The TDMA access method of Link 16 data link network divides time resources into time units, time frames and time slots. One time unit contains 64 time frames, and one time frame contains 1536 time slots. Time slot resources are allocated to each node member in the network through a time slot allocation algorithm, and then each node transmits information in the allocated time slot.
[0004] Many scholars at home and abroad have put forward their opinions on the time slot allocation method of tactical data link. When allocating time slot resources, in order to enable the tactical messages in the data link to be transmitted periodically, it is necessary to reduce the delay of the message during transmission, so as to ensure the reliability and stability of the tactical data link. When successfully allocating time slots to network nodes, it is necessary to ensure the uniformity of the allocated time slots within a time frame as much as possible. The more uniform the time slot allocation, the shorter the delay in the transmission of service messages will be, and the smaller the delay jitter will be.
[0005] a. Time slot allocation algorithm based on binary tree time slot block
[0006] At present, most of the data link time slot allocation algorithms start from the uniformity of time slot allocation. The most classic time slot allocation algorithm based on binary tree time slot blocks can only guarantee the uniformity of time slot allocation within a time frame, but cannot guarantee that the time slots allocated to periodic messages in another time frame are also uniform. Since the time slot blocks based on binary trees are composed of time slots that are powers of 2, and in practice, the number of time slots required for business messages is mostly not a power of 2. Therefore, using binary tree time slot blocks to complete time slot resource allocation will result in more time slots not being used, resulting in a waste of time slot resources.
[0007] b. Average domain annealing algorithm
[0008] exist
[0009] In IEEE Journal on selected areas in Communications, 1997, 15(2): 250-260, Wang G et al. published a paper titled "Optimal broadcast scheduling in packet radio networks using meanfield annealing". In this paper, a meanfield annealing algorithm was disclosed. However, since the algorithm has a large amount of computation, it takes a lot of time to obtain a reasonable time slot allocation scheme, which does not meet the real-time nature of information transmission in tactical data links.
[0010] c. Time slot allocation algorithm based on hybrid neural genetic algorithm
[0011] exist
[0012] In IEEE Transactions on Wireless Communications, 2003, 2(2): 277-283, Salcedo-Sanz S et al. published
[0013] The paper "A mixed neural-genetic algorithm for the broadcast scheduling problem" discloses the time slot allocation algorithm of the mixed neural genetic algorithm. The implementation of this algorithm is relatively complex and not suitable for practical engineering use.
[0014] d. TDMA time slot allocation algorithm based on genetic algorithm
[0015] In Firepower and Command and Control, 2015, 40(08):97-100, Chen Jiayuan et al. published a paper titled "Time Slot Allocation Algorithm for TDMA Tactical Data Link Based on Genetic Algorithm". The paper proposed a TDMA time slot allocation algorithm based on genetic algorithm. The algorithm breaks the constraints of the binary tree structure and directly searches for the optimal solution from the solution space of time slot allocation through the traditional genetic algorithm. However, the genetic algorithm has poor local search capabilities, and the training time required to obtain a reliable solution is too long, which cannot meet the real-time requirements of information transmission of tactical data links during combat.
[0016] e. Data link network resource allocation method based on genetic algorithm
[0017] In IEEE, 2019:1875-1880, Sun W et al. published
[0018] The paper "Data link network resource allocation method based on genetic algorithm" proposes a data link network resource allocation method based on genetic algorithm. Due to the poor local search ability of genetic algorithm, it will take too long to train to obtain the optimal solution of reliable time slots. Therefore, it cannot meet the real-time requirements of tactical data link for information transmission during combat.
[0019] f. A time division multiple access time slot allocation method based on manta ray algorithm
[0020] The patent application with publication number CN116234017A provides a time division multiple access time slot allocation method based on the manta ray algorithm, which divides the time frame into an information collection period and a time slot allocation period, and then divides the time slot allocation period into a dedicated time slot period and a dynamic time slot period. However, when the time division multiple access time slot allocation method based on the manta ray algorithm is used to obtain the optimal time slot resource allocation scheme, its delay jitter is too large, which means that the time slot allocation scheme obtained by this method is not very uniform and has not reached the theoretical optimal situation.
[0021] In summary, the existing technology has the following disadvantages: the algorithm will cause more time slots to not be used, resulting in a waste of time slot resources; the algorithm has a large amount of computation, so it takes a lot of time to obtain a reasonable time slot allocation plan, which does not meet the real-time information transmission of the tactical data link; the algorithm implementation is relatively complex and is not suitable for actual engineering use; the algorithm has poor local search capabilities, and the training time required to obtain a reliable solution is too long, which cannot meet the real-time requirements of information transmission of the tactical data link during combat and has large delay jitter. Summary of the invention
[0022] In order to overcome the shortcomings of the above-mentioned prior art, the purpose of the present invention is to provide a data link time slot allocation method, system, device and medium based on strategic Harris Hawk optimization, and by introducing a shrinkage exponential function in the Harris Hawk optimization algorithm (HHO), a new strategic Harris Hawk optimization data link time slot allocation method (SHHO-SAA) is proposed to more accurately adjust the balance between exploration (global search) and exploitation (local search) during the search process; this method improves the linear change of energy during escape in the traditional HHO algorithm into a nonlinear change, and helps the algorithm to control the decay rate of the escape energy by controlling the decay rate of the escape energy. The method can avoid falling into the local optimum too early, thereby increasing the probability of finding the global optimal solution, accelerating the convergence speed at the end of the iteration, improving the algorithm performance, and being able to quickly and accurately find the optimal time slot allocation scheme for the data link, and can significantly reduce the delay jitter. Compared with the time slot allocation method based on genetic algorithm, it has efficient optimization capability, can quickly and accurately find the optimal solution for time slot allocation, and can effectively complete the work of single-node and multi-node time slot resource allocation, which is in line with the real-time transmission of tactical business messages in the data link, thereby significantly improving the combat effectiveness of the tactical data link and the stability of information transmission.
[0023] In order to achieve the above object, the technical solution adopted by the present invention is as follows:
[0024] A data link time slot allocation method based on a strategic Harris Hawk optimization algorithm comprises the following steps:
[0025] Step 1: Determine the service parameters according to the service requirements of each node in the data link network, wherein the service parameters include: the number of nodes m requiring time slots, the lower bound lb and upper bound ub of the number of idle time slots, and the required amount of time slot resources n;
[0026] Step 2: Initialize the algorithm parameters, including: Harris Hawk group size M, Harris Hawk position X, escape energy factor E, and maximum number of iterations T;
[0027] Step 3: Calculate the delay jitter when allocating time slot resources to a single node according to the position X of the Harris Hawk. The solution with the minimum delay jitter is the optimal and uniform time slot solution.
[0028] Step 4: Calculate the average value of the delay jitter of each node when allocating time slot resources to multiple nodes according to the position X of the Harris Hawk. The solution with the minimum average value of the delay jitter of each node is the optimal and uniform time slot solution for each node.
[0029] Step 5: According to the delay jitter results calculated in Step 3 and Step 4, the optimal time slot position is continuously updated and iterated;
[0030] Step 6: Update the escape energy factor E according to the contraction exponential function;
[0031] Step 7: Match the corresponding search strategy according to the escape energy factor E updated in step 6, and update the position X of the Harris Hawk;
[0032] Step 8: When the number of iterations has not reached the maximum number of iterations T, repeat steps 3 to 7, and add 1 to the number of iterations; when the number of iterations reaches the maximum number of iterations, stop iterating; each iteration calculates the corresponding delay jitter through step 3 or step 4, and each iteration obtains a set of time slot allocation schemes, and the time slot allocation scheme corresponding to the minimum delay jitter is the optimal time slot allocation scheme; after reaching the maximum number of iterations T, the optimal result obtained after T iterations is output, that is, the optimal and uniform time slot solution is output.
[0033] The delay jitter calculation process when a single node allocates time slot resources in step 3 is as follows:
[0034] First, the time frame T with a period length of N f , denoted as T f ={T1, T2, ..., T N}, where Ti represents the position of the i-th time slot in a time frame; the idle time slot is L, L = {I1, I2, ···, I S}, (S≤N) means that there are S idle time slot resources in the cycle length N. When N=S, the instantaneous frame T f is equivalent to an idle time slot L, which means that a time frame with a period length of N will have S idle time slots L, and n is randomly selected from the S idle time slots L j The optimal idle time slot L is allocated to node j, expressed as: X j ={x 1j , x 2j ,···,x nj}(n≤S≤N), where X j It is called the time slot allocation scheme. In the time slot allocation scheme, the adjacent time slot interval of the theoretically optimal time slot allocation is:
[0035] P=S / n j (1)
[0036] For time slot allocation scheme X j , the distance between adjacent time slots actually allocated to node j is:
[0037]
[0038] In formula (2), represents the interval between adjacent time slots assigned to node j, where represents the position of the i-th time slot allocated to node j. When i=n, that is, The interval between the last time slot allocated in the current time frame and the first time slot allocated to the node in the next time frame is determined by the interval D between adjacent time slots. i The set formed can be recorded as D = {D1, D2, ···, D n}, when D1=D2=···=D n =P, it means that the time slot allocation scheme is optimal at this time, the allocated time slot resources are in a completely uniform state and the delay jitter is 0. However, in actual use, each node combat member allocates time slots according to its business time slot demand, and the uniformity of the allocated time slots cannot reach this level. Therefore, let the adjacent time slot interval D in the time slot allocation scheme be i The adjacent time slot interval P value is infinitely close to the theoretical optimal time slot allocation;
[0039] The delay jitter var to node j j To solve:
[0040]
[0041] According to formula (3), is the interval between the ith adjacent time slots assigned to node j, n j is the time slot resource requirement of the jth node. According to formula (1), P is the total idle time slots S in a frame divided by the number of time slots n that node j needs to allocate j , that is, P is the adjacent time slot interval of the theoretically optimal time slot allocation.
[0042] The process of calculating the average value of multi-node delay jitter in step 4 is as follows:
[0043] When there are m network node members in the data link network that need to send or receive business messages, n j is the time slot resource requirement for sending and receiving service messages of the jth node, so the total time slot requirement Num for each network node j in the data link network max The formula to be satisfied is as follows:
[0044]
[0045] When allocating time slot resources to multiple nodes, the delay jitter of the data link network is the average of the delay jitters of each node j. The average delay jitter at this time, that is, the fitness function fit, is:
[0046]
[0047] In formula (5), m is the number of nodes with time slot requirements in the data link network, var j The delay jitter generated when allocating time slots to node j.
[0048] The method for updating and obtaining the optimal time slot position in step 5 is:
[0049] For each updated Harris Hawk position X, the delay jitter result calculated by formula (3) is compared with the delay jitter result corresponding to the Harris Hawk position X in step 3 or step 4, and the Harris Hawk position corresponding to the smaller delay jitter is taken as the current optimal time slot position.
[0050] The update formula for the escape energy factor E in step 6 is as follows:
[0051] E0=2·rand-1
[0052]
[0053] In formula (6), E is the escape energy factor, E0 is the random factor, rand represents a random number in (0, 1), t represents the number of iterations of the current program, and T represents the maximum number of iterations.
[0054] The specific method of the step 7, which matches the corresponding search strategy according to the escape energy factor E updated in step 6, and updates the position of the Harris Hawk, includes two stages: the development stage and the exploration stage;
[0055] The escape energy factor E is used to regulate the transition between the exploitation phase and the exploration phase. When |E|≥1, it is the exploration phase, and a global search will be conducted, indicating that the entire Harris hawk population will surround the target prey as the prey moves throughout the search space. When |E|<1, it will switch to the exploitation phase, which represents a local search.
[0056] (1) Exploration stage:
[0057] All Harris hawks appear randomly at a certain position in the search space in the initial state. In the exploration phase, Harris hawks will search the space [lb, ub] to find prey, lb is the lower bound of the exploration space, and ub is the upper bound of the exploration space; let q be a random number located in (0,1), and update the position with probability q during iteration, and update the position of Harris hawks according to the following two strategies to surround the target prey: ① When q<0.5, each hawk will update its position according to the average position of the Harris hawk population and the position of the prey; ② When q≥0.5, Harris hawks will update their positions based on their positions in the previous round and the positions of other members of the Harris hawk population. The mathematical formula is as follows:
[0058]
[0059] Among them, X m (t) represents the average position of the Harris hawk population at the tth iteration, X i(t) represents the position of the i-th hawk in the t-th iteration, and N is the total number of hawks. In formula (7), X(t+1) and X(t) represent the positions of Harris hawks after the t+1-th and t-th iterations, respectively. rand (t) is the position of another eagle randomly selected from the population, X rabbit (t) represents the position of the prey at the tth iteration, that is, the currently known global optimal position during the tth iteration, X m (t) is the average position of the Harris hawk population at the tth iteration in formula (1), where r1, r2, r3, r4 and q are all random numbers in the interval (0, 1), and ub and lb are the upper and lower bounds of the exploration space, respectively;
[0060] (2) Development stage
[0061] After completing the exploration phase and encircling the target prey, the Harris Hawk population will attack in the development phase. In the development phase, the Harris Hawk performs a surprise attack on the expected prey based on the detection in the exploration phase; the Harris Hawk's attack behavior is simulated based on the escape behavior of the prey and the Harris Hawk's soft siege, hard siege, fast dive soft siege, and fast dive hard siege. The strategy to be used is determined by the escape energy factor E and the random number r∈(0,1). r represents the probability of successful escape of the prey. When r<0.5, it means that the prey escapes successfully, and when r≥0.5, it means that the prey fails to escape; when |E|≥0.5, soft siege is performed, and when |E|<0.5, hard siege is performed; the following is a detailed description of the four attack strategies:
[0062] a) Soft siege
[0063] When |E|≥0.5, r≥0.5, the prey has enough energy to escape the capture by jumping, and the Harris Hawk will gradually consume the prey's energy, and then choose the best position to pounce and capture the prey; the formula for updating the position is as follows:
[0064] X(t+1)=ΔX(t)-E|J·X rabbit (t)-X(t)| (8)
[0065] ΔX(t)=X rabbit (t)-X(t) (9)
[0066] J=2(1-rand) (10)
[0067] In formula (8), X(t+1) and X(t) represent the positions of the Harris hawk after the t+1th and tth iterations, respectively. In formula (9), ΔX(t) represents the difference between the positions of the prey and the Harris hawk after the tth iteration, that is, the distance between the optimal individual and the current individual after the tth iteration. In formula (10), J represents the random jump intensity of the prey during the escape process. The J value changes randomly in each iteration to simulate the movement properties of the prey. rand is a random number between (0, 1);
[0068] b) Hard siege
[0069] When |E|<0.5, r≥0.5, the prey does not have enough energy to escape and is captured by Harris's hawk. The position is updated as follows:
[0070] X(t+1)=X rabbit (t)-E|ΔX(t)| (11)
[0071] c) Rapid Dive Soft Siege
[0072] When |E|≥0.5 and r<0.5, the prey has enough energy to escape the encirclement, so the Harris Hawk population will form a more intelligent soft encirclement and gradually correct the position and direction of the Harris Hawk according to the prey's deceptive behavior, thereby selecting the best position for the Harris Hawk to capture the prey:
[0073] The position of the Harris Hawk is obtained by equation (12) and equation (13) respectively, and equation (14) is obtained. The best position of the Harris Hawk is searched according to equation (14). When the position obtained by equation (12) is invalid, it means f(y)>f(X(t)). Then equation (13) is used to obtain the position of the Harris Hawk. The escape mode and jumping action of the prey are simulated, the levy flight function LF is introduced, and the position of the Harris Hawk is updated. The obtained new position is substituted into the delay jitter calculated in step 3 and step 4 respectively, and the calculated delay jitter is compared with the delay jitter corresponding to the previous position. The position corresponding to the lowest delay jitter is the iterative current optimal position.
[0074] Y=X rabbit (t)-E|J·X rabbit (t)-X(t)| (12)
[0075] Z=Y+S·LF(D) (13)
[0076]
[0077] In formula (14), f() is the fitness function. In formula (13), D is the problem dimension, S is a D-dimensional random vector, and LF is the levy flight function, as shown in formula (15):
[0078]
[0079] In equations (15) and (16), μ and υ are random values in (0,1), and β is a default constant set to 1.5;
[0080] d) Fast Dive Hard Siege
[0081] When |E|<0.5 and r<0.5, the prey is not physically fit, but still has a chance to escape. Harris's hawks use progressive and rapid dives to surround the prey. The Harris's hawks try to shorten the distance between them and the average position of the target prey, using the following hunting strategies:
[0082] Y=X rabbit (t)-E|J·X rabbit (t)-X m (t)| (17)
[0083] Z=Y+S·LF(D) (18)
[0084]
[0085] A time slot allocation system based on a strategic Harris Hawk optimization algorithm, comprising:
[0086] Parameter initialization module: used in step 1 to step 2, according to the business requirements of each node in the data link network, determine the business parameters, the business parameters include: the number of nodes m requiring time slots, the lower bound lb and upper bound ub of the number of idle time slots, and the time slot resource requirement n; initialize algorithm parameters, including: Harris Hawk group size M, Harris Hawk position X, escape energy factor E, and maximum number of iterations T;
[0087] Delay jitter calculation module: used in step 3 to step 4 to calculate the delay jitter when a single node allocates time slot resources, and calculate the average value of the delay jitter of each node when multiple nodes allocate time slot resources;
[0088] Optimal time slot update module: used in step 5 to update the optimal time slot position according to the calculation result of delay jitter;
[0089] Energy factor update module: used in step 6 to update the escape energy factor E according to the contraction exponential function;
[0090] Strategic Harris Hawk position update module: used in step 7, continuously updates the position of the Harris Hawk according to the energy factor matching corresponding search strategy;
[0091] Optimal time slot allocation module: used in step 8, when the number of iterations does not reach the maximum number of iterations T, repeat steps 3 to 7, and add 1 to the number of iterations; when the number of iterations reaches the maximum number of iterations, stop the iteration; each iteration calculates the corresponding delay jitter through step 3 or step 4, and each iteration obtains a set of time slot allocation schemes, and the time slot allocation scheme corresponding to the minimum delay jitter is the optimal time slot allocation scheme; after reaching the maximum number of iterations T, the result of the optimal time slot after T iterations is output.
[0092] A time slot allocation device based on a strategic Harris Hawk optimization algorithm, comprising:
[0093] Memory for storing computer programs;
[0094] The processor is used to implement the time slot allocation method based on the strategic Harris Hawk optimization algorithm described in steps 1 to 8 when executing the computer program.
[0095] A computer-readable storage medium is used to store a computer program. When the computer program is executed by a processor, it can implement an optimal solution for time slot allocation based on the time slot allocation method based on the strategic Harris Hawk optimization algorithm described in steps 1 to 8.
[0096] Compared with the prior art, the beneficial effects of the present invention are:
[0097] 1. The present invention adopts a strategy of updating the escape energy factor by introducing a shrinking exponential function based on the Harris Hawk Optimization Algorithm (HHO), which avoids the imbalance between global search and local search caused by the linear decreasing characteristic of the escape energy factor in the iteration of the Harris Hawk Optimization Algorithm, making it easy to fall into the local search and reduce the accuracy of the solution. Thereby accelerating the convergence speed at the end of the iteration, improving the algorithm performance, being able to quickly and accurately find the optimal time slot allocation scheme for the data link, and being able to significantly reduce the delay jitter, and being able to quickly and accurately find the optimal solution for time slot allocation.
[0098] 2. The present invention uses delay jitter to evaluate the uniformity of time slot allocation. The smaller the interval representing the time slot allocation is, the closer it is to the adjacent time slot interval of the theoretical optimal time slot allocation. It can be seen from the simulation data that the iterative convergence speed of the time slot allocation method is faster, so that the time slot allocation method can achieve maximum performance, that is, it can find the optimal time slot allocation scheme faster and more effectively.
[0099] 3. The present invention adopts a data link time slot allocation method based on the strategic Harris Hawk optimization algorithm to complete the time slot resource allocation work. Compared with the existing technology, it can better help network planners to quickly make corresponding time slot plan according to the combat mission situation.
[0100] In summary, the present invention has efficient optimization capability, can quickly and accurately find the optimal solution for time slot allocation and can effectively deal with problems such as time slot resource allocation; the present invention can greatly reduce delay jitter and quickly find the optimal time slot allocation strategy, thereby greatly improving the combat effectiveness of tactical data links and the stability of information transmission. BRIEF DESCRIPTION OF THE DRAWINGS
[0101] Figure 1 It is the main flow chart of the SHHO-SAA algorithm implementation of the present invention.
[0102] Figure 2 This is a graph showing the relationship between the number of iterations and delay jitter during single-node time slot allocation.
[0103] Figure 3 Relationship between the number of iterations and delay jitter during multi-node time slot allocation.
[0104] Figure 4 Stability verification diagram of time slot allocation algorithm.
[0105] Figure 5 Correlation diagram between the number of idle time slots and latency. DETAILED DESCRIPTION
[0106] The technical solution of the present invention is described in detail below with reference to the accompanying drawings and embodiments.
[0107] See also Figure 1 , Step 1: Determine the service parameters according to the service requirements of each node in the data link network, the service parameters include: the number of nodes m requiring time slots, the lower bound lb and upper bound ub of the number of idle time slots, and the time slot resource requirement n;
[0108] Step 2: Initialize the algorithm parameters, including: Harris Hawk group size M, Harris Hawk position X, escape energy factor E, and maximum number of iterations T;
[0109] Step 3: Calculate the delay jitter when allocating time slot resources to a single node according to the position X of the Harris Hawk. The solution with the minimum delay jitter is the optimal and uniform time slot solution.
[0110] Step 4: Calculate the average value of the delay jitter of each node when allocating time slot resources to multiple nodes according to the position X of the Harris Hawk. The solution with the minimum average value of the delay jitter of each node is the optimal and uniform time slot solution for each node.
[0111] Step 5: According to the delay jitter results calculated in Step 3 and Step 4, the optimal time slot position is continuously updated and iterated;
[0112] Step 6: Update the escape energy factor E according to the contraction exponential function;
[0113] Step 7: Match the corresponding search strategy according to the escape energy factor E updated in step 6, and update the position X of the Harris Hawk;
[0114] Step 8: When the number of iterations has not reached the maximum number of iterations T, repeat steps 3 to 7, and add 1 to the number of iterations; when the number of iterations reaches the maximum number of iterations, stop iterating; each iteration calculates the corresponding delay jitter through step 3 or step 4, and each iteration obtains a set of time slot allocation schemes, and the time slot allocation scheme corresponding to the minimum delay jitter is the optimal time slot allocation scheme; after reaching the maximum number of iterations T, the optimal result obtained after T iterations is output, that is, the optimal and uniform time slot solution is output.
[0115] The delay jitter calculation process when a single node allocates time slot resources in step 3 is as follows:
[0116] First, the time frame T with a period length of N f , denoted as T f ={T1, T2, ..., T N}, where Ti represents the position of the i-th time slot in a time frame; the idle time slot is L, L = {I1, I2, ···, I S}, (S≤N) means that there are S idle time slot resources in the cycle length N. When N=S, the instantaneous frame T f is equivalent to an idle time slot L, which means that a time frame with a period length of N will have S idle time slots L, and n is randomly selected from the S idle time slots L j The optimal idle time slot L is allocated to node j, expressed as: X j ={x 1j , x 2j ,···,x nj}(n≤S≤N), where X j It is called the time slot allocation scheme. In the time slot allocation scheme, the adjacent time slot interval of the theoretically optimal time slot allocation is:
[0117] P=S / n j (1)
[0118] For time slot allocation scheme X j , the distance between adjacent time slots actually allocated to node j is:
[0119]
[0120] In formula (2), represents the interval between adjacent time slots assigned to node j, where represents the position of the i-th time slot allocated to node j. When i=n, that is, The interval between the last time slot allocated in the current time frame and the first time slot allocated to the node in the next time frame is determined by the interval D between adjacent time slots. i The set formed can be recorded as D = {D1, D2, ···, D n}, when D1=D2=···=D n =P, it means that the time slot allocation scheme is optimal at this time, the allocated time slot resources are in a completely uniform state and the delay jitter is 0. However, in actual use, each node combat member allocates time slots according to its business time slot demand, and the uniformity of the allocated time slots cannot reach this level. Therefore, let the adjacent time slot interval D in the time slot allocation scheme be i The adjacent time slot interval P value is infinitely close to the theoretical optimal time slot allocation;
[0121] The delay jitter var to node j j To solve:
[0122]
[0123] According to formula (3), is the interval between the ith adjacent time slots assigned to node j, n j is the time slot resource requirement of the jth node. According to formula (1), P is the total idle time slots S in a frame divided by the number of time slots n that node j needs to allocate j , that is, P is the adjacent time slot interval of the theoretically optimal time slot allocation.
[0124] The process of calculating the average value of multi-node delay jitter in step 4 is as follows:
[0125] When there are m network node members in the data link network that need to send or receive business messages, n j is the time slot resource requirement for sending and receiving service messages of the jth node, so the total time slot requirement Num for each network node j in the data link network max The formula to be satisfied is as follows:
[0126]
[0127] When allocating time slot resources to multiple nodes that need to send or receive business messages, the delay jitter of the data link network is the average of the delay jitter of each node j. The average delay jitter at this time, that is, the fitness function fit, is:
[0128]
[0129] In formula (5), m is the number of nodes with time slot requirements in the data link network, var j The delay jitter generated when allocating time slots to node j.
[0130] The method for updating and obtaining the optimal time slot position in step 5 is:
[0131] For each updated Harris Hawk position X, the delay jitter result calculated by formula (3) is compared with the delay jitter result corresponding to the Harris Hawk position X in step 3 or step 4, and the Harris Hawk position corresponding to the smaller delay jitter is taken as the current optimal time slot position.
[0132] The update formula for the escape energy factor E in step 6 is as follows:
[0133] E0=2·rand-1
[0134]
[0135] In formula (6), E is the escape energy factor, E0 is the random factor, rand represents a random number in (0, 1), t represents the number of iterations of the current program, and T represents the maximum number of iterations.
[0136] The specific method of the step 7, which matches the corresponding search strategy according to the escape energy factor E updated in step 6, and updates the position of the Harris Hawk, includes two stages: the development stage and the exploration stage;
[0137] The escape energy factor E is used to regulate the transition between the exploitation phase and the exploration phase. When |E|≥1, it is the exploration phase, and a global search will be conducted, indicating that the entire Harris hawk population will surround the target prey as the prey moves throughout the search space. When |E|<1, it will switch to the exploitation phase, which represents a local search.
[0138] (1) Exploration stage:
[0139] All Harris hawks appear randomly at a certain position in the search space in the initial state. In the exploration phase, Harris hawks will search the space [lb, ub] to find prey, lb is the lower bound of the exploration space, and ub is the upper bound of the exploration space; let q be a random number located in (0,1), and update the position with probability q during iteration, and update the position of Harris hawks according to two strategies to surround the target prey: ① When q<0.5, each hawk will update its position according to the average position of the Harris hawk population and the position of the prey; ② When q≥0.5, Harris hawks will update their positions based on their positions in the previous round and the positions of other members of the Harris hawk population. The mathematical formula is as follows:
[0140]
[0141] Among them, X m (t) represents the average position of the Harris hawk population at the tth iteration, X i(t) represents the position of the i-th hawk in the t-th iteration, and N is the total number of hawks. In formula (7), X(t+1) and X(t) represent the positions of Harris hawks after the t+1-th and t-th iterations, respectively. rand (t) is the position of another eagle randomly selected from the population, X rabbit (t) represents the position of the prey at the tth iteration, that is, the currently known global optimal position during the tth iteration, X m (t) is the average position of the Harris hawk population at the tth iteration in formula (1), where r1, r2, r3, r4 and q are all random numbers in the interval (0, 1), and ub and lb are the upper and lower bounds of the exploration space, respectively;
[0142] (2) Development stage
[0143] After completing the exploration phase and encircling the target prey, the Harris Hawk population will attack in the development phase. In the development phase, the Harris Hawk performs a surprise attack on the expected prey based on the detection in the exploration phase; the Harris Hawk's attack behavior is simulated based on the escape behavior of the prey and the Harris Hawk's soft siege, hard siege, fast dive soft siege, and fast dive hard siege. The strategy to be used is determined by the escape energy factor E and the random number r∈(0,1). r represents the probability of successful escape of the prey. When r<0.5, it means that the prey escapes successfully, and when r≥0.5, it means that the prey fails to escape; when |E|≥0.5, soft siege is performed, and when |E|<0.5, hard siege is performed; the following is a detailed description of the four attack strategies:
[0144] a) Soft siege
[0145] When |E|≥0.5, r≥0.5, the prey has enough energy to escape the capture by jumping, and the Harris Hawk will gradually consume the prey's energy, and then choose the best position to pounce and capture the prey; the formula for updating the position is as follows:
[0146] X(t+1)=ΔX(t)-E|J·X rabbit (t)-X(t)| (8)
[0147] ΔX(t)=X rabbit (t)-X(t) (9)
[0148] J=2(1-rand) (10)
[0149] In formula (8), X(t+1) and X(t) represent the positions of the Harris hawk after the t+1th and tth iterations, respectively. In formula (9), ΔX(t) represents the difference between the positions of the prey and the Harris hawk after the tth iteration, that is, the distance between the optimal individual and the current individual after the tth iteration. In formula (10), J represents the random jump intensity of the prey during the escape process. The J value changes randomly in each iteration to simulate the movement properties of the prey. rand is a random number between (0, 1);
[0150] b) Hard siege
[0151] When |E|<0.5, r≥0.5, the prey does not have enough energy to escape and is captured by Harris's hawk. The position is updated as follows:
[0152] X(t+1)=X rabbit (t)-E|ΔX(t)| (11)
[0153] c) Rapid Dive Soft Siege
[0154] When |E|≥0.5 and r<0.5, the prey has enough energy to escape the encirclement, so the Harris Hawk population will form a more intelligent soft encirclement and gradually correct the position and direction of the Harris Hawk according to the prey's deceptive behavior, thereby selecting the best position for the Harris Hawk to capture the prey:
[0155] The position of the Harris Hawk is obtained by equation (12) and equation (13) respectively, and equation (14) is obtained. The best position of the Harris Hawk is searched according to equation (14). When the position obtained by equation (12) is invalid, it means f(y)>f(X(t)). Then equation (13) is used to obtain the position of the Harris Hawk. The escape mode and jumping action of the prey are simulated, the levy flight function LF is introduced, and the position of the Harris Hawk is updated. The obtained new position is substituted into the delay jitter calculated in step 3 and step 4 respectively, and the calculated delay jitter is compared with the delay jitter corresponding to the previous position. The position corresponding to the lowest delay jitter is the iterative current optimal position.
[0156] Y=X rabbit (t)-E|J·X rabbit (t)-X(t)| (12)
[0157] Z=Y+S·LF(D) (13)
[0158]
[0159] In formula (14), f() is the fitness function. In formula (13), D is the problem dimension, S is a D-dimensional random vector, and LF is the levy flight function, as shown in formula (15):
[0160]
[0161] In equations (15) and (16), μ and υ are random values in (0,1), and β is a default constant set to 1.5;
[0162] d) Fast Dive Hard Siege
[0163] When |E|<0.5 and r<0.5, the prey is not physically fit, but still has a chance to escape. Harris's hawks use progressive and rapid dives to surround the prey. The Harris's hawks try to shorten the distance between them and the average position of the target prey, using the following hunting strategies:
[0164] Y=X rabbit (t)-E|J·X rabbit (t)-X m (t)| (17)
[0165] Z=Y+S·LF(D) (18)
[0166]
[0167] The application effect of the present invention is described in detail below in conjunction with simulation.
[0168] The simulation software used in the present invention is MATLAB R2021a, in which the command line window prints the generated simulation data, the global optimal fitness data in the simulation is the delay jitter index in the present invention, the position data of the Harris Hawk is the optimal time slot allocation scheme of the present invention, and the interval between the Harris Hawk positions is the interval between the allocated time slots. This interval between two time slots determines the uniformity of the time slot resources allocated by the time slot allocation algorithm.
[0169] Simulation and verification of time slot allocation method:
[0170] a. Feasibility of the method
[0171] See also Figure 2 , Figure 3 First, a time slot is allocated to a network node in the data link Link 16. Assuming that the time slot demand of the network node is 5 time slots, 5 time slot resources are allocated to the node in 1536 time slots. The time slot allocation simulation experiment parameters are set as follows: Harris Hawk population size N = 50, number of iterations T = 100, number of allocated time slot resources dim = 5, search lower bound lb = 0, search upper bound ub = 1535. The global delay jitter simulated in this experiment is the delay jitter obtained by formula 5.
[0172] See also Figure 2When the SHHO-SAA time slot allocation method allocates time slot resources for a single node, the delay jitter converges to 0.16 after 45 iterations. And the SHHO-SAA algorithm iterates 200 rounds and only takes 0.367s. The present invention is much better than the result obtained by the time slot allocation algorithm based on the binary tree time slot pool, and can meet the real-time requirements of the tactical data link.
[0173] At this time, 5 time slots are allocated to a node member in the data link network through the SHHO-SAA time slot allocation algorithm. The optimal time slot allocation schemes are X AP ={307, 614, 921, 1229, 1536}. The time slot intervals are all: P = {307, 307, 308, 307, 307}. The time slot intervals obtained by allocating time slots by the SHHO-SAA algorithm are consistent with the optimal time slot interval. The algorithm has a small number of iterations and consumes less time to find the optimal time slot allocation solution. The obtained time slot intervals are uniform and close to the optimal time slot interval. Compared with the classic binary tree time slot allocation algorithm, the binary tree time slot allocation algorithm will cause a waste of time slot resources when allocating time slot resources that are not a power of 2. The algorithm in this article can accurately allocate the required time slot resources according to the specific business needs of the network nodes. Therefore, the data link time slot allocation method based on the strategic Harris Hawk optimization algorithm of the present invention has certain advantages in data link time slot resource allocation.
[0174] See also Figure 3 , the SHHO-SAA time slot allocation method proposed in the present invention is used to allocate time slot resources to multiple nodes in the data link. Assume that there are currently four network nodes A, B, C, and D that have the need to receive and send business messages. The business time slot requirements of the four nodes are: n = {2, 3, 6, 8}. Then, time slot resources are randomly allocated to these four nodes in 512 idle time slots according to their corresponding business needs. The multi-node time slot allocation simulation parameters are set as: Harris Hawk population size N = 300, number of iterations T = 300, search lower bound lb = 0, search upper bound ub = 512.
[0175] When the SHHO-SAA time slot allocation algorithm iterates to 190 rounds, the average delay jitter converges to 0.174. At this time, the optimal time slot allocation schemes allocated to the four nodes A, B, C, and D are: X1 = {1, 257}, X2 = {80, 251, 421}, X3 = {40, 125, 210, 295, 381, 466}, X4 = {63, 127, 191, 256, 320, 384, 448, 512}. The time slot intervals allocated to nodes A, B, C, and D are: P1 = {256, 256}, P2 = {171, 170, 171}, P3 = {85, 85, 85, 86, 85, 86}, P4 = {64, 64, 65, 64, 64, 64, 63}. Theoretically, the optimal time slot intervals of the four nodes should be: P1=256, P2=170.67, P3=85.33, P4=64. The adjacent time slot intervals allocated to each node obtained by experimental simulation are infinitely close to the theoretical optimal time slot interval. Therefore, the SHHO-SAA time slot allocation method proposed in the present invention is to solve the problem of multi-node time slot resource allocation. It is both efficient and very stable. The results of time slot allocation tend to be optimal and meet the technical indicators of uniformity of adjacent time slot intervals. Therefore, the fast optimization time slot allocation method proposed in the present invention is very suitable for real electronic countermeasure environments. The time slot allocation optimization method can quickly make dynamic optimization of network time slot resources for allocation according to the specific time slot requirements of the service, and can achieve high-quality and effective message transmission.
[0176] b. Algorithm stability
[0177] See also Figure 4 The stability of the SHHO-SAA time slot allocation method is verified by solving the stability formula.
[0178] The stability of the time slot allocation method is a crucial factor for reallocating time slot resources according to the specific changes in the battlefield in the electronic countermeasure environment. This paper verifies the stability of the algorithm by using multiple experiments to observe the number of optimal time slot allocation algorithms. The solution formula for stability is shown in formula (20). The larger the Stability value, the more stable the time slot allocation algorithm.
[0179]
[0180] In formula 20, Q best It is the number of experiments with the same set of parameters to obtain the optimal solution, and Q is the total number of experiments with the same set of parameters.
[0181] In order to verify the stability of the SHHO-SAA time slot allocation method, a verification experiment is designed. The specific experimental parameters are set as follows: Harris Hawk population size N = 50, number of iterations T = 200, number of allocated time slot resources dim = 5, where the idle time slots are S = {128, 256, 512, 1536}. Taking the idle time slot S = 128 as an example, the lower bound lb = 0 is searched at this time, and the upper bound ub = 128 is searched, and so on. Each set of data will be repeated 50 times, and then the frequency of the time slot allocation algorithm to obtain the optimal solution is counted, and the stability of the algorithm under each set of data is calculated by formula 20.
[0182] pass Figure 4 From the stability verification diagram, we can see that the SHHO-SAA algorithm can maintain high stability during the experiment, and can also obtain suboptimal solutions when the optimal solution is not obtained. Therefore, the SHHO-SAA time slot allocation algorithm proposed in this paper is very suitable for real electronic countermeasure environments. The optimization algorithm stably calculates the optimal time slot allocation scheme, which can better complete the dynamic optimization of network time slot resource allocation.
[0183] c. The impact of the number of idle time slots on the algorithm delay
[0184] See also Figure 5 ,The effect of the number of idle time slots on the algorithm delay is verified through ,simulation experiments;
[0185] In order to explore the influence of the number of idle time slots on the time slot allocation efficiency and delay jitter when the SHHO-SAA time slot allocation method of the present invention allocates time slot resources according to the business time slot requirements of the combat unit. A simulation experiment is designed to study the relationship between the number of idle time slots and delay jitter. The parameters of this simulation experiment are set as: the number of time slot resources allocated to a single node dim=15, the Harris Hawk group size N=50, and the number of iterations T=100. For the number of idle time slots, the search lower bound remains unchanged, and the search upper bound continues to increase, and the corresponding number of idle time slots continues to increase.
[0186] pass Figure 5 From the correlation diagram of the number of idle time slots and delay, it can be seen that when the number of iterations T = 100, the delay jitter decreases with the increase of the number of idle time slots and finally tends to be flat. The experimental simulation results show that when the service time slot demand of the node is certain, the more idle time slots there are, the better the uniformity of the time slots allocated by the time slot allocation method proposed in the present invention will be.
[0187] In summary, the data link time slot allocation method based on the strategic Harris Hawk optimization algorithm proposed in the present invention has efficient optimization capability, can quickly and accurately find the optimal solution for time slot allocation, and can effectively handle problems such as time slot resource allocation. This method can greatly reduce delay jitter and quickly find the optimal time slot allocation strategy, thereby greatly improving the combat effectiveness of tactical data links and the stability of information transmission.
Claims
1. A data link time slot allocation method based on a strategic Harris Hawk optimization algorithm, characterized in that: The specific steps include: Step 1: Determine the service parameters according to the service requirements of each node in the data link network, wherein the service parameters include: the number of nodes m requiring time slots, the lower bound lb and upper bound ub of the number of idle time slots, and the required amount of time slot resources n; Step 2: Initialize the algorithm parameters, including: Harris Hawk group size M, Harris Hawk position X, escape energy factor E, and maximum number of iterations T; Step 3: Calculate the delay jitter when allocating time slot resources to a single node according to the position X of the Harris Hawk. The solution with the minimum delay jitter is the optimal and uniform time slot solution. Step 4: Calculate the average value of the delay jitter of each node when allocating time slot resources to multiple nodes according to the position X of the Harris Hawk. The solution with the minimum average value of the delay jitter of each node is the optimal and uniform time slot solution for each node. Step 5: According to the delay jitter results calculated in Step 3 and Step 4, the optimal time slot position is continuously updated and iterated; Step 6: Update the escape energy factor E according to the contraction exponential function; Step 7: Match the corresponding search strategy according to the escape energy factor E updated in step 6, and update the position X of the Harris Hawk; Step 8: When the number of iterations has not reached the maximum number of iterations T, repeat steps 3 to 7, and add 1 to the number of iterations; when the number of iterations reaches the maximum number of iterations, stop iterating; each iteration calculates the corresponding delay jitter through step 3 or step 4, and each iteration obtains a set of time slot allocation schemes, and the time slot allocation scheme corresponding to the minimum delay jitter is the optimal time slot allocation scheme; after reaching the maximum number of iterations T, the optimal result obtained after T iterations is output, that is, the optimal and uniform time slot solution is output.
2. The data link time slot allocation method based on the strategic Harris Hawk optimization algorithm according to claim 1 is characterized in that: The delay jitter calculation process when a single node allocates time slot resources in step 3 is as follows: First, the time frame T with a period length of N f , denoted as T f ={T1, T2, ..., T N }, where Ti represents the position of the i-th time slot in a time frame; the idle time slot is L, L = {I1, I2, ..., I S }, (S≤N) means that there are S idle time slot resources in the cycle length N. When N=S, the instantaneous frame T f is equivalent to an idle time slot L, which means that a time frame with a period length of N will have S idle time slots L, and n is randomly selected from the S idle time slots L j The optimal idle time slot L is allocated to node j, expressed as: X j ={x 1j , x 2j , …, x nj }(n≤S≤N), where X j It is called the time slot allocation scheme. In the time slot allocation scheme, the adjacent time slot interval of the theoretically optimal time slot allocation is: P=S / n j (1) For time slot allocation scheme X j , the distance between adjacent time slots actually allocated to node j is: In formula (2), represents the interval between adjacent time slots assigned to node j, where represents the position of the i-th time slot allocated to node j. When i=n, that is, The interval between the last time slot allocated in the current time frame and the first time slot allocated to the node in the next time frame is determined by the interval D between adjacent time slots. i The set formed can be recorded as D = {D1, D2, ..., D n }, when D1=D2=…=D n =P, it means that the time slot allocation scheme is optimal at this time, the allocated time slot resources are in a completely uniform state and the delay jitter is 0. However, in actual use, each node combat member allocates time slots according to its business time slot demand, and the uniformity of the allocated time slots cannot reach this level. Therefore, let the adjacent time slot interval D in the time slot allocation scheme be i The adjacent time slot interval P value is infinitely close to the theoretical optimal time slot allocation; The delay jitter var to node j j To solve: According to formula (3), is the interval between the ith adjacent time slots assigned to node j, n j is the time slot resource requirement of the jth node. According to formula (1), P is the total idle time slots S in a frame divided by the number of time slots n that node j needs to allocate j , that is, P is the adjacent time slot interval of the theoretically optimal time slot allocation.
3. The data link time slot allocation method based on the strategic Harris Hawk optimization algorithm according to claim 1 is characterized in that: The process of calculating the average value of multi-node delay jitter in step 4 is as follows: When there are m network node members in the data link network that need to send or receive business messages, n j is the time slot resource requirement for sending and receiving service messages of the jth node, so the total time slot requirement Num for each network node j in the data link network max The formula to be satisfied is as follows: When allocating time slot resources to multiple nodes, the delay jitter of the data link network is the average of the delay jitters of each node j. The average delay jitter at this time, that is, the fitness function fit, is: In formula (5), m is the number of nodes with time slot requirements in the data link network, var j The delay jitter generated when allocating time slots to node j.
4. The data link time slot allocation method based on the strategic Harris Hawk optimization algorithm according to claim 1 is characterized in that: The method for updating and obtaining the optimal time slot position in step 5 is: For each updated Harris Hawk position X, the delay jitter result calculated by formula (3) is compared with the delay jitter result corresponding to the Harris Hawk position X in step 3 or step 4, and the Harris Hawk position corresponding to the smaller delay jitter is taken as the current optimal time slot position.
5. The data link time slot allocation method based on the strategic Harris Hawk optimization algorithm according to claim 1 is characterized in that: The update formula for the escape energy factor E in step 6 is as follows: E0=2·rand-1 In formula (6), E is the escape energy factor, E0 is the random factor, rand represents a random number in (0, 1), t represents the number of iterations of the current program, and T represents the maximum number of iterations.
6. The data link time slot allocation method based on the strategic Harris Hawk optimization algorithm according to claim 1 is characterized in that: The specific method of the step 7, which matches the corresponding search strategy according to the escape energy factor E updated in step 6, and updates the position of the Harris Hawk, includes two stages: the development stage and the exploration stage; The escape energy factor E is used to regulate the transition between the exploitation phase and the exploration phase. When |E|≥1, it is the exploration phase, and a global search will be conducted, indicating that the entire Harris hawk population will surround the target prey as the prey moves throughout the search space. When |E|<1, it will switch to the exploitation phase, which represents a local search. (1) Exploration stage: All Harris hawks appear randomly at a certain position in the search space in the initial state. In the exploration phase, Harris hawks will search the space [lb, ub] to find prey, lb is the lower bound of the exploration space, and ub is the upper bound of the exploration space; let q be a random number located in (0,1), and update the position with probability q during iteration, and update the position of Harris hawks according to the following two strategies to surround the target prey: ① When q<0.5, each hawk will update its position according to the average position of the Harris hawk population and the position of the prey; ② When q≥0.5, Harris hawks will update their positions based on their positions in the previous round and the positions of other members of the Harris hawk population. The mathematical formula is as follows: Among them, X m (t) represents the average position of the Harris hawk population at the tth iteration, X i (t) represents the position of the i-th hawk in the t-th iteration, and N is the total number of hawks. In formula (7), X(t+1) and X(t) represent the positions of Harris hawks after the t+1-th and t-th iterations, respectively. rand (t) is the position of another eagle randomly selected from the population, X rabbit (t) represents the position of the prey at the tth iteration, that is, the currently known global optimal position during the tth iteration, X m (t) is the average position of the Harris hawk population at the tth iteration in formula (1), where r1, r2, r3, r4 and q are all random numbers in the interval (0, 1), and ub and lb are the upper and lower bounds of the exploration space, respectively; (2) Development stage After completing the exploration phase and encircling the target prey, the Harris Hawk population will attack in the development phase. In the development phase, the Harris Hawk performs a surprise attack on the expected prey based on the detection in the exploration phase; the Harris Hawk's attack behavior is simulated based on the escape behavior of the prey and the Harris Hawk's soft siege, hard siege, fast dive soft siege, and fast dive hard siege. The strategy to be used is determined by the escape energy factor E and the random number r∈(0,1). r represents the probability of successful escape of the prey. When r<0.5, it means that the prey escapes successfully, and when r≥0.5, it means that the prey fails to escape; when |E|≥0.5, soft siege is performed, and when |E|<0.5, hard siege is performed; the following is a detailed description of the four attack strategies: a) Soft siege When |E|≥0.5, r≥0.5, the prey has enough energy to escape the capture by jumping, and the Harris Hawk will gradually consume the prey's energy, and then choose the best position to pounce and capture the prey; the formula for updating the position is as follows: X(t+1)=ΔX(t)-E|J·X rabbit (t)-X(t)| (8) ΔX(t)=X rabbit (t)-X(t) (9) J=2(1-rand) (10) In formula (8), X(t+1) and X(t) represent the positions of the Harris hawk after the t+1th and tth iterations, respectively. In formula (9), ΔX(t) represents the difference between the positions of the prey and the Harris hawk after the tth iteration, that is, the distance between the optimal individual and the current individual after the tth iteration. In formula (10), J represents the random jump intensity of the prey during the escape process. The J value changes randomly in each iteration to simulate the movement properties of the prey. rand is a random number between (0, 1); b) Hard siege When |E|<0.5, r≥0.5, the prey does not have enough energy to escape and is captured by Harris's hawk. The position is updated as follows: X(t+1)=X rabbit (t)-E|ΔX(t)| (11) c) Rapid Dive Soft Siege When |E|≥0.5 and r<0.5, the prey has enough energy to escape the encirclement, so the Harris Hawk population will form a more intelligent soft encirclement and gradually correct the position and direction of the Harris Hawk according to the prey's deceptive behavior, thereby selecting the best position for the Harris Hawk to capture the prey: The position of the Harris Hawk is obtained by equation (12) and equation (13) respectively, and equation (14) is obtained. The best position of the Harris Hawk is searched according to equation (14). When the position obtained by equation (12) is invalid, it means f(y)>f(X(t)). Then equation (13) is used to obtain the position of the Harris Hawk. The escape mode and jumping action of the prey are simulated, the levy flight function LF is introduced, and the position of the Harris Hawk is updated. The obtained new position is substituted into the delay jitter calculated in step 3 and step 4 respectively, and the calculated delay jitter is compared with the delay jitter corresponding to the previous position. The position corresponding to the lowest delay jitter is the iterative current optimal position. Y=X rabbit (t)-E|J·X rabbit (t)-X(t)| (12) Z=Y+S·LF(D) (13) In formula (14), f() is the fitness function. In formula (13), D is the problem dimension, S is a D-dimensional random vector, and LF is the levy flight function, as shown in formula (15): In equations (15) and (16), μ and υ are random values in (0,1), and β is a default constant set to 1.5; d) Fast Dive Hard Siege When |E|<0.5 and r<0.5, the prey is not physically fit, but still has a chance to escape. Harris's hawks use progressive and rapid dives to surround the prey. The Harris's hawks try to shorten the distance between them and the average position of the target prey, using the following hunting strategies: Y=X rabbit (t)-E|J·X rabbit (t)-X m (t)| (17) Z=Y+S·LF(D) (18) 7. A time slot allocation system based on the strategic Harris Hawk optimization algorithm, characterized in that: include: Parameter initialization module: used in step 1 to step 2, according to the business requirements of each node in the data link network, determine the business parameters, the business parameters include: the number of nodes m requiring time slots, the lower bound lb and upper bound ub of the number of idle time slots, and the time slot resource requirement n; initialize algorithm parameters, including: Harris Hawk group size M, Harris Hawk position X, escape energy factor E, and maximum number of iterations T; Delay jitter calculation module: used in step 3 to step 4 to calculate the delay jitter when a single node allocates time slot resources, and calculate the average value of the delay jitter of each node when multiple nodes allocate time slot resources; Optimal time slot update module: used in step 5 to update and obtain the optimal time slot position according to the calculation result of delay jitter; Energy factor update module: used in step 6 to update the escape energy factor E according to the contraction exponential function; Strategic Harris Hawk position update module: used in step 7, continuously updates the position of the Harris Hawk according to the energy factor matching corresponding search strategy; Optimal time slot allocation module: used in step 8, when the number of iterations does not reach the maximum number of iterations T, repeat steps 3 to 7, and add 1 to the number of iterations; when the number of iterations reaches the maximum number of iterations, stop the iteration; each iteration calculates the corresponding delay jitter through step 3 or step 4, and each iteration obtains a set of time slot allocation schemes, and the time slot allocation scheme corresponding to the minimum delay jitter is the optimal time slot allocation scheme; after reaching the maximum number of iterations T, the result of the optimal time slot after T iterations is output.
8. A time slot allocation device based on a strategic Harris Hawk optimization algorithm, characterized in that: include: Memory for storing computer programs; The processor is used to implement the time slot allocation method based on the strategic Harris Hawk optimization algorithm described in steps 1 to 8 when executing the computer program.
9. A computer-readable storage medium for storing a computer program, characterized in that: When the computer program is executed by the processor, it can realize the optimal solution for time slot allocation based on the time slot allocation method based on the strategic Harris Hawk optimization algorithm described in steps 1 to 8.
Citation Information
Patent Citations
Time division multiple access time slot allocation method based on manta ray algorithm
CN116234017A
