CN119485570A - A full-duplex self-organizing network routing method - Google Patents
A full-duplex self-organizing network routing method Download PDFInfo
- Publication number
- CN119485570A CN119485570A CN202411480356.XA CN202411480356A CN119485570A CN 119485570 A CN119485570 A CN 119485570A CN 202411480356 A CN202411480356 A CN 202411480356A CN 119485570 A CN119485570 A CN 119485570A
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- interference
- network
- noise ratio
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 35
- 230000005540 biological transmission Effects 0.000 claims abstract description 79
- 238000012216 screening Methods 0.000 claims abstract description 37
- 238000010586 diagram Methods 0.000 claims description 21
- 238000004590 computer program Methods 0.000 claims description 3
- 238000004364 calculation method Methods 0.000 description 10
- 238000005457 optimization Methods 0.000 description 9
- 238000007726 management method Methods 0.000 description 8
- 230000006854 communication Effects 0.000 description 7
- 238000004088 simulation Methods 0.000 description 7
- 238000004422 calculation algorithm Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 6
- 238000005315 distribution function Methods 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 230000008569 process Effects 0.000 description 4
- 238000001914 filtration Methods 0.000 description 3
- 230000003595 spectral effect Effects 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 2
- 238000013459 approach Methods 0.000 description 2
- 230000002457 bidirectional effect Effects 0.000 description 2
- 230000001186 cumulative effect Effects 0.000 description 2
- 238000013461 design Methods 0.000 description 2
- 230000006872 improvement Effects 0.000 description 2
- 230000001105 regulatory effect Effects 0.000 description 2
- 238000011160 research Methods 0.000 description 2
- 230000032683 aging Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005562 fading Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a full duplex self-organizing network routing method which comprises a plurality of nodes, and the method comprises the steps of S1, iteratively executing the following steps until convergence is achieved to obtain a plurality of routes and a target power adjustment strategy, S11, selecting one route for each pair of source nodes and target nodes according to a preset screening rule based on data transmission requirements between the source nodes and the target nodes, S12, determining node power of each node in all routes to obtain the power adjustment strategy with the aim of minimizing total transmission delay of all routes, and S2, adjusting the node power of each node in the routes based on the target power adjustment strategy. The technical scheme of the invention reasonably distributes the node power of each node by minimizing the total transmission delay of a plurality of routes, thereby not only effectively relieving the mutual interference among the nodes, but also reducing the end-to-end transmission delay.
Description
Technical Field
The present invention relates to the field of wireless communications, and in particular, to a routing technique in the field of wireless communications, and more particularly, to a full duplex ad hoc network routing method.
Background
Existing wireless ad hoc network routing policies can be categorized into active, passive, hybrid, geographic location-based, hierarchical, and heuristic routing. The active routing strategy has small time delay and high cost; the passive routing strategy has small cost and large time delay, the hybrid routing strategy has the advantages of both active and passive routing strategies, but has large time delay of cross-domain routing, the routing strategy based on the geographic position needs to be provided with a positioning system for the nodes, the heuristic routing strategy has small cost but cannot guarantee the optimality of the paths, and the hierarchical routing strategy adopts a layered structure and is suitable for a large-scale network.
Although many routing strategies are proposed for wireless ad hoc networks, currently there are few studies on the routing strategies of full duplex ad hoc networks. In order to minimize the routing delay in a Full duplex ad-hoc network (VANET) scenario, researchers have proposed a minimum delay routing algorithm under Full duplex/Half duplex (FD/HD) mixing, and an improved Dijkstra algorithm is proposed to perform path selection with minimum delay by proving that the "any sub-path of the shortest path" in Dijkstra algorithm is also the shortest path "theorem is not true in the undirected graph of FD/HD mixing. Researchers also put forward a bidirectional self-organizing On-demand multipath distance vector (Ad Hoc On-demand Multipath Distance Vector, AOMDV) routing strategy to find multipath, disjoint and bidirectional routes in the network, and simulation experiments show that the strategy has improvement in aspects of end-to-end delay, packet loss rate and the like. Although the above routing policies may be applied to full duplex ad hoc networks, none of the above routing policies take into account the problem of mutual interference in full duplex ad hoc networks.
To alleviate the problem of mutual interference in full duplex ad hoc networks, researchers have proposed that mutual interference in full duplex ad hoc networks can be alleviated by power control. Based on the method, researchers perform modeling analysis on the capacity of the full duplex wireless network under the self-interference residual and the next-hop mutual interference, and perform theoretical deduction through a strict mathematical formula so as to finally realize the combined optimal power control and routing strategy design. Also, researchers consider the performance optimization of an unsaturated full duplex scenario, and propose a power adjustment scheme by deriving a markov chain-end outage probability model based on an unsaturated full duplex multi-hop relay system to minimize the end-to-end outage probability of the full duplex relay system under the total transmit power constraint. However, the two schemes only consider the mutual interference of the next hop node in the communication process, and do not consider the mutual interference of the whole network. In order to solve the problem of mutual interference of the whole network, researchers provide a design of a full duplex network optimal power distribution and routing protocol based on self-interference residues and mutual interference of the whole network on the basis of the existing researches, and through a given path, a power distribution optimal algorithm is provided to maximize throughput, and simultaneously, dijkstra algorithm is improved, a path with the maximum communication rate of nodes is searched for by taking the maximum communication rate of each hop as the cost, and then the optimal power distribution algorithm based on the given path is applied to finally find a route with the maximum throughput. Further, researchers continue to optimize on the basis of existing studies, expressing the problem of finding source-destination routing paths with maximum spectral efficiency as a mixed integer nonlinear programming problem, but this approach only considers optimization of a single data stream in the network, which in practice is often the case when multiple data streams are transmitted simultaneously. In order to cope with the scenario of simultaneous transmission of multiple data streams, researchers have proposed to perform optimal path planning on multiple data streams in a network to maximize throughput (i.e., to maximize minimum bottleneck rate by establishing stream conservation constraints, link rate constraints, etc.), and then to transform the mixed integer nonlinear programming problem into a linear problem solution by adopting a reconstruction-linearization technique and a piecewise linear approximation technique. However, this approach is based only on the preconditions of a given path, and does not solve for the path selection itself.
In summary, the prior art has two drawbacks in dealing with the problem of mutual interference of the full duplex ad hoc network. On the one hand, mutual interference is considered, namely mutual interference is not considered or only mutual interference of one-hop neighbor nodes is considered, a scene of concurrent transmission of a plurality of data streams is not considered, and multipath selection is not solved. On the other hand, full duplex communication is underutilized in terms of improving spectral efficiency and reducing end-to-end transmission delay.
Disclosure of Invention
It is therefore an object of the present invention to overcome the above-mentioned drawbacks of the prior art and to provide a full duplex ad hoc network routing method.
The aim of the invention is achieved by the following technical scheme.
According to a first aspect of the present invention, a full duplex self-organizing network routing method is provided, the full duplex self-organizing network includes a plurality of nodes, the method includes steps of S1, iteratively executing steps until convergence is achieved to obtain a plurality of routes and a target power adjustment strategy, S11, selecting a route for each pair of source nodes and target nodes according to a preset screening rule based on data transmission requirements between the pairs of source nodes and the target nodes, S12, determining node powers of all nodes in all routes to obtain the power adjustment strategy with a goal of minimizing total transmission delay of all routes, and S2, adjusting node powers of all nodes in the plurality of routes based on the target power adjustment strategy.
In some embodiments of the invention, the preset screening rules comprise a centralized screening rule and a distributed screening rule, wherein the centralized control full-duplex self-organizing network adopts the centralized screening rule, the centralized control indicates that the full-duplex self-organizing network is configured to centrally manage all nodes in the network through one central node, and the distributed control full-duplex self-organizing network adopts the distributed screening rule, wherein the distributed control indicates that the full-duplex self-organizing network is configured to be autonomously managed through each node in the network.
In some embodiments of the present invention, the centralized filtering rule is that a signal-to-interference-and-noise ratio between all arbitrary two nodes in the full duplex self-organizing network is calculated, a network topology connection graph is built according to a preset topology connection rule based on the signal-to-interference-and-noise ratio between all arbitrary two nodes, a transmission interruption probability between all two nodes with a connection relationship is calculated based on the network topology connection graph, and a route is selected for each pair of source nodes and target nodes according to a first path selection rule based on the transmission interruption probability between all two nodes with the connection relationship and the network topology connection graph.
In some embodiments of the present invention, the preset topology connection rule is to determine whether a signal-to-interference-and-noise ratio between any two nodes is greater than or equal to a preset signal-to-interference-and-noise ratio threshold, and connect all nodes that meet a condition to obtain a network topology connection graph.
In some embodiments of the present invention, the transmission outage probability is calculated as follows:
Wherein, Indicating the probability of transmission interruption,Representing the signal-to-interference-and-noise ratio,Representing a preset signal-to-interference-and-noise ratio threshold,Representation ofLess thanIs a probability of (2).
In some embodiments of the present invention, the first path selection rule is that, based on the transmission outage probability and the network topology connection graph between all the two nodes having the connection relationship, a neighboring node with the minimum outage probability is selected for the source node as a next-hop node of the source node, and the neighboring node with the minimum outage probability is continuously 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.
In some embodiments of the invention, the distributed filtering rule is that each node calculates the signal-to-interference-and-noise ratio between itself and other nodes, each node constructs a network topology connection graph according to a preset topology connection rule based on the signal-to-interference-and-noise ratio between all nodes and other nodes, and determines a route between each pair of source nodes and target nodes according to a second path selection rule based on the network topology connection graph.
In some embodiments of the present invention, the second path selection rule is that, based on a network topology connection graph, a source node selects a neighboring node with the maximum signal-to-interference-and-noise ratio as a next-hop node of the source node, and selects a neighboring node with the maximum signal-to-interference-and-noise ratio as a next-hop node of the next-hop node based on the next-hop node until a last-hop node is a target node.
Compared with the prior art, the method has the advantages that (1) the total transmission delay is minimized, the node power of each node is regulated, the transmission delay is reduced while the mutual interference between the nodes and between data streams is relieved, and (2) the node with the smallest transmission interruption probability is selected as the next hop by calculating the transmission interruption probability, so that the delay caused by the path interruption in the data transmission process is reduced, and the reliability of the data transmission is ensured.
Drawings
Embodiments of the invention are further described below with reference to the accompanying drawings, in which:
fig. 1 is a flow chart of a routing method of a full duplex ad hoc network according to an embodiment of the present invention;
Fig. 2 is a schematic diagram showing a comparison of total transmission delay with the number of nodes according to an embodiment of the present invention;
fig. 3 is a schematic diagram showing a comparison of total transmission delay with a data stream according to an embodiment of the present invention;
fig. 4 is a schematic diagram showing a change of a total transmission delay according to a self-interference cancellation coefficient according to an embodiment of the present invention.
Detailed Description
For the purpose of making the technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail by way of specific embodiments with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
As mentioned in the background section, the prior art has two drawbacks in dealing with the problem of mutual interference in full duplex ad hoc networks. On the one hand, the mutual interference is considered, namely the mutual interference is not considered or only the mutual interference of one-hop neighbor nodes is considered, the scene of concurrent transmission of a plurality of data streams is not considered, and the multipath selection is not solved. On the other hand, full duplex communication is underutilized in terms of improving spectral efficiency and reducing end-to-end transmission delay.
In order to solve the above problem, the inventor researches on mutual interference, and found that the mutual interference is a non-negligible factor in a full duplex self-organizing network, when a plurality of paths exist in the network for transmitting data, the mutual interference between data flows needs to be considered, and the power adjustment of a node in one data flow can influence the mutual interference received by other nodes in the data flow and the mutual interference received by nodes in other data flows. Based on the analysis of mutual interference, the inventor provides a routing strategy for a full duplex self-organizing network to minimize the total transmission delay among a plurality of routes and adjust the node power of each node in all routes.
In summary, as shown in fig. 1, the present invention provides a routing method of a full duplex ad hoc network, where the full duplex ad hoc network includes a plurality of nodes, and the method includes steps of S1, iteratively executing steps until convergence to obtain a plurality of routes and a target power adjustment policy, S11, selecting a route for each pair of source nodes and target nodes according to a preset screening rule based on data transmission requirements between the pairs of source nodes and the target nodes, S12, determining node powers of each node in all routes to obtain the power adjustment policy with a goal of minimizing a total delay of transmission of all routes, and S2, adjusting node powers of each node in the plurality of routes based on the target power adjustment policy.
For a better understanding of the present invention, each step is described in detail below in connection with specific examples.
1. Step S1
The step S1 is used for acquiring a plurality of routes and a target power adjustment strategy, wherein in the step S1, the steps of iteratively executing the steps until convergence is carried out to acquire the plurality of routes and the target power adjustment strategy are carried out, wherein in the step S11, a route is selected for each pair of source nodes and target nodes according to a preset screening rule based on data transmission requirements between the pairs of source nodes and the target nodes, and in the step S12, the node power of each node in all routes is determined to acquire the power adjustment strategy with the aim of minimizing the total transmission delay of all routes. Each sub-step is described below.
1.1 Step S11
The step S11 is configured to select a route for each pair of source nodes and target nodes according to a preset screening rule based on data transmission requirements between the pairs of source nodes and target nodes.
According to one embodiment of the invention, the preset screening rules comprise a centralized screening rule and a distributed screening rule, wherein the centralized control full-duplex self-organizing network adopts the centralized screening rule, the centralized control indicates that the full-duplex self-organizing network is configured to centrally manage all nodes in the network through one central node, and the distributed control full-duplex self-organizing network adopts the distributed screening rule, wherein the distributed control indicates that the full-duplex self-organizing network is configured to be autonomously managed through each node in the network.
For a better understanding of the present invention, centralized screening rules and distributed screening rules are described below, respectively.
First, a centralized screening rule is introduced.
The centralized screening rule is applied to a centralized control full-duplex self-organizing network, and in a centralized control scene, the full-duplex self-organizing network comprises a plurality of nodes and central nodes which are randomly distributed in a plurality of areas. The central node is provided with a global management unit which comprises a topology generation module, a channel module, an outage probability calculation module, a path selection module and a power optimization module.
According to one embodiment of the invention, the centralized screening rule comprises the steps of calculating the signal-to-interference-and-noise ratio between any two nodes in the full duplex self-organizing network, constructing a network topology connection diagram according to a preset topology connection rule based on the signal-to-interference-and-noise ratio between any two nodes, calculating the transmission interruption probability between the two nodes with connection relations based on the network topology connection diagram, and selecting a route for each pair of source nodes and target nodes according to a first path selection rule based on the transmission interruption probability between the two nodes with connection relations and the network topology connection diagram.
According to one embodiment of the invention, the preset topology connection rule is that whether the signal-to-interference-and-noise ratio between any two nodes is larger than or equal to a preset signal-to-interference-and-noise ratio threshold value is judged, and all nodes meeting the conditions are connected to obtain a network topology connection diagram.
According to one embodiment of the invention, the transmission outage probability is calculated as follows:
Wherein, Indicating the probability of transmission interruption,Representing the signal-to-interference-and-noise ratio,Representing a preset signal-to-interference-and-noise ratio threshold,Representation ofLess thanIs a probability of (2).
According to one embodiment of the invention, the first path selection rule is that a neighbor node with the minimum outage probability is selected for a source node to serve as a next-hop node of the source node based on the transmission outage probability and a network topology connection diagram between all the two nodes with the connection relationship, and the neighbor node with the minimum outage probability is continuously selected for the next-hop node to serve as the next-hop node of the next-hop node until the last-hop node is a target node.
For a better understanding of the centralized screening rules, the following describes how to obtain multiple routes in a centralized-controlled full duplex ad hoc network according to the centralized screening rules in connection with a specific implementation.
Firstly, before selecting multiple routes according to a centralized screening rule, adopting a global management unit in a central node to perform power adjustment, namely initializing node power of all nodes in a full duplex self-organizing network as。
And secondly, calling a channel module in the central node to calculate the signal-to-interference-and-noise ratio (Signal to Interference plus Noise Ratio, SINR) and the link rate between any two nodes in the network. At this time, all nodes in the network upload node position and node power information to the global management unit, the global management unit generates a node distribution diagram corresponding to the network, and the global management unit calculates the signal-to-interference-and-noise ratio and the link rate between any two nodes in the network through the channel module according to the collected node power and position information.
The calculation process of the signal-to-interference-and-noise ratio and the link rate between any two nodes comprises the following steps:
Firstly, assuming that large-scale fading and small-scale aging are mutually independent, calculating channel gain between any two nodes:
Wherein, Representing nodesSum nodeChannel gain between; represents the Rayleigh Li Cuila coefficient and obeys a complex Gaussian distribution with a mean value of 0 and a variance of 1, Obeying the exponential distribution; Representing nodes Sum nodeAn inter-distance; Representing nodes Sum nodeAnd the path loss between the two paths can be determined by selecting different path loss models according to actual situations, and the invention is not limited.
And then make any node have maximum transmission powerDefining nodesNode power level of (2). Assuming that there is one data streamData flowNode in (a)Directional nodeTransmitting data, node in full duplex sceneThe signal-to-interference-and-noise ratio of (a) is:
Wherein, Representing nodesSignal to interference plus noise ratio (s-n); Representing nodes Slave nodeThe received data is used to determine the data,Representing nodesNode power of (a); Representing gaussian white noise effects; the residual of the self-interference is represented, The attenuation factor is indicated as such,Representing nodesNode power of (a); representing mutual interference from the whole network; Representing a set of data flows present in the full network; Representing nodes Sum nodeChannel gain between.
Reams theIs thatThe denominators in the signal-to-interference-and-noise ratio calculation formula can be combined, and the node at the momentSum nodeThe inter-link rate can be expressed as:
Wherein, Representing nodesSum nodeThe inter-link rate is set to be,Representing nodesSum nodeA link between; representing the channel bandwidth.
Thirdly, a topology generation module in the central node is called to generate a network topology connection diagram based on a preset topology connection rule. In short, the global management unit judges whether the signal-to-interference-and-noise ratio between any two nodes is greater than or equal to a preset signal-to-interference-and-noise ratio threshold (minimum signal-to-interference-and-noise ratio value required for successfully receiving signals) according to the signal-to-interference-and-noise ratio between all any two nodes calculated by the channel module, if so, judges that the two nodes are topologically connected, otherwise, the two nodes are not connected, and then a network connection topological graph of the whole full duplex self-organizing network is obtained.
Fourth, the outage probability calculation module in the call center node calculates transmission outage probabilities between all the two nodes with the connection relationship based on the network topology connection graph. The specific calculation process is as follows:
Suppose a node Successful reception from a nodeThe data conditions of (2) are:
Wherein, Representing a preset signal-to-interference-and-noise ratio threshold (signal-to-interference-and-noise ratio value of a successfully received signal), the transmission interruption probability is:
Wherein, Indicating the probability of transmission interruption,Representing the signal-to-interference-and-noise ratio,Representing a preset signal-to-interference-and-noise ratio threshold,Representation ofLess thanIs a probability of (2).
When the route is selected, the selection basis of each hop node is to select the node with the smallest transmission interruption probability as the next hop node, and each node adopts the amplifying relay forwarding mode to transmit data, so that 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 formula of the specific transmission interruption probability is deduced as follows:
Suppose a node Successful reception from a nodeThe data conditions of (2) are:
unfolding it into two separate parts:
Wherein,
For variablesThe distribution function (Cumulative Distribution Function, CDF) and the probability distribution function (Probability Distribution Function, PDF) are derived as follows:
Order the ;Variable(s)The PDF function of (2) is;Is a variable with a degree of freedom of 2,The PDF function of (2) isDue toThenThe distribution function of (2) can be expressed as:
the probability distribution function of (2) can be expressed as:
in summary, the calculation of the transmission interruption probability is expressed as follows:
Wherein the derivation of the fourth-row to fifth-row equations is due to variables The channel coefficients in (a) are independent of each other, so there are:
Wherein, can be to And (3) unfolding:
thus:
Fifth, the global management unit calls the path selection module to select a route for each pair of source nodes and target nodes according to a first path selection rule based on the transmission interruption probability and the network topology connection diagram between all the two nodes with connection relations according to the result returned by the interruption probability calculation module.
Then, introduce distributed screening rules
The distributed screening rule is applied to a distributed control full-duplex self-organizing network, and in a distributed control scene, the full-duplex self-organizing network comprises a plurality of nodes which are randomly distributed in a plurality of areas, and each node is provided with a channel module, a path selection module and a power control module.
According to one embodiment of the invention, the distributed screening rule is that each node calculates the signal-to-interference-and-noise ratio between the node and other nodes, each node builds a network topology connection diagram according to a preset topology connection rule based on the signal-to-interference-and-noise ratio between all the nodes and other nodes, and the routing between each pair of source nodes and target nodes is determined according to a second path selection rule based on the network topology connection diagram.
According to one embodiment of the invention, the second path selection rule is that the source node selects a neighbor node with the maximum signal-to-interference-and-noise ratio as a next-hop node of the source node based on the network topology connection graph, and selects the neighbor node with the maximum signal-to-interference-and-noise ratio as the next-hop node of the next-hop node based on the next-hop node until the last-hop node is a target node.
For a better understanding of the distributed screening rules, how to obtain multiple routes in a distributed controlled full duplex ad hoc network according to the distributed screening rules is described below in connection with specific implementations.
First, before selecting multiple routes according to the distributed filtering rule, each node in the network performs power adjustment, that is, each node in the full duplex ad hoc network initializes its own node power to be。
Second, each node calculates the signal-to-interference-and-noise ratio and the link rate between other nodes according to the channel module of the node, wherein each node calculates the signal-to-interference-and-noise ratio between other nodes according to the received signal strength of other nodes as follows:
Wherein, Representing the effective signal power received by the node,Representing the early noise power of the signal,Representing interference noise power (including self-interference).
And calculates the link rate as follows:
Wherein, Representing nodesSum nodeInter link rate.
Thirdly, each node calculates the signal-to-interference-and-noise ratio with other nodes based on the signal intensity of other nodes received by the node, judges whether the signal-to-interference-and-noise ratio is larger than or equal to a preset signal-to-interference-and-noise ratio threshold, and connects all nodes meeting the conditions to obtain a network topology connection diagram.
Fourth, based on the network topology connection graph, each source node selects a neighbor node with the maximum signal-to-interference-and-noise ratio as a next-hop node of the source node based on the path selection module of the source node, and the next-hop node selects the neighbor node with the maximum signal-to-interference-and-noise ratio as the next-hop node of the next-hop node based on the path selection module of the source node until the last-hop node is a target node corresponding to the source node. If there are neighboring nodes with the same maximum signal-to-interference-and-noise ratio, a node with a previous node ID is selected, and the node ID is a number allocated to each node during initialization.
1.2 Step S12
In the step S12, the node power of each node in all routes is determined to obtain a power adjustment policy with the goal of minimizing the total transmission delay of all routes. The specific calculation process is as follows:
defining nodes in data transmission process Sum nodeThe transmission delay between them is expressed as follows:
Wherein, Representing nodesSum nodeThe transmission delay between the two is equal to the transmission delay,Indicating the packet length of the transmission.
For each data streamFrom multiple transmission linksComposition, all node sets in the data stream are represented asBased on this, the end-to-end transmission delay under the full duplex ad hoc network can be expressed as:
The total delay of end-to-end transmission in the full duplex self-organizing network is:
Wherein, Representing the total delay of transmission.
And constructing an optimization target by using the transmission total delay expression, and further determining a power adjustment strategy. The full duplex self-organizing network with centralized control acquires a plurality of routes obtained by the path selection module by a global management unit, and invokes the power control module to optimize the node power of nodes in all routes, so as to minimize the total transmission delay, wherein the specific optimization objective can be expressed as:
expanding the optimization target:
Order the ,Wherein, the method comprises the steps of, wherein,Is a concave function of the shape of the concave,Is a convex function, then there are:
the final optimization objective can be expressed as:
the optimization target can be solved by adopting a logarithmic obstacle interior point method function.
The distributed control full duplex self-organizing network optimizes the node power thereof based on the power control module thereof, so as to minimize the total transmission time delay, and the specific calculation principle is consistent with the calculation process of the full duplex self-organizing network under the centralized control, and the difference is that the optimization target expansion is different, and the expansion is expressed as follows:
2. step S2
In the step S2, the node power of each node in the plurality of routes is adjusted based on the target power adjustment policy. Specifically, the full duplex self-organizing network in the centralized scene adjusts the node power of each node of the plurality of 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 scene adjusts its own node power based on the target power adjustment policy.
In order to better understand the distinction between the prior art and the present invention, the present invention sets up simulation experiments to evaluate the differences between the prior art and the present invention.
Wherein, the simulation experiment is simulated by MATLAB, and specific simulation parameters are shown in Table 1.
TABLE 1
Simulation experiments were performed with the simulation parameters set in table 1 (the routes were selected in the simulation experiments with the centralized screening rules described in the previous embodiments) to obtain the experimental results as shown in fig. 2-4.
Fig. 2 shows the case where the total transmission delay varies with the number of nodes. As can be seen from fig. 2, as the number of nodes increases, the size of the full duplex ad hoc network increases, the mutual interference in the network increases, and the total transmission delay tends to increase.
Fig. 3 shows the variation of the total transmission delay with the number of data streams. As can be seen from fig. 3, as the number of data streams transmitted in the network increases, the interference between the data streams increases, and the total transmission delay in the case of the same data stream in the prior art is greater than the total transmission delay in the present invention because the prior art does not consider the mutual interference between the data streams.
Fig. 4 shows the total transmission delay as a function of the self-interference cancellation coefficient. As can be seen from fig. 4, as the self-interference cancellation coefficient increases, the total transmission delay increases, and when the self-interference cancellation coefficient is greater than-70 db, a plurality of effective routes cannot be found due to severe self-interference, and at the same time, when the self-interference coefficient is less than-80 db, the performance of the full-duplex self-organizing network is better than that of the half-duplex self-organizing network.
The method has the advantages that (1) the total transmission delay is minimized, the node power of each node is regulated, the transmission delay is reduced while the mutual interference between the nodes and between data streams is relieved, and (2) the node with the smallest transmission interruption probability is selected as the next hop by calculating the transmission interruption probability, so that the delay caused by the path interruption in the data transmission process is reduced, and the reliability of the data transmission is ensured.
It should be noted that, although the steps are described above in a specific order, it is not meant to necessarily be performed in the specific order, and in fact, some of the steps may be performed concurrently or even in a changed order, as long as the required functions are achieved.
The present invention may be a system, method, and/or computer program product. The computer program product may include a computer readable storage medium having computer readable program instructions embodied thereon for causing a processor to implement aspects of the present invention.
The computer readable storage medium may be a tangible device that retains and stores instructions for use by an instruction execution device. The computer readable storage medium may include, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium include 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 Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical encoding device, punch cards or intra-groove protrusion structures such as those having instructions stored thereon, and any suitable combination of the foregoing.
The foregoing description of embodiments of the invention has been presented for purposes of illustration and description, and is not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the various embodiments described. The terminology used herein was chosen in order to best explain the principles of the embodiments, the practical application, or the technical improvements in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (10)
1. A method of routing a full duplex ad hoc network comprising a plurality of nodes, the method comprising:
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 nodes and target nodes according to a preset screening rule based on data transmission requirements between the pairs of source nodes and target nodes;
Step S12, aiming at 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 step S2, adjusting the node power of each node in the plurality of routes based on the target power adjustment strategy.
2. The method of claim 1, wherein the preset screening rules include a centralized screening rule and a distributed screening rule, wherein:
The centralized control full duplex self-organizing network adopts a centralized screening rule, wherein the centralized control means that the full duplex self-organizing network is configured to centrally manage all nodes in the network through one central node;
The distributed control full duplex ad hoc network employs a distributed screening rule, wherein the distributed control means that the full duplex ad hoc network is configured to be autonomously managed by individual nodes in the network.
3. The method of claim 2, wherein the centralized screening rule is:
calculating the signal-to-interference-and-noise ratio between all arbitrary two nodes in the full duplex self-organizing network;
constructing a network topology connection diagram according to a preset topology connection rule based on the signal-to-interference-and-noise ratio between any two nodes;
calculating the transmission interruption probability between all the two nodes with the connection relationship based on the network topology connection diagram;
and selecting a route for each pair of source nodes and target nodes according to a first path selection rule based on the transmission interruption probability and the network topology connection diagram between all the two nodes with the connection relationship.
4. A method according to claim 3, wherein the predetermined topology connection rule is:
And judging whether the signal-to-interference-and-noise ratio between any two nodes is greater than or equal to a preset signal-to-interference-and-noise ratio threshold value, and connecting all nodes meeting the conditions to obtain a network topology connection diagram.
5. The method of claim 4, wherein the transmission outage probability is calculated as follows:
Wherein, Indicating the probability of transmission interruption,Representing the signal-to-interference-and-noise ratio,Representing a preset signal-to-interference-and-noise ratio threshold,Representation ofLess thanIs a probability of (2).
6. The method of claim 5, wherein the first path selection rule is:
And selecting a neighbor node with the minimum outage probability for the source node as a next-hop node of the source node based on the transmission outage probability and the network topology connection diagram between all the two nodes with the connection relationship, and continuously selecting the neighbor node with the minimum outage probability for the next-hop node as the next-hop node of the next-hop node until the last-hop node is a target node.
7. The method of claim 4, wherein the distributed screening rules are:
each node calculates the signal-to-interference-and-noise ratio between itself and other nodes;
based on the signal-to-interference-and-noise ratio between all nodes and other nodes, each node constructs a network topology connection diagram according to a preset topology connection rule;
and determining the route between each pair of source nodes and the target node according to a second path selection rule based on the network topology connection graph.
8. The method of claim 7, wherein 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-plus-noise ratio as a next-hop node of the source node, and selects the neighbor node with the maximum signal-to-interference-plus-noise ratio as the next-hop node of the next-hop node based on the next-hop node until the last-hop node is a target node.
9. A computer readable storage medium, having stored thereon a computer program executable by a processor to perform the steps of the method of any of claims 1-8.
10. An electronic device, comprising:
One or more processors, and
A memory, wherein the memory is for storing executable instructions;
The one or more processors are configured to implement the steps of the method of any of claims 1-8 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411480356.XA CN119485570A (en) | 2024-10-23 | 2024-10-23 | A full-duplex self-organizing network routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202411480356.XA CN119485570A (en) | 2024-10-23 | 2024-10-23 | A full-duplex self-organizing network routing method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN119485570A true CN119485570A (en) | 2025-02-18 |
Family
ID=94570598
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202411480356.XA Pending CN119485570A (en) | 2024-10-23 | 2024-10-23 | A full-duplex self-organizing network routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN119485570A (en) |
-
2024
- 2024-10-23 CN CN202411480356.XA patent/CN119485570A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4113131B2 (en) | Route routing without collision between layers | |
| JP5015458B2 (en) | Fast / piggy distributed resource reallocation for established connections in multi-hop networks | |
| US9674073B2 (en) | Method and arrangement for route cost determination and selection with link cost interaction | |
| JP5176291B2 (en) | Communication system, communication method, base station, destination device, and intermediate device | |
| Yin et al. | Routing and resource allocation for IAB multi-hop network in 5G advanced | |
| Cui et al. | Scalable deep reinforcement learning for routing and spectrum access in physical layer | |
| JP2024501587A (en) | Methods, devices and systems for configuring communication links used for exchanging data regarding cooperative control algorithms | |
| CN111132259A (en) | Combined power optimization and routing method for physical layer security | |
| Anh et al. | A deep reinforcement learning approach for backscatter-assisted relay communications | |
| Ibrahim et al. | Performance analysis of minimum hop count-based routing techniques in millimeter wave networks: A stochastic geometry approach | |
| Mughal et al. | Allocation schemes for relay communications: A multiband multichannel approach using game theory | |
| Yao et al. | Multi-path routing based QoS-aware fairness backhaul-access scheduling in mmWave UDN | |
| CN116249176B (en) | Route establishment method, node and system of variable channel bandwidth wireless ad hoc network | |
| CN119485570A (en) | A full-duplex self-organizing network routing method | |
| Dab et al. | A novel joint routing and channel allocation approach in hybrid data center network | |
| Hu et al. | On the feasibility of high throughput mmWave backhaul networks in urban areas | |
| Singh et al. | A distributed algorithm for D2D communication in 5G using stochastic model | |
| Teja et al. | Duelling Q-learning based path selection for 5G D2D networks | |
| Tonguz et al. | Is the number of neighbors in ad hoc wireless networks a good indicator of connectivity? | |
| Sangeetha et al. | Physical layer link quality metrics-based stable routing for QoS enhancement in adhoc network | |
| Hwang et al. | The capacity of random wireless networks | |
| Sarı et al. | CentAir: Centrality based cross layer routing for software-defined aerial networks | |
| Chakraborty et al. | An intelligent routing for Internet of Things mesh networks | |
| Borgohain et al. | A coalition formation game for cooperative spectrum sensing in cognitive radio network under the constraint of overhead | |
| Zhao et al. | Agent transfer learning for cognitive resource management on multi-hop backhaul networks |
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 |