Communication Scheduling Method and Device for Underwater Cluster Cooperative Encirclement and Capture

Abstract

The present application proposes a communication scheduling method and device for underwater cluster cooperative hunting. Among them, the underwater cluster includes a master node and slave nodes. The method includes: The master node determines the information value of the current communication data and the feedback packet transmission success rate of each slave node in the current scheduling phase based on the feedback packets sent by the slave nodes in the scheduling phase, and then determines the time slot redundancy of the next round of scheduling communication; According to the method of maximizing the average information value of the cluster, the node transmission order in the scheduling communication is further determined; The master node adaptively adjusts the scheduling maintenance period according to the tightness and maximum communication distance between the underwater cooperative hunting clusters to generate a scheduling instruction packet and broadcast it; Thus, the scheduling parameters are dynamically adjusted through feedback information to improve the support of the communication protocol for underwater cluster cooperative hunting communication, thereby improving the efficiency and success rate of the underwater cluster cooperative hunting task.

Description

Technical Field

[0001] This application relates to the technical field of cluster control, and particularly relates to a communication scheduling method for underwater cluster collaborative hunting and a communication scheduling device for underwater cluster collaborative hunting. Background Art

[0002] In related technologies, Underwater Acoustic Sensor Networks (UASNs) play a key role in marine monitoring and collaborative tasks, especially in important applications such as autonomous underwater vehicle (AUV) cluster collaborative hunting, target tracking, and formation control. Traditional underwater communication protocols (such as TDMA, Aloha, Handshake) are mostly designed based on general tasks and have not been optimized for underwater unmanned cluster collaborative hunting tasks, lacking adaptability to the dynamic characteristics of underwater acoustic channels (such as high propagation delay, path loss, and low packet delivery rate). For example, existing protocols often use fixed time slot division or static scheduling periods, resulting in a significant decrease in the timeliness of information between the command node (master node) and slave nodes during the target hunting task, thereby causing formation coordination deviation and reducing the hunting success rate. In addition, due to the influence of underwater acoustic channels and energy constraints, traditional Medium Access Control Protocols (MAC) are difficult to balance the Packet Delivery Ratio (PDR) and energy consumption. Especially in dynamic hunting scenarios, frequent scheduling instructions are likely to cause the command node to run out of energy prematurely. Therefore, how to improve the effectiveness and reliability of the cluster communication protocol in this scenario has become a key technical challenge for improving the efficiency of underwater cluster collaborative hunting. Summary of the Invention

[0003] This application aims to at least partly solve one of the technical problems in the above technologies. To this end, one objective of this application is to propose a communication scheduling method for underwater cluster collaborative hunting, which dynamically adjusts scheduling parameters through feedback information to improve the support of the communication protocol for underwater cluster collaborative hunting communication, thereby improving the efficiency and success rate of underwater cluster collaborative hunting tasks.

[0004] The second objective of this application is to propose a communication scheduling device for underwater cluster collaborative hunting.

[0005] To achieve the above object, the present application proposes a communication scheduling method for underwater cluster collaborative enclosure. The underwater cluster includes a master node and multiple slave nodes. The communication scheduling method includes the following steps: obtaining an initial scheduling instruction packet and sending it to each slave node so that each slave node generates a feedback data packet according to the initial scheduling instruction packet, where the scheduling instruction packet includes the channel access time and scheduling maintenance period of each slave node; receiving the feedback data packets sent by each slave node, where the feedback data packet includes the position information and motion state of the slave node itself; calculating the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative time slot redundancy; using a genetic algorithm to generate the scheduling transmission order of the feedback data packets of each slave node, and obtaining the channel access time of each slave node in the next round according to the quantitative time slot redundancy; calculating the cluster tightness and maximum communication distance according to the feedback data packet, and obtaining the scheduling maintenance period in the next round according to the cluster tightness and maximum communication distance; generating a scheduling instruction packet in the next round according to the channel access time of each slave node in the next round and the scheduling maintenance period in the next round for communication scheduling; thus, dynamically adjusting the scheduling parameters through feedback information to improve the support of the communication protocol for underwater cluster collaborative enclosure communication, thereby improving the efficiency and success rate of the underwater cluster collaborative enclosure task.

[0006] In addition, the communication scheduling method for underwater cluster collaborative enclosure proposed by the present application may also have the following additional technical features:

[0007] Optionally, the scheduling instruction packet further includes formation command information, and the formation command information includes the expected motion positions corresponding to each slave node to dynamically adjust the network topology structure.

