CN114500359B - Cluster dynamic networking method and cluster dynamic system - Google Patents
Cluster dynamic networking method and cluster dynamic system Download PDFInfo
- Publication number
- CN114500359B CN114500359B CN202210394547.9A CN202210394547A CN114500359B CN 114500359 B CN114500359 B CN 114500359B CN 202210394547 A CN202210394547 A CN 202210394547A CN 114500359 B CN114500359 B CN 114500359B
- Authority
- CN
- China
- Prior art keywords
- communication
- node
- connection
- cluster
- connection node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/126—Shortest path evaluation minimising geographical or physical path length
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention relates to a cluster dynamic networking method and a cluster dynamic system. The method comprises the steps that a first connecting node connected with a first communication cluster and a second connecting node connected with a second parcel are selected from a plurality of communication nodes of a first parcel, and a first dominant path is selected based on the first connecting node and the second connecting node; selecting a first connection point for each first remaining communication node outside the first dominant path in the first segment; selecting a third connecting node connected with the second communication cluster and a fourth connecting node connected with the first parcel from a plurality of communication nodes of the second parcel, and selecting a second dominant path based on the third and fourth connecting nodes; selecting a second connection point for each second remaining communication node outside the second dominant path in the second patch. The invention ensures the optimality of the link and the scheduling control of other communication nodes, and the selection and calculation processes are simpler and more efficient compared with the traditional scheme.
Description
Technical Field
The present invention relates to the field of communication networking, and in particular, to a cluster dynamic networking method and a cluster dynamic system.
Background
The internet technology has been developed for decades and has been widely used in the fields of life and military. Aiming at the difficult problem of mobile communication networking in some complex scenes, for example, mobile devices such as unmanned aerial vehicles and satellites carry out dynamic link selection and networking in the communication process, the existing ad hoc networking technical research is not complete. The traditional method is to consider complete non-intersection, shared nodes and shared paths, establish a plurality of links, select dominant communication links from the links, use the rest links as alternative links, and adopt the alternative links when the dominant path fails, so that the real-time optimization of the links cannot be ensured, and the link selection and calculation processes are complex.
Disclosure of Invention
The technical problem to be solved by the present invention is to provide a cluster dynamic networking method and a cluster dynamic system, which are not only simple and efficient, but also can select a dominant node in real time as required to ensure that a link is optimal, aiming at the above defects in the prior art.
The technical scheme adopted by the invention for solving the technical problems is as follows: a cluster dynamic networking method is constructed, and comprises the following steps:
s1, dividing a plurality of communication nodes between a first communication cluster and a second communication cluster which need to communicate into a first fragment and a second fragment respectively;
s2, selecting a first connection node connected to the first communication cluster and a second connection node connected to the second parcel from the plurality of communication nodes in the first parcel, and selecting a first dominant path based on the first connection node and the second connection node;
s3, selecting a first connection point for each first remaining communication node outside the first dominant path in the first segment;
s4, selecting a third connection node connected to the second communication cluster and a fourth connection node connected to the first parcel from the plurality of communication nodes in the second parcel, and selecting a second dominant path based on the third connection node and the fourth connection node;
s5, selecting a second connection point for each second remaining communication node outside the second dominant path in the second patch.
In the method for dynamically networking a cluster according to the present invention, the step S2 further includes the following steps:
s21, calculating the distance between each communication node in the first parcel and the first communication cluster, and selecting a first connecting node based on the security of the communication node and the distance between the communication node and the first communication cluster;
s22, calculating the distance between each communication node in the first parcel and the center point of the second parcel, and selecting a second connection node based on the security of the communication node and the distance between the communication node and the center point of the second parcel;
s23, acquiring a first dominant path based on the positions of the first connecting node and the second connecting node.
In the method for dynamically networking a cluster according to the present invention, the step S23 further includes the following steps:
s231, when the first connection node and the second connection node are the same communication node, the first dominant path is the first communication cluster-the same communication node-the second parcel;
s232, when the first connection node and the second connection node are different nodes located in a communication range of each other, the first dominant path is the first communication cluster-the first connection node-the second parcel;
s233, when the first connection node and the second connection node are different nodes located outside a communication range of each other, selecting a relay communication node from the plurality of communication nodes within the communication range of the first connection node, and constructing the first dominant path based on the first connection node, the second connection node, and the relay communication node, where the first dominant path is the first communication cluster-the first connection node-the relay communication node-the second connection node-the second segment.
In the method for dynamically networking a cluster according to the present invention, the step S3 further includes the following steps:
s31, regarding the remaining communication nodes which meet the security requirement in the remaining communication nodes outside the first dominant path in the first segment as the first remaining communication node;
s32, calculating the distance between each first residual communication node and the first connecting node and sequencing;
s33, selecting the first connection point for each of the first remaining communication nodes from alternative points based on hop count, distance and number of connection branches, wherein the alternative points are all communication nodes within a communication range of the first remaining communication node that have been connected to the first communication cluster.
In the dynamic cluster networking method of the present invention, in step S33, the alternative point with the minimum f value is selected as the first connection point
；
Wherein T represents the hop count from the first remaining communication node to p point through the alternative point, D represents the distance from the first remaining communication node to the alternative point, R represents the number of connection branches of the alternative point, T represents the maximum hop count supported by the first connection node, D represents the maximum communication distance of the alternative point, R represents the maximum number of connection branches of the alternative point, ω 1 represents the weight of the hop count, ω 2 represents the weight of the distance, and ω 3 represents the weight of the number of connection branches.
In the cluster dynamic networking method of the present invention, in the step S33, the determined expert points are determined based on a plurality of expert scoresThe weight of the number of hops, the weight of the distance and the weight of the number of connecting branches
，
Where e represents the number of experts,
represents the scoring of the ith expert for the jth item's weight.
In the method for dynamically networking a cluster according to the present invention, the step S4 further includes the following steps:
s41, calculating the distance between each communication node in the second parcel and the second communication cluster, and selecting a third connection node based on the security of the communication node and the distance between the communication node and the second communication cluster;
s42, calculating the distance between each communication node in the second fragment and the center point of the first fragment, and selecting a fourth connection node based on the security of the communication node and the distance between the communication node and the center point of the first fragment;
s43, acquiring a second dominant path based on the positions of the third connecting node and the fourth connecting node.
In the method for dynamically networking a cluster according to the present invention, the step S43 further includes the following steps:
s431, when the third connection node and the fourth connection node are the same communication node, the second dominant path is the second communication cluster-the same communication node-the first parcel;
s432, when the third connection node and the fourth connection node are different nodes located in a communication range of each other, the second dominant path is the second communication cluster-the third connection node-the fourth connection node-the first segment;
s433, when the third connection node and the fourth connection node are different nodes located outside a communication range of each other, selecting a relay communication node from a plurality of communication nodes within the communication range of the third connection node, and constructing the second dominant path based on the third connection node, the fourth connection node, and the relay communication node, where the second dominant path is the second communication cluster-the third connection node-the relay communication node-the fourth connection node-the first segment.
In the method for dynamically networking a cluster according to the present invention, the step S5 further includes the following steps:
s51, taking the remaining communication nodes meeting the security requirement in the remaining communication nodes outside the second dominant path in the second segment as the second remaining communication nodes;
s52, calculating the distance between each second residual communication node and the third connecting node and sequencing;
s53, selecting a second connection point for each of the second remaining communication nodes from alternative points based on the hop count, the distance and the number of connection branches, wherein the alternative points are all communication nodes within a communication range of the second remaining communication node that have been connected to the second communication cluster.
Another technical solution adopted by the present invention to solve the technical problem is to construct a dynamic cluster system, which is constructed according to the dynamic cluster networking method.
The invention ensures the optimality of the link by selecting the superior node in real time as required to establish the communication link in the moving process, the communication link is connected with other communication nodes to ensure the scheduling control of the other communication nodes, and the selection and calculation processes are simpler and more efficient compared with the traditional scheme. Further, the real-time requirement can be further met and the link can be further optimized by considering the distance, the hop count and the number of the connecting branches in multiple aspects.
Drawings
The invention will be further described with reference to the accompanying drawings and examples, in which:
FIG. 1 is a flow chart of the steps of a preferred embodiment of a cluster dynamic networking method of the present invention;
FIG. 2 is a flowchart of the steps for selecting a first connection node and a second connection node in the preferred embodiment of the cluster dynamic networking method of the present invention;
FIG. 3A is a schematic diagram of a first form of a first connection node and a second connection node;
FIG. 3B is a schematic diagram of a first connection node and a second connection node in a second form;
FIG. 3C is a schematic diagram of a third form of first and second connection nodes;
FIG. 4 is a flowchart of the steps of selecting a first dominant path in the preferred embodiment of the cluster dynamic networking method of the present invention;
fig. 5 is a flowchart of the steps of selecting the first connection point in the preferred embodiment of the cluster dynamic networking method of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention relates to a cluster dynamic networking method, which comprises the steps of dividing a plurality of communication nodes between a first communication cluster and a second communication cluster which need to communicate into a first fragment and a second fragment respectively; selecting a first connecting node connected with the first communication cluster and a second connecting node connected with the second parcel in a plurality of communication nodes of the first parcel, and selecting a first dominant path based on the first connecting node and the second connecting node; selecting a first connection point for each first remaining communication node outside the first dominant path in the first patch; selecting a third connecting node connected with the second communication cluster and a fourth connecting node connected with the first parcel in the plurality of communication nodes of the second parcel, and selecting a second dominant path based on the third connecting node and the fourth connecting node; selecting a second connection point for each second remaining communication node in the second patch outside the second dominant path. The invention ensures the optimality of the link by selecting the superior node in real time as required to establish the communication link in the moving process, the communication link is connected with other communication nodes to ensure the scheduling control of the other communication nodes, and the selection and calculation processes are simpler and more efficient compared with the traditional scheme. Further, the real-time requirement can be further met and the link can be further optimized by considering the distance, the hop count and the number of the connecting branches in multiple aspects.
Fig. 1 is a flowchart of steps of a preferred embodiment of a cluster dynamic networking method of the present invention. As shown in fig. 1, in step S1, a plurality of communication nodes between a first communication cluster and a second communication cluster that need to communicate are divided into a first segment and a second segment, respectively. Here, assuming that communication is to be performed between the two communication clusters X, Y, the wireless relay device may be used to divide a plurality of communication nodes between the two communication clusters X, Y into a plurality of sectors, and the present invention is described by taking the division into two sectors A, B as an example.
In step S2, a first connection node connecting the first communication cluster and a second connection node connecting the second parcel are selected from the plurality of communication nodes in the first parcel, and a first dominant path is selected based on the first connection node and the second connection node.
In a preferred embodiment of the present invention, the step S2 further includes calculating a distance between each of the communication nodes in the first parcel and the first communication cluster, and selecting a first connection node based on the security of the communication node and its distance from the first communication cluster; calculating a distance between each of the communication nodes in the first patch and a center point of the second patch, and selecting a second connection node based on the security of the communication node and its distance from the center point of the second patch; a first dominant path is then obtained based on the locations of the first and second connection nodes.
In step S3, a first connection point is selected for each first remaining communication node in the first patch outside the first dominant path. In a preferred embodiment of the present invention, the step S3 further includes taking, as the first remaining communication node, a remaining communication node that meets the security requirement among remaining communication nodes outside the first dominant path in the first segment; calculating the distance between each first residual communication node and the first connecting node and sequencing; and selecting a first connecting point from alternative points for each first residual communication node based on the hop count, the distance and the number of connecting branches, wherein the alternative points are all communication nodes which are connected with the first communication cluster in the communication range of the first residual communication node.
In step S4, a third connection node connecting the second communication cluster and a fourth connection node connecting the first parcel are selected from the plurality of communication nodes in the second parcel, and a second dominant path is selected based on the third connection node and the fourth connection node.
This step S4 is similar to step S2. In a preferred embodiment of the present invention, the step S4 further includes calculating a distance between each of the communication nodes in the second parcel and the second communication cluster, and selecting a third connection node based on the security of the communication node and its distance from the second communication cluster; calculating a distance between each of the communication nodes in the second patch and a center point of the first patch, and selecting a fourth connection node based on the security of the communication node and its distance from the center point of the first patch; and acquiring a second dominant path based on the positions of the third connecting node and the fourth connecting node.
In step S5, a second connection point is selected for each second remaining communication node in the second patch outside the second dominant path. This step S5 is similar to step S3. In a preferred embodiment of the present invention, the step S5 further takes, as the second remaining communication node, a remaining communication node that meets the security requirement, of remaining communication nodes outside the second dominant path in the second segment; calculating and sequencing the distance between each second remaining communication node and the third connecting node; and selecting a second connection point for each second remaining communication node from alternative points based on the hop count, the distance and the number of connection branches, wherein the alternative points are all communication nodes which are connected with the second communication cluster in the communication range of the second remaining communication node.
The invention ensures the optimality of the link by selecting the superior node in real time as required to establish the communication link in the moving process, the communication link is connected with other communication nodes to ensure the scheduling control of the other communication nodes, and the selection and calculation processes are simpler and more efficient compared with the traditional scheme. Further, the real-time requirement can be further met and the link can be further optimized by considering the distance, the hop count and the number of the connecting branches in multiple aspects.
Fig. 2 is a flowchart of steps for selecting a first connection node and a second connection node in the preferred embodiment of the cluster dynamic networking method of the present invention. FIG. 3A is a schematic diagram of a first form of a first connection node and a second connection node; FIG. 3B is a schematic diagram of a first connection node and a second connection node in a second form; FIG. 3C is a schematic diagram of a third form of first and second connection nodes; FIG. 4 is a flowchart illustrating a step of selecting a first dominant path according to an embodiment of the dynamic cluster networking method of the present invention; fig. 5 is a flowchart of the steps of selecting the first connection point in the preferred embodiment of the cluster dynamic networking method of the present invention.
The following further describes a preferred embodiment of the cluster dynamic networking method of the present invention with reference to fig. 2 to 5. First, assuming that communication is to take place between two communication clusters X, Y, a plurality of communication nodes between two communication clusters X, Y may be divided into a first segment a and a second segment B using a wireless relay device, as can be seen with reference to fig. 3A-3C.
The distance of each of the communication nodes in the first zone a to the first communication cluster X is then calculated and a first connection node p is selected based on the security of the communication node and its distance to the first communication cluster X. Specifically, as shown in fig. 2, at a certain time, a networking plan is performed for each current communication node situation, and in stepIn step S1, n in the first region A is calculated1The distances from the communication nodes to the first communication cluster X are sorted from small to large. Specifically, the first communication cluster X coordinate is noted as
And the position of each communication node in the first area A is recorded as the coordinate
The distance of each communication node to the first communication cluster X is calculated as
. And then sorted by distance from small to large.
In step S2, the communication node having the shortest distance to the first communication cluster X is selected as the preliminary connection node. In order to ensure the communication security, it is necessary to ensure that the selected relay communication node is safe, i.e., fully controllable. Therefore, in step S3, it is determined whether the communication node with the shortest distance is safe, and if so, the communication node is used as the connection node with the first communication cluster X, i.e., the first connection node p; if it is not safe, the process returns to step S2 to get the residual n1Selecting the communication node with the smallest distance from the first communication cluster X from the 1 communication nodes as a prepared connection node, and then executing step S3 to judge the safety condition. And repeating the steps until the safe communication node with the minimum distance is found. Then, step S4 is executed to connect the communication node with the first communication cluster X and to record it as the first connection node p.
In step S5, a distance between each of the communication nodes in the first patch a and a center point of the second patch B is calculated. For example, if there is n in the second patch B2A communication node, the position of each communication node is recorded as a coordinate
The center point of the second region B is expressed as
Which is equal to
. And the distance between each communication node in the first patch A and the center point of the second patch B is
. And then sorted by distance from small to large.
In step S6, the communication node having the shortest distance to the center point of the second segment B is selected as the preliminary connection node. In order to ensure the communication security, it is necessary to ensure that the selected relay communication node is safe, i.e., fully controllable. Therefore, in step S7, it is determined whether the communication node with the shortest distance is safe, and if so, the communication node is a connection node with the second parcel B, i.e., a second connection node q; if it is not safe, the process returns to step S6 to get n from the rest2Selecting the communication node with the smallest distance from the center point of the second segment B from the 1 communication nodes as a preparation connection node, and then executing step S7 to judge the safety condition. And repeating the steps until the safe communication node with the minimum distance is found. Then step S8 is executed to connect this communication node with the second partition B and to note as a second connecting node q.
The first connection node p and the second connection node q exist in three forms as shown in fig. 3A to 3C, i.e., the first connection node p and the second connection node q are the same point; the first connecting node p and the second connecting node q are different points but within communication range of each other; the first connecting node p and the second connecting node q are different points and are not within communication range of each other.
For these three different forms, fig. 4 shows a different flow of steps for selecting the first dominant path. As shown in fig. 4, when the first connection node p and the second connection node q are the same communication node, the first dominant path is the first communication cluster-the same communication node-the second parcel. That is, when the first connection node p and the second connection node q are the same communication node, as shown in fig. 3A, they are used as the connection nodes of the first communication cluster X and the second partition B, and an advantageous communication path X-p-B is obtained.
When the first connection node p and the second connection node q are different nodes located in communication ranges of each other, the first dominant path is the first communication cluster-the first connection node p-the second connection node q-the second parcel. That is, when the first connection node p and the second connection node q are different communication nodes but located within a communication range of each other, as shown in fig. 3B, the first connection node p and the second connection node q are respectively used as connection nodes with the first communication cluster X and the second partition B, and an advantageous communication path X-p-q-B is obtained.
When the first connection node p and the second connection node q are different nodes located outside a communication range of each other, selecting a relay communication node from a plurality of communication nodes within the communication range of the first connection node p, and constructing the first dominant path based on the first connection node p, the second connection node q, and the relay communication node, the first dominant path being the first communication cluster-the first connection node p-the relay communication node-the second connection node q-the second segment.
When the first connecting node p and the second connecting node q are different communication nodes and are located out of communication range with each other, as shown in fig. 3C and 4, the first dominant path is selected as follows.
Firstly, the security of the remaining communication nodes in the first area A is considered, and the nodes which do not meet the standard are screened out. For m communication nodes within the communication range of the first connection node p meeting the security standard, calculating the sum of the distances from each communication node to the first connection node p and the second connection node q, and then selecting the communication node with the shortest sum as a relay communication node k1 to be connected with the first connection node p. If said second connecting node q is within the communication range of the relay communication node k1, the first dominant path X-p-k1-q-B is obtained. If the second connecting node q is not in the communication range of the relay communication node k1, continuing the above steps, selecting the communication node k2 with the smallest distance to the relay communication node k1 and the second connecting node q among the L communication nodes in the communication range of the relay communication node k1, connecting the communication node k 3838 with the relay communication node k1, and repeating the above steps until the second connecting node q is in the range of the communication node ki, so as to obtain a first dominant path: x-p-k1-k2- … -ki-q-B.
In a further preferred embodiment of the present invention, when the first connecting node p and the second connecting node q are different communication nodes and are located out of communication range of each other, another method may also be used to select the first dominant path.
Firstly, the security of the remaining communication nodes in the first area A is considered, and the nodes which do not meet the standard are screened out. For m communication nodes within the communication range of the first connection node p that meet a security standard, the sum of the distances of each communication node to the first connection node p and the second connection node q is calculated. Then, the distance and the first three shortest paths are selected, and then the corresponding three undetermined communication nodes are recorded as k1, k2 and k3, if the three undetermined communication nodes are not selected, the three undetermined communication nodes are selected, and if the three undetermined communication nodes are not selected, the three undetermined communication nodes are selected, and the three undetermined communication nodes are selected as k1, k2 and k3
Within the communication range of the second connection node q, selecting
So that
The first dominant path X-p-k1-q-B is obtained. If it is not
Is not within the communication range of said second connecting node q, is removed by calculation
Other than
The sum of the distance from the communication node in the communication range to the second connection node q and the distance from the communication node in the communication range to the first connection node p, the first three paths with the shortest distance sum are selected, and the corresponding three nodes to be determined are recorded as
. If it is
Within the communication range of the second connection node q, selecting
So that
The first dominant path X-p-k1-k2-q-B is obtained. If it is not
Are not within the communication range of said second connecting node q, and the above-mentioned steps are continuously repeated until all are within the communication range of said second connecting node q
Within the communication range of said second connecting node q. Selecting
So that
Then, a first dominant path is obtained: x-p-k1-k2- … -ki-q-B.
Then, selecting a first connection point from the rest communication nodes outside the first dominant path in the first segment to continue connection. Fig. 5 is a flowchart of the steps of selecting the first connection point in the preferred embodiment of the cluster dynamic networking method of the present invention.
As shown in fig. 5, in step S1, the security of the remaining communication nodes outside the first dominant path in the first partition is considered, the nodes that do not meet the security standard are deleted, and the remaining communication nodes that meet the security requirement are used as the first remaining communication nodes. In step S2, the distance between each of the first remaining communication nodes and the first connection node p is calculated and sorted. It is assumed that the distances from the remaining n satisfactory communication nodes to the first connection node p are calculated and are respectively marked as { first remaining communication node 1, first remaining communication node 2, …, first remaining communication node n } in the order of decreasing distance.
In step S3, a first connection point is selected for each of the first remaining communication nodes from alternative points based on hop count, distance and number of connection legs, wherein the alternative points are all communication nodes within a communication range of the first remaining communication node that have been connected to the first communication cluster. Specifically, for { first remaining communication node 1, first remaining communication node 2, …, first remaining communication node n }, the specific steps of selecting the first connection point of the first remaining communication node i are as follows.
And taking all communication nodes connected (including direct connection and indirect connection) with the first communication cluster X in the communication range of the first remaining communication node i as alternative points, and selecting the first connection point from the alternative points by considering three indexes of hop count, distance and number of connection branches.
The specific method is based on selecting the alternative point with the minimum f value as the first connecting point
(ii) a Where T represents the number of hops from the first remaining communication node to p point through the alternative point, D represents the distance from the first remaining communication node to the alternative point, R represents the number of connection branches of the alternative point, T represents the maximum number of hops supported by the first connection node, D represents the maximum communication distance of the alternative point, R represents the maximum number of connection branches of the alternative point, ω 1 represents the weight of the number of hops, ω 2 represents the weight of the distance, ω 3 represents the weight of the number of connection branches, and f can be understood as an alternative calculation value, which is determined by the aforementioned parameters, preferably the minimum thereof.
Determining the weight omega 1 of the hop count, the weight omega 2 of the distance and the weight omega 3 of the number of the connecting branches based on a plurality of expert scores, wherein the expert scores are generally according to the importance degree: the division into { important, general, unimportant }, which may correspond to scores {5,3,1}, respectively. Table 1 shows the scoring of three indices by e experts, respectively. The weight ω 1 of the hop count, the weight ω 2 of the distance and the weight ω 3 of the number of connected branches can be calculated according to the expert scoring of table 1 and the following formula:
Table 1
The connection between each communication node (i.e. a plurality of said first connection points) in the first zone a to the first connection node p can be obtained based on the above scheme.
And for the second patch B, the method is similar to the connection of the first patch a. First, based on the embodiment shown in fig. 2, a third connecting node t in the second patch B closest to the second communication cluster Y and a fourth connecting node s in the second patch B closest to the center point of the first patch a may be found. Then, referring to the embodiment shown in fig. 4, a second dominant path from the second communication cluster Y to the first patch a is obtained. Further, with reference to the embodiment shown in fig. 5, the connection between each communication node in the second patch B to the third connection node t may be obtained. Based on the teachings of the present invention, those skilled in the art can complete the acquisition and connection of the second dominant path and each communication node (i.e., the second connection point) in the second segment B, which will not be described in detail herein.
The invention ensures the optimality of the link by selecting the superior node in real time as required to establish the communication link in the moving process, the communication link is connected with other communication nodes to ensure the scheduling control of the other communication nodes, and the selection and calculation processes are simpler and more efficient compared with the traditional scheme. Furthermore, by considering the distance, the hop count and the number of the connecting branches in multiple aspects, the real-time requirement can be further met, and the link can be further optimized.
The invention also relates to a cluster dynamic system constructed according to the cluster dynamic networking method. Based on the foregoing teaching of the cluster dynamic networking method, those skilled in the art can construct a cluster dynamic networking method according to the foregoing teaching, and thus, the description is not repeated here.
Furthermore, the present invention can be realized in hardware, software, or a combination of hardware and software. The present invention can be realized in a centralized fashion in at least one computer system, or in a distributed fashion where different elements are spread across several interconnected computer systems. Any kind of computer system or other apparatus adapted for carrying out the methods of the present invention is suited. A typical combination of hardware and software could be a general purpose computer system with a computer program that, when being loaded and executed, controls the computer system such that it carries out the methods described herein.
The present invention may also be implemented by a computer program product, comprising all the features enabling the implementation of the methods of the invention, when loaded in a computer system. The computer program in this document refers to: any expression, in any programming language, code or notation, of a set of instructions intended to cause a system having an information processing capability to perform a particular function either directly or after either or both of the following: a) conversion to other languages, codes or symbols; b) reproduced in a different format.
While the invention has been described with reference to specific embodiments, it will be understood by those skilled in the art that various changes may be made and equivalents may be substituted without departing from the scope of the invention. In addition, many modifications may be made to adapt a particular situation or material to the teachings of the invention without departing from its scope. Therefore, it is intended that the invention not be limited to the particular embodiment disclosed, but that the invention will include all embodiments falling within the scope of the appended claims.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and is not to be construed as limiting the invention, and any modifications, equivalents and improvements made within the spirit and principle of the present invention are intended to be included within the scope of the present invention.
Claims (9)
1. A cluster dynamic networking method is characterized by comprising the following steps:
s1, dividing a plurality of communication nodes between a first communication cluster and a second communication cluster which need to communicate into a first fragment and a second fragment respectively;
s2, selecting a first connection node connected with the first communication cluster and a second connection node connected with the second parcel from the plurality of communication nodes of the first parcel, and selecting a first dominant path based on the first connection node and the second connection node;
s3, selecting a first connection point for each first remaining communication node outside the first dominant path in the first patch;
s4, selecting a third connection node connected to the second communication cluster and a fourth connection node connected to the first parcel from the plurality of communication nodes in the second parcel, and selecting a second dominant path based on the third connection node and the fourth connection node;
s5, selecting a second connection point for each second remaining communication node outside the second dominant path in the second segment;
the step S3 further includes the steps of:
s31, regarding the remaining communication nodes which meet the security requirement in the remaining communication nodes outside the first dominant path in the first segment as the first remaining communication node;
s32, calculating the distance between each first residual communication node and the first connecting node and sequencing;
s33, selecting the first connection point for each of the first remaining communication nodes from alternative points based on hop count, distance and number of connection branches, wherein the alternative points are all communication nodes within a communication range of the first remaining communication node that have been connected to the first communication cluster.
2. The cluster dynamic networking method according to claim 1, wherein the step S2 further comprises the steps of:
s21, calculating the distance between each communication node in the first parcel and the first communication cluster, and selecting a first connecting node based on the security of the communication node and the distance between the communication node and the first communication cluster;
s22, calculating the distance between each communication node in the first parcel and the center point of the second parcel, and selecting a second connection node based on the security of the communication node and the distance between the communication node and the center point of the second parcel;
s23, acquiring a first dominant path based on the positions of the first connecting node and the second connecting node.
3. The cluster dynamic networking method according to claim 2, wherein the step S23 further comprises the steps of:
s231, when the first connection node and the second connection node are the same communication node, the first dominant path is the first communication cluster-the same communication node-the second parcel;
s232, when the first connection node and the second connection node are different nodes located in a communication range of each other, the first dominant path is the first communication cluster-the first connection node-the second parcel;
s233, when the first connection node and the second connection node are different nodes located outside a communication range of each other, selecting a relay communication node from the plurality of communication nodes within the communication range of the first connection node, and constructing the first dominant path based on the first connection node, the second connection node, and the relay communication node, where the first dominant path is the first communication cluster-the first connection node-the relay communication node-the second connection node-the second segment.
4. The method according to claim 3, wherein in step S33, the alternative point with the smallest value is selected as the first connection point
；
Wherein T represents the hop count from the first remaining communication node to p point through the alternative point, D represents the distance from the first remaining communication node to the alternative point, R represents the number of connection branches of the alternative point, T represents the maximum hop count supported by the first connection node, D represents the maximum communication distance of the alternative point, R represents the maximum number of connection branches of the alternative point, ω 1 represents the weight of the hop count, ω 2 represents the weight of the distance, and ω 3 represents the weight of the number of connection branches.
5. The method for cluster dynamic networking according to claim 4, wherein in the step S33, the weight of the hop count, the weight of the distance and the weight of the number of connected branches are determined based on a plurality of expert scores
，
Where e represents the number of experts,
represents the scoring of the ith expert for the jth item's weight.
6. The cluster dynamic networking method according to any one of claims 1 to 5, wherein the step S4 further comprises the following steps:
s41, calculating a distance between each communication node in the second parcel and the second communication cluster, and selecting a third connection node based on the security of the communication node and its distance from the second communication cluster;
s42, calculating the distance between each communication node in the second fragment and the center point of the first fragment, and selecting a fourth connection node based on the security of the communication node and the distance between the communication node and the center point of the first fragment;
s43, acquiring a second dominant path based on the positions of the third connecting node and the fourth connecting node.
7. The cluster dynamic networking method according to claim 6, wherein the step S43 further comprises the steps of:
s431, when the third connection node and the fourth connection node are the same communication node, the second dominant path is the second communication cluster-the same communication node-the first segment;
s432, when the third connection node and the fourth connection node are different nodes located within a communication range of each other, the second dominant path is the second communication cluster-the third connection node-the fourth connection node-the first parcel;
s433, when the third connection node and the fourth connection node are different nodes located outside a communication range of each other, selecting a relay communication node from the plurality of communication nodes within the communication range of the third connection node, and constructing the second dominant path based on the third connection node, the fourth connection node, and the relay communication node, where the second dominant path is the second communication cluster-the third connection node-the relay communication node-the fourth connection node-the first segment.
8. The cluster dynamic networking method according to claim 7, wherein the step S5 further comprises the steps of:
s51, taking the remaining communication nodes meeting the security requirement in the remaining communication nodes except the second dominant path in the second segment as the second remaining communication nodes;
s52, calculating the distance between each second residual communication node and the third connecting node and sequencing;
s53, selecting the second connection point for each of the second remaining communication nodes from alternative points based on hop count, distance and number of connection legs, wherein the alternative points are all communication nodes within communication range of the second remaining communication nodes that have been connected to the second communication cluster.
9. A cluster dynamic system, characterized by being constructed according to the cluster dynamic networking method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210394547.9A CN114500359B (en) | 2022-04-15 | 2022-04-15 | Cluster dynamic networking method and cluster dynamic system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210394547.9A CN114500359B (en) | 2022-04-15 | 2022-04-15 | Cluster dynamic networking method and cluster dynamic system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114500359A CN114500359A (en) | 2022-05-13 |
| CN114500359B true CN114500359B (en) | 2022-07-12 |
Family
ID=81489685
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210394547.9A Active CN114500359B (en) | 2022-04-15 | 2022-04-15 | Cluster dynamic networking method and cluster dynamic system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114500359B (en) |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1620027A (en) * | 2003-09-15 | 2005-05-25 | 微软公司 | Measurement-based construction of locality-aware overlay networks |
| CN104836730A (en) * | 2015-05-08 | 2015-08-12 | 东南大学 | Layer-based clustering routing protocol method applied to three-dimensional underwater acoustic sensor network |
| CN107277828A (en) * | 2017-06-30 | 2017-10-20 | 天津大学 | A kind of information physical system planing method of equalizing system failure risk |
| CN107613480A (en) * | 2017-09-24 | 2018-01-19 | 中南大学 | A kind of method of data capture based on tree-shaped cluster and mobile element |
| CN109990796A (en) * | 2019-04-23 | 2019-07-09 | 成都信息工程大学 | Intelligent vehicle paths planning method based on two-way extension random tree |
| CN110784373A (en) * | 2019-10-18 | 2020-02-11 | 深圳市永达电子信息股份有限公司 | Virtual network convergence method and device |
| CN113260012A (en) * | 2021-05-31 | 2021-08-13 | 四川腾盾科技有限公司 | Unmanned aerial vehicle cluster topology control method based on position track prediction |
| CN113395660A (en) * | 2021-06-18 | 2021-09-14 | 河南大学 | WSNs mobile convergence node self-adaptive position updating energy consumption optimization method based on tree |
| CN113596119A (en) * | 2021-07-16 | 2021-11-02 | 中移（杭州）信息技术有限公司 | Edge capability distribution method, system, device and computer readable storage medium |
| CN113867382A (en) * | 2021-09-01 | 2021-12-31 | 西安电子科技大学广州研究院 | Topology control method of unmanned aerial vehicle cluster network |
Family Cites Families (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101877138B (en) * | 2009-04-30 | 2014-01-15 | 国际商业机器公司 | Animation planning method and device of dynamic diagram |
| CN107330030B (en) * | 2017-06-23 | 2019-10-15 | 南京师范大学 | A kind of hierarchical network construction method towards the compression storage of magnanimity road net data |
| CN107612725B (en) * | 2017-09-09 | 2023-07-11 | 国网浙江杭州市萧山区供电公司 | Planning method for power distribution communication access network |
| CN109525958A (en) * | 2018-12-22 | 2019-03-26 | 北京工业大学 | A kind of unmanned plane cluster network controller design method of software definition |
| CN110087208B (en) * | 2019-05-21 | 2021-04-06 | 昆明理工大学 | WSN partition double-communication recovery method based on Steiner tree and convex polygon |
| CN111294108B (en) * | 2020-01-15 | 2021-12-14 | 南京航空航天大学 | Efficient routing method for orthogonal circular orbit configuration satellite constellation |
| US11374852B2 (en) * | 2020-05-29 | 2022-06-28 | Huawei Technologies Co., Ltd. | Piecewise shortest path first routing |
| CN113206784B (en) * | 2021-05-08 | 2022-04-08 | 桂林电子科技大学 | Source position privacy protection method based on multipath random routing |
-
2022
- 2022-04-15 CN CN202210394547.9A patent/CN114500359B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1620027A (en) * | 2003-09-15 | 2005-05-25 | 微软公司 | Measurement-based construction of locality-aware overlay networks |
| CN104836730A (en) * | 2015-05-08 | 2015-08-12 | 东南大学 | Layer-based clustering routing protocol method applied to three-dimensional underwater acoustic sensor network |
| CN107277828A (en) * | 2017-06-30 | 2017-10-20 | 天津大学 | A kind of information physical system planing method of equalizing system failure risk |
| CN107613480A (en) * | 2017-09-24 | 2018-01-19 | 中南大学 | A kind of method of data capture based on tree-shaped cluster and mobile element |
| CN109990796A (en) * | 2019-04-23 | 2019-07-09 | 成都信息工程大学 | Intelligent vehicle paths planning method based on two-way extension random tree |
| CN110784373A (en) * | 2019-10-18 | 2020-02-11 | 深圳市永达电子信息股份有限公司 | Virtual network convergence method and device |
| CN113260012A (en) * | 2021-05-31 | 2021-08-13 | 四川腾盾科技有限公司 | Unmanned aerial vehicle cluster topology control method based on position track prediction |
| CN113395660A (en) * | 2021-06-18 | 2021-09-14 | 河南大学 | WSNs mobile convergence node self-adaptive position updating energy consumption optimization method based on tree |
| CN113596119A (en) * | 2021-07-16 | 2021-11-02 | 中移（杭州）信息技术有限公司 | Edge capability distribution method, system, device and computer readable storage medium |
| CN113867382A (en) * | 2021-09-01 | 2021-12-31 | 西安电子科技大学广州研究院 | Topology control method of unmanned aerial vehicle cluster network |
Non-Patent Citations (3)
| Title |
|---|
| Comparative Analysis of Route Planning Algorithms on Road Networks;R. K. Yadav;《Proceedings of the Fifth International Conference on Communication and Electronics Systems (ICCES 2020)》;20200710;全文 * |
| 基于信息交互的无人机集群建模与韧性评估;李艳军;《CNKI中国硕士论文全文数据库》;20210115;全文 * |
| 基于最短路径和负载动态的改进路由策略;孙玺菁;《海军航空工程学院学报》;20150915;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114500359A (en) | 2022-05-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sardouk et al. | Crisis management using MAS-based wireless sensor networks | |
| Qi et al. | CDS-based topology control in FANETs via power and position optimization | |
| CN108519737B (en) | Unmanned equipment path planning method considering energy supply | |
| CN108134772B (en) | Safe routing method realized by adopting AODV (Ad hoc on demand distance vector) or DSDV (direct distance vector) protocol | |
| CN110798841B (en) | Multi-hop wireless network deployment method, network capacity determination method and device | |
| CN113645143B (en) | Optimization method and device for air trunking communication network | |
| Hara et al. | Data replication methods based on the stability of radio links in ad hoc networks | |
| CN111861018B (en) | Warehouse picking path optimization method, storage medium and equipment based on routing information protocol | |
| CN113867382A (en) | Topology control method of unmanned aerial vehicle cluster network | |
| WO2019208639A1 (en) | Optimization device, optimization method, and program | |
| US6052678A (en) | Problem solving operation apparatus using a state transition | |
| CN114500359B (en) | Cluster dynamic networking method and cluster dynamic system | |
| CN113411766B (en) | Intelligent Internet of things comprehensive sensing system and method | |
| CN111683384B (en) | Network optimization method for realizing dynamic weighting of communication link by artificial intelligence | |
| CN110662272A (en) | Minimum-number pilot selection method based on swarm unmanned aerial vehicle | |
| CN109152079B (en) | Time slot scheduling and channel allocation method for TSCH (three-channel switched capacitor) network | |
| CN116867025A (en) | Sensor node clustering method and device in wireless sensor network | |
| CN110519820A (en) | A kind of method for routing applied in cluster UAV Communication | |
| CN116307328A (en) | Greedy solving method for travel business problem | |
| Lin et al. | CADer: a deep reinforcement learning approach for designing the communication architecture of system of systems | |
| CN108804582A (en) | Method based on the chart database optimization of complex relationship between big data | |
| CN106068033A (en) | Optimized power allocation method based on outage probability under the new agreement of a kind of collaboration communication | |
| Wang et al. | Learning-based dynamic connectivity maintenance for UAV-assisted D2D multicast communication | |
| CN107682904A (en) | Mobile ad-hoc network group mobility behavior decision method | |
| Xu et al. | Research on cooperative task allocation for multiple UCAVs based on modified co-evolutionary genetic algorithm |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |