Full-duplex self-organizing network routing method

Abstract

The invention provides a full-duplex self-organizing network routing method, the full-duplex self-organizing network comprises a plurality of nodes, and the method comprises the following steps: step S1, iteratively executing the following steps until convergence to obtain a plurality of routes and a target power adjustment strategy; step S11, selecting a route for each pair of source node and target node according to a preset screening rule based on data transmission requirements between multiple pairs of source nodes and target nodes; step S12, with the goal of minimizing the total transmission delay of all routes, determining the node power of each node in all routes to obtain a power adjustment strategy; and S2, adjusting the node power of each node in the plurality of routes based on the target power adjustment strategy. According to the technical scheme provided by the invention, the node power of each node is reasonably distributed by minimizing the total transmission delay of multiple routes, so that the mutual interference between the nodes can be effectively relieved, and the end-to-end transmission delay can be reduced.

Description

Technical Field

[0001] The invention relates to the field of wireless communications, in particular to a routing planning technology in the field of wireless communications, and more particularly to a full-duplex self-organizing network routing method. Background Art

[0002] The existing wireless self-organizing network routing strategies can be divided into active, passive, hybrid, geo-location-based, hierarchical and heuristic routing. Among them, the active routing strategy has low latency and high overhead; the passive routing strategy has low overhead and high latency; the hybrid routing strategy has the advantages of both active and passive routing strategies, but the cross-domain routing latency is large; the geo-location-based routing strategy requires a positioning system for the nodes; the heuristic routing strategy has low overhead, but cannot guarantee the optimality of the path; the hierarchical routing strategy adopts a hierarchical structure and is suitable for large-scale networks.

[0003] Although many routing strategies have been proposed for wireless ad hoc networks, there are few studies on routing strategies for full-duplex ad hoc networks. In order to minimize the routing delay in the full-duplex vehicular ad-hoc network (VANET) scenario, some researchers proposed a minimum delay routing algorithm under full-duplex / half-duplex (FD / HD) hybrid. By proving that the theorem "any subpath of the shortest path is also the shortest path" in the Dijkstra algorithm does not hold in the FD / HD hybrid undirected graph, an improved Dijkstra algorithm is proposed for the path selection with the lowest delay. Other researchers have proposed a bidirectional self-organizing on-demand multipath distance vector (AOMDV) routing strategy to find multi-path, non-intersecting, and bidirectional routes in the network. Simulation experiments show that this strategy has improved end-to-end delay, packet loss rate, etc. Although the above routing strategies can be applied to full-duplex ad hoc networks, none of the above routing strategies consider the mutual interference problem in full-duplex ad hoc networks.

[0004] In order to alleviate the mutual interference problem in full-duplex self-organizing networks, researchers have proposed that power control can be used to alleviate the mutual interference in full-duplex self-organizing networks. Based on this, some researchers have modeled and analyzed the capacity of full-duplex wireless networks under residual self-interference and next-hop mutual interference, and theoretically derived it through rigorous mathematical formulas, ultimately achieving joint optimal power control and routing strategy design. Other researchers have considered the performance optimization of an unsaturated full-duplex scenario, and proposed a power adjustment scheme by deriving a terminal-to-terminal interruption probability model based on a Markov chain of an unsaturated full-duplex multi-hop relay system to minimize the end-to-end interruption probability of the full-duplex relay system under the total transmission power constraint. However, these two schemes only consider the mutual interference of the next-hop node during the communication process, and do not consider the mutual interference of the entire network. In order to solve the problem of mutual interference in the whole network, some researchers proposed an optimal power allocation and routing protocol design for full-duplex networks based on self-interference residual and mutual interference in the whole network on the basis of existing research. By proposing an optimal power allocation algorithm for a given path to maximize throughput, the Dijkstra algorithm is improved to find a path with the highest communication rate at the cost of the maximum communication rate of each node, and then the optimal power allocation algorithm based on the given path proposed above is used to finally find a route with the highest throughput. Further, the researchers continued to optimize on the basis of existing research and formulated the problem of finding a source-destination routing path with maximum spectrum efficiency as a mixed integer nonlinear programming problem. However, this method only considers the optimization of a single data stream in the network. However, in actual situations, the network usually has multiple data streams transmitted simultaneously. In order to cope with the scenario of multiple data streams being transmitted simultaneously, some researchers proposed to perform optimal path planning for multiple data streams in the network to maximize throughput (i.e., maximizing the minimum bottleneck rate by establishing flow conservation constraints, link rate constraints, etc.); and then, by adopting reconstruction-linearization technology and piecewise linear approximation technology, the mixed integer nonlinear programming problem is converted into a linear problem for solution. However, this solution is only based on the prerequisites of a given path and does not solve the path selection itself.

