Method for allocating communication interference resources based on genetic algorithm

Abstract

The application relates to a communication interference resource allocation method based on a genetic algorithm and relates to the technical field of communication. The method randomly generates a feasible interference resource allocation scheme to form an initial group by adopting the genetic algorithm, selects an intermediate interference resource allocation scheme close to an optimal interference resource allocation scheme as a selection principle, further generates a new interference resource allocation scheme through crossover, guarantees a diversity group capable of evolution in an iteration process through mutation, and increases the global optimization characteristics. When the fitness reaches a given threshold value or the fitness of an optimal individual and the fitness of the group no longer increase, the iteration is completed, the interference resource allocation scheme of the optimal individual obtained is the optimal interference resource allocation scheme sought by the application, and the interference resource is reasonably allocated under the condition that the interference resource is limited, the target object is subjected to cooperative interference, and the best interference effect is achieved.

Description

Technical Field

[0001] This disclosure relates to the field of communication technology, and in particular to a communication interference resource allocation algorithm based on a genetic algorithm. Background Technology

[0002] With the widespread application of electronic information technology in the military field, electronic warfare has become increasingly important in modern warfare. Electronic jamming is a crucial aspect of electronic warfare. During electronic warfare, both sides face limitations in the types and numbers of jamming resources. How to fully utilize these limited resources to achieve the most ideal electronic jamming effect is a major challenge for command and decision-makers. Researching optimized scheduling algorithms for multi-dimensional jamming resources in real-world combat scenarios is of great significance for improving electronic warfare capabilities.

[0003] Resource allocation is a classic mathematical optimization problem. Its solution can be achieved using traditional mathematical programming methods from operations research, such as convex optimization algorithms. Convex optimization algorithms identify a point that is a local optimum when both the objective and constraint functions are convex functions and the decision variables are convex sets; this point then represents the global optimum. Traditional optimization algorithms provide a framework for addressing perplexing resource allocation problems, but their effectiveness is limited due to the highly nonlinear nature of the objective functions and the high-dimensional solution spaces of many optimization problems. Furthermore, many resource allocation problems are non-convex, making it easy to get trapped in local optima using traditional convex optimization methods. In recent years, with the rapid advancement and widespread adoption of heuristic algorithms, techniques for solving complex optimization problems based on various heuristics have been extensively studied by researchers worldwide. Numerous heuristic algorithms, such as simulated annealing, genetic algorithms, and particle swarm optimization, have been widely applied to solving NP-hard optimization problems such as spectrum allocation.

[0004] Zong Siguang, Liu Tao, and others from the Naval University of Engineering proposed a jamming resource allocation method based on an improved genetic algorithm in their published paper. The authors established an objective function for the jamming effectiveness of networked radar systems, improved the traditional genetic algorithm to address the jamming efficiency problem of networked radars, and used the improved genetic algorithm to solve the problem. This method allocates jammers as the only type of jamming resource, essentially allocating resources based on operational targets, without considering the allocation of resources such as frequency, power, beam, and jammer deployment location. Li Dongsheng, Gao Yang, and others from the School of Electronic Engineering proposed a similar method in their published paper. Based on the improved discrete cuckoo algorithm for jamming resource allocation, the authors modeled the jamming resource allocation problem of a cooperative IFF system with a secondary radar mechanism, designed an evaluation index for jamming effect, and established a model for jamming resource allocation. The model was simplified to a one-to-one or many-to-few model, and an improved discrete cuckoo algorithm was proposed to solve the model. This algorithm models the jamming resource allocation problem from the three domains of time, space, and frequency. However, the time, space, and frequency operating characteristics of the jammer are fixed, and the algorithm only allocates jamming resources under the current operating state without considering the adjustment of the time, space, and frequency operating characteristics of the jammer. Summary of the Invention

[0005] In view of the above-mentioned prior art, the technical problem solved by the present invention is at least to address the shortcomings of the existing interference resource allocation technology, and to provide a communication interference resource allocation algorithm based on genetic algorithm, so as to avoid the waste of interference resources, rationally allocate interference resources under the condition of limited interference resources, and carry out coordinated interference on the target object to achieve the best interference effect.

[0006] To solve the above-mentioned technical problems, the technical solution of the present invention is as follows.

[0007] In a first aspect, the present invention proposes a communication interference resource allocation method based on a genetic algorithm, characterized in that the method includes the following steps:

[0008] Each feasible jamming resource allocation scheme is encoded and treated as an individual, and an initial group is randomly generated. The information expressed by the encoding includes the jammer deployment location, the jammable target at that location, and the jammer's operating status.

[0009] Fitness is determined using the following formula:

[0010]

[0011] Where f is the fitness function, Nt is the number of jammed radio stations, Njmax is the maximum number of jammers, and Nj is the number of jammers used.

[0012] Using the initial population as the starting point for the iteration of the genetic operators, an intermediate population is generated based on fitness, and iterative optimization is carried out through gene crossover and mutation to obtain the optimal interference resource allocation scheme.

[0013] The power of the optimal jamming resource allocation scheme is adjusted so that the jamming targets of each jammer operating in the optimal jamming resource allocation scheme do not overlap, and the jammer operates with the maximum minimum effective jamming power.

[0014] In the above-described method, the method can be used for precise scheduling of communication interference resources across multiple dimensions for collaborators in real-world combat scenarios. First, feasible interference resource allocation schemes are randomly generated to form an initial group. Then, based on fitness, interference resource allocation schemes with higher fitness are selected to form an intermediate group. Next, crossover is used to recombine existing interference resource schemes and generate new groups. Finally, mutation is performed on the groups generated after the crossover operation, generating new feasible interference resource allocation schemes during the iteration process to improve group diversity, avoid premature convergence, and reduce the probability of getting trapped in local optima. When the fitness reaches a given threshold, or when the fitness of the optimal individual and the fitness of the group no longer increase, the iteration is complete, and the interference resource allocation scheme of the optimal individual obtained is the optimal interference resource allocation scheme sought by this invention. This invention uses a genetic algorithm to overcome the problem of excessively high complexity in solving the interference resource scheduling problem. Simulation results in specific implementations show that the method of this invention has the advantages of good optimization effect and fast convergence speed. In the above-described technical solution, the fitness calculation formula reflects two objectives: first, to interfere with as many local radio stations as possible; and second, to save interference resources as much as possible.

[0015] In the above technical solution, one implementation of obtaining the optimal interference resource allocation scheme includes the following steps:

[0016] Fitness is calculated for individuals in the initial population;

[0017] Step P1: Randomly select two individuals from the parent population to compare their fitness, select the individual with the highest fitness and retain it in the intermediate population, and perform this process several times to generate a complete intermediate population;

[0018] The intermediate population is paired up, and each pair of individuals randomly selects the position of a first set number of genes according to a first set probability, and exchanges the gene data of the corresponding positions of the two individuals.