[0008] Optionally, each slave node generating a feedback data packet according to the initial scheduling instruction packet includes: each slave node decoding the received initial scheduling instruction packet to obtain the corresponding channel access time and expected motion position; each slave node moving according to the expected motion position and sending its respective feedback data packet to the master node at the corresponding channel access time.

[0009] Optionally, calculating the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative time slot redundancy includes: starting timing before sending the scheduling instruction packet and stopping until the feedback data packets of each slave node are received to obtain the propagation delay corresponding to each slave node; obtaining the information value corresponding to each slave node according to the propagation delay and obtaining the corresponding quantitative time slot redundancy according to the information value.

[0010] Optionally, the information value corresponding to each slave node is obtained according to the following formula:

[0011]

[0012] Among them, represents the corresponding information value, represents the initial value of the information value, represents the end-to-end delay, that is, the propagation delay, represents the maximum effective time of the information, and represents the correction parameter.

[0013] Optionally, the quantitative slot redundancy corresponding to each slave node is obtained according to the following formula:

[0014]

[0015] Among them, represents the quantitative slot redundancy corresponding to the kth slave node, represents the maximum slot redundancy, represents the minimum slot redundancy, represents the information value corresponding to the kth slave node.

[0016] Optionally, a genetic algorithm is used to generate the scheduling transmission order of the feedback data packets of each slave node, including: initializing the sequence set composed of each slave node; constructing a fitness function to evaluate the transmission sequence overhead of each individual in the sequence set, so as to select a fixed number of elite sequence individuals into the next generation; performing crossover and mutation on the elite sequence individuals until the next generation sequence set is filled; calculating the average fitness of the next generation sequence set to obtain the overall mean square error according to the average fitness; calculating the dynamic mutation probability according to the overall mean square error; using the dynamic mutation probability to mutate all sequence individuals in the next generation sequence set, and so on, until the stop condition is met and the scheduling transmission order of the feedback data packets of each slave node is output.

[0017] Optionally, the cluster compactness and the maximum communication distance are calculated according to the following formula:

[0018]

[0019]

[0020] Among them, represents the cluster compactness, represents the maximum communication distance, , represents the spatial coordinates of the cluster members, , represents the spatial coordinates of the surrounded target, the set of cluster member numbers is [0,n], and the master node number is always fixed at 0.

[0021] Optionally, the scheduling maintenance period of the next round is obtained according to the following formula:

[0022]

[0023]

[0024] where represents the scheduling maintenance period of the next round, represents the normalization factor of the cluster tightness and the maximum communication distance, which is obtained according to the initial deployment range X×Y of the cluster.

[0025] To achieve the above object, the present application proposes a communication scheduling device for underwater cluster cooperative hunting. The underwater cluster includes a master node and a plurality of slave nodes. The communication scheduling device includes: a sending module, configured to obtain an initial scheduling instruction packet and send it to each slave node, so that each slave node generates a feedback data packet according to the initial scheduling instruction packet. The scheduling instruction packet includes the channel access time and the scheduling maintenance period of each slave node; a receiving module, configured to receive the feedback data packets sent by each slave node. The feedback data packet includes the position information and the motion state of the slave node itself; a first calculation module, configured to calculate the corresponding information value according to the feedback data packet and its receiving time to obtain the corresponding quantitative time slot redundancy; a processing module, configured to use a genetic algorithm to generate the scheduling transmission order of the feedback data packets of each slave node, and obtain the channel access time of each slave node in the next round according to the quantitative time slot redundancy; a second calculation module, configured to calculate the cluster tightness and the maximum communication distance according to the feedback data packet, and obtain the scheduling maintenance period of the next round according to the cluster tightness and the maximum communication distance; a communication scheduling module, configured to generate a scheduling instruction packet for the next round according to the channel access time of each slave node in the next round and the scheduling maintenance period of the next round for communication scheduling; thus, the scheduling parameters are dynamically adjusted through the feedback information to improve the support of the communication protocol for underwater cluster cooperative hunting communication, thereby improving the efficiency and success rate of the underwater cluster cooperative hunting task. Description of the Drawings

[0026] Figure 1 It is a schematic flowchart of a communication scheduling method for underwater cluster cooperative hunting according to an embodiment of the present application;

[0027] Figure 2 It is a schematic diagram of a scenario of a communication scheduling method for underwater cluster cooperative hunting according to an embodiment of the present application;

[0028] Figure 3 It is a schematic flowchart of a scheduling periodic working process of a communication scheduling method for underwater cluster cooperative hunting according to an embodiment of the present application;

