CN115190043B - Method, computer system and medium for dual connectivity determination of communication network - Google Patents
Method, computer system and medium for dual connectivity determination of communication network Download PDFInfo
- Publication number
- CN115190043B CN115190043B CN202210700766.5A CN202210700766A CN115190043B CN 115190043 B CN115190043 B CN 115190043B CN 202210700766 A CN202210700766 A CN 202210700766A CN 115190043 B CN115190043 B CN 115190043B
- Authority
- CN
- China
- Prior art keywords
- matrix
- node
- communication network
- nodes
- sub
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0805—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability
- H04L43/0811—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters by checking availability by checking connectivity
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
Abstract
The invention discloses a method, a computer system, a medium and a program product for dual-connectivity determination of a communication network. The method comprises the following steps: acquiring an undirected communication network topology graph G consisting of N nodes of a communication network; obtaining an adjacency matrix A of an undirected communication network topology graph G, wherein N nodes in the adjacency matrix A are arranged in a first node sequence; processing the adjacent matrix A by using a Prim algorithm to obtain a minimum spanning tree T of the undirected communication network topological graph G; the minimum spanning tree T is a path from one end starting point in the T, which passes through all other nodes in the T once and only once and then reaches the end point at the other end in the T, and the nodes on the minimum spanning tree T are arranged according to a second node sequence; when the number of the nodes in the second node sequence is N, determining an undirected communication network topology graph G as a communication graph; and when the undirected communication network topology graph G is a connectivity graph, determining the bicontinuity of the G by performing a series of elementary transformations on the adjacency matrix of the undirected communication graph G.
Description
Technical Field
The invention belongs to the field of communication, in particular to the field of communication network connectivity judgment, and relates to a method, a computer system and a medium for judging double communication of a communication network.
Background
The communication network topology having dual connectivity means that when no node exists in the undirected communication network topology connectivity graph, the communication network topology graph is a dual connectivity graph, and the communication network topology has dual connectivity. The node refers to a node of a communication network in a topological connectivity graph of an undirected communication network, if a certain node is disconnected from the communication network, and the connectivity graph is divided into two or more independent sub-connectivity graphs. In particular, if two adjacent nodes exist in the communication network topology undirected communication graph, the two nodes and the edge connecting the two nodes together form a bridge.
With the development of communication, computer, artificial intelligence, autonomous control and other technologies, the aircraft performs tasks in a multi-aircraft/cluster cooperative manner, so as to further improve task efficiency, and become an important task mode in the future. If no node is present in the communication network topology communication diagram of the multi-aircraft system, namely the communication network has double communication, when any one of the aircraft nodes is interfered or destroyed, the communication topology networks among the rest aircraft nodes can still be communicated, and the communication network with double communication has strong survivability and can be more suitable for increasingly complex aircraft task environments. Therefore, the gateway node is quickly searched in the dynamic communication topology communication network between the aircrafts, and whether the communication topology network has double connectivity or not is judged, so that the method has important application value.
The node searching method in the current communication topological network is mostly a node searching method based on a traversal algorithm and a fast suspected node searching method based on a Fisher vector. The joint point searching method based on the traversal algorithm has large calculation amount, and is difficult to meet the requirements of rapidness and instantaneity for searching the joint point in the dynamic communication network environment; in the fast suspicious node searching method based on the Fisher vector, the completeness of the node searching is insufficient because only partial suspicious nodes can be given.
Disclosure of Invention
In view of the foregoing, the present disclosure provides a method, apparatus, device, and method thereof for communication network dual connectivity determination, a computer system, medium, and program product that can quickly determine dual connectivity.
In one aspect of an embodiment of the present invention, a method for dual connectivity determination for a communication network is provided. The method comprises the following steps: acquiring an undirected communication network topology graph G composed of N nodes of the communication network, wherein N is an integer greater than 2; acquiring an adjacency matrix A of the undirected communication network topology graph G, wherein the N nodes in the adjacency matrix A are arranged in a first node sequence; processing the adjacent matrix A by using a Crim algorithm to obtain a minimum spanning tree T of the undirected communication network topology graph G; the minimum spanning tree T is a path which starts from one end of the T and reaches the end of the other end of the T after passing through all other nodes in the T once and only once; the nodes on the minimum spanning tree T are according to a second node sequence; when the number of the nodes in the second node sequence is N, determining that the undirected communication network topological graph G is a communication graph; and when the undirected communication network topology graph G is a connectivity graph, determining the dual connectivity of the undirected communication network topology graph G through the following steps S1 to S5. S1, acquiring an equivalent matrix A ' of an adjacent matrix A, wherein the equivalent matrix A ' is another adjacent matrix of the undirected communication network topological graph G, and the N nodes in the equivalent matrix A ' are arranged in the second node sequence. S2, dividing N sub-matrix blocks from the equivalent matrix A', wherein N is an integer greater than or equal to 1 and less than N, and S2 comprises S2.1-S2.3. S2.1, in the lower triangle part of the equivalent matrix A', from the first column, sequentially searching row-column coordinates with the element value of 1 which is farthest from the secondary diagonal in each column downwards according to rows in each column; s2.2, starting from the second column of the equivalent matrix A', sequentially comparing the magnitudes of the row coordinate values recorded in the current column with those recorded in the previous column, wherein if the row coordinate value recorded in the j-1 column is smaller than or equal to the row coordinate value recorded in the j-1 column, deleting the coordinate recorded in the j-1 column, and finally reserving n coordinates; s2.3, the main diagonal elements in the rows determined by the abscissa in each of the n coordinates and the main diagonal elements in the columns determined by the ordinate are taken as two endpoints, and a square matrix is defined in the equivalent matrix, so that the n sub-matrix blocks are obtained. And S3, based on the corresponding relation between the coordinates contained in each sub-matrix block and each node in the second node sequence, acquiring the nodes contained in each sub-matrix block in the n sub-matrix blocks, and acquiring node sets corresponding to the n sub-matrix blocks respectively. S4, sequentially taking intersection sets from two to two for node sets corresponding to the n sub-matrix blocks respectively to obtain n-1 intersection sets. S5, determining whether the undirected communication network topology graph G has double connectivity or not based on the respective node numbers of the n-1 intersections; wherein when there is an intersection with a node number of 1 among the n-1 intersections, it is determined that the undirected communication network topology graph G is not a double communication graph and the communication network does not have double communication; and determining the nodes in the intersection set with the node number of 1 as the gateway nodes in the undirected communication network topology graph G.
According to an embodiment of the present invention, the S5 further includes: after determining the node points in the undirected communication network topology graph G, if node sets with the number of 2 exist in the node sets corresponding to the n sub-matrix blocks, determining whether the nodes in the node sets with the number of 2 are node points; and if two nodes in the node set with the node number of 2 are all joint points, determining that the two joint points and edges connecting the two joint points form a bridge in the undirected communication network topological graph G together.
According to an embodiment of the present invention, the S5 further includes: and when the number of nodes of each intersection of the n-1 intersections is greater than 1 and the number of nodes in the node sets corresponding to the n sub-matrix blocks is not 2, determining that the undirected communication network topology graph G is a double-communication graph and the communication network has double-communication.
According to an embodiment of the present invention, the S1 includes: obtaining an adjustment matrix L corresponding to the adjacent matrix A, wherein the expression of the adjustment matrix L is as follows:
wherein T is k Numbering the kth node in the second node sequence, wherein the number T of the kth node in the second node sequence k The value of the (b) is the number value of the kth node in the first node sequence;
multiplying the adjustment matrix L by the adjacency matrix A to the left and multiplying the transpose L of the adjustment matrix to the right T And obtaining the equivalent matrix A'.
According to an embodiment of the present invention, the obtaining the adjustment matrix L corresponding to the adjacency matrix a includes: and based on the corresponding relation of the numbers of the nodes at the same position in the first node sequence and the second node sequence, performing elementary transformation of exchanging two rows on the N-order identity matrix to obtain the adjustment matrix L.
According to an embodiment of the present invention, the S2.3 includes: searching a main diagonal element of a row and a column where each coordinate in the n coordinates is located in the equivalent matrix A'; two elements corresponding to each coordinate are taken as a main diagonal element set, and n main diagonal element sets are obtained by corresponding to the n coordinates one by one; and respectively taking two elements in each main diagonal element set as two endpoints, and demarcating a square matrix in an equivalent matrix A' to obtain the n sub-matrix blocks.
According to an embodiment of the present invention, the S3 includes: recording the coordinate range of the main diagonal element of each sub-matrix block on the main diagonal in the equivalent matrix A'; corresponding the coordinate values in the coordinate range to the nodes in the second node sequence to obtain a sub-node sequence contained in each sub-matrix block; and obtaining a node set contained in each sub-matrix block based on the sub-node sequence contained in each sub-matrix block.
According to an embodiment of the invention, the communication network is a communication network for use between aircraft, and the N nodes are N aircraft nodes.
In a second aspect of embodiments of the present invention, a computer system is provided. The computer system includes: one or more processors and memory. The memory is configured to store one or more programs that, when executed by the one or more processors, cause the one or more processors to perform the above-described method.
In a third aspect of embodiments of the present invention, there is also provided a computer-readable storage medium having stored thereon executable instructions that, when executed by a processor, cause the processor to perform the above-described method.
One or more of the above embodiments have the following advantages or benefits: a transformation matrix is constructed based on a spanning tree of an undirected communication network topological graph, and a series of elementary transformations are carried out on an adjacent matrix of the undirected communication network topological graph, so that a method for dynamically judging double connectivity and all nodes of the undirected communication network topological graph is provided, and the technical effect of quickly judging whether the communication network has double connectivity can be realized.
Drawings
FIG. 1 is an aircraft p in accordance with an embodiment of the invention 1 ，p 2 ，…，p N Connectivity and dual-connectivity judging flow chart of undirected communication network topology graph G between nodes;
FIG. 2 is a given undirected communication network topology G with independent nodes present;
fig. 3 is a adjacency matrix a corresponding to the undirected communication network topology G shown in fig. 2;
FIG. 4 is a corresponding node relation adjustment matrix L designed according to the minimum spanning tree node order obtained by the Prim algorithm for the undirected communication network topology G shown in FIG. 2;
fig. 5 is an equivalent matrix a' obtained by adjusting the adjacent matrix a corresponding to the undirected communication network topology graph G shown in fig. 2;
FIG. 6 is a diagram showing the position of the element "1" farthest from the minor diagonal in each column sequentially looking down in the equivalent matrix A' shown in FIG. 5, and marking after choosing;
FIG. 7 is a schematic diagram of defining each sub-matrix block in the equivalence matrix A' shown in FIG. 5, and determining a corresponding set of nodes for each sub-matrix block;
FIG. 8 is a diagram illustrating the determination of the intersection of adjacent sub-matrix blocks in the equivalence matrix A' shown in FIG. 5;
fig. 9 is a given further undirected communication network topology G with bridges present;
fig. 10 is an adjacency matrix a corresponding to the undirected communication network topology G shown in fig. 9;
FIG. 11 is a corresponding node relation adjustment matrix L designed in the sequence of minimum spanning tree nodes obtained by the Prim algorithm for the undirected communication network topology G shown in FIG. 9;
fig. 12 is an equivalent matrix a' obtained by adjusting the adjacent matrix a corresponding to the undirected communication network topology graph G shown in fig. 9;
FIG. 13 is a diagram showing the position of the element "1" farthest from the minor diagonal in each column sequentially searched downward in the equivalent matrix A' shown in FIG. 12, and marked after rounding;
FIG. 14 is a schematic diagram of defining each sub-matrix block in the equivalence matrix A' shown in FIG. 12, and determining a corresponding set of nodes for each sub-matrix block;
FIG. 15 is a diagram illustrating the determination of the intersection of adjacent sub-matrix blocks in the equivalence matrix A' shown in FIG. 12; and
FIG. 16 is a block diagram of a computer system for dual connectivity determination of a communication network in accordance with an embodiment of the present invention.
Detailed Description
The present invention will be further described in detail below with reference to specific embodiments and with reference to the accompanying drawings, in order to make the objects, technical solutions and advantages of the present invention more apparent. FIG. 1 shows N aircraft and node p 1 ，p 2 ，…，p N Connectivity and dual-connectivity decision flow chart of the undirected communication network topology graph G; FIGS. 2-8 are examples of node lookup and dual connectivity decisions in the presence of independent nodes in a undirected communication network topology; fig. 9 to 15 are examples of node lookup and dual connectivity determination in the case where a bridge exists in the undirected communication network topology, i.e., two nodes are adjacent. FIG. 16 is a block diagram of a computer system according to an embodiment of the present invention. It should be noted that the communication network described below is an inter-aircraft network, and the present invention is not limited to the application range of the communication network.
According to the embodiment of the invention, a spanning tree of the undirected communication network topological graph of the aircraft is utilized, a transformation matrix is constructed based on the spanning tree, a series of elementary transformations are carried out on the adjacent matrix of the undirected communication network topological graph, each sub-block in the communication topological graph is divided in the transformed adjacent matrix, aircraft node sets corresponding to each sub-block are obtained, the intersection sets are sequentially acquired two by two through each aircraft node set, the number of nodes in the intersection sets is judged, and all the nodes of the communication topological graph are obtained, and the bicontinuity is judged. The embodiment of the invention can quickly find all the nodes of the communication topological graph in the dynamic communication network environment of the aircraft, thereby giving double-connectivity judgment.
FIG. 1 is an aircraft p according to an embodiment of the invention 1 ，p 2 ，…，p N Connectivity and dual connectivity decision flow diagrams of the undirected communication network topology graph G between nodes.
As shown in fig. 1, the decision flow may be generally divided into steps one to three, wherein step two includes sub-steps 1) to 2), and step three includes sub-steps 1) to 5).
Step one, obtaining N aircrafts p 1 ，p 2 ，…，p N Adjacency matrix a of undirected communication network topology G between nodes, where p 1 ，p 2 ，…，p N I.e. the first node sequence. The concrete explanation is as follows:
n aircraft p 1 ，p 2 ，…，p N The adjacency matrix A corresponding to the undirected communication network topological graph G between the nodes is an N multiplied by N order square matrix, wherein N is the number of aircraft nodes in the communication network topological graph G, and the aircraft p 1 ，p 2 ，…，p N The corresponding node numbers of the nodes are 1,2, … and N:
step two, N aircraft p 1 ，p 2 ，…，p N Connectivity determination of a topological graph G of the undirected communication network among nodes is specifically described as follows:
1) For N aircraft p 1 ，p 2 ，…，p N The adjacency matrix A corresponding to the undirected communication network topological graph G among the nodes obtains an aircraft node sequence on a minimum spanning tree T through the Prim algorithm (namely, prim algorithm)(i.e., a second node sequence) in which the corresponding node numbers of the respective nodes in the second node sequence are sequentially T 1 、T 2 、…、T k 、…、T K ；
2) If the number K of the nodes contained in the obtained aircraft node sequence on the minimum spanning tree T is equal to N, communicating an undirected communication network topological graph G among N aircrafts, and turning to the step III; otherwise, the undirected communication network topology G between the N aircraft is not connected, and thus is not double-connected.
Step three, N aircraft p 1 ，p 2 ，…，p N The dual-connectivity judgment of the undirected communication network topological graph G between the nodes is specifically described as follows:
1) Aircraft node sequences on minimum spanning tree T for adjacency matrix A Corresponding node number T 1 、T 2 、…、T k 、…、T K (where k=n) acquisition of the corresponding adjustment matrix L for the construction of the line exchange in a series of elementary transformations:
adjusting matrix L to N-order identity matrix I N×N According to the node number T corresponding to the aircraft node sequence on the minimum spanning tree T 1 、T 2 、…、T k 、…、T K (k=n) by a corresponding series of elementary transformations of two interchangeable rows, namely:
2) Aircraft node sequence on minimum spanning tree T for mapping adjacency matrix A Corresponding node number T 1 、T 2 、…、T k 、…、T K (k=n) performing a series of elementary transformations corresponding to the two-row and two-column exchanges to generate an equivalent matrix a' of the adjacency matrix a, as follows:
the equivalent matrix A' of the adjacent matrix A is obtained by multiplying the adjacent matrix A by the adjusting matrix L and multiplying the adjacent matrix A by the transpose L of the adjusting matrix L T The method comprises the following steps:
A′＝L×A×L T
the equivalent matrix A' of the adjacent matrix A is an NxN-order square matrix, and N is the number of aircraft nodes in the undirected communication network topological graph G. The equivalent matrix A' of the adjacent matrix A is the minimum spanning tree node sequence givenCorresponding node number T 1 、T 2 、…、T k 、…、T K (k=n) arranged adjacency matrix, i.e.:
3) Each sub-matrix block is defined in the equivalent matrix a' of the obtained adjacency matrix a, and is specifically described as follows:
i) In the lower triangular part of the equivalent matrix a' of the obtained adjacent matrix a, row coordinates with an element value of "1" farthest from the minor diagonal in each column are sequentially searched downward in each column from the first column, and recorded as:
ii) sequentially comparing the row coordinate values recorded in the current column with the row coordinate values recorded in the previous column from the second column of the equivalent matrix A' of the adjacent matrix ASize of the product. If the row coordinate value recorded in the j-th column +.>Row coordinate value +.>I.e. < ->Then the coordinates recorded in column j are truncated +.>Finally, n coordinates are obtained in an equivalent matrix A' of the obtained adjacent matrix A:
where m is a column coordinate value, m ε 1, …, j j ε 1, …, K-1 K=N; n is the number of coordinates reserved, and N is an integer greater than or equal to 1 and less than N.
iii) According to the obtained n coordinatesAnd searching the main diagonal elements in the equivalent matrix A' of the obtained adjacency matrix A, wherein each coordinate corresponds to two elements. Obtaining n element sets:
here m e 1, …, j j e 1, …, K-1 k=n;
iv) with the first element setElements a' (1, 1) to ∈1>For sub-matrix block B 1 Is defined in the equivalent matrix a' of the obtained adjacency matrix a. And so on, sequentially obtaining the submatrix blocks B 1 ，…，B n 。
4) Defining a sub-matrix block B in the equivalent matrix a' of the resulting adjacency matrix a 1 ，…，B n The aircraft node number set corresponding to the main diagonal element is specifically described as follows:
i) Record sub-matrix block B 1 The coordinate range of the main diagonal corresponding to the main diagonal on the equivalent matrix A' of the obtained adjacent matrix A isA node number T corresponding to the main diagonal coordinates in the range and the obtained node sequence on the minimum spanning tree T 1 、T 2 、…、T k 、…、T K Correspondingly, a sub-matrix block B is obtained 1 A partial minimum spanning tree node sequence contained in the tree node sequence;
ii) sub-matrix block B 1 The partial minimum spanning tree node sequence contained in the system corresponds to the aircraft node numbers 1,2, … and N in the undirected communication network topology graph G to obtain a submatrix block B 1 Aircraft node number set V corresponding to medium main diagonal element 1 . And so on, each sub-matrix block B is obtained 1 ，…，B n Aircraft node number set V corresponding to medium main diagonal element 1 ，…，V n . Wherein V is 1 ，…，V n For n sub-matrix blocks B 1 ，…，B n And respectively corresponding node sets.
5) Searching N aircraft p 1 ，p 2 ，…，p N The nodes in the undirected communication network topology graph G are connected with each other and the double connectivity is judged, and the specific explanation is as follows:
i) From aircraft node numbering set V 1 To aircraft node numbering set V n Sequentially taking intersection C two by two 1 ，…，C n-1 The method comprises the following steps:
C 1 ＝V 1 ∩V 2 ，…，C n-1 ＝V n-1 ∩V n
recording the number of aircraft nodes in each intersection;
ii) if intersection C i (here i epsilon 1 … n-1) the number of aircraft nodes is equal to 1, and the nodes in the intersection are the nodes in the undirected communication network topology graph G; if intersection C i (here, i epsilon 1 … n-1) if the number of aircraft nodes in the intersection is greater than 1, then none of the nodes in the intersection are nodes in the undirected communication network topology graph G;
iii) When there are nodes in the undirected communication network topology graph G, if the number of aircraft nodes in a certain aircraft node number set is equal to 2 and the aircraft nodes in the set are all nodes in the undirected communication network topology graph G, the aircraft node number set V i The two joint points and the edge connecting the two joint points together form a bridge in the undirected communication network topological graph G;
iv) if any intersection C i (here i e 1 … n-1) there is an inode, then the undirected communication network topology G is not a dual connectivity graph; if all intersect C 1 ，…，C n-1 If no node exists, the undirected communication network topology graph G is a double-connection graph.
According to the embodiment of the invention, all node searching and double-connectivity rapid judging algorithms of the undirected communication topological graph can be designed from the adjacency matrix of the undirected communication topological graph G. The algorithm has simple flow, and the joint point judgment basis in the algorithm is visual and clear; the adjacency matrix is used for clearly and intuitively showing the position relation of the node in the undirected communication network topological graph G; all the nodes in the undirected communication network topology graph can be found out at one time without analyzing each node one by one; if the undirected communication network topology graph G among the N aircraft nodes is not a double-communication graph, the obtained sub-matrix blocks are the double-communication parts in the undirected communication network topology graph G among the N aircraft nodes, and the connection relation among the aircraft nodes of the undirected communication network topology graph G can be rapidly given. The embodiment can be applied to multi-unmanned aerial vehicle, multi-missile, multi-satellite communication network and ground mobile vehicle communication network node searching and dual-connectivity judging.
Detailed description of the preferred embodiments
Referring to fig. 1, specific flow steps of the method for searching the node under the condition that independent nodes exist in the undirected communication network topology diagram are described as follows in conjunction with fig. 2 to 8.
Step one, according to 10 aircraft p 1 ，p 2 ，…，p 10 And obtaining a corresponding adjacency matrix A by using the undirected communication network topological graph G among the nodes, wherein the corresponding numbers of 10 aircraft nodes are 1, … and 10.
Step two, for 10 aircraft p 1 ，p 2 ，…，p 10 The undirected communication network topology graph G between the nodes carries out connectivity judgment, and the specific implementation mode is as follows:
1) For an adjacency matrix A corresponding to a 10 aircraft undirected communication network topological graph G, obtaining a node sequence on a minimum spanning tree T by using a Prim algorithm(i.e., the second node sequence), node sequence +.>The corresponding aircraft node numbers are:
1-8-9-2-7-3-10-6-4-5
2) The resulting minimum spanning tree node sequence contains 10 aircraft p 1 ，p 2 ，…，p 10 The nodes, i.e. all aircraft nodes in the comprising undirected communication network topology G, are connected.
Step three, for 10 aircraft p 1 ，p 2 ，…，p 10 The specific implementation manner of the dual connectivity judgment of the undirected communication network topological graph G between the nodes is as follows:
1) Based on the obtained node sequence on the minimum spanning tree T Acquiring a corresponding adjustment matrix L of an adjacent matrix A corresponding to a communication network topological graph G;
2) According to the obtained adjusting matrix L, the adjacent matrix A corresponding to the undirected communication network topological graph G is multiplied by the adjusting matrix L in the left and the transpose L of the adjusting matrix in the right T Obtaining an equivalent matrix A' of the adjacent matrix A after transformation;
3) After the adjacency matrix A corresponding to the undirected communication network topology graph G is adjusted, each sub-matrix block is defined in an equivalent matrix A' of the adjacency matrix A after transformation. The specific implementation mode is as follows:
i) In the lower triangle part of the equivalent matrix a' of the transformed adjacent matrix a, from the 1 st column to the 9 th column, each column searches down by row for the coordinates of the element value "1" farthest from the next diagonal element in the column, resulting in 9 sets of coordinates: (3, 1), (3, 2), (6, 3), (6, 4), (8, 5), (7, 6), (10, 7), (10, 8), (10, 9);
ii) comparing the row coordinate values recorded in column 2 with column 1, resulting in 3=3. The coordinates recorded in column 2 are therefore discarded. And comparing the row coordinate values recorded in the 3 rd column with the row coordinate values recorded in the 2 nd column, wherein the result is 6 & gt3. The coordinates recorded in column 3 are thus retained. And so on, finally, 4 groups of row and column coordinates are reserved: (3, 1), (6, 3), (8, 5), (10, 7);
iii) According to the row-column coordinates (3, 1) of the 1 st group, searching corresponding main diagonal elements as a ' (3, 3) and a ' (1, 1) in an equivalent matrix A ' of the adjacent matrix A after transformation; and according to the row-column coordinates (6, 3) of the 2 nd group, searching corresponding main diagonal elements as a ' (6, 6) and a ' (3, 3) in an equivalent matrix A ' of the adjacent matrix A after transformation. And so on, 4 sets of main diagonal elements are obtained: { a '(3, 3), a' (1, 1) }, { a '(6, 6), a' (3, 3) }, { a '(8, 8), a' (5, 5) }, { a '(10, 10), a' (7, 7) };
iv) dividing the sub-matrix block B in the equivalent matrix A ' of the adjacent matrix A after transformation by taking a ' (1, 1) to a ' (3, 3) as main diagonal of the square matrix 1 The method comprises the steps of carrying out a first treatment on the surface of the The method is carried out by the steps a '(3, 3) to a' (6,6) Dividing a sub-matrix block B in an equivalent matrix A' of a transformed adjacent matrix A as a main diagonal of the square matrix 2 . And so on, 4 sub-matrix blocks are obtained: b (B) 1 、B 2 、B 3 、B 4 。
4) Defining a sub-matrix block B in the equivalent matrix a' of the transformed adjacency matrix a 1 、B 2 、B 3 、B 4 And the aircraft node number set corresponding to the main diagonal element. The specific implementation mode is as follows:
i) Record sub-matrix block B 1 The coordinate range of the main diagonal corresponding to the main diagonal on the equivalent matrix A ' of the adjacent matrix A after transformation is a ' (1, 1), …, a ' (3, 3), and the obtained minimum spanning tree T node sequence is corresponding Record sub-matrix block B 2 The coordinate range of the main diagonal corresponding to the main diagonal on the equivalent matrix A ' of the adjacent matrix A after transformation is a ' (3, 3), …, a ' (6, 6), and the node sequence mapped to the minimum spanning tree T is +.>And so on, 4 node sequences located in the minimum spanning tree T are obtained: />
ii) sequencing the 4 nodesCorresponding to the aircraft node number in the undirected communication network topology graph G, obtaining a sub-matrix block B 1 Aircraft node number set V corresponding to medium main diagonal element 1 = {1,8,9}; partial node sequence of minimum spanning tree T +.>Corresponding to the aircraft node number in the undirected communication network topology graph G, obtaining a sub-matrix block B 2 Aircraft node number set V corresponding to medium main diagonal element 2 = {9,2,7,3}. And so on, each sub-matrix block B is obtained 1 、B 2 、B 3 、B 4 Corresponding sets of aircraft node numbers:
V 1 ＝{1，8，9}
V 2 ＝{9，2，7，3}
V 3 ＝{7，3，10，6}
V 4 ＝{10，6，4，5}
5) According to the result, searching 10 aircraft p 1 ，p 2 ，…，p 10 The specific implementation mode is as follows:
i) Aircraft node numbering set V 1 With aircraft node numbering set V 2 Taking intersection, the result is: c (C) 1 ＝V 1 ∩V 2 = {9}, the number of aircraft nodes in the intersection is 1; aircraft node numbering set V 2 With aircraft node numbering set V 3 Taking intersection, the result is: c (C) 2 ＝V 2 ∩V 3 = {7,3}, the number of aircraft nodes in the intersection is 2; aircraft node numbering set V 3 With aircraft node numbering set V 4 Taking intersection, the result is: c (C) 3 ＝V 3 ∩V 4 = {10,6}, the number of aircraft nodes in the intersection is 2;
ii) intersection C 1 The number of the aircraft nodes in the network topology graph G is equal to 1, so that the node 9 is an off node in the network topology graph G; intersection C 2 The number of aircraft nodes in (1) is greater than the number of aircraft nodes in (1), so intersection C 2 The nodes in the network topology graph G are not the gateway nodes in the undirected communication network topology graph G; intersection C 3 The number of aircraft nodes in (1) is greater than the number of aircraft nodes in (1), so intersection C 3 None of the nodes in the undirected communication network topology graph G are the nodes of interest. In summary, the node of the undirected communication network topology graph G is node 9;
iii) Due to aircraft node numbering set V 1 、V 2 、V 3 、V 4 In (3)The number of the nodes of the line device is not equal to 2, so that no bridge exists in the undirected communication network topological graph G;
iv) due to intersection C 1 Since the node is present, the undirected communication network topology G is not a dual connectivity graph.
Detailed description of the preferred embodiments
Referring to fig. 1, fig. 9 to fig. 15, specific flow steps of the method for searching the joint point in the case of the existence of the bridge in the undirected communication network topology chart are described as follows:
Step one, according to 10 aircraft p 1 ，p 2 ，…，p 10 And obtaining a corresponding adjacency matrix A by using the undirected communication network topological graph G among the nodes, wherein the corresponding numbers of 10 aircraft nodes are 1, … and 10.
Step two, for 10 aircraft p 1 ，p 2 ，…，p 10 The connectivity determination is carried out on the undirected communication network topological graph G among the nodes, and the specific implementation modes are as follows:
1) For an adjacency matrix A corresponding to a 10 aircraft undirected communication network topological graph G, obtaining a node sequence on a minimum spanning tree T by using a Prim algorithmNode sequence->The corresponding aircraft node numbers are:
1-8-9-2-7-3-10-6-4-5
2) The resulting minimum spanning tree node sequence contains 10 aircraft p 1 ，p 2 ，…，p 10 All aircraft nodes in the communication network topology graph G are in communication, so the communication network topology graph G is communicated.
Step three, for 10 aircraft p 1 ，p 2 ，…，p 10 The specific implementation manner of the dual connectivity judgment of the undirected communication network topological graph G between the nodes is as follows:
1) Based on the obtained node sequence on the minimum spanning tree TAcquiring a corresponding adjustment matrix L of an adjacent matrix A corresponding to the undirected communication network topology graph G;
2) According to the obtained corresponding adjustment matrix L, the adjacent matrix A corresponding to the undirected communication network topological graph G is multiplied by the adjustment matrix L in the left and the transpose L of the adjustment matrix in the right T Obtaining an equivalent matrix A' of the adjacent matrix A after transformation;
3) After the adjustment of the adjacency matrix a corresponding to the undirected communication network topology graph G is completed, each sub-matrix block is defined in the adjacency matrix a' after transformation. The specific implementation mode is as follows:
i) In the lower triangle part of the equivalent matrix a' of the transformed adjacent matrix a, from the 1 st column to the 9 th column, each column searches down by row for the coordinates of the element value "1" farthest from the next diagonal element in the column, resulting in 9 sets of coordinates: (3, 1), (3, 2), (6, 3), (6, 4), (6, 5), (7, 6), (10, 7), (10, 8), (10, 9);
ii) comparing the row coordinate values recorded in column 2 with column 1, resulting in 3=3. The coordinates recorded in column 2 are therefore discarded. And comparing the row coordinate values recorded in the 3 rd column with the row coordinate values recorded in the 2 nd column, wherein the result is 6 & gt3. The coordinates recorded in column 3 are thus retained. And so on, finally, 4 groups of row and column coordinates are reserved: (3, 1), (6, 3), (7, 6), (10, 7);
iii) According to the row-column coordinates (3, 1) of the 1 st group, searching corresponding main diagonal elements as a ' (3, 3) and a ' (1, 1) in an equivalent matrix A ' of the adjacent matrix A after transformation; and according to the row-column coordinates (6, 3) of the 2 nd group, searching corresponding main diagonal elements as a ' (6, 6) and a ' (3, 3) in an equivalent matrix A ' of the adjacent matrix A after transformation. And so on, 4 sets of main diagonal elements are obtained: { a '(3, 3), a' (1, 1) }, { a '(6, 6), a' (3, 3) }, { a '(7, 7), a' (6, 6) }, { a '(10, 10), a' (7, 7) };
iv) dividing the sub-matrix block B in the equivalent matrix A ' of the adjacent matrix A after transformation by taking a ' (1, 1) to a ' (3, 3) as main diagonal of the square matrix 1 The method comprises the steps of carrying out a first treatment on the surface of the Principal diagonal of square matrix of a '(3, 3) to a' (6, 6)Lines dividing sub-matrix blocks B in the equivalent matrix A' of the transformed adjacent matrix A 2 . And so on, 4 sub-matrix blocks are obtained: b (B) 1 、B 2 、B 3 、B 4 。
4) Defining a sub-matrix block B in the equivalent matrix a' of the transformed adjacency matrix a 1 、B 2 、B 3 、B 4 And the aircraft node number set corresponding to the main diagonal element. The specific implementation mode is as follows:
i) Record sub-matrix block B 1 The coordinate range of the main diagonal corresponding to the main diagonal on the equivalent matrix A ' of the adjacent matrix A after transformation is a ' (1, 1), …, a ' (3, 3), and the obtained minimum spanning tree T node sequence is correspondingRecord sub-matrix block B 2 The coordinate range of the main diagonal corresponding to the main diagonal on the equivalent matrix A ' of the adjacent matrix A after transformation is a ' (3, 3), …, a ' (6, 6), and the obtained minimum spanning tree T node sequence->And so on, obtaining partial node sequences of 4 minimum spanning trees T: />
ii) partial node sequence of the minimum spanning tree TCorresponding to the aircraft node number in the undirected communication network topology graph G, obtaining a sub-matrix block B 1 Aircraft node number set V corresponding to medium main diagonal element 1 = {1,8,9}; partial node sequence of minimum spanning tree T +.>Corresponding to the aircraft node number in the undirected communication network topology graph G, obtaining a sub-matrix block B 2 Middle main bodyAircraft node number set V corresponding to diagonal elements 2 = {9,2,7,3}. And so on, each sub-matrix block B is obtained 1 、B 2 、B 3 、B 4 Corresponding sets of aircraft node numbers:
V 1 ＝{1，8，9}
V 2 ＝{9，2，7，3}
V 3 ＝{3，10}
V 4 ＝{10，6，4，5}
5) According to the result, searching 10 aircraft p 1 ，p 2 ，…，p 10 The specific implementation modes of the gateway nodes in the undirected communication network topology graph G among the nodes and judging the double connectivity are as follows:
i) Aircraft node numbering set V 1 With aircraft node numbering set V 2 Taking intersection, the result is: c (C) 1 ＝V 1 ∩V 2 = {9}, the number of aircraft nodes in the intersection is 1; aircraft node numbering set V 2 With aircraft node numbering set V 3 Taking intersection, the result is: c (C) 2 ＝V 2 ∩V 3 = {3}, the number of aircraft nodes in the intersection is 1; aircraft node numbering set V 3 With aircraft node numbering set V 4 Taking intersection, the result is: c (C) 3 ＝V 3 ∩V 4 = {10}, the number of aircraft nodes in the intersection is 1;
ii) intersection C 1 The number of the aircraft nodes in the network topology graph G is equal to 1, so that the node 9 is an off node in the network topology graph G; intersection C 2 The number of the aircraft nodes in the network topology graph G is equal to 1, so that the node 3 is an off node in the network topology graph G; intersection C 3 The number of aircraft nodes in (a) is equal to 1, so node 10 is the node of interest in the undirected communication network topology graph G. In summary, the nodes in the undirected communication network topology graph G are node 9, node 3 and node 10;
iii) Due to aircraft node numbering set V 3 The number of aircraft nodes in the set is equal to 2, and all the aircraft nodes in the set are in undirected communicationThe nodes in the network topology graph G are thus set V 3 Two joint points, namely a node 3 and a node 10, and an edge connecting the two joint points form a bridge in the undirected communication network topological graph G together;
iv) due to intersection C 1 、C 2 、C 3 Since the node is present, the undirected communication network topology G is not a dual connectivity graph.
FIG. 16 is a block diagram of a computer system for dual connectivity determination of a communication network in accordance with an embodiment of the present invention.
As shown in fig. 16, a computer system 1600 according to an embodiment of the present invention includes a processor 1601 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM) 1602 or a program loaded from a storage section 1608 into a Random Access Memory (RAM) 1603. The processor 1601 may include, for example, a general purpose microprocessor (e.g., a CPU), an instruction set processor and/or an associated chipset and/or a special purpose microprocessor (e.g., an Application Specific Integrated Circuit (ASIC)), or the like. The processor 1601 may also include on-board memory for caching purposes. The processor 1601 may include a single processing unit or multiple processing units for performing different actions in accordance with the method flows of the disclosed embodiments.
In RAM 1603, various programs and data required for the operation of computer system 1600 are stored. The processor 1601, ROM 1602, and RAM 1603 are connected to each other by a bus 1604. The processor 1601 performs various operations of the method flow according to the embodiments of the present disclosure by executing programs in the ROM 1602 and/or RAM 1603. Note that the program can also be stored in one or more memories other than the ROM 1602 and the RAM 1603. The processor 1601 may also perform various operations of the method flow according to an embodiment of the present disclosure by executing programs stored in the one or more memories.
According to an embodiment of the invention, computer system 1600 may also include an input/output (I/O) interface 1605, with input/output (I/O) interface 1605 also connected to bus 1604. Computer system 1600 may also include one or more of the following components connected to I/O interface 1605: an input portion 1606 including a keyboard, a mouse, and the like; an output portion 1607 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker, and the like; a storage section 1608 including a hard disk or the like; and a communication section 1609 including a network interface card such as a LAN card, a modem, or the like. The communication section 1609 performs communication processing via a network such as the internet. The drive 1610 is also connected to the I/O interface 1605 as needed. A removable medium 1611 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is installed as needed on the drive 1610 so that a computer program read out therefrom is installed into the storage section 1608 as needed.
The present disclosure also provides a computer-readable storage medium that may be embodied in the apparatus/device/system described in the above embodiments; or may exist alone without being assembled into the apparatus/device/system. The computer-readable storage medium carries one or more programs which, when executed, implement methods in accordance with embodiments of the present disclosure.
According to embodiments of the present invention, the computer-readable storage medium may be a non-volatile computer-readable storage medium, which may include, for example, but is not limited to: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this disclosure, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. For example, according to embodiments of the invention, the computer-readable storage medium may include ROM 1602 and/or RAM 1603 described above and/or one or more memories other than ROM 1602 and RAM 1603.
Embodiments of the present disclosure also include a computer program product comprising a computer program containing program code for performing the methods shown in the flowcharts. The program code, when executed in a computer system, causes the computer system to perform the methods provided by embodiments of the present disclosure.
The above-described functions defined in the system/apparatus of the embodiments of the present disclosure are performed when the computer program is executed by the processor 1601. The systems, apparatus, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the invention.
In one embodiment, the computer program may be based on a tangible storage medium such as an optical storage device, a magnetic storage device, or the like. In another embodiment, the computer program can also be transmitted, distributed over a network medium in the form of signals, downloaded and installed via the communication portion 1609, and/or from the removable medium 1611. The computer program may include program code that may be transmitted using any appropriate network medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
In such embodiments, the computer program may be downloaded and installed from a network via the communication portion 1609, and/or installed from the removable media 1611. The above-described functions defined in the system of the embodiments of the present disclosure are performed when the computer program is executed by the processor 1601. The systems, devices, apparatus, modules, units, etc. described above may be implemented by computer program modules according to embodiments of the invention.
According to embodiments of the present invention, program code for executing computer programs provided by embodiments of the present disclosure may be written in any combination of one or more programming languages, and in particular, such computer programs may be implemented in high-level procedural and/or object-oriented programming languages, and/or assembly/machine languages. Programming languages include, but are not limited to, such as Java, c++, python, "C" or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, partly on a remote computing device, or entirely on the remote computing device or server. In the case of remote computing devices, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., connected via the Internet using an Internet service provider).
The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
Those skilled in the art will appreciate that the features recited in the various embodiments of the disclosure and/or in the claims may be provided in a variety of combinations and/or combinations, even if such combinations or combinations are not explicitly recited in the disclosure. In particular, the features recited in the various embodiments of the present disclosure and/or the claims may be variously combined and/or combined without departing from the spirit and teachings of the present disclosure. All such combinations and/or combinations fall within the scope of the present disclosure.
The embodiments of the present disclosure are described above. However, these examples are for illustrative purposes only and are not intended to limit the scope of the present disclosure. Although the embodiments are described above separately, this does not mean that the measures in the embodiments cannot be used advantageously in combination. The scope of the disclosure is defined by the appended claims and equivalents thereof. Various alternatives and modifications can be made by those skilled in the art without departing from the scope of the disclosure, and such alternatives and modifications are intended to fall within the scope of the disclosure.
Claims (9)
1. A method for dual connectivity determination of a communication network, wherein the method comprises:
acquiring an undirected communication network topology graph G composed of N nodes of the communication network, wherein N is an integer greater than 2;
acquiring an adjacency matrix A of the undirected communication network topology graph G, wherein the N nodes in the adjacency matrix A are arranged in a first node sequence;
processing the adjacent matrix A by using a Crim algorithm to obtain a minimum spanning tree T of the undirected communication network topology graph G; the minimum spanning tree T is a path which starts from one end of the T and reaches the end of the other end of the T after passing through all other nodes in the T once and only once; the nodes on the minimum spanning tree T are arranged according to a second node sequence;
When the number of the nodes in the second node sequence is N, determining that the undirected communication network topological graph G is a communication graph; and
when the undirected communication network topology graph G is a connectivity graph, determining dual connectivity of the undirected communication network topology graph G through the following steps S1 to S5 includes:
s1, acquiring an equivalent matrix A ' of an adjacent matrix A, wherein the equivalent matrix A ' is another adjacent matrix of the undirected communication network topological graph G, and the N nodes corresponding to the equivalent matrix A ' are arranged in the second node sequence; the method specifically comprises the following steps:
obtaining an adjustment matrix L corresponding to the adjacent matrix A, wherein the expression of the adjustment matrix L is as follows:
wherein T is k Is the first node in the second node sequenceNumbering of k nodes, wherein the number T of the kth node in the second node sequence k The value of the (b) is the number value of the kth node in the first node sequence;
multiplying the adjustment matrix L by the adjacency matrix A to the left and multiplying the transpose L of the adjustment matrix to the right T Obtaining the equivalent matrix A';
s2, dividing N sub-matrix blocks from the equivalent matrix A', wherein N is an integer greater than or equal to 1 and less than N, and specifically comprises the steps S2.1-S2.3:
S2.1, in the lower triangle part of the equivalent matrix A', from the first column, sequentially searching row-column coordinates with the element value of 1 which is farthest from the secondary diagonal in each column downwards according to rows in each column;
s2.2, starting from the second column of the equivalent matrix A', sequentially comparing the magnitudes of the row coordinate values recorded in the current column with those recorded in the previous column, wherein if the row coordinate value recorded in the j-1 column is smaller than or equal to the row coordinate value recorded in the j-1 column, deleting the coordinate recorded in the j-1 column, and finally reserving n coordinates;
s2.3, using a main diagonal element in a row determined by an abscissa in each of the n coordinates and a main diagonal element in a column determined by an ordinate as two endpoints, and defining a square matrix in the equivalent matrix A' to obtain the n sub-matrix blocks;
s3, based on the corresponding relation between the coordinates contained in each sub-matrix block and each node in the second node sequence, acquiring the nodes contained in each sub-matrix block in the n sub-matrix blocks, and acquiring node sets corresponding to the n sub-matrix blocks respectively;
s4, sequentially taking intersection sets from each pair of node sets corresponding to the n sub-matrix blocks to obtain n-1 intersection sets;
S5, determining whether the undirected communication network topology graph G has double connectivity or not based on the respective node numbers of the n-1 intersections; when the n-1 intersections have intersections with the node number of 1, determining that the undirected communication network topology graph G is not a double-connectivity graph and the communication network does not have double connectivity; and determining the nodes in the intersection set with the node number of 1 as the gateway nodes in the undirected communication network topology graph G.
2. The method of claim 1, wherein S5 further comprises:
after determining the node points in the undirected communication network topology graph G, if node sets with the number of 2 exist in the node sets corresponding to the n sub-matrix blocks, determining whether the nodes in the node sets with the number of 2 are node points; and
if two nodes in the node set with the node number of 2 are all joint points, determining that the two joint points and edges connecting the two joint points together form a bridge in the undirected communication network topological graph G.
3. The method of claim 1, wherein S5 further comprises:
and when the number of nodes of each intersection of the n-1 intersections is greater than 1 and the number of nodes in the node sets corresponding to the n sub-matrix blocks is not 2, determining that the undirected communication network topology graph G is a double-communication graph and the communication network has double-communication.
4. The method of claim 1, wherein the obtaining the adjustment matrix L corresponding to the adjacency matrix a comprises:
and based on the corresponding relation of the numbers of the nodes at the same position in the first node sequence and the second node sequence, performing elementary transformation of exchanging two rows on the N-order identity matrix to obtain the adjustment matrix L.
5. The method of claim 1, wherein the S2.3 comprises:
searching a main diagonal element of a row and a column where each coordinate in the n coordinates is located in the equivalent matrix A'; two elements corresponding to each coordinate are taken as a main diagonal element set, and n main diagonal element sets are obtained by corresponding to the n coordinates one by one; and
and respectively taking two elements in each main diagonal element set as two endpoints, and demarcating a square matrix in an equivalent matrix A' to obtain the n sub-matrix blocks.
6. The method of claim 1, wherein the S3 comprises:
recording the coordinate range of the main diagonal element of each sub-matrix block on the main diagonal in the equivalent matrix A';
corresponding the coordinate values in the coordinate range to the nodes in the second node sequence to obtain a sub-node sequence contained in each sub-matrix block; and
And obtaining a node set contained in each sub-matrix block based on the sub-node sequence contained in each sub-matrix block.
7. The method according to any one of claims 1 to 6, wherein,
the communication network is a communication network used among aircrafts, and the N nodes are N aircraft nodes.
8. A computer system, comprising:
one or more processors;
a memory for storing one or more programs,
wherein the one or more programs, when executed by the one or more processors, cause the one or more processors to perform the method of any of claims 1-7.
9. A computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210700766.5A CN115190043B (en) | 2022-06-20 | 2022-06-20 | Method, computer system and medium for dual connectivity determination of communication network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210700766.5A CN115190043B (en) | 2022-06-20 | 2022-06-20 | Method, computer system and medium for dual connectivity determination of communication network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115190043A CN115190043A (en) | 2022-10-14 |
| CN115190043B true CN115190043B (en) | 2023-09-08 |
Family
ID=83514936
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210700766.5A Active CN115190043B (en) | 2022-06-20 | 2022-06-20 | Method, computer system and medium for dual connectivity determination of communication network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115190043B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101437305A (en) * | 2008-12-09 | 2009-05-20 | 重庆邮电大学 | Method for double communications and communication route optimization of wireless sensor network |
| CN102340141A (en) * | 2011-08-26 | 2012-02-01 | 大连海事大学 | Network topology analytical method using matrix method |
| CN105830497A (en) * | 2013-12-19 | 2016-08-03 | 高通股份有限公司 | Serving gateway relocation and secondary node eligibility for dual connectivity |
| CN110803302A (en) * | 2019-10-15 | 2020-02-18 | 西北工业大学 | Rapid prediction method for spacecraft cluster topological connectivity |
| CN113300880A (en) * | 2021-04-15 | 2021-08-24 | 南京南瑞继保电气有限公司 | Ethernet switch topology generation and drawing method based on Tarjan algorithm |
| CN113596855A (en) * | 2021-07-30 | 2021-11-02 | 郑州大学 | Distributed method and system for establishing double random communication matrixes in unidirectional strong communication network |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8948053B2 (en) * | 2011-09-12 | 2015-02-03 | Honeywell International Inc. | Apparatus and method for detecting critical nodes and critical links in a multi-hop network |
| US20210337611A1 (en) * | 2020-04-27 | 2021-10-28 | Cisco Technology, Inc. | Optimized serving gateway node selection for interworking networks |
-
2022
- 2022-06-20 CN CN202210700766.5A patent/CN115190043B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101437305A (en) * | 2008-12-09 | 2009-05-20 | 重庆邮电大学 | Method for double communications and communication route optimization of wireless sensor network |
| CN102340141A (en) * | 2011-08-26 | 2012-02-01 | 大连海事大学 | Network topology analytical method using matrix method |
| CN105830497A (en) * | 2013-12-19 | 2016-08-03 | 高通股份有限公司 | Serving gateway relocation and secondary node eligibility for dual connectivity |
| CN110803302A (en) * | 2019-10-15 | 2020-02-18 | 西北工业大学 | Rapid prediction method for spacecraft cluster topological connectivity |
| CN113300880A (en) * | 2021-04-15 | 2021-08-24 | 南京南瑞继保电气有限公司 | Ethernet switch topology generation and drawing method based on Tarjan algorithm |
| CN113596855A (en) * | 2021-07-30 | 2021-11-02 | 郑州大学 | Distributed method and system for establishing double random communication matrixes in unidirectional strong communication network |
Non-Patent Citations (1)
| Title |
|---|
| Huiliang Zhang ; Zhonglong Wang ; Fei Qin ; Meng Ma ; Jianhua Zhang.A Neural-Network-Based Non-linear Interference Cancellation Scheme for Wireless IoT Backhaul with Dual-Connectivity.《2019 32nd IEEE International System-on-Chip Conference (SOCC)》.2020,全文. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115190043A (en) | 2022-10-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112800915B (en) | Building change detection method, device, electronic equipment and storage medium | |
| CN111595850B (en) | Slice defect detection method, electronic device and readable storage medium | |
| CN110009637B (en) | Remote sensing image segmentation network based on tree structure | |
| CN107729935B (en) | The recognition methods of similar pictures and device, server, storage medium | |
| CN113724279B (en) | System, method, equipment and storage medium for automatically dividing traffic cells into road networks | |
| CN111797571A (en) | Landslide susceptibility evaluation method, device, equipment and storage medium | |
| CN112084864A (en) | Model optimization method and device, electronic equipment and storage medium | |
| CN115375868A (en) | Map display method, remote sensing map display method, computing device and storage medium | |
| CN114758199A (en) | Training method, device, equipment and storage medium for detection model | |
| CN103390271B (en) | Remote Sensing Image Segmentation and device | |
| CN114491200A (en) | Method and device for matching heterogeneous interest points based on graph neural network | |
| CN115190043B (en) | Method, computer system and medium for dual connectivity determination of communication network | |
| CN116778169A (en) | Remote sensing image semantic segmentation method, device and equipment based on mixed feature extraction | |
| CN112966054A (en) | Enterprise graph node relation-based ethnic group division method and computer equipment | |
| CN114494782B (en) | Image processing method, model training method, related device and electronic equipment | |
| CN116227566A (en) | Calculation graph visualization method, device, equipment and medium applied to AI chip | |
| CN113362227B (en) | Image processing method, device, electronic equipment and storage medium | |
| CN115544197A (en) | Fine-grained address matching method and system | |
| US11481998B2 (en) | Building footprint generation by using clean mask generation and received image data | |
| WO2020238749A1 (en) | Raster data access method and apparatus, electronic device, and computer storage medium | |
| Demir et al. | Robocodes: Towards generative street addresses from satellite imagery | |
| CN108733304A (en) | A kind of automatic identification and processing hand-written character method, apparatus | |
| CN116436820A (en) | Method, computer system and medium for dual connectivity determination of communication network | |
| CN111712811A (en) | Scalable graphic SLAM for HD maps | |
| CN114048804B (en) | Classification model training method and device |
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 |