Scatter communication link planning method and device, medium and product

Abstract

The invention discloses a scatter communication link planning method and device, a medium and a product, and relates to the field of link planning, and the method comprises the steps: simplifying a scatter communication network into a weighted graph through employing a graph theory; each point in the weighted graph represents a scatter communication node, an edge represents a scatter link, and the weight of the edge is the weighted value of the rate and the communication reliability of each link; and according to the weighted graph, performing scatter communication link planning based on a Dijkstra algorithm. According to the invention, rapid link planning between the sending station and any receiving station can be realized, and the communication reliability between the scattering stations is improved.

Description

Technical Field

[0001] The present application relates to the field of link planning, and in particular to a method, device, medium and product for planning a scattering communication link. Background Art

[0002] Scattering communication has the advantages of anti-interception, anti-interference, anti-reconnaissance and beyond-line-of-sight communication, and has a wide range of military use scenarios. With the development of technology and changes in usage requirements, the demand for scattering communication networking applications is becoming increasingly prominent.

[0003] Traditional scatter communication is often used for direct communication between two nodes. At present, there is a lack of effective link planning methods in scatter communication, which makes it difficult to deal with reasonable planning when scatter communication networking applications are applied, and further difficult to deal with the rapid reconstruction of scatter links after the link is broken. On the one hand, when the channel conditions deteriorate, the scatter communication link is prone to link breakage, making the communication reliability low. On the other hand, since the establishment of scatter communication links is limited by equipment configuration, under extreme conditions, the possibility of quickly reconstructing the link after a link break is low.

[0004] From the above, we can see that the establishment of scattered communication links is mainly limited by the transmission rate between links and the equipment hardware of the scattered sites. When the transmission rate between two sites is lower than the minimum communication requirement, the link will not be able to guarantee the use demand (that is, the link will not be established); when the number of established links at the site reaches the equipment hardware limit, new links cannot be established.

[0005] Therefore, in order to effectively solve the above problems, we should focus on analyzing the reasons that limit scattering communication link planning and take advantage of the network. In the scattering communication network, a fast link planning method that is not limited to direct links and improves network reliability is urgently needed. Summary of the invention

[0006] The purpose of this application is to provide a scatter communication link planning method, device, medium and product, which can realize fast link planning between a sending site and any receiving site, and improve the communication reliability between scatter sites.

[0007] To achieve the above objectives, this application provides the following solutions:

[0008] In a first aspect, the present application provides a scatter communication link planning method, the scatter communication link planning method comprising:

[0009] The scattering communication network is simplified into a weighted graph using graph theory; each point in the weighted graph represents a scattering communication node, an edge represents a scattering link, and the weight of the edge is a weighted value of the rate and communication reliability of each link;

[0010] According to the weighted graph, scattering communication link planning is performed based on the Dijkstra algorithm.

[0011] Optionally, simplifying the scattering communication network into a weighted graph by using graph theory specifically includes:

[0012] According to network planning or network management data, the location distribution of scattering sites in the scattering communication network and the scattering links between the sites are obtained by using graph theory to obtain a weighted graph.

[0013] Optionally, the network planning or network management data includes: scattering site locations, rates between scattering sites, and communication reliability.

[0014] Alternatively, using the formula Determine the distance d between the edge of node i and node j in the weighted graph ij ;

[0015] Among them, r ij 、p ij are the rate and communication reliability between node i and node j respectively, and a1 and a2 are the quantization constants corresponding to the rate and communication reliability respectively.

[0016] Optionally, the scattering communication link planning is performed based on the Dijkstra algorithm according to the weighted graph, specifically including:

[0017] S1, starting from node 1, puts node 1 into the visited set S, and nodes 2 to N into the unvisited set Q;

[0018] S2, array Path_num[i] is used to store the previous node of node i, and the value of array Path_num[i] is set to 1;