[0029] Figure 4 It is a block diagram of a communication scheduling device for underwater cluster cooperative encirclement according to an embodiment of the present application. Detailed implementation manners

[0030] The embodiments of the present application will be described in detail below. Examples of the embodiments are shown in the accompanying drawings, where the same or similar reference numerals denote the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are intended to explain the present application, and should not be construed as a limitation of the present application.

[0031] To better understand the above technical solutions, the exemplary embodiments of the present application will be described in more detail with reference to the accompanying drawings. Although the exemplary embodiments of the present application are shown in the drawings, it should be understood that the present application can be implemented in various forms and should not be limited by the embodiments set forth herein. On the contrary, these embodiments are provided to enable a more thorough understanding of the present application and to fully convey the scope of the present application to those skilled in the art.

[0032] To better understand the above technical solutions, the above technical solutions will be described in detail below in conjunction with the accompanying drawings of the specification and specific implementation manners.

[0033] As Figure 2 shown, the cluster nodes of the system architecture of the present application include a command node (i.e., the master node) and several data nodes (i.e., the slave nodes). Among them, the master node and the slave nodes have the same functions, are initially randomly distributed underwater for searching for the encirclement target, and the node that first discovers the encirclement target will become the master node; all nodes can obtain their own position information and motion states, and there is no need for time synchronization between the cluster nodes either.

[0034] During the search process, each cluster node i ( , the set of network nodes) has the same status, but the first cluster node that discovers the target (numbered 0) will become the master node of the encirclement task, and the remaining nodes will become the slave nodes; the master node will continuously perform target tracking, cluster network communication scheduling, and command the slave nodes to form an encirclement formation until the collaborative encirclement is finally completed.

[0035] Assume that the detection function of the AUV can perform reconnaissance and target recognition within a range centered on the individual. When the distance between the AUV and the target is less than , it can perform an encirclement action on the target. When the number of nodes that can perform the encirclement action reaches the encirclement threshold , it is determined that the encirclement task is successful.

[0036] In the communication scheduling model, two types of messages are defined: the scheduling instruction packet and the feedback data packet. The former is sent by the master node, which specifies the transmission delay of all slave nodes participating in the encirclement (the time from when a slave node receives the scheduling instruction packet to when it sends the feedback data packet) and the formation command information (information for guiding the movement and formation adjustment of the slave nodes); the latter is sent by the slave nodes and includes the position coordinates and motion state of the slave nodes themselves. Based on the above feedback information, the master node calculates the predicted real-time dynamic azimuth of the slave nodes, so as to precisely schedule the data transmission of the slave nodes.

[0037] Specifically, Figure 1 FIG. is a schematic flowchart of a communication scheduling method for underwater cluster collaborative encirclement according to an embodiment of the present application. As Figure 1 shown, the communication scheduling method for underwater cluster collaborative encirclement according to an embodiment of the present application includes the following steps:

[0038] S101, Obtain an initial scheduling instruction packet and send it to each slave node, so that each slave node generates a feedback data packet according to the initial scheduling instruction packet, where the scheduling instruction packet includes the channel access time and the scheduling maintenance period of each slave node.

[0039] As an embodiment, the scheduling instruction packet further includes formation command information, and the formation command information includes the expected movement positions corresponding to each slave node to dynamically adjust the network topology.

[0040] It should be noted that the transmission delay of a slave node refers to the time from when the slave node receives the scheduling instruction packet to when it sends the feedback data packet, and the scheduling maintenance period refers to the time interval between two consecutive transmissions of the scheduling instruction packet by the master node.

[0041] As an embodiment, each slave node generates a feedback data packet according to the initial scheduling instruction packet, including: each slave node decodes the received initial scheduling instruction packet to obtain the corresponding channel access time and expected movement position; each slave node moves according to the expected movement position and sends its respective feedback data packet to the master node at the corresponding channel access time.

[0042] That is to say, as Figure 3 shown, the master node calculates the transmission delay, the current round of scheduling maintenance period, and the formation command information of each slave node; after encapsulating the above information, it is broadcast in the message type of the scheduling instruction packet; after receiving the scheduling instruction packet, the slave nodes transmit several feedback data packets to the master node after several transmission delays.

[0043] S102, Receive the feedback data packets sent by each slave node, where the feedback data packet includes the position information and motion state of the slave node itself.