[0019] The basic bit mutation by row is used as the mutation operator. For each individual in the population, a second predetermined probability is used to determine whether it needs to be mutated.

[0020] If mutation is required, a gene locus is randomly selected and re-encoded;

[0021] Perform fitness calculations;

[0022] Determine if the maximum number of iterations has been reached. If not, replace the worst offspring with the best parent individual and return to step P1. Otherwise, obtain the best individual in the population, which is the optimal disturbance resource allocation scheme.

[0023] The process of obtaining the optimal allocation scheme for interference resources described above is the iterative process of the genetic algorithm. From this process, we can see the significant difference between the genetic algorithm and traditional optimization algorithms. Traditional optimization algorithms iteratively seek the optimal solution from a single initial value, which easily leads to getting trapped in local optima. In contrast, the parent algorithms in a genetic algorithm represent a set of solutions that satisfy the allocation conditions, not a single solution, thus having a wider coverage and facilitating global selection.

[0024] In the above-described method and technical solution, by adjusting the power of the optimal interference resource allocation scheme, both the achievement of interference operational objectives and the conservation of interference resources are considered. This approach minimizes the waste of interference resources while ensuring the achievement of operational objectives as much as possible, thereby improving resource utilization efficiency. One implementation of the adjustment includes the following steps:

[0025] Calculate the minimum effective interference power of each jammer in the optimal interference resource allocation scheme so that the bit error rate of each radio station in the jammed target set reaches the threshold. Obtain the target set of repeated interference and the target set of non-repeated interference for each jammer. Also obtain the maximum minimum effective interference power in the non-repeated target set and the maximum minimum effective interference power in the repeated target set for each jammer.

[0026] If there are no targets in a jammer's target set that are not being jammed repeatedly, then the jammer's transmit power is set to 0.

[0027] Step marked P2: Obtain an overlapping target;

[0028] Select a jammer that can interfere with the target with the least power required, and classify the target as a non-repeating target of this jammer;

[0029] Determine if there are any overlapping targets. If not, update the power of each jammer to the maximum minimum power of the non-overlapping targets for each jammer. Otherwise, return to the step marked P2.

[0030] In the above-described method and technical solution, one implementation of the interference resource allocation scheme considers the optimized scheduling of multiple interference resources, which conforms to actual combat scenarios and has good practicality. This implementation includes the following steps:

[0031] The operational area is divided into cooperative operational areas and non-cooperative operational areas.

[0032] Within the cooperative's operational area, there are m×N random jamming machine deployment locations, where m is the population size and N is the total number of available jamming machines;

[0033] For each location point, obtain the set of frequency-domain targets that can be interfered with, the set of spatial-domain targets that can be interfered with, and the set of targets that can be covered by the beam at that location point;

[0034] The intersection of the frequency domain jammable target set, the spatial domain jammable target set, and the beam coverage target set is used to obtain the jammable target set at that location. Each element of the jammable target set is a feasible jamming resource configuration scheme for the jammer deployed at that location.

[0035] In the above method and technical solution, the targets in the frequency domain jammable target set are targets that can reach the bit error rate threshold when the jammer deployed at that location emits jamming signals at maximum power. One implementation method obtains these targets through the following steps:

[0036] S401. Sort the non-cooperative radio stations by signal frequency, take the lowest operating frequency of the radio station as the starting point, and take the interference signal bandwidth as the step size.

[0037] S402. Perform a sliding window operation and extract the radio station information corresponding to all operating frequencies covered by the current sliding window result. Create a set to store this information and the current operating frequency of the interference signal.

[0038] S403. Determine whether the current sliding window result covers the maximum working frequency. If yes, execute S405; otherwise, execute S404.

[0039] S404. Calculate the difference between the second operating frequency covered by the current sliding window result and the next operating frequency after the last operating frequency.

[0040] If the difference is greater than the step size, the step size of the next window slide is the difference, and the process returns to step S402; otherwise, the step size of the next window slide is the difference between the first operating frequency and the second operating frequency, and the process returns to step S402.

[0041] S405, Output frequency domain can interfere with the set of targets.

[0042] In the above-described method and technical solution, one implementation of obtaining the set of airspace targets that can be interfered with includes the following steps:

[0043] S411. If there is a location point where the airspace set of targets that can be interfered with has not been obtained, then obtain the jammer deployed at a location point as the current jammer i, and obtain a non-cooperative radio station j that has not been judged to be able to be interfered with by the jammer j at the current location transmitting jamming signals at maximum power.

[0044] S412. Calculate the signal-to-interference ratio (ISR) at the receiver of the current radio station j when jammer i transmits the jamming signal at maximum power. ij :

[0045] ISR ij =10×lg(p) i )+g i -Loss ij -10×lg(pt j )-gc j +Loss j

[0046] In the formula: p i Let g be the transmit power of the i-th jammer. i The antenna gain of the i-th jammer, pt j Let gc be the transmitter power of the j-th radio pair. j For the transmitter antenna gain of the j-th radio station pair, Loss ij Loss represents the path loss of the interference signal from the cooperating party's jammer i to the non-cooperating party's radio receiver j. j The path loss of communication signals from non-cooperative radio stations from the transmitting end to the receiving end;

[0047] S413. Calculate the signal-to-noise ratio (SNR) at the receiver of the current radio station j. j :

[0048] SNR j =10×lg(pt) j )+gc j -Loss j -n j -30

[0049] Where: n j Let be the receiver noise power of the j-th radio pair;

[0050] S414. Based on the current modulation mode and signal-to-interference ratio (SNR) of radio station i... j Signal-to-noise ratio (ISR) ij Calculate the bit error rate Pe of radio station i. j ;

[0051]

[0052] In the formula: Fs j Let Fd be the sampling rate at the j-th radio station. j Let k be the symbol rate of the j-th radio station. j Let F be the base of the j-th radio station. ij Let O be the frequency domain interference coefficient of the i-th jammer to the receiver of the j-th radio pair. ijLet be the beam pointing coefficient of the beam pair of the i-th jammer to the j-th radio station pair, N be the total number of available jammers; Q is the right tail function of a normal distribution.

[0053] S415. Denote the bit error rate threshold of the current radio station j as γ. j If Pe j ≤γ j If the jammer i at the current position transmits a jamming signal at maximum power, it can interfere with this non-cooperative radio station in the airspace, and S416 is executed; otherwise, return to S411.

[0054] S416. If there is another non-cooperative radio station that has not been determined to be able to be jammed by jammer i at the current position transmitting jamming signals at maximum power, then obtain the next non-cooperative radio station as the current radio station j and return to S412.

[0055] Otherwise, obtain all non-cooperative radio stations that can be interfered with in the airspace when jammer j transmits jamming signals at maximum power, thereby obtaining the set of airspace targets that can be interfered with at the deployment location, and return to step S411.