[0019] S3, lenth_num[i] is used to store the total distance from node i to node 1. The distance of the direct link between node i and node 1 is set as the distance of the direct link, and the distance of the remaining nodes is set as infinity;

[0020] S4, Pr[i] is used to store the total reliability of node i to node 1, set Pr[1] = 1, if there is no link between node i and node 1, set Pr[i] = 0, otherwise, set Pr[i] = p 1i ;

[0021] S5, find the node i* with the highest reliability of node 1 in the unvisited set Q, and the total reliability rate from node i* to node 1 meets the minimum communication reliability requirement;

[0022] S6, remove node i* from the unvisited set Q and add it to the visited set S;

[0023] S7, select node j in the unvisited set Q and a node i in the visited set S that is not node 1. If the communication reliability of node j when forwarding through node i meets the maximum reliability requirement and the total distance is smaller than the distance of the previous node, then update the previous node of node j to node i, Path_num[j] = i, and update the array, lenth_num[j] = lenth_num[i] + d ij +d i , Pr[i]=Pr[i]*p ij ;

[0024] S8, repeat S7 until the nodes in the unvisited set Q and the visited set S are polled;

[0025] S9, repeat S5 to S8 until the unvisited set Q is an empty set or all remaining nodes in the unvisited set Q do not meet the minimum reliability requirement;

[0026] S10, for any node i whose lenth_num[i] is not infinite, trace back the array Path_num[i] to find its previous node j, until tracing back to node 1, and obtain the optimal scattering link route from node 1 to each node i that meets the communication reliability condition.

[0027] Alternatively, using the formula Determine node i*;

[0028] Among them, arg is a mathematical function, min is the minimum value, lenth_num[i] is used to store the total distance from node i to node 1, Pr[i] is used to store the total reliability from node i to node 1, and p th The minimum reliability requirement for communication.

[0029] In a second aspect, the present application provides a scattering communication link planning device, the scattering communication link planning device comprising:

[0030] A weighted graph determination module is used to simplify the scattering communication network into a weighted graph using graph theory; each point in the weighted graph represents a scattering communication node, an edge represents a scattering link, and the weight of the edge is a weighted value of the rate of each link and the communication reliability;

[0031] The link planning module is used to plan scattering communication links based on the weighted graph and the Dijkstra algorithm.

[0032] In a third aspect, the present application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the scattering communication link planning method.

[0033] In a fourth aspect, the present application provides a computer-readable storage medium having a computer program stored thereon, which implements the scattering communication link planning method when executed by a processor.

[0034] In a fifth aspect, the present application provides a computer program product, including a computer program, which implements the scattering communication link planning method when executed by a processor.

[0035] According to the specific embodiments provided in this application, this application has the following technical effects:

[0036] The present application provides a scattering communication link planning method, equipment, medium and product, which uses graph theory to simplify the scattering communication network into a weighted graph, wherein each point in the weighted graph represents a scattering communication node, an edge represents a scattering link, and the weight of the edge is the weighted value of the rate of each link and the communication reliability. The present application can quickly find the scattering link communication route from the starting site to the remaining sites in the scattering communication network based on the Dijkstra algorithm while meeting the minimum communication reliability and transit node loss, greatly speeding up the network planning. The present application is portable, universal and efficient, and provides technical support for the planning of a large number of scattering communication links. BRIEF DESCRIPTION OF THE DRAWINGS

[0037] In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings required for use in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present application. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative work.

[0038] Figure 1 This is a schematic diagram of a scattering communication link planning method in one embodiment of the present application;

[0039] Figure 2 This is a schematic diagram of the overall process of a scattering communication link planning method in one embodiment of the present application;

[0040] Figure 3 It is a weighted graph of the scattering communication network in a certain area. DETAILED DESCRIPTION

[0041] The following will be combined with the drawings in the embodiments of the present application to clearly and completely describe the technical solutions in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of this application.

[0042] In order to make the above-mentioned objects, features and advantages of the present application more obvious and easy to understand, the present application is further described in detail below with reference to the accompanying drawings and specific implementation methods.