[0044] It should be noted that the position information of the slave node itself is the geographical coordinate, and the motion state refers to the real-time state information of the slave node moving in the underwater environment. For example, the moving speed and direction of the slave node, the distance and relative position between the slave node and the encirclement target, etc. The present application does not make specific limitations on this.

[0045] S103. Calculate the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative slot redundancy.

[0046] As an embodiment, calculating the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative slot redundancy includes: starting timing before sending the scheduling instruction packet until receiving the feedback data packets of each slave node and then stopping, so as to obtain the propagation delay corresponding to each slave node; obtaining the information value corresponding to each slave node according to the propagation delay, and obtaining the corresponding quantitative slot redundancy according to the information value.

[0047] As a specific embodiment, as time goes by, underwater ocean currents and obstacles will cause deviations between the feedback information and the actual motion state of the slave node. Therefore, simply using the feedback information for scheduling, the channel collision probability will inevitably increase. Thus, as shown in the following formula, by introducing the Value of Information (VOI) to quantify the reliability of the feedback data packet, through the quantitative calculation of slot redundancy, the channel collision probability can be further reduced and the channel utilization rate can be improved.

[0048]

[0049] Among them, represents the corresponding information value, represents the initial value of the information value, represents the end-to-end delay, that is, the propagation delay, represents the maximum effective time of the information, and represents the correction parameter.

[0050] It should be noted that when performing scheduling calculations, the closer the VOI is to the initial value , the more timely the feedback information of the slave node, the higher the reliability of the information, and the less the required slot redundancy. When the VOI is the initial value , only the protection interval of needs to be used as the slot redundancy; when the VOI reaches the minimum value, the motion state of the slave node has become unreliable due to the long time without update, and at this time, the maximum slot redundancy is given to it, where represents the maximum propagation distance of the underwater acoustic channel, that is, the maximum distance between a node and the master node, which depends on factors such as the underwater environment, the transmission power of the sonar, and the receiving sensitivity, represents the underwater acoustic rate. Using a linear relationship to complete the mapping, the following formula for slot redundancy is obtained:

[0051]

[0052] where, represents the quantitative slot redundancy corresponding to the k-th slave node, represents the maximum slot redundancy, represents the minimum slot redundancy, represents the information value corresponding to the k-th slave node.

[0053] S104, use a genetic algorithm to generate the scheduling transmission order of the feedback data packets of each slave node, and obtain the channel access time of each slave node in the next round according to the quantitative slot redundancy.

[0054] As an example, using a genetic algorithm to generate the scheduling transmission order of the feedback data packets of each slave node includes: initializing the sequence set composed of each slave node; constructing a fitness function to evaluate the transmission sequence overhead of each individual in the sequence set to select a fixed number of elite sequence individuals into the next generation; performing crossover and mutation on the elite sequence individuals until the next generation sequence set is filled; calculating the average fitness of the next generation sequence set to obtain the overall mean square error according to the average fitness; calculating the dynamic mutation probability according to the overall mean square error; using the dynamic mutation probability to mutate all sequence individuals in the next generation sequence set, and so on, until the stop condition is met and then output the scheduling transmission order of the feedback data packets of each slave node.

[0055] It should be noted that the essence of VOI is information value, which can measure the effectiveness of the feedback information of the slave node. Different transmission sequences will affect the VOI and slot redundancy in the next scheduling: if the transmission order of a slave node is adjusted forward, then in the next scheduling calculation, its VOI will decrease accordingly. In the hunting task, the master node always expects to obtain timely global node information (that is, as high a VOI as possible) for hunting decision-making and scheduling calculation. To maximize the VOI of the information received by the master node, an improved genetic algorithm is proposed, which comprehensively considers the reliability of the feedback information of the cluster nodes and minimizes the frame length by optimizing the transmission sequence, thereby improving the throughput. The proposed improved genetic algorithm is as follows:

[0056]

[0057] Specifically, consider a complete undirected graph G(N, a) with N cluster nodes. N is the set of nodes in the network, and N = {0, 1, 2, …, N}. Then the sequence optimization objective of the genetic algorithm is to minimize the frame length, and the optimization function is:

[0058]

[0059] where c represents the underwater acoustic rate, represents the data packet length, represents the communication rate, represents the frame length of the i-th sequence individual in the t-th generation sequence set, is the distance between the master node and the first sending node, is the slot redundancy size of the k-th data node under the corresponding sequence. By performing a negative exponential mapping on the frame length, the fitness function of the i-th individual in the t-th generation sequence set can be obtained:

[0060]

