CN117412408A - Optimized networking method of wireless ad hoc network - Google Patents
Optimized networking method of wireless ad hoc network Download PDFInfo
- Publication number
- CN117412408A CN117412408A CN202311564424.6A CN202311564424A CN117412408A CN 117412408 A CN117412408 A CN 117412408A CN 202311564424 A CN202311564424 A CN 202311564424A CN 117412408 A CN117412408 A CN 117412408A
- Authority
- CN
- China
- Prior art keywords
- node
- interference
- nodes
- network
- preset
- 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 44
- 230000006855 networking Effects 0.000 title claims abstract description 27
- 238000005457 optimization Methods 0.000 claims abstract description 15
- 238000012216 screening Methods 0.000 claims abstract description 15
- 230000008569 process Effects 0.000 claims abstract description 12
- 238000005265 energy consumption Methods 0.000 claims description 33
- 230000004044 response Effects 0.000 claims description 13
- 230000005855 radiation Effects 0.000 claims description 9
- 238000013433 optimization analysis Methods 0.000 claims description 6
- 230000005856 abnormality Effects 0.000 claims description 4
- 230000005251 gamma ray Effects 0.000 claims description 3
- 230000008054 signal transmission Effects 0.000 abstract description 2
- 230000005540 biological transmission Effects 0.000 description 8
- 238000004891 communication Methods 0.000 description 3
- 230000002159 abnormal effect Effects 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000008520 organization Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Classifications
-
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/02—Arrangements for optimising operational condition
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/246—Connectivity information discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/248—Connectivity information update
-
- 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 relates to the field of wireless ad hoc networks, and particularly discloses an optimized networking method of a wireless ad hoc network, which comprises the following steps: firstly, introducing a multi-plane network structure according to a networking coverage area, dividing a plurality of areas according to the distribution of the multi-plane network structure, introducing area nodes, and constructing an initial network according to the characteristics of the area nodes; then, by carrying out interference analysis on a plurality of nodes in the area of the initial network, judging whether interference is normal or not: if yes, executing a screening strategy, and turning to the next step; otherwise, node optimization is carried out, and the current steps are repeated; further, obtaining an optimal node number according to a screening strategy analysis result, and obtaining an optimal node path according to the position distribution of the optimal node number and the dynamic network topological structure characteristics; finally, updating the initial network according to the optimal node path to form an optimal network; the invention ensures the balanced transmission of signals in the dynamic networking process through the optimized networking process of the wireless ad hoc network, and improves the utilization rate of nodes and paths.
Description
Technical Field
The invention relates to the field of wireless ad hoc networks, in particular to an optimized networking method of a wireless ad hoc network.
Background
Wireless ad hoc networks (AAWG) refer to a network system in which a group of wireless devices forms an autonomous organization, autonomous control, and autonomous management by negotiating and dynamically adapting to a networking state. With the popularization of mobile equipment and the rapid development of the internet of things, equipment in a network can be added into or separated from the network autonomously, and the network can dynamically adjust a networking mode according to the conditions of a topological structure, signal strength, bandwidth and the like, so that the optimal network performance is realized.
However, in the practical application process, the number of nodes in the AAWG network is numerous, which may cause low communication efficiency and complex network topology; most of the existing AAWG networks carry out self-adaptive adjustment according to the nodes in actual use, so that the smoothness of a connection path is ensured, and repeated transmission of the same signal by different nodes is difficult to avoid; and because the unbalanced distribution connection of the paths and the nodes causes congestion of individual transmission paths, and other path signals are rare, the utilization rate of node transmission and path distribution is not high, and the problem of unbalanced transmission signals is caused.
Disclosure of Invention
The invention aims to provide an optimized networking method of a wireless ad hoc network, which solves the following technical problems:
and (3) ensuring balanced transmission of signals in the dynamic networking process of the wireless ad hoc network, and improving the utilization rate of nodes and paths.
The aim of the invention can be achieved by the following technical scheme:
an optimized networking method of a wireless ad hoc network, the method comprising:
s1, introducing a multi-plane network structure according to a networking coverage area, dividing a plurality of areas according to the multi-plane network structure distribution, introducing area nodes, and constructing an initial network according to the characteristics of the area nodes;
s2, judging whether interference is normal or not by carrying out interference analysis on a plurality of nodes in the area of the initial network:
if yes, executing a screening strategy, and turning to step S3;
otherwise, node optimization is carried out, and the step S2 is repeated;
s3, obtaining an optimal node number according to a screening strategy analysis result, and obtaining an optimal node path according to the position distribution of the optimal node number and the dynamic network topological structure characteristics;
s4, updating the initial network according to the optimal node path to form an optimal network.
Preferably, the interferometric analysis of the area node comprises:
setting a distance R as a radius by taking a central node of the region as a circle center, determining the area range of the node radiation circle according to the size of the distance R, and calculating the number N of interference nodes in the area range of the radiation circle;
comparing the number N of the interference nodes with the threshold value N of the number of the interference nodes:
if N is more than N, judging interference abnormality, and optimizing interference nodes;
if N is less than or equal to N, judging that the interference is normal, and determining the current area node as a source node and the interference node as a target node.
Preferably, the method for optimizing the interference node is as follows:
by the formulaAcquiring information coefficient Nod of jth response node j The method comprises the steps of carrying out a first treatment on the surface of the Wherein G is ij Accumulating relevance coefficients for information of jth response node corresponding to ith interference node, A Total (S) For the total amount of information acquired by the node, A i Information quantity obtained for the ith interference node, F i Response times for the information quantity of the ith interference node; to the information coefficient Nod j And a preset standard threshold value [ N ] a ，N b ]Comparing the sizes:
if the information coefficient Nod j ＞N b Judging that the information quantity of the interference node is too large, sending out early warning information, and adjusting the position of the interference node;
if the information coefficient Nod j ＜N a Judging that the information quantity of the interference node is too small, deleting the current interference node, and replacing a node path;
if the information coefficient Nod j ∈[N a ，N b ]And judging that the information quantity of the interference node is normal, and carrying out node path optimization analysis.
Preferably, the analysis process of node path optimization is:
acquiring the total number M of interference nodes, the connectivity parameter C of the interference nodes and the network flow number S of the interference nodes in real time for analysis;
and judging the optimal paths of the interference node and the source node according to the analysis result.
Preferably, the analytical process is:
by the formulaObtaining node signal coefficient P im The method comprises the steps of carrying out a first treatment on the surface of the Wherein k is [1, M ]]；C k Is the connectivity parameter of the kth interference node, S k The number of network flows for the kth interference node; gamma ray 1 、γ 2 Is a weight coefficient; c (C) 0 Connecting a degree parameter for a standard interference node; s is S 0 The number of network flows is the standard interference node; mu (mu) k And f is a preset function, wherein the f is the weight coefficient of the kth interference node.
Preferably, the node signal coefficient P im And a preset threshold P A 、P B And (3) performing comparison:
if P im ≥P B Judging that the interference node signal is stronger;
if P B ＞P im ＞P A Judging that the interference node signal is general;
if P im ≤P A And judging that the interference node signal is weak.
Preferably, the screening strategy is:
acquiring energy consumption data of a preset source node, and calculating average target node energy consumption according to the shortest linear distance between the source node and the target node;
acquiring target node distribution density within a source node preset area range according to average target node energy consumption;
acquiring the number of preset nodes according to the distribution density of the target nodes;
comparing and adjusting the number of preset nodes with the number of target nodes:
if the target nodes are larger than the number of the preset nodes, the target nodes are reduced to the number of the preset nodes;
if the target nodes are smaller than the preset node quantity, adding the target nodes to the preset node quantity.
Preferably, the method further comprises:
according to the energy consumption of the target node after adjustment, comparing the energy consumption with an average target node energy consumption preset threshold value:
if the energy consumption of the target node does not belong to the preset threshold value, the current node position is adjusted;
if the energy consumption of the target node belongs to the preset threshold value, continuing the current node arrangement.
The invention has the beneficial effects that: the method comprises the steps of carrying out interference analysis on a plurality of nodes in an area of an initial network, ensuring that the number of the nodes and node paths are optimally adjusted according to interference analysis results, specifically carrying out optimization analysis on nodes with abnormal interference analysis, ensuring that the adjustment on the number of the interference nodes is realized by analyzing the information quantity of the interference nodes; and on the other hand, the nodes with normal interference analysis are subjected to node number and path position change through a screening strategy, the optimal node number is obtained, and the optimal node path is obtained by carrying out self-adaptive position distribution and dynamic network topological structure characteristics according to the node number.
Of course, it is not necessary for any one product to practice the invention to achieve all of the advantages set forth above at the same time.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed for the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a step diagram of an optimized networking method of a wireless ad hoc network according to the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Referring to fig. 1, the present invention is a method for optimizing networking of a wireless ad hoc network, comprising:
s1, introducing a multi-plane network structure according to a networking coverage area, dividing a plurality of areas according to the multi-plane network structure distribution, introducing area nodes, and constructing an initial network according to the characteristics of the area nodes;
s2, judging whether interference is normal or not by carrying out interference analysis on a plurality of nodes in the area of the initial network:
if yes, executing a screening strategy, and turning to step S3;
otherwise, node optimization is carried out, and the step S2 is repeated;
s3, obtaining the optimal node number according to a screening strategy analysis result, and obtaining an optimal node path according to the self-adaptive position distribution of the optimal node number and the dynamic network topological structure characteristics;
s4, updating the initial network according to the optimal node path to form an optimal network.
Through the technical scheme, the invention realizes the self-adaptive adjustment of node optimization and path optimization by designing an optimization networking method of the wireless ad hoc network, and comprises the following specific steps:
firstly, introducing a multi-plane network structure according to a networking coverage area, wherein the multi-plane network structure is a self-adaptive topology structure of network planarization built according to the current network structure, and dividing a plurality of areas according to the known multi-plane network structure distribution, the area division in the embodiment is not limited to a division mode, the design is mainly divided according to network points and plane structure service areas, and the division mode of line segment boundaries of polygons or squares is referred to so as to facilitate node position arrangement; introducing area nodes according to boundary intersection points or center points of the division types, and constructing an initial network according to the characteristics of the area nodes, wherein the initial network is obtained by self-adaptive adjustment according to the existing network topology algorithm;
then, by carrying out interference analysis on a plurality of nodes in the area of the initial network, judging whether interference is normal or not:
if yes, executing a screening strategy, and turning to the next step;
otherwise, node optimization is carried out, the current steps are repeated until the interference state is normal, when the interference state is abnormal, the problems of node redundancy, node waste, uneven energy consumption of path transmission caused by uneven node distribution and the like are easy to exist, and the synchronous information adjustment and information transmission of the whole wireless autonomous network are further affected;
then, obtaining the optimal node number according to the screening strategy analysis result, and obtaining an optimal node path according to the optimal node number, the position distribution and the dynamic network topological structure characteristics of the optimal node number;
and finally, updating the initial network according to the optimal node path to form an optimal network.
As one embodiment of the present invention, the interferometric analysis of the area node includes:
setting a distance R as a radius by taking a central node of the region as a circle center, determining the area range of the node radiation circle according to the size of the distance R, and calculating the number N of interference nodes in the area range of the radiation circle;
comparing the number N of the interference nodes with the threshold value N of the number of the interference nodes:
if N is more than N, judging interference abnormality, and optimizing interference nodes;
if N is less than or equal to N, judging that the interference is normal, and determining the current area node as a source node and the interference node as a target node.
According to the technical scheme, the regional nodes are mostly distributed in the regional range, the regional center point is divided, the node close to the center point is set as the circle center, the distance R is set as the radius, the area covered by the circle is divided, the current distance R is a reasonable distance obtained according to the distribution length of the network nodes of the same type screened in the historical database, and the current distance R is a fitting data result obtained through historical experience; the area range of the radiation circle obtained after the radius R is determined can be obtained through image data display equipment, and the number of nodes in the radiation circle can be calculated and the position display can be obtained; defining nodes belonging to the radiation circle range as interference nodes; acquiring the number N of interference nodes; comparing the number N of the interference nodes with the number threshold value N of the interference nodes, analyzing if N is more than N, judging interference abnormality, and optimizing the interference nodes; if N is less than or equal to N, judging that the interference is normal, determining the current area node as a source node, and setting the interference node as a target node.
As one embodiment of the present invention, the method for interference node optimization is:
by the formulaAcquiring information coefficient Nod of jth response node j The method comprises the steps of carrying out a first treatment on the surface of the Wherein G is ij Accumulating relevance coefficients for information of jth response node corresponding to ith interference node, A Total (S) For the total amount of information acquired by the node, A i Information quantity obtained for the ith interference node, F i Response times for the information quantity of the ith interference node; to the information coefficient Nod j And a preset standard threshold value [ N ] a ，N b ]Comparing the sizes:
if the information coefficient Nod j ＞N b Judging that the information quantity of the interference node is too large, sending out early warning information, and adjusting the position of the interference node;
if the information coefficient Nod j ＜N a Judging that the information quantity of the interference node is too small, deleting the current interference node, and replacing a node path;
if the information coefficient Nod j ∈[N a ，N b ]And judging that the information quantity of the interference node is normal, and carrying out node path optimization analysis.
Through the technical scheme, after the number of the interference nodes exceeds a set value, the interference nodes are optimized, so that reasonable distribution and number setting of the nodes are ensured; in a specific embodiment, the formula is used toAcquiring information coefficient Nod of jth response node j The method comprises the steps of carrying out a first treatment on the surface of the Information is transmitted from one node to another node to respond to the information, and the node transmission condition is judged according to the information response; corresponding information and information quantity states are ensured by acquiring the information coefficient of each node; wherein G is ij Accumulating relevance coefficients for information of jth response node corresponding to ith interference node, A Total (S) For the total amount of information acquired by the node, A i Information quantity obtained for the ith interference node, F i The response times of the information quantity of the ith interference node.
By combining information coefficients Nod j And a preset standard threshold value [ N ] a ，N b ]Comparing and judging the information coefficient Nod j Judging whether the information coefficient Nod is within the standard threshold range j ＞N b Judging that the information quantity of the interference node is too large, sending out early warning information, and adjusting the position of the interference node; if the information coefficient Nod j ＜N a Judging that the information quantity of the interference node is too small, deleting the current interference node, and replacing the node path, wherein the node path is obtained according to the existing path allocation optimization algorithm in the ad hoc network, and is not described in detail in the prior art; if the information coefficient Nod j ∈[N a ，N b ]And judging that the information quantity of the interference node is normal, and carrying out node path optimization analysis.
As one embodiment of the present invention, the analysis process of node path optimization is:
acquiring the total number M of interference nodes, the connectivity parameter C of the interference nodes and the network flow number S of the interference nodes in real time for analysis;
and judging the optimal paths of the interference node and the source node according to the analysis result.
According to the technical scheme, the optimal path allocation scheme is ensured to be acquired by the node optimization analysis, and the communication capacity analysis among the nodes is considered in addition to the rationality of the number of the nodes in the node path allocation process, so that the communication optimization processing of the node connection paths is ensured, and the balance of the network topology structure is further ensured; specifically, factor information of path optimization of the associated nodes is obtained, wherein the factor information comprises the total number M of the interference nodes, the connectivity parameter C of the interference nodes and the network flow number S of the interference nodes in real time, and the factors are analyzed, and the analysis process comprises the steps of analyzing the influence of the factors on network signals; and then judging the optimal paths of the interference node and the source node according to the analysis result.
As an embodiment of the present invention, the analysis process is:
by the formulaObtaining node signal coefficient P im The method comprises the steps of carrying out a first treatment on the surface of the Wherein k is [1, M ]]；C k Is the connectivity parameter of the kth interference node, S k The number of network flows for the kth interference node; gamma ray 1 、γ 2 Is a weight coefficient; c (C) 0 Connecting a degree parameter for a standard interference node; s is S 0 The number of network flows is the standard interference node; mu (mu) k And f is a preset function, wherein the f is the weight coefficient of the kth interference node.
Through the technical scheme, the method and the device adopt the formula The node signal coefficient Pim is obtained, the node signal coefficient Pim can reflect the strength of the analyzed interference node signal, and then the node with weak signal is adjusted, so that the optimal path between the interference node and the source node is ensured to be adjusted, and stable transmission of the signal is realized.
As one embodiment of the present invention, the node signal coefficient P im And a preset threshold P A 、P B And (3) performing comparison:
if P im ≥P B Judging that the interference node signal is stronger;
if P B ＞P im ＞P A Judging that the interference node signal is general;
if P im ≤P A And judging that the interference node signal is weak.
Through the technical scheme, the node signal coefficient P is used for im And a preset threshold P A 、P B Comparing, judging if P im ≥P B Judging that the interference node signal is stronger; if P B ＞P im ＞P A Judging that the interference node signal is general; if P im ≤P A And judging that the interference node signal is weak.
As an embodiment of the present invention, the screening strategy is:
acquiring energy consumption data of a preset source node, and calculating average target node energy consumption according to the shortest linear distance between the source node and the target node;
acquiring target node distribution density within a source node preset area range according to average target node energy consumption;
acquiring the number of preset nodes according to the distribution density of the target nodes;
comparing and adjusting the number of preset nodes with the number of target nodes:
if the target nodes are larger than the number of the preset nodes, the target nodes are reduced to the number of the preset nodes;
if the target nodes are smaller than the preset node quantity, adding the target nodes to the preset node quantity.
According to the technical scheme, energy consumption data of a preset source node are obtained through a screening strategy, and average target node energy consumption is calculated according to the shortest linear distance between the source node and the target node; acquiring target node distribution density within a source node preset area range according to average target node energy consumption; acquiring the number of preset nodes according to the distribution density of the target nodes; comparing and adjusting the number of preset nodes with the number of target nodes: if the target nodes are larger than the number of the preset nodes, the target nodes are reduced to the number of the preset nodes; if the target nodes are smaller than the preset node quantity, adding the target nodes to the preset node quantity; and obtaining the optimal node quantity through adjusting the node quantity, and obtaining an optimal node path by carrying out self-adaptive position distribution and dynamic network topological structure characteristics according to the node quantity.
As an embodiment of the present invention, further comprising:
according to the energy consumption of the target node after adjustment, comparing the energy consumption with an average target node energy consumption preset threshold value:
if the energy consumption of the target node does not belong to the preset threshold value, the current node position is adjusted;
if the energy consumption of the target node belongs to the preset threshold value, continuing the current node arrangement.
Through the technical scheme, according to the energy consumption of the adjusted target node, the energy consumption is compared with the average target node energy consumption preset threshold value: if the energy consumption of the target node does not belong to the preset threshold value, the current node position is adjusted; if the energy consumption of the target node belongs to the preset threshold value, continuing the current node arrangement.
The foregoing is merely illustrative and explanatory of the principles of the invention, as various modifications and additions may be made to the specific embodiments described, or similar thereto, by those skilled in the art, without departing from the principles of the invention or beyond the scope of the appended claims.
Claims (8)
1. An optimized networking method for a wireless ad hoc network, the method comprising:
s1, introducing a multi-plane network structure according to a networking coverage area, dividing a plurality of areas according to the multi-plane network structure distribution, introducing area nodes, and constructing an initial network according to the characteristics of the area nodes;
s2, judging whether interference is normal or not by carrying out interference analysis on a plurality of nodes in the area of the initial network:
if yes, executing a screening strategy, and turning to step S3;
otherwise, node optimization is carried out, and the step S2 is repeated;
s3, obtaining an optimal node number according to a screening strategy analysis result, and obtaining an optimal node path according to the position distribution of the optimal node number and the dynamic network topological structure characteristics;
s4, updating the initial network according to the optimal node path to form an optimal network.
2. The method for optimizing networking of a wireless ad hoc network according to claim 1, wherein said interference analysis of area nodes comprises:
setting a distance R as a radius by taking a central node of the region as a circle center, determining the area range of the node radiation circle according to the size of the distance R, and calculating the number N of interference nodes in the area range of the radiation circle;
comparing the number N of the interference nodes with the threshold value N of the number of the interference nodes:
if N is more than N, judging interference abnormality, and optimizing interference nodes;
if N is less than or equal to N, judging that the interference is normal, and determining the current area node as a source node and the interference node as a target node.
3. The method for optimizing networking of a wireless ad hoc network according to claim 2, wherein the method for optimizing the interference node is as follows:
by the formulaAcquiring information coefficient Nod of jth response node j The method comprises the steps of carrying out a first treatment on the surface of the Wherein G is ij Accumulating relevance coefficients for information of jth response node corresponding to ith interference node, A Total (S) For the total amount of information acquired by the node, A i Information quantity obtained for the ith interference node, F i Response times for the information quantity of the ith interference node;
to the information coefficient Nod j And a preset standard threshold value [ N ] a ，N b ]Comparing the sizes:
if the information coefficient Nod j ＞N b Judging that the information quantity of the interference node is too large, sending out early warning information, and adjusting the position of the interference node;
if the information coefficient Nod j ＜N a Judging that the information quantity of the interference node is too small, deleting the current interference node, and replacing a node path;
if the information coefficient Nod j ∈[N a ，N b ]And judging that the information quantity of the interference node is normal, and carrying out node path optimization analysis.
4. The method for optimizing networking of a wireless ad hoc network according to claim 3, wherein the analysis process of node path optimization is as follows:
acquiring the total number M of interference nodes, the connectivity parameter C of the interference nodes and the network flow number S of the interference nodes in real time for analysis;
and judging the optimal paths of the interference node and the source node according to the analysis result.
5. The method for optimizing networking of a wireless ad hoc network according to claim 4, wherein said analyzing process is:
by the formulaObtaining node signal coefficient P im The method comprises the steps of carrying out a first treatment on the surface of the Wherein k is [1, M ]]；C k Is the connectivity parameter of the kth interference node, S k The number of network flows for the kth interference node; gamma ray 1 、γ 2 Is a weight coefficient; c (C) 0 Connecting a degree parameter for a standard interference node; s is S 0 The number of network flows is the standard interference node; mu (mu) k And f is a preset function, wherein the f is the weight coefficient of the kth interference node.
6. Root of Chinese characterThe method for optimizing networking of a wireless ad hoc network according to claim 5, wherein the node signal coefficient P im And a preset threshold P A 、P B And (3) performing comparison:
if P im ≥P B Judging that the interference node signal is stronger;
if P B ＞P im ＞P A Judging that the interference node signal is general;
if P im ≤P A And judging that the interference node signal is weak.
7. The method for optimizing networking of a wireless ad hoc network according to claim 1, wherein said screening strategy is:
acquiring energy consumption data of a preset source node, and calculating average target node energy consumption according to the shortest linear distance between the source node and the target node;
acquiring target node distribution density within a source node preset area range according to average target node energy consumption;
acquiring the number of preset nodes according to the distribution density of the target nodes;
comparing and adjusting the number of preset nodes with the number of target nodes:
if the target nodes are larger than the number of the preset nodes, the target nodes are reduced to the number of the preset nodes;
if the target nodes are smaller than the preset node quantity, adding the target nodes to the preset node quantity.
8. The method for optimizing networking of a wireless ad hoc network according to claim 7, further comprising:
according to the energy consumption of the target node after adjustment, comparing the energy consumption with an average target node energy consumption preset threshold value:
if the energy consumption of the target node does not belong to the preset threshold value, the current node position is adjusted;
if the energy consumption of the target node belongs to the preset threshold value, continuing the current node arrangement.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311564424.6A CN117412408A (en) | 2023-11-22 | 2023-11-22 | Optimized networking method of wireless ad hoc network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311564424.6A CN117412408A (en) | 2023-11-22 | 2023-11-22 | Optimized networking method of wireless ad hoc network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117412408A true CN117412408A (en) | 2024-01-16 |
Family
ID=89499924
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311564424.6A Pending CN117412408A (en) | 2023-11-22 | 2023-11-22 | Optimized networking method of wireless ad hoc network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117412408A (en) |
-
2023
- 2023-11-22 CN CN202311564424.6A patent/CN117412408A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111556461A (en) | Vehicle-mounted edge network task distribution and unloading method based on deep Q network | |
| CN107172166A (en) | The cloud and mist computing system serviced towards industrial intelligentization | |
| CN107484209B (en) | Network load balancing vertical switching method considering user QoS | |
| CN110233755B (en) | Computing resource and frequency spectrum resource allocation method for fog computing in Internet of things | |
| CN109151864A (en) | A kind of migration decision and resource optimal distribution method towards mobile edge calculations super-intensive network | |
| CN111988225A (en) | Multi-path routing method based on reinforcement learning and transfer learning | |
| CN104093183B (en) | A kind of wireless sensor network Uneven Cluster method based on optimal sub-clustering number | |
| CN102612080B (en) | Minimum-energy-consumption self-adaption convergent routing method on basis of second-generation wavelet zero tree encoding | |
| CN110519849B (en) | Communication and computing resource joint allocation method for mobile edge computing | |
| JP7486659B2 (en) | Energy saving processing method and processing device for base station | |
| CN104022951B (en) | A kind of method for building up and system in network service path | |
| CN107889195A (en) | A kind of self study heterogeneous wireless network access selection method of differentiated service | |
| CN107509165A (en) | A kind of method for being calculated based on big data, determining AP positions | |
| CN108923979A (en) | Software defined network mapping method of virtual network | |
| CN109688540A (en) | Ad Hoc network physical topology non-cooperative inference system | |
| CN110996365B (en) | Heterogeneous network vertical switching algorithm and system based on multi-objective optimization model | |
| CN111510319B (en) | Network slice resource management method based on state perception | |
| CN116050540A (en) | Self-adaptive federal edge learning method based on joint bi-dimensional user scheduling | |
| CN113676357B (en) | Decision method for edge data processing in power internet of things and application thereof | |
| CN106714189A (en) | Method and device for analyzing cell over coverage | |
| CN108616893A (en) | A kind of topology control method of high energy efficiency | |
| CN110461006A (en) | Reduce WLAN interference method, device and terminal device | |
| CN109560972A (en) | Non-cooperative inference method for Ad Hoc network physical topology | |
| CN116166444B (en) | Collaborative reasoning method oriented to deep learning hierarchical model | |
| CN117412408A (en) | Optimized networking method of wireless ad hoc network |
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 |