[0043] In an exemplary embodiment, Figure 1 As shown, a scattering communication link planning method is provided, and the method includes the following S101 to S102. Wherein:

[0044] S101, using graph theory to simplify the scattering communication network into a weighted graph; e.g. Figure 3 As shown in the figure, each point in the weighted graph represents a scattering communication node, and the edge represents a scattering link. The weight of the edge is the weighted value of the rate of each link and the communication reliability. Nodes 1 to N are scattering sites, and N is the number of scattering sites in the area. The edge between each point is the link between scattering sites. If there is no edge between two points, the equipment at these two sites does not have the resources to open a new link or the link does not meet the communication requirements.

[0045] S101 specifically includes:

[0046] The position distribution of scattering sites in the scattering communication network and the scattering links between sites are obtained by graph theory according to network planning or network management data, wherein the network planning or network management data includes: the position of scattering sites, the rate between scattering sites and the communication reliability.

[0047] Link opening refers to the link from the transmitting site to the receiving site. The opening of a scattering link is related to the link rate and communication reliability. The higher the communication rate of each segment and the higher the communication reliability, the greater the possibility of opening the scattering link referred to in this application. Therefore, the weight value of the edge is the weighted value of the rate and communication reliability of each link. ij The distance d ij It is expressed as:

[0048]

[0049] Among them, r ij 、p ij are the rate and communication reliability between node i and node j, respectively. a1 and a2 are the quantization constants corresponding to the rate and communication reliability, respectively. The quantization constants are obtained from the experience of previous scattering communication assurance or the theoretical calculation of the scattering communication propagation model.

[0050] S102, according to the weighted graph, scatter communication link planning is performed based on the Dijkstra algorithm. The Dijkstra algorithm is an algorithm for solving the shortest path from the starting node to the remaining nodes in the graph. Its main feature is that it starts from the starting point and adopts the strategy of the greedy algorithm, and each time traverses to the adjacent nodes of the vertex closest to the starting node and not visited, until it is extended to the end point. According to the Dijkstra algorithm, the main factor parameters involved in scatter communication link planning are equivalently quantized into distances, and then scatter communication link planning is performed.

[0051] like Figure 2 As shown, S102 specifically includes:

[0052] S1, starting from node 1, puts node 1 into the visited set S, and nodes 2 to N into the unvisited set Q;

[0053] S2, array Path_num[i] is used to store the previous node of node i, and the value of array Path_num[i] is set to 1;

[0054] S3, lenth_num[i] is used to store the total distance from node i to node 1 (the sum of the link distances from node 1 to node i, plus the sum of the additional distances of all the nodes passed, where the node additional distance d i represents the loss caused by forwarding through node i), the distance of the direct link with node 1 is set as the distance of the direct link, and the distance of the other nodes is set as infinity;

[0055] S4, Pr[i] is used to store the total reliability of node i to node 1, set Pr[1] = 1, if there is no link between node i and node 1, set Pr[i] = 0, otherwise, set Pr[i] = p 1i ;

[0056] S5, find the node i* with the highest reliability of node 1 in the unvisited set Q, and the total reliability rate from node i* to node 1 meets the minimum communication reliability requirement, that is,

[0057] S6, remove node i* from the unvisited set Q and add it to the visited set S;

[0058] S7, select node j in the unvisited set Q and a node i in the visited set S that is not node 1. If the communication reliability of node j when forwarding through node i meets the maximum reliability requirement and the total distance is smaller than the distance of the previous node, that is, Pr[i] * p ij ≥p th And lenth_num[j]>lenth_num[i]+d ij +d i; then update the previous node of node j to node i, Path_num[j] = i, and update the array, lenth_num[j] = lenth_num[i] + d ij +d i , Pr[i]=Pr[i] * p ij ;

[0059] S8, repeat S7 until the nodes in the unvisited set Q and the visited set S are polled;