[0061] That is to say, the genetic algorithm first needs to complete the initialization of the sequence set. The initial set contains N random transmission sequences, and at the same time, it is evaluated based on the fitness function to calculate the overhead of all transmission sequences. During the iteration process of the sequence set, a fixed number of high-fitness excellent sequences are directly selected into the next generation, and then the remaining sequences are generated using the crossover and mutation scheme shown in the above genetic algorithm, which ensures that sequences with higher fitness are selected into the next generation population set multiple times. Based on the adaptive scheme, the parent sequences in the crossover process are selected, that is, the sequences with the largest difference in fitness among the excellent sequences are selected. This method avoids inbreeding, optimizes the next generation sequence set, and then selects the two sequences with the largest difference in fitness among the remaining sequences to complete the crossover process to generate offspring sequences until the remaining sequences in the next generation set are empty.

[0062] After the genetic algorithm completes crossover and mutation, random mutation is introduced to achieve fast convergence. In the traditional genetic algorithm, the mutation probability is fixed throughout the evolution process. And this application uses an adaptive mutation probability adjustment method based on the overall mean square deviation. The overall mean square deviation (Average Square Deviation, ASD) describes the specific differences within the set. The larger the ASD value, the greater the differences between the sequences in the set:

[0063]

[0064]

[0065] where, represents the average fitness of the t-th generation sequence set, denotes the sequence individual fitness of the t-th generation set, and N denotes the total number of sequences in the set. The dynamic mutation probability is calculated by the following formula:

[0066]

[0067] where denotes the fixed mutation probability, denotes the maximum fitness in the current set. The dynamic mutation probability is related to the mutation probability and ASD. When the ASD value decreases, it will increase dynamically to promote the diversity of sequences in the set.

[0068] After performing multiple rounds of crossover mutation and iterative optimization on the initial set until the stop condition is met, the final excellent sequence set can be obtained. Selecting the sequence with the minimum transmission overhead among them is the transmission sequence that meets the requirements. By imitating the mechanism of selection and inheritance in nature, the genetic algorithm optimizes the transmission sequence to minimize the frame length and improve the network throughput. At the same time, the potential parallelism of the genetic algorithm can simplify the complexity of the sequence optimization problem and reduce the requirements for actual deployed devices, and it has good adaptability to the scenario of low channel utilization and limited energy consumption in the underwater unmanned hunting cluster.

[0069] S105. Calculate the cluster compactness and the maximum communication distance based on the feedback data packet, and obtain the scheduling maintenance period for the next round according to the cluster compactness and the maximum communication distance.

[0070] As a specific embodiment, in different stages of the hunting task, a single scheduling can maintain multiple cycles in the manner shown Figure 3 . The scheduling maintenance period affects the hunting success rate and the energy consumption of the master node. High-frequency scheduling can increase the hunting success rate, but it will correspondingly increase the energy consumption and reduce the working life of the master node. Therefore, as the hunting task progresses, it is important to dynamically adjust the scheduling model maintenance period; adaptively adjust the scheduling maintenance period through the compactness and the communication distance :

[0071]

[0072]

[0073] where denotes the cluster compactness, denotes the maximum communication distance, , denote the spatial coordinates of the cluster members, , Denote the spatial coordinates of the surrounded target. The set of cluster member numbers is [0, n], and the master node number is always fixed at 0; the cluster compactness Quantify the discreteness between the cluster and the surrounded target, that is, the average distance di,t from the cluster members (the master node and slave nodes together form the cluster) to the surrounded target. The communication distance Is the maximum communication distance from each cluster member to the master node. Further, calculate the scheduling maintenance period through the normalized cluster compactness and the maximum communication distance :

[0074]

[0075]

[0076] Among them, Denote the next scheduling maintenance period, Denote the normalization factors of the cluster compactness and the maximum communication distance, obtained according to the initial deployment range X×Y of the cluster; both the cluster compactness and the maximum communication distance are indicators of the surrounding stage. The cluster compactness represents the necessity of increasing the scheduling frequency in the later stage of the surrounding stage, and the maximum communication distance reflects the necessity of reducing the scheduling frequency in the early stage of the surrounding stage.

[0077] It should be noted that not long after the surrounding task starts, the cluster members are far from the surrounded target. At this time, the task of the cluster members is to approach the target, only need to move forward in a general established direction, and do not require the master node to command and schedule frequently; and the slave nodes are also far from the master node, and the master node needs a large command node transmission power to complete a single scheduling communication. Therefore, it is necessary to increase the scheduling maintenance period, reduce the scheduling frequency, and reduce the energy consumption of the master node. As the surrounding stage progresses, the average distance between the cluster members and the surrounded target decreases, and it is necessary to reduce the scheduling maintenance period and command the slave nodes more precisely and frequently; at the same time, the communication distance also shows the same downward trend, which can increase the scheduling frequency while reducing the energy consumption of a single scheduling.