[0056] In the above-described method and technical solution, one implementation of obtaining the set of targets that can be covered by the beam includes the following steps:

[0057] S421. Calculate the angle between the line connecting the location of the jammer and the location of each non-cooperative radio station and the parallel of latitude. Sort the radio stations according to the angle, take the location with the smallest angle as the starting point, and take the largest beam angle as the step size.

[0058] S422. Execute the sliding window if the beam pointing angle of the current sliding window is greater than 2π-A. J A J Let be the beam angle of the jammer, then calculate whether the beam will cover the area satisfying [0, A]. J [The radio station]; and extract the radio station information corresponding to all angles covered by the current sliding window result, and save the radio station information and the angle of the beam pointing at this time;

[0059] S423. Determine whether the current sliding window result covers the largest angle. If yes, execute S425; otherwise, execute S424.

[0060] S424. Calculate the difference between the second included angle covered by the current sliding window result and the next included angle of the last included angle;

[0061] If the difference is greater than the step size, the step size of the next sliding window is the difference, and return to S422;

[0062] If the difference is not greater than the step size, the step size of the next sliding window is the difference between the first angle and the second angle, and the process returns to S422;

[0063] S425, the output beam can cover the target set.

[0064] In the above method and technical solution, the interference resource allocation scheme satisfies a multi-dimensional communication interference resource allocation model; the multi-dimensional communication interference resource allocation model includes an objective function and constraints, the constraints including power constraints, beam pointing constraints, and deployment location constraints; the objective function is as follows:

[0065]

[0066] In the formula: M is the number of communication radio pairs; E j To characterize the interference coefficient of each jammer on the receiver of the j-th radio pair, where N is the total number of available jammers, N on The total number of jammers used, 1 ≤ N on ≤N;

[0067] The power constraint refers to the transmit power range of each deployed jammer being [0, p]. max ], p max This represents the jammer's maximum transmit power.

[0068] The beam pointing constraint refers to the range of the angle between the beam pointing of each deployed jammer and the parallel of latitude being [0, 2π].

[0069] The deployment location constraint means that the jammer should be deployed within the partner's operational area.

[0070] The aforementioned multi-dimensional communication jamming resource allocation model considers the optimal scheduling of various jamming resources, making it more consistent with actual combat scenarios and demonstrating good practicality. The objective function of this model is the same as the fitness calculation formula in a genetic algorithm. Its primary objective is to jam as many local radio stations as possible; the secondary objective is to conserve jamming resources as much as possible. Therefore, the construction of the objective function involves providing appropriate weights for the primary objective and adding penalty terms based on the impact of secondary objectives on the primary objective.

[0071] Secondly, based on the technical solution of the above method, the present invention proposes a communication interference resource allocation device based on a genetic algorithm, the device comprising an initial population generation module, a fitness calculation module, a genetic algorithm module, and a power adjustment module;

[0072] The initial swarm generation module is configured to encode each feasible jamming resource allocation scheme and treat it as an individual to randomly generate an initial swarm; the information expressed by the encoding includes the jammer deployment location, the jammable targets at that location, and the jammer's operating status;

[0073] The fitness calculation module is configured to calculate fitness according to the following formula:

[0074]

[0075] Where f is the fitness function, Nt is the number of stations being jammed, Njmax is the maximum number of jammers, and Nj is the number of jammers used.

[0076] The genetic algorithm module is configured to use the initial population obtained by the initial population generation module and the fitness calculated by the fitness calculation module as the starting point for the set genetic operator iteration, generate an intermediate population based on the fitness, and perform iterative optimization through gene crossover and mutation to obtain the optimal interference resource allocation scheme.

[0077] The power adjustment module is configured to adjust the power of the optimal interference resource allocation scheme so that the interference targets of each jammer in the allocation scheme do not overlap, and that it operates with the maximum minimum effective interference power.

[0078] Thirdly, the present invention also proposes a communication interference resource allocation device based on a genetic algorithm, the device comprising a memory and a processor, wherein the memory stores a computer program that can be loaded by the processor and executed by any of the above methods. Attached Figure Description

[0079] To more clearly illustrate the technical solutions in the embodiments of this application, the accompanying drawings used in the description of the embodiments will be briefly introduced below. Obviously, the accompanying drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0080] Figure 1 A flowchart illustrating one embodiment of the method of the present invention;

[0081] Figure 2 A schematic diagram of the process for obtaining a set of frequency-domain interferable targets under one implementation method;

[0082] Figure 3 A schematic diagram of the process for obtaining the set of airspace targets that can be interfered with under one implementation method;

[0083] Figure 4 A schematic diagram of the process for obtaining the set of targets that can be covered by the beam under one implementation method;

[0084] Figure 5 A schematic diagram of one embodiment of the device of the present invention. Detailed Implementation

[0085] The technical solutions in the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments.

[0086] In a simulation, a rectangular action area of ​​100 square kilometers is defined, with the main diagonal dividing the area into cooperative and non-cooperative action areas. The non-cooperative side deploys two pairs of communication radios, while the cooperative side has a total of two available jammers. The simulation employs the following... Figure 1 The method of the present invention shown performs coordinated interference resource allocation.

[0087] S0. Establish a multi-dimensional communication interference resource allocation model.

[0088] S01. Obtain the operating parameters of each enemy radio station, the performance parameters of our jammer, and the geographical location information of the combat area.

[0089] The operating parameters of each enemy radio station are shown in Table 1, including the number of communication radio pairs M and the transmitter power of the j-th radio pair as pt. j The operating frequency is fc j The transmitter antenna gain is gc j The receiver noise power is n j The bit error rate threshold is γ j The receiver's operating bandwidth is Br j The sampling rate at the radio transmitter is Fs j The symbol rate is Fd j The base number is k j The longitude and latitude coordinates of the transmitter deployment location are respectively Lont j and Latt j The longitude and latitude coordinates of the receiver deployment location are respectively Longr j and Latr j .

[0090] Table 1. Operating parameters of enemy radio stations

[0091]

[0092] The performance parameters of our jammers are shown in Table 2, including the total number of available jammers N and the maximum transmit power of each jammer p. max The bandwidth of the interference signal is B. J The beam angle is A J The transmit power of the i-th jammer is p i The beam direction makes an angle of o with the parallel of latitude. i The operating frequency of the interference signal is f i The antenna gain is The longitude and latitude coordinates of the deployment location are respectively Loni and Lat i .

[0093] Table 2. Performance parameters of the jammer

[0094]

[0095]