[0005] In summary, the existing technology has two defects when dealing with the mutual interference problem of full-duplex self-organizing networks. On the one hand, the mutual interference is not considered comprehensively: mutual interference is not considered or only the mutual interference of one-hop neighbor nodes is considered, the scenario of concurrent transmission of multiple data streams is not considered, and the selection of multiple paths is not solved. On the other hand, the advantages of full-duplex communication in improving spectrum efficiency and reducing end-to-end transmission delay are not fully utilized. Summary of the invention

[0006] Therefore, the object of the present invention is to overcome the above-mentioned defects of the prior art and provide a full-duplex self-organizing network routing method.

[0007] The objectives of the present invention are achieved through the following technical solutions.

[0008] According to a first aspect of the present invention, a full-duplex self-organizing network routing method is provided, wherein the full-duplex self-organizing network includes multiple nodes, and the method includes: step S1, iteratively executing the following steps until convergence to obtain multiple routes and target power adjustment strategies; step S11, based on the data transmission requirements between multiple pairs of source nodes and target nodes, selecting a route for each pair of source nodes and target nodes according to preset screening rules; step S12, with the goal of minimizing the total transmission delay of all routes, determining the node power of each node in all routes to obtain a power adjustment strategy; step S2, based on the target power adjustment strategy, adjusting the node power of each node in the multiple routes.

[0009] In some embodiments of the present invention, the preset screening rules include centralized screening rules and distributed screening rules; wherein: a centrally controlled full-duplex self-organizing network adopts centralized screening rules, wherein centralized control means that the full-duplex self-organizing network is configured to centrally manage all nodes in the network through a central node; a distributedly controlled full-duplex self-organizing network adopts distributed screening rules, wherein distributed control means that the full-duplex self-organizing network is configured to be autonomously managed through each node in the network.

[0010] In some embodiments of the present invention, the centralized screening rule is: calculating the signal to noise ratio between all any two nodes in the full-duplex self-organizing network; based on the signal to noise ratio between all any two nodes, constructing a network topology connection graph according to a preset topology connection rule; based on the network topology connection graph, calculating the transmission interruption probability between all two nodes with a connection relationship; based on the transmission interruption probability between all two nodes with a connection relationship and the network topology connection graph, selecting a route for each pair of source nodes and target nodes according to the first path selection rule.

[0011] In some embodiments of the present invention, the preset topological connection rule is: determining whether the signal to interference plus noise ratio between any two nodes is greater than or equal to a preset signal to interference plus noise ratio threshold, and connecting all nodes that meet the condition to obtain a network topological connection diagram.

[0012] In some embodiments of the present invention, the transmission interruption probability is calculated as follows:

[0013]

[0014] in, represents the transmission interruption probability, represents the signal-to-interference-noise ratio, Indicates the preset signal-to-interference-noise ratio threshold. express Less than probability.