[0078] S106. Generate the next scheduling instruction packet according to the channel access time of each slave node in the next round and the scheduling maintenance period in the next round for communication scheduling.

[0079] That is to say, the master node sends the scheduling instruction packet according to the calculated scheduling maintenance period and performs cyclic communication scheduling until the collaborative surrounding is finally completed.

[0080] In summary, according to the communication scheduling method for underwater cluster cooperative hunting in the embodiments of the present application, during the process of continuously tracking the hunting target by the master node, scheduling instruction packets are periodically sent outwards to command the channel access time and the movement destination location of the slave nodes. Among them, the scheduling instruction packets include the numbers and transmission delays of each slave node, which are used to determine the channel access opportunity of the slave nodes and the maintenance period of this scheduling, and the numbers and expected movement positions of each slave node, which are used to dynamically adjust the network topology structure; based on the feedback data packets received in this round of scheduling stage and their arrival times, calculate the propagation delays between the master node and each slave node, as well as the information value and quantitative time slot redundancy of the feedback data packets. The calculation of the propagation delay does not require the hunting cluster to achieve clock synchronization. Before sending the scheduling instruction packet, the master node starts timing, listens to the feedback data packets of each slave node, obtains the propagation delays corresponding to each slave node according to the time difference between the calculations, and further calculates the information value and quantitative time slot redundancy; based on the propagation delay and the information value corresponding to the feedback data packet, determine the optimized transmission time slot scheme for each slave node, and generate the data packet scheduling transmission order for each slave node accordingly. Among them, according to the information value and the scheduling maintenance period, through an improved genetic algorithm, determine the channel access time of each slave node under multiple scheduling maintenance periods; according to the network topology structure and the movement state of the slave nodes, calculate the cluster compactness and the maximum communication distance, quantify the cluster dispersion degree and the hunting task advancement stage, and determine the next scheduling maintenance period. Among them, the slave node listens to the scheduling instruction packet, matches the decoded information with its own number to obtain the corresponding channel access time and movement destination location, and sends a feedback data packet at this channel access time. The feedback data packet includes the current geographical position coordinates and movement state of the slave node itself, which can determine the topology structure of the current cluster network and the movement state of the slave node; thus, based on the feedback information, dynamically adjust the scheduling parameters to improve the support of the communication protocol for underwater cluster cooperative hunting communication, thereby improving the efficiency and success rate of the underwater cluster cooperative hunting task.

[0081] To implement the above embodiments, the embodiments of the present application also propose a communication scheduling device for underwater cluster cooperative hunting, as Figure 4 shown. The communication scheduling device for underwater cluster cooperative hunting includes: a sending module 10, a receiving module 20, a first calculation module 30, a processing module 40, a second calculation module 50, and a communication scheduling module 60.

[0082] Among them, the sending module 10 is used to obtain an initial scheduling instruction packet and send it to each slave node, so that each slave node generates a feedback data packet according to the initial scheduling instruction packet. The scheduling instruction packet includes the channel access time and the scheduling maintenance period of each slave node; the receiving module 20 is used to receive the feedback data packets sent by each slave node. The feedback data packet includes the position information and motion state of the slave node itself; the first calculation module 30 is used to calculate the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative time slot redundancy; the processing module 40 is used to generate the scheduling transmission order of the feedback data packets of each slave node by using a genetic algorithm, and obtain the channel access time of each slave node in the next round according to the quantitative time slot redundancy; the second calculation module 50 is used to calculate the cluster tightness and the maximum communication distance according to the feedback data packet, and obtain the scheduling maintenance period in the next round according to the cluster tightness and the maximum communication distance; the communication scheduling module 60 is used to generate a scheduling instruction packet in the next round according to the channel access time of each slave node in the next round and the scheduling maintenance period in the next round for communication scheduling.

[0083] It should be noted that the above description and example of the communication scheduling method for underwater cluster cooperative hunting also apply to the communication scheduling device for underwater cluster cooperative hunting in this embodiment, and will not be elaborated here.