[0096] The geographical location information of the operational area is shown in Table 3, including the latitude and longitude coordinates of the lower left and upper right corners of the area. L Lat L ) and (Lon R Lat R The combat zones of the two sides are divided by the main diagonal of this rectangular area.

[0097] Table 3. Geographical Information of Rectangular Operational Areas

[0098]

[0099] S02: Model and characterize the electromagnetic interference between the two sides based on the operating parameters of the enemy's radio stations and the performance parameters of our jammers.

[0100] Based on the information obtained above, the electromagnetic interference modeling and characterization are performed as follows, and steps S021 to S023 are followed.

[0101] S021. Determine whether the operating frequency of the communication radio is covered by the frequency band of the interfering signal, and perform frequency domain interference modeling and characterization. Define the frequency domain interference coefficient as F. ij This is used to characterize the frequency domain interference situation of the i-th jammer on the receiver of the j-th radio pair:

[0102]

[0103] In the formula: f i fc is the operating frequency of the interference signal. j For operating frequency; B J This is the bandwidth of the interference signal. That is: if F ij =1, then the i-th jammer can interfere with the receiver of the j-th radio pair in the frequency domain; if F ij If = 0, then the i-th jammer cannot interfere with the receiver of the j-th radio pair in the frequency domain.

[0104] S022: Determine whether the beam direction of an jammer deployed at a certain location can cause a certain communication radio receiver to be covered by the beam of the jamming signal, and perform beam domain interference modeling and characterization.

[0105] First, calculate the angle between the line connecting the i-th jammer and the receiver of the j-th radio pair and the parallel of latitude. Establish a rectangular coordinate system with the jammer's location as the origin, the direction of increasing longitude parallel to the parallel of latitude as the positive x-axis, and the direction of increasing latitude parallel to the parallel of longitude as the positive y-axis. Calculate the angle A between the lines connecting the i-th jammer and the receiver of the j-th radio pair. ij :

[0106] (1) When Lon i equals Lonr j And Lat i Less than Latr j hour,

[0107] (2) When Lon i equals Lonr j And Lat i Greater than Latr j hour,

[0108] (3) When Lon i Less than Lonr j And Lat i Less than or equal to Latr j hour:

[0109]

[0110] (4) When Lon i Greater than Lonr j And Lat i Less than or equal to Latr j hour:

[0111]

[0112] (5) When Lon i Greater than Lonr j And Lat i Greater than or equal to Latr j hour:

[0113]

[0114] (6) Other situations:

[0115]

[0116] Wherein: the function D(x, y, m, n) calculates the straight-line distance between two latitude and longitude coordinate points (x, y) and (m, n); Lon i The longitude of the deployment location of the i-th jammer; Lat iLet Lonr be the dimension of the deployment location of the i-th jammer; j Let Latr be the longitude of the location where the receiver of the j-th radio station is deployed; j The dimension of the location where the receiver is deployed at the j-th radio station.

[0117] Secondly, determine whether the communication radio receiver is covered by the jammer's beam; define the beam pointing coefficient O. ij This is used to characterize whether the beam of the i-th jammer covers the receiver of the j-th radio pair:

[0118]

[0119] If O ij =1, then the receiver of the j-th radio pair can be covered by the beam of the i-th jammer; if O ij =0, then the receiver of the j-th radio pair cannot be covered by the beam of the i-th jammer. A J The beam angle; o i Let be the angle between the beam direction of the i-th jammer and the parallel.

[0120] S013: Determine whether the interference-to-signal ratio at the receiver of a non-cooperative radio station is large enough to make its bit error rate reach the threshold that prevents normal communication when a jammer deployed at a certain location transmits jamming signals at maximum transmit power, and perform energy domain interference modeling and characterization.

[0121] The first step is to calculate the signal-to-noise ratio (SNR) at the receiver of the non-cooperative radio station. j :

[0122] First, calculate the path loss (Loss) of the communication signal from the non-cooperative radio station from the transmitter to the receiver. j :

[0123] Loss j =32.44+20×lg(D(Lonr) j Latr j Lonr j Latt j ))+20×lg(fc j )

[0124] Then, the receiver signal-to-noise ratio (SNR) is obtained. j :

[0125] SNR j =10×lg(pt) j )+gc j -Loss j -n j -30

[0126] The second step is to calculate the interference-to-signal ratio (ISR) of the cooperating jammer to the non-cooperating radio receiver. ij .

[0127] First, calculate the path loss (Loss) of the cooperating party's interference signal propagating from the jammer to the non-cooperating party's radio receiver. ij :

[0128] Loss ij =32.44+20×lg(D(Lonr) j Latr j Lon i Lat i ))+20×lg(f j )

[0129] Then, the receiver interference signal ratio (ISR) is obtained. ij :

[0130] ISR ij =10×lg(p) i )+g j -Loss ij -10×lg(pt j )-gc j +Loss ij

[0131] The third step is to calculate the interference effect of each jammer on non-cooperative radio stations, using the bit error rate Pe as the metric. j For example, using 2ASK:

[0132]

[0133] Where: Fs j Let Fd be the sampling rate at the j-th radio station. j Let k be the symbol rate of the j-th radio station. j Let F be the base of the j-th radio station. ij Let O be the frequency domain interference coefficient of the i-th jammer to the receiver of the j-th radio pair. ij Let be the beam pointing coefficient of the i-th jammer's beam pair to the j-th radio station pair, and N be the total number of available jammers.

[0134] Step 4: Define the interference coefficient E j This characterizes the energy domain interference of each jammer on the receiver of the j-th radio pair:

[0135]

[0136] E j =1 indicates that each jammer can effectively interfere with the receiver of the j-th radio pair; E j=0 indicates that there is an jammer that cannot effectively interfere with the receiver of the j-th radio pair.

[0137] S03: Design an objective function based on the operational objective of effectively jamming as many non-cooperative communication radios as possible using as few jamming resources as possible.

[0138] The basic idea of ​​the objective function is as follows: consider a primary objective and a secondary objective. The primary objective is to achieve effective control over as many communication stations as possible, while the secondary objective is to use as few control resources as possible. The design of the objective function should take into account both the primary and secondary objectives, and ensure that the primary objective is achieved first, avoiding excessive influence of the secondary objective on the primary objective. This invention uses a weighted method to increase the influence of the primary objective on the overall optimization objective, and introduces the secondary objective into the objective function in the form of a penalty function. In summary, the objective function is designed as follows:

[0139]

[0140] Where M is the number of communication radio pairs, N on This is the total number of jammers used, and obviously 1 ≤ N. on ≤N. By setting the numerical weight of the primary objective to N, the penalty function N is avoided. on Excessive influence on key target values.

[0141] S04: Establish constraints, including power constraints, beam pointing constraints, and deployment location constraints.

[0142] The power constraint refers to the jammer's transmit power being less than or equal to its maximum transmit power p. max That is: if p is used i Let p represent the transmit power of the i-th jammer, then 0 ≤ p i ≤p max .

[0143] The beam pointing constraint refers to the fact that the angle between the beam pointing of each deployed jammer and the parallel is within the range of [0, 2π]. That is, if o i Let represent the angle between the direction of the i-th jammer and the parallel of latitude, then 0 ≤ o i ≤2π.