[0015] In some embodiments of the present invention, the first path selection rule is: based on the transmission interruption probability between all two nodes that have a connection relationship and the network topology connection diagram, a neighbor node with the smallest interruption probability is selected for the source node as the next hop node of the source node, and the neighbor node with the smallest interruption probability is continued to be selected for the next hop node as the next hop node of the next hop node, until the last hop node is the target node.

[0016] In some embodiments of the present invention, the distributed screening rule is: each node calculates the signal to noise ratio between itself and other nodes; based on the signal to noise ratio between all nodes and other nodes, each node constructs a network topology connection graph according to a preset topology connection rule; based on the network topology connection graph, the route between each pair of source nodes and target nodes is determined according to the second path selection rule.

[0017] In some embodiments of the present invention, the second path selection rule is: based on the network topology connection diagram, the source node selects a neighbor node with the maximum signal to interference and noise ratio as the next hop node of the source node, and based on the next hop node, selects a neighbor node with the maximum signal to interference and noise ratio as the next hop node of the next hop node, until the last hop node is the target node.

[0018] Compared with the prior art, the advantages of the present invention are: (1) with the goal of minimizing the total transmission delay, the node power of each node is adjusted to reduce the transmission delay while alleviating the mutual interference between nodes and data streams; (2) by calculating the transmission interruption probability, the node with the minimum transmission interruption probability is selected as the next hop, thereby reducing the delay caused by path interruption during data transmission and ensuring the reliability of data transmission. BRIEF DESCRIPTION OF THE DRAWINGS

[0019] The embodiments of the present invention are further described below with reference to the accompanying drawings, in which:

[0020] Figure 1 A schematic diagram of a full-duplex self-organizing network routing method according to an embodiment of the present invention;

[0021] Figure 2 A schematic diagram showing the comparison of total transmission delay with the number of nodes according to an embodiment of the present invention;

[0022] Figure 3 A schematic diagram showing the comparison of total transmission delay with the number of data streams according to an embodiment of the present invention;

[0023] Figure 4Schematic diagram of the total transmission delay varying with the self-interference elimination coefficient according to an embodiment of the present invention. DETAILED DESCRIPTION

[0024] In order to make the purpose, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below through specific embodiments in conjunction with the accompanying drawings. It should be understood that the specific embodiments described herein are only used to explain the present invention and are not intended to limit the present invention.

[0025] As mentioned in the background technology section, the existing technology has two defects when dealing with the mutual interference problem of full-duplex self-organizing networks. On the one hand, the mutual interference is not considered comprehensively: mutual interference is not considered or only the mutual interference of one-hop neighbor nodes is considered, the scenario of concurrent transmission of multiple data streams is not considered, and the selection of multiple paths is not solved. On the other hand, the advantages of full-duplex communication in improving spectrum efficiency and reducing end-to-end transmission delay are not fully utilized.

[0026] In order to solve the above problems, the inventors studied mutual interference and found that mutual interference is a factor that cannot be ignored in full-duplex self-organizing networks. When there are multiple paths in the network to transmit data, the mutual interference between data streams also needs to be considered. The power adjustment of nodes in a data stream will affect the mutual interference received by other nodes in this data stream and the mutual interference received by nodes in other data streams. Based on the analysis of mutual interference, the inventors proposed a routing selection strategy for full-duplex self-organizing networks, which minimizes the total transmission delay between multiple routes to adjust the node power of each node in all routes. This processing method can not only effectively alleviate the mutual interference between nodes, but also reduce the total end-to-end transmission delay.

[0027] In summary, if Figure 1 As shown, the present invention provides a full-duplex self-organizing network routing method, the full-duplex self-organizing network includes multiple nodes, and the method includes: step S1, iteratively executing the following steps until convergence to obtain multiple routes and target power adjustment strategies; step S11, based on the data transmission requirements between multiple pairs of source nodes and target nodes, selecting a route for each pair of source nodes and target nodes according to preset screening rules; step S12, with the goal of minimizing the total transmission delay of all routes, determining the node power of each node in all routes to obtain a power adjustment strategy; step S2, based on the target power adjustment strategy, adjusting the node power of each node in the multiple routes.