[0084] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can take the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware aspects. Moreover, the present application can take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0085] The present application is described with reference to the flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, and the combination of processes and / or blocks in the flowchart and / or block diagram can be implemented by computer program instructions. These computer program instructions can be provided to the processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing devices to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing devices generate for implementing the processes Figure 1 one process or multiple processes and / or blocks Figure 1 a device for the functions specified in one block or multiple blocks.

[0086] These computer program instructions can also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to operate in a particular manner, such that the instructions stored in the computer-readable memory produce a manufacture including instruction means that implement the functions specified in one or more of the processes and / or blocks Figure 1 in one or more of the processes and / or blocks Figure 1 specified in the function.

[0087] These computer program instructions can also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer-implemented process, whereby the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one or more of the processes and / or blocks Figure 1 in one or more of the processes and / or blocks Figure 1 specified in the function.

[0088] It should be noted that, in the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of other elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The application may be implemented by means of hardware including several distinct elements, and by means of a suitably programmed computer. In the unit claims listing several means, several of these means may be embodied by one and the same item of hardware. The use of the words first, second, and third, etc. does not denote any order. These words may be interpreted as names.

[0089] Although the preferred embodiments of the present application have been described, additional changes and modifications can be made by those skilled in the art once they learn of the basic inventive concept. Therefore, the appended claims are intended to be construed to cover the preferred embodiments as well as all changes and modifications falling within the scope of the present application.

[0090] Obviously, those skilled in the art can make various changes and modifications to the present application without departing from the spirit and scope of the present application. Thus, if these modifications and variations of the present application fall within the scope of the claims of the present application and their equivalent technologies, the present application is also intended to include these modifications and variations.

[0091] In the description of the present application, it should be understood that the terms "first" and "second" are used for descriptive purposes only and cannot be construed as indicating or implying relative importance or implicitly indicating the quantity of the indicated technical features. Thus, features defined with "first" and "second" may explicitly or implicitly include one or more of such features. In the description of the present application, "a plurality of" means two or more unless otherwise specifically defined.

[0092] In this application, unless otherwise clearly specified or limited, the terms "installed", "connected", "connected to", "fixed", etc. shall be understood in a broad sense. For example, it can be a fixed connection, a detachable connection, or integrated; it can be a mechanical connection or an electrical connection; it can be directly connected or indirectly connected through an intermediate medium, and it can be the communication inside two components or the interaction relationship between two components. For those of ordinary skill in the art, the specific meanings of the above terms in this application can be understood according to specific circumstances.

[0093] In this application, unless otherwise clearly specified or limited, the first feature being "on" or "under" the second feature can be that the first and second features are in direct contact, or the first and second features are indirectly in contact through an intermediate medium. Moreover, the first feature being "above", "over" and "on top of" the second feature can be that the first feature is directly above or obliquely above the second feature, or merely means that the horizontal height of the first feature is higher than that of the second feature. The first feature being "under", "beneath" and "underneath" the second feature can be that the first feature is directly below or obliquely below the second feature, or merely means that the horizontal height of the first feature is less than that of the second feature.

[0094] In the description of this specification, the description with reference to terms such as "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials, or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of this application. In this specification, the schematic descriptions of the above terms should not be understood as necessarily referring to the same embodiment or example. Moreover, the specific features, structures, materials, or characteristics described can be combined in a suitable manner in any one or more embodiments or examples. In addition, without contradiction, those skilled in the art can combine and combine the different embodiments or examples described in this specification and the features of different embodiments or examples.

[0095] Although the embodiments of this application have been shown and described above, it can be understood that the above embodiments are exemplary and should not be construed as limiting this application. Those of ordinary skill in the art can make changes, modifications, substitutions, and variations to the above embodiments within the scope of this application.

Claims