[0144] The deployment location constraint means that the jammer deployment location should be within the cooperative party's operational area. In the above implementation, a rectangular operational area of ​​100 square kilometers is defined, with the main diagonal dividing the operational areas of the cooperative and non-cooperative parties. First, the equation of the main diagonal of the operational area is given. Using the latitude of the lower left corner of the operational area as the x-axis, and the direction of increasing longitude as the positive direction of the x-axis, and the longitude of the lower left corner of the operational area as the y-axis, with the direction of increasing latitude as the positive direction of the y-axis, a rectangular coordinate system is established. The equation of the main diagonal can then be obtained as follows:

[0145]

[0146] In this implementation, it is assumed that the partner's action area is located to the left of the main diagonal, so the following conditions must be met:

[0147]

[0148] Lon L <Lon i <Lon R

[0149] Lat L <Lat i <Lat R

[0150] In summary, based on the objective function and constraints, the multi-dimensional communication interference resource allocation model is as follows:

[0151]

[0152]

[0153] S1. Gridify the combat area, randomly generate jamming aircraft deployment points, and calculate the set of jammable targets at each location.

[0154] S11: Determine the operational area. Considering the operational area to be rectangular, discretize the continuous geographical location information of the operational area to form a finite number of map grid points, i.e., grid the operational area. Define the row and column coordinates of the lower left corner vertex of the map as row 0, column 0. Suppose the entire operational area is divided into r rows and c columns, then the coordinates of a point within the operational area are determined by the row number r. i and column number c i Two parameters describe this. Specifically, the latitude and longitude coordinates of the lower left and upper right corners of the known action area are (Lon...). L Lat L ) and (Lon R Lat R If the latitudinal granularity of two adjacent rows is defined as follows: The longitude granularity of two adjacent columns is Let the row and column coordinates of a point within the action area be (r0, c0), then the corresponding latitude and longitude coordinates of that point are (Lon L +c0·G Lon Lat L +a0·G Lat ).

[0155] S12: Preliminary selection of jamming aircraft locations based on the gridded combat area.

[0156] One method for initially selecting the location of the jammer is by randomly generating row and column numbers, respectively. That is, column number c... i It is a random integer between 0 and the largest column number c, and the row number r. i It is a random integer between 0 and the maximum row number r, ensuring that the randomly generated location point is within the combat area specified by the maximum row and column number. Therefore, the initial location point of the jammer is determined as (r i c i ).

[0157] Furthermore, the operational area is divided into cooperative and non-cooperative operational areas by the main diagonal. The area to the left of the main diagonal is designated as the cooperative operational area. The equation of the main diagonal of the operational area in a rectangular coordinate system described by row and column numbers is:

[0158]

[0159] The coordinates of all locations within the partner's operational area should satisfy:

[0160]

[0161] Since the jammer should be deployed within the partner's operational area, then for the randomly generated row number r i and column number c i It is also necessary to determine whether it is located within the operational area of ​​the partner, i.e., whether it meets the requirements. If the condition is met, the generation is complete, and the coordinates of the position point are output; otherwise, the row and column numbers are regenerated until the condition is met.

[0162] S13: Extract frequency domain targets that can be interfered with, and establish a set of frequency domain targets that can be interfered with.

[0163] The method for extracting frequency domain interference targets is to obtain the entire set of frequency domain interference targets using a sliding window. The specific steps are as follows: Figure 2 As shown:

[0164] S401. Arrange the radio stations on the number axis in order of signal frequency magnitude; and initialize the sliding window parameters, with the step size being the interference signal bandwidth and the starting point being the lowest radio station operating frequency.

[0165] S402. Perform a sliding window operation and extract the radio station information corresponding to all operating frequencies covered by this sliding window result. Create a set to store this information and the operating frequency of the interference signal at this time.

[0166] S403. Determine whether the current sliding window result covers the maximum operating frequency. If yes, proceed to S405; otherwise, continue executing S404.

[0167] S404, calculate the difference between the second operating frequency covered by this sliding window result and the next operating frequency after the last operating frequency;

[0168] If the difference is greater than the step size, the step size of the next window slide is the difference, and the process returns to step S402; otherwise, the step size of the next window slide is the difference between the first operating frequency and the second operating frequency, and the process returns to step S402.

[0169] S405, Output frequency domain can interfere with the set of targets.

[0170] The extraction result of the frequency domain jamming target set is only related to the signal bandwidth of the cooperating jammer and the operating frequency of each communication radio station of the non-cooperating party, and is independent of the deployment location of the jammer. Therefore, the frequency domain jamming target set of all deployed jammers is exactly the same and does not change with the change of deployment location.

[0171] S14: Extract the airspace targets that can be interfered with at each location point and establish a set of airspace targets that can be interfered with.

[0172] One implementation method for airspace interference target extraction involves identifying targets at a given location where a jammer transmitting jamming signals at maximum power can achieve a bit error rate (BER) threshold. Specifically, for a jammer with a defined deployment location, the signal-to-interference ratio (SIR) at the receivers of each non-cooperative radio station when transmitting jamming signals at maximum power can be calculated. Furthermore, the BER of each radio station when jammed by this jammer can be calculated. By comparing the BER values ​​with the BER threshold acceptable to each non-cooperative radio station while maintaining normal communication, it can be determined whether the jammer deployed at that location is capable of effectively suppressing airspace interference for each radio station. The specific steps include the following: Figure 3 As shown:

[0173] S411. If there is a location point where the airspace set of targets that can be interfered with has not been obtained, then obtain the jammer deployed at a location point as the current jammer i, and obtain a non-cooperative radio station j that has not been judged to be able to be interfered with by the jammer j at the current location transmitting jamming signals at maximum power.

[0174] S412. Calculate the signal-to-interference ratio (ISR) at the receiver of the current radio station j when jammer i transmits the jamming signal at maximum power. ij :

[0175] ISR ij =10×lg(p) i )+g i -Loss ij -10×lg(pt j )-gc j +Loss j

[0176] In the formula: p i Let g be the transmit power of the i-th jammer. i The antenna gain of the i-th jammer, pt j Let gc be the transmitter power of the j-th radio pair. j For the transmitter antenna gain of the j-th radio station pair, Loss ij Loss represents the path loss of the interference signal from the cooperating party's jammer i to the non-cooperating party's radio receiver j. j The path loss of the communication signal of non-cooperative radio station j from the transmitting end to the receiving end;

[0177] S413. Calculate the signal-to-noise ratio (SNR) at the receiver of the current radio station j. j :

[0178] SNR j =10×lg(pt) j )+gc j -Loss j -n j -30

[0179] Where: n j Let be the receiver noise power of the j-th radio pair;

[0180] S414. Based on the current modulation mode and signal-to-interference ratio (SNR) of radio station j... j Signal-to-noise ratio (ISR) ij Calculate the bit error rate Pe of the j-th radio station. j ;