[0060] S9, repeat S5 to S8 until the unvisited set Q is an empty set or all remaining nodes in the unvisited set Q do not meet the minimum reliability requirement;

[0061] S10, for any node i whose lenth_num[i] is not infinite, trace back the array Path_num[i] to find its previous node j, until tracing back to node 1, and obtain the optimal scattering link route from node 1 to each node i that meets the communication reliability condition.

[0062] Based on the same inventive concept, the embodiment of the present application also provides a scattering communication link planning device for implementing the scattering communication link planning method involved above. The implementation scheme for solving the problem provided by the device is similar to the implementation scheme recorded in the above method, so the specific limitations in one or more scattering communication link planning device embodiments provided below can refer to the limitations of the scattering communication link planning method above, and will not be repeated here.

[0063] In an exemplary embodiment, a scattering communication link planning device is provided, comprising:

[0064] A weighted graph determination module is used to simplify the scattering communication network into a weighted graph using graph theory; each point in the weighted graph represents a scattering communication node, an edge represents a scattering link, and the weight of the edge is a weighted value of the rate of each link and the communication reliability;

[0065] The link planning module is used to plan scattering communication links based on the weighted graph and the Dijkstra algorithm.

[0066] In an exemplary embodiment, a computer device is provided, which may be a server or a terminal. The computer device includes a processor, a memory, an input / output interface (I / O for short) and a communication interface. The processor, the memory and the input / output interface are connected via a system bus, and the communication interface is connected to the system bus via the input / output interface. The processor of the computer device is used to provide computing and control capabilities. The memory of the computer device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system, a computer program and a database. The internal memory provides an environment for the operation of the operating system and the computer program in the non-volatile storage medium. The input / output interface of the computer device is used to exchange information between the processor and an external device. The communication interface of the computer device is used to communicate with an external terminal via a network connection. When the computer program is executed by the processor, a scattering communication link planning method is implemented.

[0067] In an exemplary embodiment, a computer-readable storage medium is provided, storing a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.

[0068] In an exemplary embodiment, a computer program product is provided, including a computer program, and when the computer program is executed by a processor, the steps in the above method embodiments are implemented.

[0069] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, stored data, displayed data, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties, and the collection, use and processing of relevant data must comply with relevant regulations.

[0070] Those of ordinary skill in the art can understand that all or part of the processes in the above-mentioned embodiment methods can be completed by instructing the relevant hardware through a computer program, and the computer program can be stored in a non-volatile computer-readable storage medium. When the computer program is executed, it can include the processes of the embodiments of the above-mentioned methods. Among them, any reference to the memory, database or other medium used in the embodiments provided in the present application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM may be in various forms, such as static random access memory (SRAM) or dynamic random access memory (DRAM).

[0071] The database involved in each embodiment provided in this application may include at least one of a relational database and a non-relational database. The non-relational database may include a distributed database based on blockchain, etc., but is not limited thereto. The processor involved in each embodiment provided in this application may be a general-purpose processor, a central processing unit, a graphics processor, a digital signal processor, a programmable logic device, a data processing logic device based on quantum computing, etc., but is not limited thereto.

[0072] In this application, all actions to obtain signals, information or data are carried out in compliance with the relevant data protection laws and policies of the country where they are located and with the authorization given by the owner of the corresponding device.

[0073] The technical features of the above embodiments may be combined arbitrarily. To make the description concise, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0074] This article uses specific examples to illustrate the principles and implementation methods of this application. The description of the above embodiments is only used to help understand the method and core ideas of this application. At the same time, for those skilled in the art, according to the ideas of this application, there will be changes in the specific implementation methods and application scope. In summary, the content of this specification should not be understood as limiting this application.

Claims

1. A scattering communication link planning method, characterized in that: The scattering communication link planning method comprises: The scattering communication network is simplified into a weighted graph using graph theory; each point in the weighted graph represents a scattering communication node, an edge represents a scattering link, and the weight of the edge is a weighted value of the rate and communication reliability of each link; According to the weighted graph, scattering communication link planning is performed based on the Dijkstra algorithm.