1. A communication scheduling method for underwater swarm collaborative hunting, characterized in that, The underwater cluster includes a master node and multiple slave nodes, and the communication scheduling method includes the following steps: Obtain an initial scheduling instruction packet and send it to each slave node, so that each slave node generates a feedback data packet according to the initial scheduling instruction packet, where the scheduling instruction packet includes the channel access time and the scheduling maintenance period of each slave node; Receive the feedback data packets sent by each slave node, where the feedback data packet includes the position information and motion state of the slave node itself; Calculate the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative time slot redundancy; Use a genetic algorithm to generate the scheduling transmission order of the feedback data packets of each slave node, and obtain the channel access time of each slave node in the next round according to the quantitative time slot redundancy; Calculate the cluster tightness and the maximum communication distance according to the feedback data packet, and obtain the scheduling maintenance period in the next round according to the cluster tightness and the maximum communication distance; Generate a scheduling instruction packet in the next round according to the channel access time of each slave node in the next round and the scheduling maintenance period in the next round for communication scheduling; Among them, calculating the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative time slot redundancy includes: Start timing before sending the scheduling instruction packet until the feedback data packets of each slave node are received and stop, so as to obtain the propagation delay corresponding to each slave node; Obtain the information value corresponding to each slave node according to the propagation delay, and obtain the corresponding quantitative time slot redundancy according to the information value; Obtain the information value corresponding to each slave node according to the following formula: Among them, represents the corresponding information value, represents the initial value of the information value, represents the end-to-end delay, that is, the propagation delay, represents the maximum effective time of the information, and represents the correction parameter; Obtain the corresponding quantitative time slot redundancy of each slave node according to the following formula: Among them, represents the quantitative slot redundancy corresponding to the k-th slave node, represents the maximum slot redundancy, represents the minimum slot redundancy, represents the information value corresponding to the k-th slave node.

2. The communication scheduling method for underwater cluster collaborative encirclement and capture according to claim 1, characterized in that The scheduling instruction packet further includes formation command information, and the formation command information includes the expected motion position corresponding to each slave node to dynamically adjust the network topology.

3. The communication scheduling method for underwater cluster collaborative encirclement and capture according to claim 2, characterized in that, Each slave node generates a feedback data packet according to the initial scheduling instruction packet, including: Each slave node decodes the received initial scheduling instruction packet to obtain the corresponding channel access time and expected motion position; Each slave node moves according to the expected motion position and sends its own feedback data packet to the master node at the corresponding channel access time.

4. The communication scheduling method for underwater cluster collaborative encirclement and capture according to claim 1, characterized in that, Using a genetic algorithm to generate the scheduling transmission order of the feedback data packets of each slave node includes: Initialize the sequence set composed of each slave node; Construct a fitness function to evaluate the transmission sequence overhead of each individual in the sequence set, so as to select a fixed number of elite sequence individuals into the next generation; Perform crossover and mutation on the elite sequence individuals until the next generation sequence set is filled; Calculate the average fitness of the next generation sequence set to obtain the overall mean square error according to the average fitness; Calculate the dynamic mutation probability according to the overall mean square error; Use the dynamic mutation probability to mutate all sequence individuals in the next generation sequence set, and so on, until the stop condition is met and then output the scheduling transmission order of the feedback data packets of each slave node.

5. The communication scheduling method for underwater cluster cooperative encirclement and capture according to claim 1, characterized in that, Calculate the cluster tightness and the maximum communication distance according to the following formula: Among them, represents the cluster compactness, represents the maximum communication distance, , represents the spatial coordinates of the cluster members, , represents the spatial coordinates of the surrounded target. The set of cluster member numbers is [0, n], and the main node number is always fixed at 0.

6. The communication scheduling method for underwater cluster collaborative encirclement and capture according to claim 5, characterized in that, Obtain the scheduling maintenance period of the next round according to the following formula: Among them, represents the scheduling maintenance period of the next round, represents the normalization factor of the cluster compactness and the maximum communication distance, which is obtained according to the initial deployment range X×Y of the cluster.

7. A communication scheduling device for underwater swarm cooperative hunting, which is used to execute the communication scheduling method for underwater swarm cooperative hunting according to any one of claims 1-6, characterized in that, The underwater cluster includes a master node and multiple slave nodes, and the communication scheduling device includes: A sending module, configured to obtain an initial scheduling instruction packet and send it to each slave node, so that each slave node generates a feedback data packet according to the initial scheduling instruction packet, where the scheduling instruction packet includes the channel access time and the scheduling maintenance period of each slave node; A receiving module, configured to receive the feedback data packets sent by each slave node, where the feedback data packet includes the position information and motion state of the slave node itself; A first calculation module, configured to calculate the corresponding information value according to the feedback data packet and its reception time to obtain the corresponding quantitative time slot redundancy; A processing module, configured to generate the scheduling transmission order of the feedback data packets of each slave node by using a genetic algorithm, and obtain the channel access time of each slave node in the next round according to the quantitative time slot redundancy; A second calculation module, configured to calculate the cluster compactness and the maximum communication distance according to the feedback data packet, and obtain the scheduling maintenance period of the next round according to the cluster compactness and the maximum communication distance; A communication scheduling module, configured to generate a scheduling instruction packet for the next round according to the channel access time of each slave node in the next round and the scheduling maintenance period of the next round for communication scheduling.

Images