[0181]

[0182] In the formula: Fs j Let Fd be the sampling rate at the j-th radio station. j Let k be the symbol rate of the j-th radio station. j Let F be the base of the j-th radio station. ij Let O be the frequency domain interference coefficient of the i-th jammer to the receiver of the j-th radio pair. ijLet be the beam pointing coefficient of the beam pair of the i-th jammer to the j-th radio station pair, and N be the total number of available jammers; Q is the right-tail function of a normal distribution;

[0183] S415. Denote the bit error rate threshold of the current radio station j as γ. j If Pe j ≤γ j If the jammer i at the current position transmits a jamming signal at maximum power, it can interfere with this non-cooperative radio station in the airspace, and S416 is executed; otherwise, return to S411.

[0184] S416. If there is another non-cooperative radio station that has not been determined to be able to be jammed by jammer i at the current position transmitting jamming signals at maximum power, then obtain the next non-cooperative radio station as the current radio station j and return to S412.

[0185] Otherwise, obtain all non-cooperative radio stations that can be interfered with in the airspace when jammer j transmits jamming signals at maximum power, thereby obtaining the set of airspace targets that can be interfered with at the deployment location, and return to step S411.

[0186] S15: Extract the beam-coverable targets at each location point and establish a set of beam-coverable targets.

[0187] Specifically, it includes the following steps, such as Figure 4 As shown:

[0188] S421. Calculate the location (r) of the jammer deployment point. k c k The angle A between the line connecting the locations of the non-cooperative radio stations and the parallels of latitude. kj , j∈[1,M], let Temp1=Lon i +c k ·G lon Temp2 = Lat L +r k ·G lat :

[0189] (1) When Temp1 equals Lonr j And Temp2 is less than Latr j hour,

[0190] (2) When Temp1 equals Lonr j And Temp2 is greater than Latr j hour,

[0191] (3) When Temp1 is less than Lonr j And Temp2 is less than or equal to Latrj hour:

[0192]

[0193] (4) When Temp1 is greater than Lonr j And Temp2 is less than or equal to Latr j hour:

[0194]

[0195] (5) When Temp1 is greater than Lonr j And Temp2 is greater than or equal to Latr j hour:

[0196]

[0197] (6) Other situations:

[0198]

[0199] Each radio station is set to A. kj Sort the data, for example, in ascending order, and then initialize the sliding window parameters, using A as an example. kj The starting point is the point with the smallest value, and the step size is the maximum beam angle.

[0200] S422. Execute the sliding window if the beam pointing angle of the current sliding window is greater than 2π-A. J A J Let be the beam angle of the jammer, then calculate whether the beam will cover the area satisfying [0, A]. J The process involves identifying the radio station and extracting the radio station information corresponding to all angles covered by the current sliding window result. The extracted information includes both the radio station information and the beam pointing angle. In this step, the beam pointing range is 0 to 360 degrees. If it exceeds 360 degrees, the beam angle has completed a full rotation and the calculation restarts from 0. Therefore, the beam pointing sliding window process is not a unidirectional process but a loop. For example, consider a two-dimensional Cartesian coordinate system. The jammer is located at the origin, with the positive x-axis as a reference. If the maximum beam angle of the jammer's interference signal is 60 degrees, and the angle between the line connecting the location of a non-cooperative radio station A to the origin and the positive x-axis is 10 degrees, then the jammer's beam pointing is 350 degrees. Therefore, the jammer's interference signal beam actually covers radio station A.

[0201] S423. Determine whether the current sliding window result covers the largest A. kj If yes, then execute S425; otherwise, execute S424.

[0202] S424. Calculate the second A covered by the current sliding window result.kj With the last A kj The next A kj If the difference is greater than the step size, the step size of the next sliding window is this difference, and the starting point of the next sliding window is the angle after the last angle covered by the current sliding window, then return to S422; otherwise, the step size of the next sliding window is the first A. kj And the second A kj The difference is returned to S422;

[0203] S425, the output beam can cover the target set;

[0204] S16: Take the intersection of the three extracted sets of interference targets and integrate them to obtain a feasible interference scheme for the location point;

[0205] Step S16, which involves integrating the extracted interference targets, involves taking the intersection of the three sets obtained in steps S13, S14, and S15 and removing duplicate sets. This yields a set of interferable targets for the corresponding location. This set not only stores the set of targets that can be simultaneously interfered with but also the various operating parameters of the jammer when simultaneously interfering with these targets. Each element of the set of interferable targets represents a feasible interference resource configuration scheme for the jammer deployed at that point.

[0206] S17: Randomly generate m×N jammer deployment locations, where m is the population size and N is the total number of available jammers. Perform operations S11 to S16 on all generated locations to extract feasible jamming schemes for each location.

[0207] S2: Encode the above information and randomly generate an initial population. Each individual in the population is a disturbance resource allocation scheme.

[0208] The encoding method described in step S2 is matrix encoding, with 3 columns and N rows, and each row corresponds to the working status of a specified jammer.

[0209] The first column contains the row and column coordinates of the randomly generated jammer deployment locations;

[0210] The second column is the index of a randomly selected element from the set of targets that can be interfered with by the coordinate point in the first column of this row within the entire set (the second column is the index of a randomly selected element from the set of targets that can be interfered with by each coordinate point within the entire set);

[0211] The elements in the third column represent the transmission power of each jammer. When an element is 1, the jammer operates at its maximum transmission power. When an element is 0, the jammer's transmission power is 0, meaning the jammer in that row is not powered on.

[0212] S3: Calculate the fitness of all schemes within the initial population to find the optimal individual in the population. The fitness calculation formula directly adopts the objective function of the multi-dimensional communication interference resource allocation model, i.e.:

[0213]

[0214] Where Nt is the number of radio stations being jammed, Njmax is the maximum number of jammers, and Nj is the number of jammers used.

[0215] S4: Using the initial population as the starting point for algorithm iteration, perform genetic algorithm optimization. Based on the above encoding and fitness calculation, select appropriate genetic operators for genetic algorithm optimization. Specifically, this includes the following steps:

[0216] S41: The selection operator adopts random league selection, that is, each time two individuals are randomly selected from the parent group to compare fitness, and the individual with the highest fitness is retained in the intermediate group. This process is repeated a number of times to generate a complete intermediate group.

[0217] S42: Using multi-point crossover, the intermediate population is first paired up, and each pair of individuals is crossovered at multiple points with a certain probability. The specific operation of crossover is: randomly select a certain number of gene loci and exchange the gene locus data of the corresponding positions of the two individuals.

[0218] S43: The mutation operator adopts row-based basic bit mutation, that is, for each individual in the population, it is determined with a certain probability whether it needs to be mutated. If mutation is required, a gene bit is randomly selected for re-encoding. If the coordinates of the randomly generated geographical location points during the encoding process have not been extracted by the interference target, the interference target should be extracted first, and then the interference target extraction result should be saved. After determining the position column, the scheme is re-selected, and then the power is re-selected with a 50% probability.