[0028] In order to better understand the present invention, each step is described in detail below in conjunction with specific embodiments.

[0029] 1. Step S1

[0030] The step S1 is used to obtain multiple routes and target power adjustment strategies, wherein, in the step S1, the following steps are iteratively executed until convergence to obtain multiple routes and target power adjustment strategies: step S11, based on the data transmission requirements between multiple pairs of source nodes and target nodes, a route is selected for each pair of source nodes and target nodes according to a preset screening rule; step S12, with the goal of minimizing the total transmission delay of all routes, the node power of each node in all routes is determined to obtain a power adjustment strategy. Each sub-step is explained below.

[0031] 1.1. Step S11

[0032] The step S11 is used to select a route for each pair of source nodes and target nodes according to a preset screening rule based on the data transmission requirements between multiple pairs of source nodes and target nodes.

[0033] According to one embodiment of the present invention, the preset screening rules include centralized screening rules and distributed screening rules; wherein: a centrally controlled full-duplex self-organizing network adopts centralized screening rules, wherein centralized control means that the full-duplex self-organizing network is configured to centrally manage all nodes in the network through a central node; a distributedly controlled full-duplex self-organizing network adopts distributed screening rules, wherein distributed control means that the full-duplex self-organizing network is configured to be autonomously managed through each node in the network.

[0034] In order to better understand the present invention, the centralized screening rules and the distributed screening rules are respectively introduced below.

[0035] First, the centralized screening rules are introduced.

[0036] The centralized screening rule is applied to a centrally controlled full-duplex self-organizing network. In the centralized control scenario, the full-duplex self-organizing network includes a plurality of nodes randomly allocated in a plurality of areas and a central node. The central node is provided with a global management unit, which includes a topology generation module, a channel module, an interruption probability calculation module, a path selection module, and a power optimization module.

[0037] According to one embodiment of the present invention, the centralized screening rule is: calculating the signal to noise ratio between all any two nodes in the full-duplex self-organizing network; based on the signal to noise ratio between all any two nodes, constructing a network topology connection diagram according to a preset topology connection rule; based on the network topology connection diagram, calculating the transmission interruption probability between all two nodes with a connection relationship; based on the transmission interruption probability between all two nodes with a connection relationship and the network topology connection diagram, selecting a route for each pair of source nodes and target nodes according to the first path selection rule.

[0038] According to an embodiment of the present invention, the preset topology connection rule is: determining whether the signal to interference plus noise ratio between any two nodes is greater than or equal to a preset signal to interference plus noise ratio threshold, and connecting all nodes that meet the condition to obtain a network topology connection diagram.

[0039] According to one embodiment of the present invention, the transmission interruption probability is calculated as follows:

[0040]

[0041] in, represents the transmission interruption probability, represents the signal-to-interference-noise ratio, Indicates the preset signal-to-interference-noise ratio threshold. express Less than probability.

[0042] According to one embodiment of the present invention, the first path selection rule is: based on the transmission interruption probability between all two nodes with a connection relationship and the network topology connection diagram, a neighbor node with the smallest interruption probability is selected for the source node as the next hop node of the source node, and the neighbor node with the smallest interruption probability is continued to be selected for the next hop node as the next hop node of the next hop node, until the last hop node is the target node.

[0043] In order to better understand the centralized screening rules, the following describes how to obtain multiple routes in a centrally controlled full-duplex self-organizing network according to the centralized screening rules in combination with a specific execution process.

[0044] First, before selecting multiple routes according to the centralized screening rules, the global management unit in the central node is used to adjust the power, that is, the node power of all nodes in the full-duplex self-organizing network is initialized to .