2. The scattering communication link planning method according to claim 1, characterized in that: The method of simplifying the scattering communication network into a weighted graph by using graph theory specifically includes: According to network planning or network management data, the location distribution of scattering sites in the scattering communication network and the scattering links between the sites are obtained by using graph theory to obtain a weighted graph.

3. The scattering communication link planning method according to claim 2, characterized in that: The network planning or network management data includes: scattering site locations, inter-scattering site rates, and communication reliability.

4. The scattering communication link planning method according to claim 1, characterized in that: Using the formula Determine the distance d between the edge of node i and node j in the weighted graph ij ; Among them, r ij 、p ij are the rate and communication reliability between node i and node j respectively, and a1 and a2 are the quantization constants corresponding to the rate and communication reliability respectively.

5. The scattering communication link planning method according to claim 1, characterized in that: The method of using the Dijkstra algorithm to plan scattering communication links based on the weighted graph specifically includes: S1, starting from node 1, puts node 1 into the visited set S, and nodes 2 to N into the unvisited set Q; S2, array Path_num[i] is used to store the previous node of node i, and the value of array Path_num[i] is set to 1; S3, lenth_num[i] is used to store the total distance from node i to node 1. The distance of the direct link between node i and node 1 is set as the distance of the direct link, and the distance of the remaining nodes is set as infinity; S4, Pr[i] is used to store the total reliability of node i to node 1, set Pr[1] = 1, if there is no link between node i and node 1, set Pr[i] = 0, otherwise, set Pr[i] = p 1i ; S5, find the node i* with the highest reliability of node 1 in the unvisited set Q, and ensure that the total reliability rate from node i* to node 1 meets the minimum communication reliability requirement; S6, remove node i* from the unvisited set Q and add it to the visited set S; S7, select node j in the unvisited set Q and a node i in the visited set S that is not node 1. If the communication reliability of node j when forwarding through node i meets the maximum reliability requirement and the total distance is smaller than the distance of the previous node, then update the previous node of node j to node i, Path_num[j] = i, and update the array, lenth_num[j] = lenth_num[i] + d ij +d i , Pr[i]=Pr[i]*p ij ; S8, repeat S7 until the nodes in the unvisited set Q and the visited set S are polled; S9, repeat S5 to S8 until the unvisited set Q is an empty set or all remaining nodes in the unvisited set Q do not meet the minimum reliability requirement; S10, for any node i whose lenth_num[i] is not infinite, trace back the array Path_num[i] to find its previous node j, until tracing back to node 1, and obtain the optimal scattering link route from node 1 to each node i that meets the communication reliability condition.

6. The scattering communication link planning method according to claim 5, characterized in that: Using the formula Pr[i]≥p th Determine node i*; Among them, arg is a mathematical function, min is the minimum value, lenth_num[i] is used to store the total distance from node i to node 1, Pr[i] is used to store the total reliability from node i to node 1, and p th The minimum reliability requirement for communication.

7. A scattering communication link planning device, characterized in that: The scattering communication link planning device comprises: A weighted graph determination module is used to simplify the scattering communication network into a weighted graph using graph theory; each point in the weighted graph represents a scattering communication node, an edge represents a scattering link, and the weight of the edge is a weighted value of the rate of each link and the communication reliability; The link planning module is used to plan scattering communication links based on the weighted graph and the Dijkstra algorithm.

8. A computer device comprising: A memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the scattering communication link planning method according to any one of claims 1 to 6.

9. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the computer program is executed by a processor, the scattering communication link planning method described in any one of claims 1 to 6 is implemented.

10. A computer program product, comprising a computer program, characterized in that When the computer program is executed by a processor, the scattering communication link planning method described in any one of claims 1 to 6 is implemented.

Images