[0219] S44: Perform fitness calculations and replace the worst offspring with the best parent individual;

[0220] S45: Determine if the maximum number of iterations has been reached. If yes, proceed to step S5; otherwise, proceed to step S3. The convergence condition here could also be that the fitness reaches a given threshold, or that the fitness of the optimal individual and the fitness of the population no longer increase.

[0221] S5: The scheme optimized by the genetic algorithm is further optimized for power. This power optimization avoids multiple jammers repeatedly and effectively jamming the same non-cooperative radio, thus saving power resources and reducing waste. Specifically, it includes the following steps:

[0222] S51: Calculate the minimum effective interference power of each jammer in the optimized scheme of step S4, which makes the bit error rate of each radio station in the jammed target set reach the threshold, and find the target with the largest minimum effective interference power.

[0223] S52: Identify the targets that are repeatedly jammed and the targets that are not repeatedly jammed by each jammer, and find the maximum minimum effective jamming power of all non-repeating targets and the maximum minimum effective jamming power of all repeating targets of each jammer. Compare them. If the maximum minimum effective jamming power of non-repeating targets is greater than the maximum minimum effective jamming power of repeating targets, then directly use that value as the transmission power of this jammer, and set all repeating targets of this jammer as non-repeating targets. Other jammers do not need to consider jamming these targets.

[0224] S53: If there are no non-overlapping targets in a certain jammer target set, then the jammer's transmission power is directly set to 0;

[0225] S54: Process the next overlapping target;

[0226] S55: Select a jammer that can interfere with the target with the least power required, and classify the target as a non-overlapping target of this jammer;

[0227] S56: Determine if there are any overlapping targets. If not, update the power of each jammer to the maximum minimum power of each jammer when there are no overlapping targets. Otherwise, execute S54.

[0228] The simulation content and results of the simulation performed according to the above method are shown in Table 4. It can be seen that this algorithm can achieve precise allocation of interference resources such as frequency, power, and beam, and has good optimization capabilities.

[0229] Table 4

[0230]

[0231] Based on the implementation of the above method, the method can also be implemented as a corresponding device. In one embodiment of the device, the structure of the device is as follows: Figure 5 As shown, the system includes an initial population generation module, a fitness calculation module, a genetic algorithm module, and a power adjustment module. The initial population generation module is configured to encode each jamming resource allocation scheme and treat it as an individual, randomly generating an initial population. The information expressed through the encoding includes the jammer's deployment location, the jammable targets at that location, and the jammer's operating status. The fitness calculation module is configured to calculate the fitness according to the following formula:

[0232]

[0233] Where f is the fitness function; Nt is the number of stations being jammed; Njmax is the maximum number of jammers; and Nj is the number of jammers used.

[0234] The genetic algorithm module is configured to use the initial population obtained by the initial population generation module and the fitness calculated by the fitness calculation module as the starting point for the set genetic operator iteration, generate an intermediate population based on the fitness, and perform iterative optimization through gene crossover and mutation to obtain the optimal interference resource allocation scheme.

[0235] The power adjustment module is configured to adjust the power of the optimal interference resource allocation scheme so that the interference targets of each jammer in the allocation scheme do not overlap, and that it operates with the maximum minimum effective interference power.

[0236] In another feasible embodiment of the device, the device includes a memory and a processor, wherein the memory stores a computer program that can be loaded by the processor and execute the methods described above.

[0237] Through the above description of the embodiments, those skilled in the art will clearly understand that the methods or apparatus of this disclosure can be implemented by means of software plus necessary general-purpose hardware, or by special-purpose hardware including application-specific integrated circuits, dedicated CPUs, dedicated memory, dedicated components, etc. Generally, any function performed by a computer program can be easily implemented using corresponding hardware, and the specific hardware structure used to implement the same function can be diverse, such as analog circuits, digital circuits, or dedicated circuits. However, for the purposes of this disclosure, software program implementation is more often a preferred implementation method.

[0238] Although embodiments of the present invention have been described above in conjunction with the accompanying drawings, the present invention is not limited to the specific embodiments and application fields described above. The specific embodiments described above are merely illustrative and instructive, and not restrictive. Those skilled in the art can make many other forms based on the guidance of this specification and without departing from the scope of protection of the claims of the present invention, and all of these are within the scope of protection of the present invention.

Claims

1. A communication interference resource allocation method based on a genetic algorithm, characterized in that, The method includes the following steps: The operational area is divided into cooperative operational area and non-cooperative operational area; within the cooperative operational area, m×N jammer deployment locations are randomly selected, where m is the population size and N is the total number of available jammers; for each location, the set of frequency-domain jammable targets, the set of airspace jammable targets, and the set of beam-coverable targets for that location are obtained; The intersection of the frequency domain jammable target set, the spatial domain jammable target set, and the beam coverage target set is used to obtain the jammable target set at that location. Each element of the jammable target set is a feasible jamming resource configuration scheme for the jammer deployed at that location. Each feasible jamming resource allocation scheme is encoded and treated as an individual, and an initial group is randomly generated. The information expressed by the encoding includes the jammer deployment location, the jammable targets at that location, and the jammer's operating status. Fitness is determined using the following formula: in, For the fitness function, The number of radio stations being jammed. This represents the maximum number of jammers. The number of jammers used; Using the initial population as the starting point for the iteration of the genetic operators, an intermediate population is generated based on fitness, and iterative optimization is performed through gene crossover and mutation to obtain the optimal interference resource allocation scheme. Adjusting the power of the optimal jamming resource allocation scheme to ensure that the jamming targets of each jammer operating in the optimal jamming resource allocation scheme do not overlap, and that they operate with the maximum minimum effective jamming power, includes the following steps: Calculate the minimum effective interference power of each jammer in the optimal interference resource allocation scheme so that the bit error rate of each radio station in the jammed target set reaches the threshold. Obtain the repeating target set and non-repeating target set of each jammer. Then obtain the maximum minimum effective interference power in the non-repeating target set and the maximum minimum effective interference power in the repeating target set of each jammer. If there are no non-repeating targets in a certain jammer's target set, then the jammer's transmission power is set to 0; Step marked P2: Obtain a duplicate target; Select a jammer that can interfere with the target with the least power required, and classify the target as a non-repeating target of this jammer; Determine if there are any duplicate targets. If not, update the power of each jammer to the maximum minimum power of each jammer against non-duplicate targets. Otherwise, return to step marked P2.