[0045] Second, the channel module in the central node is called to calculate the signal to interference plus noise ratio (SINR) and link rate between any two nodes in the network. At this time, all nodes in the network upload node location and node power information to the global management unit, which generates a node distribution map corresponding to the network. The global management unit calculates the signal to interference plus noise ratio and link rate between any two nodes in the network through the channel module based on the collected node power and location information.

[0046] The calculation process of the signal-to-interference-noise ratio and link rate between any two nodes is:

[0047] Assuming that large-scale fading and small-scale aging are independent of each other, calculate the channel gain between any two nodes:

[0048]

[0049] in, Representation Node and nodes The channel gain between represents the Rayleigh fading coefficient and obeys a complex Gaussian distribution with a mean of 0 and a variance of 1. It follows an exponential distribution; Representation Node and nodes distance between Representation Node and nodes The path loss between the two paths can be determined by selecting different path loss models according to actual situations, and the present invention does not limit this.

[0050] Then let any node have the maximum transmission power , define the node The node power size . Assume there is a data stream , data flow Nodes in To Node Transmit data, then the node in the full-duplex scenario The signal-to-interference-noise ratio is:

[0051]

[0052] in, Representation Node Signal-to-interference-noise ratio; Representation Node Slave Node The received data, Representation Node Node power; Indicates the influence of Gaussian white noise; represents the self-interference residual, represents the attenuation factor, Representation Node Node power; Represents mutual interference from the entire network; Represents the set of data flows existing in the entire network; Representation Node and nodes The channel gain between

[0053] Re-order for , so that the denominator in the signal-to-interference-noise ratio calculation formula can be merged, then the node and nodes The link rate can be expressed as:

[0054]

[0055] in, Representation Node and nodes The link rate, Representation Node and nodes Links between Indicates the channel bandwidth.

[0056] Third, the topology generation module in the central node is called to generate a network topology connection diagram based on the preset topology connection rules. In simple terms, the global management unit determines whether the signal interference noise ratio between any two nodes is greater than or equal to the preset signal interference noise ratio threshold (the minimum signal interference noise ratio value required for successful signal reception) based on the signal interference noise ratio between all any two nodes calculated by the channel module. If so, the two nodes are topologically connected, otherwise they are not connected, and the network connection topology diagram of the entire full-duplex self-organizing network is obtained.

[0057] Fourth, the interruption probability calculation module in the call center node is used to calculate the transmission interruption probability between all two nodes that have a connection relationship based on the network topology connection diagram. The specific calculation process is as follows:

[0058] Assume Node Successfully received from the node The data conditions are:

[0059]

[0060] in, represents the preset signal-to-interference-noise ratio threshold (the signal-to-interference-noise ratio value for successfully receiving the signal), then the transmission interruption probability is:

[0061]

[0062] in, represents the transmission interruption probability, represents the signal-to-interference-noise ratio, Indicates the preset signal-to-interference-noise ratio threshold. express Less than probability.

[0063] When selecting a route, each hop node is selected based on the node with the lowest transmission interruption probability as the next hop node, and each node transmits data by amplifying relay forwarding. Therefore, the interruption events of two adjacent relay links are not independent, and the transmission interruption probability is the cumulative product of the transmission interruption probability of each link. The specific formula for transmission interruption probability is derived as follows:

[0064] Assume Node Successfully received from the node The data conditions are:

[0065]

[0066] Expand it into two separate parts:

[0067]

[0068] in,

[0069]

[0070]

[0071] For variables The Cumulative Distribution Function (CDF) and Probability Distribution Function (PDF) are derived as follows:

[0072] make ; ,variable The PDF function is ; is a variable with 2 degrees of freedom, The PDF function is ;because ,but The distribution function can be expressed as:

[0073]

[0074] The probability distribution function can be expressed as:

[0075]

[0076] In summary, the calculation of transmission interruption probability is expressed as follows:

[0077]

[0078] The derivation of the fourth to fifth rows of equations is due to the variable The channel coefficients in are independent of each other, so:

[0079]

[0080] Among them, To expand:

[0081]

[0082] therefore:

[0083]

[0084] Fifth, the global management unit calls the path selection module according to the result returned by the interruption probability calculation module, and selects a route for each pair of source nodes and target nodes according to the first path selection rule based on the transmission interruption probability between all two nodes with a connection relationship and the network topology connection diagram.

[0085] Then, introduce the distributed filtering rules

[0086] The distributed screening rules are applied to a full-duplex self-organizing network of distributed control. In a distributed control scenario, the full-duplex self-organizing network includes multiple nodes randomly distributed in multiple areas, and each node has a channel module, a path selection module and a power control module.

[0087] According to one embodiment of the present invention, the distributed screening rule is: each node calculates the signal to noise ratio between itself and other nodes; based on the signal to noise ratio between all nodes and other nodes, each node builds a network topology connection graph according to a preset topology connection rule; based on the network topology connection graph, the route between each pair of source nodes and target nodes is determined according to the second path selection rule.

[0088] According to an embodiment of the present invention, the second path selection rule is: based on the network topology connection diagram, the source node selects a neighbor node with the maximum signal to interference and noise ratio as the next hop node of the source node, and based on the next hop node, selects a neighbor node with the maximum signal to interference and noise ratio as the next hop node of the next hop node, until the last hop node is the target node.

[0089] In order to better understand the distributed filtering rules, the following describes how to obtain multiple routes in a distributed controlled full-duplex self-organizing network according to the distributed filtering rules in combination with a specific execution process.

[0090] First, before selecting multiple routes according to the distributed screening rules, each node in the network performs power adjustment, that is, each node in the full-duplex self-organizing network initializes its own node power to .

[0091] Second, each node calculates the signal-to-noise ratio and link rate between itself and other nodes based on its own channel module. Each node calculates the signal-to-noise ratio between itself and other nodes based on the signal strength received from other nodes as follows:

[0092]

[0093] in, Indicates the effective signal power received by the node, represents the early noise power, Represents the interference noise power (including self-interference).

[0094] The link rate is calculated as follows:

[0095]

[0096] in, Representation Node and nodes The link rate between the two devices.

[0097] Third, each node calculates the signal interference-noise ratio (SINR) with other nodes based on the signal strength received from other nodes, and determines whether the SINR is greater than or equal to a preset SINR threshold. All nodes that meet the conditions are connected to obtain a network topology connection diagram.

[0098] Fourth, based on the network topology connection diagram, each source node selects the neighbor node with the maximum signal to noise ratio as the next hop node of the source node based on its own path selection module, and the next hop node selects the neighbor node with the maximum signal to noise ratio as the next hop node of the next hop node based on its own path selection module, until the last hop node is the target node corresponding to the source node. It should be noted that if there are neighbor nodes with the same maximum signal to noise ratio, the node with the previous node ID is selected, and the node ID is the number assigned to each node during initialization.

[0099] 1.2 Step S12

[0100] In step S12, the node power of each node in all routes is determined to obtain a power adjustment strategy with the goal of minimizing the total transmission delay of all routes. The specific calculation process is as follows:

[0101] Define the nodes in the data transmission process and nodes The transmission delay between is expressed as follows:

[0102]

[0103] in, Representation Node and nodes The transmission delay between Indicates the length of the transmitted data packet.

[0104] For each data flow , consisting of multiple transmission links The set of all nodes in the data stream is represented as Based on this, the end-to-end transmission delay in a full-duplex self-organizing network can be expressed as:

[0105]

[0106] The total end-to-end transmission delay in a full-duplex ad hoc network is:

[0107]

[0108] in, Indicates the total transmission delay.

[0109] The total transmission delay expression is used to construct the optimization target, and then the power adjustment strategy is determined. Among them, the centralized controlled full-duplex self-organizing network uses the global management unit to obtain multiple routes obtained by the path selection module, and calls the power control module to optimize the node power of nodes in all routes to minimize the total transmission delay. The specific optimization target can be expressed as:

[0110]

[0111] Expand the optimization objective:

[0112]

[0113] make , ,in, is a concave function, is a convex function, then:

[0114]

[0115] The final optimization goal can be expressed as:

[0116]

[0117] Among them, the optimization objective can be solved using the logarithmic barrier interior point method function.

[0118] The distributed controlled full-duplex self-organizing network optimizes its own node power based on its own power control module to minimize the total transmission delay. The specific calculation principle is consistent with the calculation process of the full-duplex self-organizing network under centralized control. The difference lies in the different optimization target expansion, which is expressed as follows:

[0119] Step S2

[0120] In step S2, the node power of each node in the multiple routes is adjusted based on the target power adjustment strategy. Specifically, the full-duplex self-organizing network in the centralized scenario adjusts the node power of each node in the multiple routes through the global management center based on the target power adjustment strategy. Each node in the full-duplex self-organizing network in the distributed scenario adjusts its own node power based on the target power adjustment strategy.

[0121] In order to better understand the difference between the prior art and the present invention, the present invention sets up a simulation experiment to evaluate the difference between the prior art and the present invention.

[0122] The simulation experiment is carried out using MATLAB, and the specific simulation parameters are shown in Table 1.

[0123] Table 1

[0124]

[0125] The simulation experiment was carried out with the simulation parameters set in Table 1 (in the simulation experiment, the centralized screening rule described in the above embodiment was used to select the route), and the following results were obtained: Figure 2-4 The experimental results.

[0126] in, Figure 2 It shows how the total transmission delay varies with the number of nodes. Figure 2 It can be seen that as the number of nodes increases, the scale of the full-duplex self-organizing network increases, the mutual interference in the network increases, and the total transmission delay shows an upward trend; since the prior art does not consider the mutual interference between data streams, the total transmission delay of the prior art is greater than the total transmission delay of the present invention.

[0127] Figure 3 It shows how the total transmission delay varies with the number of data streams. Figure 3 It can be seen that as the number of data streams transmitted in the network increases, the interference between data streams increases and the total transmission delay increases; since the prior art does not take into account the mutual interference between data streams, the total transmission delay of the prior art under the same data stream condition is greater than the total transmission delay of the present invention.

[0128] Figure 4 The total transmission delay varies with the self-interference cancellation coefficient. Figure 4 It can be seen that as the self-interference elimination coefficient increases, the total transmission delay increases, and when the self-interference elimination coefficient is greater than -70db, multiple valid routes cannot be found due to severe self-interference; at the same time, when the self-interference coefficient is less than -80db, the performance of the full-duplex self-organizing network is better than that of the half-duplex self-organizing network.

[0129] The beneficial effects of the present invention are: (1) with the goal of minimizing the total transmission delay, the node power of each node is adjusted, and the transmission delay is reduced while alleviating the mutual interference between nodes and data streams; (2) by calculating the transmission interruption probability, the node with the minimum transmission interruption probability is selected as the next hop, thereby reducing the delay caused by path interruption during data transmission and ensuring the reliability of data transmission.

[0130] It should be noted that although the above describes the various steps in a specific order, it does not mean that the various steps must be executed in the above specific order. In fact, some of these steps can be executed concurrently or even in a different order as long as the required functions can be achieved.

[0131] The present invention may be a system, a method and / or a computer program product. The computer program product may include a computer-readable storage medium carrying computer-readable program instructions for causing a processor to implement various aspects of the present invention.

[0132] A computer-readable storage medium may be a tangible device that holds and stores instructions used by an instruction execution device. Computer-readable storage media may include, for example, but are not limited to, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination thereof. More specific examples (non-exhaustive list) of computer-readable storage media include: a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanical encoding device, such as a punch card or a protruding structure in a groove on which instructions are stored, and any suitable combination thereof.