2. The method according to claim 1, characterized in that, The process of obtaining the optimal interference resource allocation scheme includes the following steps: Fitness is calculated for individuals in the initial population; Step P1: Randomly select two individuals from the parent population to compare their fitness, select the individual with the highest fitness and retain it in the intermediate population, and perform this process several times to generate a complete intermediate population; The intermediate population is paired up, and each pair of individuals randomly selects the position of a first set number of genes according to a first set probability, and exchanges the gene data of the corresponding positions of the two individuals. The basic bit mutation by row is used as the mutation operator. For each individual in the population, a second predetermined probability is used to determine whether it needs to be mutated. If mutation is required, a gene locus is randomly selected and re-encoded; Perform fitness calculations; Determine if the maximum number of iterations has been reached. If not, replace the worst offspring with the best parent and return to step P1; otherwise, obtain the best individual in the population.

3. The method according to claim 1, characterized in that, The targets in the frequency domain jammable target set are those that can reach the bit error rate threshold when the jammer deployed at that location emits jamming signals at maximum power. This is obtained through the following steps: S401. Sort the non-cooperative radio stations by signal frequency, take the lowest operating frequency of the radio station as the starting point, and take the interference signal bandwidth as the step size. S402. Perform a sliding window operation and extract the radio station information corresponding to all operating frequencies covered by the current sliding window result. Create a set to store this information and the current operating frequency of the interference signal. S403. Determine whether the current sliding window result covers the maximum working frequency. If yes, execute S405; otherwise, execute S404. S404. Calculate the difference between the second operating frequency covered by the current sliding window result and the next operating frequency after the last operating frequency. If the difference is greater than the step size, the step size of the next window slide is the difference, and the process returns to step S402; otherwise, the step size of the next window slide is the difference between the first operating frequency and the second operating frequency, and the process returns to step S402. S405, Output frequency domain can interfere with the set of targets.

4. The method according to claim 1, characterized in that, The set of airspace targets that can be interfered with is obtained through the following steps: S411. If there exists a location point for which no airspace set of jamming targets has been acquired, then the jammer deployed at that location point is selected as the current jammer. Obtain a non-cooperative device that is not identified as being able to be jammed at the current location. Radio stations that transmit jamming signals at maximum power ; S412, Calculate the current jammer When transmitting jamming signals at maximum power, at the current radio station Signal-to-interference ratio generated at the receiving end : In the formula: For the first The transmission power of the jammer No. Antenna gain of the jammer For the first The transmitter power of each radio station pair For the first Transmitter antenna gain for each radio station pair Interference signals from the jammer for the partner Broadcast to non-partner radio stations Path loss of the receiver, For non-partner radio stations The path loss of the communication signal from the transmitter to the receiver; S413, Calculate the current radio station Signal-to-noise ratio at the receiver : In the formula: For the first The receiver noise power of each radio pair; S414, According to the current radio station modulation mode, signal-to-interference ratio Signal-to-noise ratio Calculate the first Bit error rate per radio station ; In the formula: For the first Each radio station's sampling rate For the first The symbol rate of each radio station For the first The base of a radio station For the first The jammer targets the first... Frequency domain interference coefficient of the receiver for each radio station pair For the first The beam of the jammer is against the first Beam pointing coefficient of each radio station pair Let be the total number of available jammers; Q is the right-tail function of a normal distribution; S415, Change the current radio station The bit error rate threshold is denoted as ,like The jammer at the current location When transmitting jamming signals at maximum power, it can interfere with this non-cooperative radio station in the airspace, executing S416; Otherwise, return to S411; S416. If there is another non-cooperative radio station that has not been determined to be jammed by the jammer at the current location... If a radio station transmits jamming signals at maximum power, then the next non-cooperative radio station will be selected as the current radio station. Return to S412; Otherwise, an jammer will be obtained. When transmitting jamming signals at maximum power, all non-cooperative radio stations that can be interfered with in the airspace are obtained, thus obtaining the set of airspace targets that can be interfered with at the deployment location, and returning to step S411.

5. The method according to claim 1, characterized in that, The target set that the beam can cover is obtained through the following steps: S421. Calculate the angle between the line connecting the location of the jammer and the location of each non-cooperative radio station and the parallel of latitude. Sort the radio stations according to the angle, take the location with the smallest angle as the starting point, and take the largest beam angle as the step size. S422. Execute the sliding window; if the beam pointing angle of the current sliding window is greater than... , Let be the beam angle of the jammer, then calculate whether the beam will cover the area that satisfies the following conditions: The radio stations; and extract the radio station information corresponding to all the included angles covered by the current sliding window result, and save the radio station information and the included angles to which the beam is pointing at this time; S423. Determine whether the current sliding window result covers the largest angle. If so, execute S425. Otherwise, execute S424; S424. Calculate the difference between the second included angle covered by the current sliding window result and the next included angle of the last included angle; If the difference is greater than the step size, the step size of the next sliding window is the difference, and return to S422; If the difference is not greater than the step size, the step size of the next sliding window is the difference between the first angle and the second angle, and the process returns to S422; S425, the output beam can cover the target set.

6. The method according to claim 1, characterized in that, The interference resource allocation scheme satisfies a multi-dimensional communication interference resource allocation model. The multi-dimensional communication interference resource allocation model includes an objective function and constraints, including power constraints, beam pointing constraints, and deployment location constraints. The objective function is as follows: In the formula: For the number of communication radio stations; To characterize the effect of each jammer on the first Interference coefficient of the receiver for each radio station pair This represents the total number of available jammers. It is the total number of jammers used. ; The power constraint refers to the range of transmit power for each deployed jammer. , This represents the jammer's maximum transmit power. The beam pointing constraint refers to the range of the angle between the beam pointing of each deployed jammer and the latitude line. ; The deployment location constraint means that the jamming aircraft should be deployed within the operational area of ​​the partner.

7. A communication interference resource allocation device based on a genetic algorithm, characterized in that, The device includes an initial population generation module, a fitness calculation module, a genetic algorithm module, and a power adjustment module; The initial swarm generation module is configured to encode each feasible jamming resource allocation scheme and treat it as an individual to randomly generate an initial swarm; the information expressed by the encoding includes the jammer deployment location, the jammable targets at that location, and the jammer's operating status; The fitness calculation module is configured to calculate fitness according to the following formula: in, The fitness function; The number of radio stations being jammed. This represents the maximum number of jammers. The number of jammers used; The genetic algorithm module is configured to use the initial population obtained by the initial population generation module and the fitness calculated by the fitness calculation module as the starting point for the set genetic operator iteration, generate an intermediate population based on the fitness, and perform iterative optimization through gene crossover and mutation to obtain the optimal interference resource allocation scheme. The power adjustment module is configured to adjust the power of the optimal interference resource allocation scheme so that the interference targets of each jammer in the allocation scheme do not overlap, and that it operates with the maximum minimum effective interference power.

8. A communication interference resource allocation device based on a genetic algorithm, characterized in that: It includes a memory and a processor, wherein the memory stores a computer program that can be loaded by the processor and executed as described in any one of claims 1 to 6.

Images