[0133] The embodiments of the present invention have been described above, and the above description is exemplary, not exhaustive, and is not limited to the disclosed embodiments. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The selection of terms used herein is intended to best explain the principles of the embodiments, practical applications, or technical improvements in the market, or to enable other persons of ordinary skill in the art to understand the embodiments disclosed herein.

Claims

1. A full-duplex self-organizing network routing method, wherein the full-duplex self-organizing network comprises a plurality of nodes, characterized in that: The method comprises: Step S1, iteratively execute the following steps until convergence to obtain multiple routes and target power adjustment strategies; Step S11: based on the data transmission requirements between multiple pairs of source nodes and target nodes, select a route for each pair of source nodes and target nodes according to a preset screening rule; Step S12: with the goal of minimizing the total transmission delay of all routes, determine the node power of each node in all routes to obtain a power adjustment strategy; Step S2: Based on the target power adjustment strategy, adjust the node power of each node in the multiple routes.

2. The method according to claim 1, characterized in that The preset screening rules include centralized screening rules and distributed screening rules; wherein: The centrally controlled full-duplex self-organizing network adopts a centralized screening rule, wherein centralized control means that the full-duplex self-organizing network is configured to centrally manage all nodes in the network through a central node; The distributed controlled full-duplex self-organizing network adopts a distributed screening rule, wherein the distributed control means that the full-duplex self-organizing network is configured to be autonomously managed by each node in the network.

3. The method according to claim 2, characterized in that The centralized screening rules are: Calculate the signal-to-interference-noise ratio between any two nodes in a full-duplex ad hoc network; Based on the signal-to-interference-to-noise ratio between any two nodes, a network topology connection diagram is constructed according to the preset topology connection rules; Based on the network topology connection diagram, the transmission interruption probability between all two nodes with a connection relationship is calculated; Based on the transmission interruption probability between all two nodes having a connection relationship and the network topology connection diagram, a route is selected for each pair of source nodes and target nodes according to the first path selection rule.

4. The method according to claim 3, characterized in that The preset topological connection rule is: It is determined whether the signal to noise ratio between any two nodes is greater than or equal to a preset signal to noise ratio threshold, and all nodes that meet the condition are connected to obtain a network topology connection diagram.

5. The method according to claim 4, characterized in that The transmission outage probability is calculated as follows: in, represents the transmission interruption probability, represents the signal-to-interference-noise ratio, Indicates the preset signal-to-interference-noise ratio threshold. express Less than probability.

6. The method according to claim 5, characterized in that The first path selection rule is: Based on the transmission interruption probability between all two nodes with a connection relationship and the network topology connection diagram, the neighbor node with the smallest interruption probability is selected as the next hop node of the source node, and the neighbor node with the smallest interruption probability is continued to be selected as the next hop node of the next hop node until the last hop node is the target node.

7. The method according to claim 4, characterized in that The distributed screening rules are: Each node calculates the signal-to-interference-to-noise ratio between itself and other nodes; Based on the signal-to-interference-noise ratio between all nodes and other nodes, each node builds a network topology connection diagram according to the preset topology connection rules; Based on the network topology connection diagram, the route between each pair of source nodes and target nodes is determined according to the second path selection rule.

8. The method according to claim 7, characterized in that The second path selection rule is: Based on the network topology connection graph, the source node selects the neighbor node with the largest signal to interference and noise ratio as the next hop node of the source node, and based on the next hop node, it selects the neighbor node with the largest signal to interference and noise ratio as the next hop node of the next hop node, until the last hop node is the target node.

9. A computer-readable storage medium, characterized in that: A computer program is stored thereon, and the computer program can be executed by a processor to implement the steps of any method described in claims 1-8.

10. An electronic device, characterized in that: include: one or more processors, and A memory, wherein the memory is used to store executable instructions; The one or more processors are configured to implement the steps of any one of the methods of claims 1-8 by executing the executable instructions.

Images