CN114866170B - Wireless network ad hoc network method and system - Google Patents
Wireless network ad hoc network method and system Download PDFInfo
- Publication number
- CN114866170B CN114866170B CN202210345630.7A CN202210345630A CN114866170B CN 114866170 B CN114866170 B CN 114866170B CN 202210345630 A CN202210345630 A CN 202210345630A CN 114866170 B CN114866170 B CN 114866170B
- Authority
- CN
- China
- Prior art keywords
- node
- nodes
- routing table
- parameters
- wireless network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/309—Measuring or estimating channel quality parameters
- H04B17/318—Received signal strength
-
- 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
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/08—Testing, supervising or monitoring using real traffic
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
-
- 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/12—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality
- H04W40/125—Communication route or path selection, e.g. power-based or shortest path routing based on transmission quality or channel quality using a measured number of retransmissions as a link metric
-
- 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
-
- 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)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- Electromagnetism (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a wireless network ad hoc network method and a wireless network ad hoc network system, wherein the method comprises the steps of obtaining coordinates and addresses of each node; broadcasting detection signals through each node to obtain signal intensity values between every two adjacent nodes, and judging connectivity between every two adjacent nodes based on the signal intensity values; calculating the distance between every two adjacent connected nodes based on the coordinates of each node; according to the distance between every two adjacent nodes which are communicated, calculating the optimal transmission paths from the central node to each node respectively, and generating a routing table based on the address and the optimal transmission paths; distributing communication channel parameters to other nodes through the central node according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes so as to generate an ad hoc network of the wireless network; if the existing node is an offline node, a new routing table is regenerated to generate an ad hoc network of the new wireless network. The invention can reduce the cost of the whole network and automatically repair the ad hoc network.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a wireless network ad hoc network method and system.
Background
In the related technical fields of environment monitoring and the like, a scene lacking a cellular network often exists, lora is used as a long-distance wireless communication technology, data transmission is realized through a central node by connecting ad hoc networks among nodes, and wide application is achieved. The conventional Lora network is a star network structure, i.e. one central node is connected to a plurality of nodes, each node is not connected to each other, and the coverage of this way is limited by the communication distance between the central node and the nodes.
In the prior art, some technical methods are to increase the number of central nodes to achieve the purpose of expanding the communication coverage, and some technical methods are to increase the number of relay nodes to forward data to achieve the purpose of expanding the communication coverage, and the technical methods need to increase hardware equipment, so that the cost of a network system is increased, meanwhile, in the networking process, manual intervention is needed to specify the connection path of the nodes, and once the nodes fail, the communication capability cannot be automatically restored.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a wireless network ad hoc network method and a wireless network ad hoc network system, which can reduce the cost of the whole network, automatically repair the ad hoc network and avoid the problem that communication cannot be automatically repaired when a node fails.
In order to achieve the above purpose, the technical scheme of the invention is realized as follows:
in a first aspect, an embodiment of the present invention provides a wireless network ad hoc network method, including the steps of:
acquiring coordinates and addresses of each node; broadcasting detection signals through each node to obtain signal intensity values between every two adjacent nodes, and judging connectivity between every two adjacent nodes based on the signal intensity values;
according to connectivity between every two adjacent nodes, calculating the distance between every two adjacent nodes based on the coordinates of each node;
according to the distance between every two adjacent nodes which are communicated, calculating the optimal transmission paths from the central node to each node respectively, and generating a routing table based on the address and the optimal transmission paths; wherein the optimal transmission path means that the distance between the center node and each node is shortest;
distributing communication channel parameters for other nodes through the central node according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes so as to generate an ad hoc network of the wireless network;
and detecting the communication state of each node through the central node, if the node is an offline node, regenerating a new routing table according to the distance between every two adjacent nodes communicated in the online nodes, distributing communication channel parameters for all online nodes according to the parameters in the new routing table, and sending the parameters in the routing table to all online nodes so as to generate the ad hoc network of the new wireless network.
Compared with the prior art, the first aspect of the invention has the following beneficial effects:
the method comprises the steps of obtaining coordinates and addresses of each node; broadcasting detection signals through each node to obtain signal intensity values between every two adjacent nodes, and judging connectivity between every two adjacent nodes based on the signal intensity values; according to connectivity between every two adjacent nodes, calculating the distance between every two adjacent nodes based on the coordinates of each node; according to the distance between every two adjacent nodes which are communicated, calculating the optimal transmission paths from the central node to each node respectively, and generating a routing table based on the address and the optimal transmission paths; wherein the optimal transmission path means that the distance between the center node and each node is shortest; distributing communication channel parameters to other nodes through the central node according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes so as to generate an ad hoc network of the wireless network; and detecting the communication state of each node through the central node, if the node is an offline node, regenerating a new routing table according to the distance between every two adjacent nodes communicated in the online nodes, distributing communication channel parameters for all online nodes according to the parameters in the new routing table, and sending the parameters in the routing table to all online nodes to generate the ad hoc network of the new wireless network.
Therefore, the method obtains two adjacent nodes which can be connected in a communication way by obtaining the signal intensity value between the adjacent nodes as the communication condition, can obtain the optimal transmission path from the central node to each node respectively according to the distance between every two adjacent nodes which are communicated and obtained by calculation, and generates a routing table based on the address and the optimal transmission path, wherein the routing table directly issues and controls through the central node without detecting and networking other nodes, so that the complexity of the ad hoc network is greatly reduced, and simultaneously, the channel parameters of wireless communication are automatically divided directly according to the parameters in the routing table, the communication interference is reduced, and the communication reliability of the whole system is enhanced; through the management of the central node, the mutual communication among other nodes can be effectively realized, each node can be used for relaying and forwarding data, the relay node is not required to be added for forwarding the data, and the cost of the whole system network is reduced; and detecting the communication condition among the rest nodes through the central node, and when an offline node is detected, re-acquiring parameters in a routing table to automatically repair the ad hoc network, thereby avoiding the problem that the communication cannot be automatically repaired when the node fails.
According to some embodiments of the invention, the determining connectivity between every two neighboring nodes based on the signal strength value includes:
comparing the signal strength value with a threshold value, and if the signal strength value is greater than or equal to the threshold value, enabling communication connection between the adjacent nodes; and if the signal strength value is smaller than the threshold value, the adjacent nodes are not connected in a communication way.
According to some embodiments of the invention, the calculating the optimal transmission path between the central node and each node according to the distance between every two adjacent nodes, includes:
calculating the distance between every two adjacent nodes communicated with each other, and obtaining the weight between the adjacent nodes;
acquiring adjacent nodes which can be connected in a communication way through the signal intensity value;
the optimal transmission path between the central node and each node is calculated by the following steps:
step S310, initializing a node set n= { a }, and calculating weights from all nodes not in the node set to a central node in the node set as follows:
wherein a represents a center node in the node set, a represents a source point in the initialization node set, v represents a node not in the node set, I (a, v) represents a weight from a node v not in the node set to the source point a, and D (v) represents a distance value from the source point a to a node v not in the node set;
step S320, comparing the distances between all the nodes v connected in direct communication and the source point a, obtaining the node w closest to the source point a, and adding the node w closest to the source point a into the node set N;
step S330, except for the node v closest to the source point a, adding a distance value D (w) from a node w not in a node set to the source point a and a weight I (w, v) from the node w to the node v to obtain an added value, comparing the D (v) with the added value to update the D (v) by the following formula, obtaining an updated D (v), and adding a node not in the node set corresponding to the updated D (v) to the node set N to obtain an updated node set N, where the formula is:
D(v)←Min[D(v),D(w)+I(w,v)]；
step S340, repeating the step S330 until all nodes are in the node set N.
According to some embodiments of the invention, the allocating, by the central node, communication channel parameters to the remaining nodes according to parameters in the routing table, and sending the parameters in the routing table to the remaining nodes, to generate an ad hoc network of the wireless network, includes:
the central node automatically allocates a communication channel for the primary node and issues parameters in the routing table according to the parameters in the routing table; if the primary node detects that the target addresses are consistent, directly feeding back to the central node, and recording parameters in the routing table and the communication channel; if the primary node detects that the target addresses are inconsistent, the primary node detects whether a routing table needs to be forwarded, if so, the primary node automatically allocates a communication channel to a secondary node, records parameters in the communication channel and the routing table, simultaneously issues parameters in the routing table to the secondary node, records the parameters in the routing table and the communication channel, and simultaneously feeds back the parameters in the routing table to the central node; if forwarding is not needed, directly discarding the node; and so on, the ad hoc network of the wireless network is generated.
According to some embodiments of the present invention, if the node is an offline node, a new routing table is regenerated according to a distance between every two connected neighboring nodes in the online nodes, and communication channel parameters are allocated to all online nodes according to the new routing table, and the parameters in the routing table are sent to all online nodes, so as to generate an ad hoc network of a new wireless network, including:
and a heartbeat mechanism is arranged on a communication link between each two nodes, the central node sends an instruction to enable each node to send a heartbeat message once every fixed time to detect the communication connection condition of the nodes, if the central node detects that an offline node exists, a new routing table is regenerated according to the distance between every two adjacent connected nodes in the online nodes, communication channel parameters are distributed to all online nodes according to the new routing table, and the parameters in the routing table are sent to all online nodes to generate the ad hoc network of the new wireless network.
According to some embodiments of the invention, the method further comprises the step of:
in the data communication process, detecting the link communication condition between each other node through a collision avoidance mechanism, if the link is busy and unavailable, randomly delaying and re-detecting the link communication condition until the link is available, if the link is available, detecting whether the link has a call signal by adopting periodic dormancy wakeup, if the link has the call signal, transmitting data, and if the link has no call signal, entering dormancy.
According to some embodiments of the invention, the method further comprises the step of:
and managing and controlling all the other nodes through the central node, acquiring data of the other nodes, transmitting the data to a server, receiving a control instruction of the server, and managing and calculating parameters in a routing table of all the other nodes.
According to some embodiments of the invention, the method further comprises the step of:
and managing the data of all the rest nodes and the central node through the parameters in the routing tables of all the rest nodes and the central node managed by the server.
In a second aspect, an embodiment of the present invention further provides a wireless network ad hoc network system, which is applied to the above-mentioned wireless network ad hoc network method, including:
the server is used for managing parameters in routing tables of all other nodes and the central node and managing data of all the other nodes and the central node;
the central node is used for managing and controlling all the other nodes, acquiring data of the other nodes, transmitting the data to the server, receiving a control instruction of the server, calculating and managing parameters in a routing table of all the nodes, distributing communication channel parameters for the other nodes according to the parameters in the routing table by the central node, and transmitting the parameters in the routing table to the other nodes so as to generate an ad hoc network of a wireless network;
the rest nodes are used for collecting sensor data, storing parameters in the routing table, the communication channel parameters and data transmission, and have a relay function, so that data forwarding among the nodes is realized according to the parameters in the routing table.
Compared with the prior art, the second aspect of the invention has the following beneficial effects:
the server of the system is used for managing parameters in routing tables of all other nodes and the central node and managing data of all other nodes and the central node; the central node is used for managing and controlling all other nodes, acquiring data of the other nodes and transmitting the data to the server, receiving a control instruction of the server, calculating and managing parameters in a routing table of all the nodes, distributing communication channel parameters for the other nodes according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes so as to generate an ad hoc network of the wireless network; the other nodes are used for collecting sensor data, storing parameters in the routing table, communication channel parameters and data transmission, and have a relay function, and data forwarding among the nodes is realized according to the parameters in the routing table.
Therefore, the system directly issues the control routing table through the central node, and other nodes are not required to detect and group networks, so that the complexity of the self-networking is greatly reduced, and meanwhile, the channel parameters of wireless communication are automatically divided directly according to the parameters in the routing table, so that the communication interference is reduced, and the communication reliability of the whole system is enhanced; and through the management of the central node, the mutual communication among other nodes can be effectively realized, each node can be used for relaying and forwarding data, the relay node is not required to be added for forwarding the data, and the cost of the whole system network is reduced.
According to some embodiments of the present invention, the central node is further configured to detect a communication status of each of the nodes, and if the node exists as an offline node, regenerate a new routing table according to a distance between every two connected neighboring nodes in the online nodes, allocate communication channel parameters to all online nodes according to parameters in the new routing table, and send the parameters in the routing table to all online nodes, so as to generate an ad hoc network of the new wireless network.
Drawings
The foregoing and/or additional aspects and advantages of the invention will become apparent and may be better understood from the following description of embodiments taken in conjunction with the accompanying drawings in which:
fig. 1 is a flowchart of a wireless network ad hoc network method according to an embodiment of the present invention;
fig. 2 is a block diagram of a wireless network ad hoc network according to an embodiment of the present invention;
FIG. 3 is a diagram of network weights according to one embodiment of the present invention;
FIG. 4 is a diagram of the calculation result of the optimal transmission path according to one embodiment of the present invention;
FIG. 5 is a parameter diagram of a routing table according to an embodiment of the present invention;
fig. 6 is a block diagram of a wireless network ad hoc network system according to an embodiment of the present invention;
fig. 7 is a schematic diagram of a wireless network ad hoc network system according to another embodiment of the present invention.
Detailed Description
The technical solutions of the embodiments of the present disclosure will be clearly and completely described below with reference to the accompanying drawings, and it is apparent that the described embodiments are only some embodiments of the present disclosure, but not all embodiments. All remaining embodiments, which may be made by one of ordinary skill in the art without undue burden based on the embodiments of the present disclosure, are intended to be within the scope of the present disclosure. It should be noted that, without conflict, the embodiments of the present disclosure and features of the embodiments may be combined with each other. In addition, the drawings are used for supplementing the description of the text part of the specification by using figures so that a person can intuitively and intuitively understand each technical feature and the whole technical scheme of the present disclosure, but cannot understand the limitation of the protection scope of the present disclosure.
In the description of the invention, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present invention, unless otherwise indicated, the meaning of "a plurality" is two or more.
In the description of the present invention, unless explicitly defined otherwise, terms such as arrangement, installation, connection, etc. should be construed broadly and the specific meaning of the terms in the present invention can be reasonably determined by a person skilled in the art in combination with the specific contents of the technical scheme.
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 of the remaining embodiments, based on the embodiments of the invention, which a person of ordinary skill in the art would obtain without undue burden, are within the scope of the invention.
In the related technical fields of environment monitoring and the like, a scene lacking a cellular network often exists, lora is used as a long-distance wireless communication technology, data transmission is realized through a central node by connecting ad hoc networks among nodes, and wide application is achieved. The conventional Lora network is a star network structure, i.e. one central node is connected to a plurality of nodes, each node is not connected to each other, and the coverage of this way is limited by the communication distance between the central node and the nodes.
In the prior art, some technical methods are to increase the number of central nodes to achieve the purpose of expanding the communication coverage, and some technical methods are to increase the number of relay nodes to forward data to achieve the purpose of expanding the communication coverage, and the technical methods need to increase hardware equipment, so that the cost of a network system is increased, meanwhile, in the networking process, manual intervention is needed to specify the connection path of the nodes, and once the nodes fail, the communication capability cannot be automatically restored.
In order to solve the problems, the method obtains two adjacent nodes which can be connected in a communication way by obtaining the signal intensity value between the adjacent nodes as the communication condition, obtains the optimal transmission path from the central node to each node according to the distance between every two adjacent nodes which are communicated and obtained by calculation, generates a routing table based on the address and the optimal transmission path, directly transmits the routing table through the central node to be controlled, does not need other nodes to carry out detection networking, greatly reduces the complexity of the ad hoc network, simultaneously, automatically divides the channel parameters of wireless communication according to the parameters in the routing table, reduces communication interference and enhances the communication reliability of the whole system; and through the management of the central node, the mutual communication among other nodes can be effectively realized, the communication condition among each other node is detected through the central node, when the off-line node is detected, the parameters in the routing table are acquired again, the self-organizing network is automatically repaired, and the problem that the communication cannot be automatically repaired when the node fails is avoided.
Referring to fig. 1, an embodiment of the present invention provides a wireless network ad hoc network method, including the steps of:
step S100, acquiring coordinates and addresses of each node; and broadcasting a detection signal through each node to obtain a signal strength value between every two adjacent nodes, and judging the connectivity between every two adjacent nodes based on the signal strength value.
Specifically, the coordinates and the address of each node are obtained; broadcasting a detection signal through each node to obtain a signal intensity value between every two adjacent nodes, comparing the signal intensity value with a threshold value, and if the signal intensity value is greater than or equal to the threshold value, connecting the adjacent nodes in a communication way; if the signal strength value is less than the threshold, no communication connection is possible between the adjacent nodes. For example, referring to fig. 2, with a central node as a central connection point, all nodes are directly or indirectly connected to the central node through one or more paths. The threshold value in this embodiment may be set as needed.
Step 200, calculating the distance between every two adjacent nodes based on the coordinates of each node according to the connectivity between every two adjacent nodes.
Specifically, after the coordinates of each node are obtained in step S100, two neighboring nodes capable of being connected in communication calculate a distance value between the two neighboring nodes according to the coordinates of the two neighboring nodes.
Step S300, calculating optimal transmission paths from the central node to each node according to the distance between every two adjacent nodes which are communicated, and generating a routing table based on the address and the optimal transmission paths; wherein the optimal transmission path means that the distance between the center node and each node is the shortest.
Specifically, calculating the distance between every two adjacent nodes communicated with each other to obtain the weight between the adjacent nodes;
acquiring adjacent nodes which can be connected in a communication way through the signal intensity value;
the optimal transmission path between the central node and each node is calculated by the following steps:
step S310, initializing a node set n= { a }, and calculating weights from all nodes not in the node set to a central node in the node set as follows:
wherein a represents a central node in the node set, a central node a represents a source point in the initialized node set, v represents a node not in the node set, I (a, v) represents a weight from the node v not in the node set to the source point a, and D (v) represents a distance value from the source point a to the node v not in the node set;
step S320, comparing the distances between all the nodes v connected in direct communication and the source point a, obtaining the node w closest to the source point a, and adding the node w closest to the source point a into the node set N;
step S330, except for the node v closest to the source point a, adding the distance value D (w) from the node w which is not in the node set to the source point a and the weight value I (w, v) from the node w to the node v to obtain an added value, comparing D (v) with the added value to update D (v) through the following formula to obtain updated D (v), and adding the node which is not in the node set and corresponds to the updated D (v) into the node set N to obtain updated node set N, wherein the formula is as follows:
D(v)←Min[D(v),D(w)+I(w,v)]；
step S340, repeating step S330 until all nodes are in node set N.
For example, referring to fig. 3 and 4, in fig. 3, nodes 1 to 6 are provided, weights between adjacent nodes are marked on connection lines, node 1 is a central node, node set N is initialized, only node 1 in node set N has connectivity through judgment of signal strength, it is explained that node 1 and node 2, node 3 and node 4 can be in communication connection, then distance values D (2), D (3) and D (4) of node 1 to node 2, node 3 and node 4 are calculated respectively, and the others have no connectivity and fill out infinity, and are represented by a symbol ≡.
On the other nodes except node 1, a node w closest to node 1 is detected, w=4, because of the nodes D (2), D (3) and D (4), D (4) =1, the value of which is the smallest, and thus node 4 is added to node set N, and then calculation is required for all the other nodes not in node set N.
For node 2, the original D (V) =d (2) and the current D (W) +i (W, V) =d (4) +i (4, 2) =1+2=3, D (W) +i (W, V) =d (4) +i (4, 2) =1+2=3 > D (2) are compared. Therefore, the distance D (V) from node 2 to node 1 does not need to be updated, and the distance D (V) from node 2 to node 1 is also 2.
For node 3, the original D (V) =d (3) and the current D (W) +i (W, V) =d (4) +i (4, 3) =1+3=4, D (W) +i (W, V) =d (4) +i (4, 3) =1+3=4 < D (3), so that the distance D (V) between node 3 and node 1 is updated and the distance D (V) between node 3 and node 1 is reduced from 5 to 4. And the like, comparing D (V) values of the rest nodes which are not in the node set until all rest nodes are calculated, and adding the D (V) value with the minimum value into the node set.
The above process is repeated until all the remaining nodes are in the node set.
Referring to fig. 5, the optimal transmission path between the center node 1 to all the remaining nodes is obtained in the above-described manner, and the routing table is obtained based on the optimal transmission path and the address of each node.
Step 400, distributing communication channel parameters to other nodes through the central node according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes to generate the ad hoc network of the wireless network.
Specifically, parameters in routing tables of all the other nodes and the central node are managed through the server, and data of all the other nodes and the central node are managed.
And managing and controlling all the other nodes through the central node, acquiring data of the other nodes, transmitting the data to the server, receiving a control instruction of the server, managing and calculating parameters in routing tables of all the other nodes, and storing the routing tables of each other node.
The process of generating the ad hoc network of the wireless network is as follows: the central node automatically allocates a communication channel for the primary node and issues parameters in the routing table according to the parameters in the routing table; if the primary node detects that the target addresses are consistent, directly feeding back to the central node, and recording parameters and communication channels in the routing table; if the primary node detects that the target addresses are inconsistent, the primary node detects whether the routing table needs to be forwarded, if so, the primary node automatically allocates a communication channel to the secondary node, records parameters in the communication channel and the routing table, simultaneously transmits the parameters in the routing table to the secondary node, records the parameters in the routing table and the communication channel, and simultaneously feeds back the parameters in the routing table to the central node; if forwarding is not needed, directly discarding the node; similarly, an ad hoc network of the wireless network is generated.
In the embodiment, the routing table is directly controlled by the central node, and other nodes are not required to detect and group networks, so that the complexity of the ad hoc network is greatly reduced, and meanwhile, the channel parameters of wireless communication are automatically divided directly according to the parameters in the routing table, so that the communication interference is reduced, and the communication reliability of the whole system is enhanced; through the management of the central node, the mutual communication among other nodes can be effectively realized; the nodes of the ad hoc network of the wireless network can effectively realize mutual communication among the nodes through the management of the central node, each node can transmit data on the network and can be used for relaying and forwarding the data, the relay node is not required to be added for forwarding the data, the cost of the whole system network is reduced, and the nodes are managed by the server and the central node at the same time, so that the stability of the system can be effectively ensured.
And S500, detecting the communication state of each node through the central node, if the node is an offline node, regenerating a new routing table according to the distance between every two adjacent nodes communicated in the online nodes, distributing communication channel parameters for all online nodes according to the parameters in the new routing table, and sending the parameters in the routing table to all online nodes to generate the ad hoc network of the new wireless network.
Specifically, a heartbeat mechanism is arranged on a communication link between each two nodes, a central node sends an instruction to enable each node to send a heartbeat message to detect the communication connection condition of the nodes once every fixed time, if the central node detects that an offline node exists, a new routing table is regenerated according to the distance between every two adjacent nodes communicated in the online nodes, communication channel parameters are distributed to all online nodes according to the new routing table, and parameters in the routing table are sent to all online nodes to generate an ad hoc network of a new wireless network.
In the data communication process, the link communication condition between each other node is detected through a collision avoidance mechanism, if the link is busy and unavailable, the link communication condition is randomly delayed and re-detected until the link is available, if the link is available, a periodic dormancy wakeup detection link is adopted to detect whether a call signal exists, if the call signal exists, data is transmitted, and if the call signal does not exist, dormancy is carried out.
In this embodiment, the central node detects the communication condition between each of the other nodes, and when the off-line node is detected, the parameters in the routing table are acquired again, the ad hoc network is automatically repaired, the problem that the communication cannot be automatically repaired when the node fails is avoided, whether the link has a call signal or not is detected by periodically dormancy and awakening, if the call signal exists, data is transmitted, and if the call signal does not exist, the network enters dormancy, so that the power consumption of the network is reduced.
Referring to fig. 6, the embodiment of the present invention further provides a wireless network ad hoc network system, which is applied to the wireless network ad hoc network method, including:
a server 100 for managing parameters in routing tables of all the remaining nodes and the center node, and managing data of all the remaining nodes and the center node;
the central node 200 is used for managing and controlling all other nodes, acquiring data of the other nodes, transmitting the data to the server, receiving control instructions of the server, calculating and managing parameters in a routing table of all the nodes, distributing communication channel parameters for the other nodes according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes so as to generate an ad hoc network of the wireless network;
the other nodes 300 are used for collecting sensor data, storing parameters in the routing table, communication channel parameters and data transmission, and have a relay function, and data forwarding among the nodes is realized according to the parameters in the routing table.
In the embodiment of the invention, the central node is further used for detecting the communication state of each node, if the node is an offline node, a new routing table is regenerated according to the distance between every two adjacent nodes communicated in the online nodes, communication channel parameters are distributed to all online nodes according to the parameters in the new routing table, and the parameters in the routing table are sent to all online nodes so as to generate the ad hoc network of the new wireless network.
It should be noted that, referring to fig. 7, there may be one or more central nodes in the system, the lower nodes of the central nodes may include one or more levels of nodes according to the routing information, and the sensor data may be accessed to different kinds of sensors, such as an inclination sensor, an acceleration sensor, a rainfall sensor, and water content, according to the actual application.
In the embodiment, the central node issues the control routing table, and other nodes are not required to detect and group networks, so that the complexity of the ad hoc network is greatly reduced, and meanwhile, the channel parameters of wireless communication are automatically divided directly according to the parameters in the routing table, so that the communication interference is reduced, and the communication reliability of the whole system is enhanced; and through the management of the central node, the mutual communication among other nodes can be effectively realized, each node can be used for relaying and forwarding data, the relay node is not required to be added for forwarding the data, and the cost of the whole system network is reduced.
In the description of the present specification, reference to the terms "one embodiment," "some embodiments," "illustrative embodiments," "examples," "specific examples," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, schematic representations of the above terms do not necessarily refer to the same embodiments or examples. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
While the preferred embodiment of the present invention has been described in detail, the present invention is not limited to the above embodiments, and those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit and scope of the present invention, and these equivalent modifications or substitutions are included in the scope of the present invention as defined in the appended claims.
Claims (9)
1. A wireless network ad hoc network method, comprising the steps of:
acquiring coordinates and addresses of each node; broadcasting detection signals through each node to obtain signal intensity values between every two adjacent nodes, and judging connectivity between every two adjacent nodes based on the signal intensity values;
according to connectivity between every two adjacent nodes, calculating the distance between every two adjacent nodes based on the coordinates of each node;
according to the distance between every two adjacent nodes which are communicated, calculating the optimal transmission paths from the central node to each node respectively, and generating a routing table based on the address and the optimal transmission paths; wherein the optimal transmission path means that the distance between the center node and each node is shortest;
distributing communication channel parameters for other nodes through the central node according to the parameters in the routing table, and sending the parameters in the routing table to the other nodes so as to generate an ad hoc network of the wireless network; the central node automatically allocates a communication channel for the primary node and issues parameters in the routing table according to the parameters in the routing table; if the primary node detects that the target addresses are consistent, directly feeding back to the central node, and recording parameters in the routing table and the communication channel; if the primary node detects that the target addresses are inconsistent, the primary node detects whether a routing table needs to be forwarded, if so, the primary node automatically allocates a communication channel to a secondary node, records parameters in the communication channel and the routing table, simultaneously issues parameters in the routing table to the secondary node, records the parameters in the routing table and the communication channel, and simultaneously feeds back the parameters in the routing table to the central node; if forwarding is not needed, directly discarding the node; similarly, generating the ad hoc network of the wireless network;
and detecting the communication state of each node through the central node, if the node is an offline node, regenerating a new routing table according to the distance between every two adjacent nodes communicated in the online nodes, distributing communication channel parameters for all online nodes according to the parameters in the new routing table, and sending the parameters in the routing table to all online nodes so as to generate the ad hoc network of the new wireless network.
2. The wireless network ad hoc network method according to claim 1, wherein said determining connectivity between each two neighboring nodes based on said signal strength values comprises:
comparing the signal strength value with a threshold value, and if the signal strength value is greater than or equal to the threshold value, enabling communication connection between the adjacent nodes; and if the signal strength value is smaller than the threshold value, the adjacent nodes are not connected in a communication way.
3. The wireless network ad hoc network method according to claim 2, wherein said calculating the optimal transmission path between the central node and each node according to the distance between every two adjacent nodes, respectively, comprises:
calculating the distance between every two adjacent nodes communicated with each other, and obtaining the weight between the adjacent nodes;
acquiring adjacent nodes which can be connected in a communication way through the signal intensity value;
the optimal transmission path between the central node and each node is calculated by the following steps:
step S310, initializing a node set n= { a }, and calculating weights from all nodes not in the node set to a central node in the node set as follows:
wherein a represents a center node in the node set, a represents a source point in the initialization node set, v represents a node not in the node set, I (a, v) represents a weight from a node v not in the node set to the source point a, and D (v) represents a distance value from the source point a to a node v not in the node set;
step S320, comparing the distances between all the nodes v connected in direct communication and the source point a, obtaining the node w closest to the source point a, and adding the node w closest to the source point a into the node set N;
step S330, except for the node v closest to the source point a, adding a distance value D (w) from a node w not in a node set to the source point a and a weight I (w, v) from the node w to the node v to obtain an added value, comparing the D (v) with the added value to update the D (v) by the following formula, obtaining an updated D (v), and adding a node not in the node set corresponding to the updated D (v) to the node set N to obtain an updated node set N, where the formula is:
D(v)←Min[D(v),D(w)+I(w,v)]；
step S340, repeating the step S330 until all nodes are in the node set N.
4. The method according to claim 1, wherein if the node exists as an offline node, regenerating a new routing table according to a distance between every two connected neighboring nodes in the online nodes, allocating communication channel parameters to all online nodes according to the new routing table, and transmitting the parameters in the routing table to all online nodes, so as to generate an ad hoc network of a new wireless network, comprising:
and a heartbeat mechanism is arranged on a communication link between each two nodes, the central node sends an instruction to enable each node to send a heartbeat message once every fixed time to detect the communication connection condition of the nodes, if the central node detects that an offline node exists, a new routing table is regenerated according to the distance between every two adjacent connected nodes in the online nodes, communication channel parameters are distributed to all online nodes according to the new routing table, and the parameters in the routing table are sent to all online nodes to generate the ad hoc network of the new wireless network.
5. The wireless network ad hoc network method of claim 4, further comprising the steps of:
in the data communication process, detecting the link communication condition between each other node through a collision avoidance mechanism, if the link is busy and unavailable, randomly delaying and re-detecting the link communication condition until the link is available, if the link is available, detecting whether the link has a call signal by adopting periodic dormancy wakeup, if the link has the call signal, transmitting data, and if the link has no call signal, entering dormancy.
6. The wireless network ad hoc network method of claim 5, further comprising the steps of:
and managing and controlling all the other nodes through the central node, acquiring data of the other nodes, transmitting the data to a server, receiving a control instruction of the server, and managing and calculating parameters in a routing table of all the other nodes.
7. The wireless network ad hoc network method of claim 6, further comprising the steps of:
and managing the data of all the rest nodes and the central node through the parameters in the routing tables of all the rest nodes and the central node managed by the server.
8. A wireless network ad hoc network system, applied to the wireless network ad hoc network method of any one of claims 1 to 7, comprising:
the server is used for managing parameters in routing tables of all other nodes and the central node and managing data of all the other nodes and the central node;
the central node is used for managing and controlling all the other nodes, acquiring data of the other nodes, transmitting the data to the server, receiving a control instruction of the server, calculating and managing parameters in a routing table of all the nodes, distributing communication channel parameters for the other nodes according to the parameters in the routing table by the central node, and transmitting the parameters in the routing table to the other nodes so as to generate an ad hoc network of a wireless network; the central node automatically allocates a communication channel for the primary node and issues parameters in the routing table according to the parameters in the routing table; if the primary node detects that the target addresses are consistent, directly feeding back to the central node, and recording parameters in the routing table and the communication channel; if the primary node detects that the target addresses are inconsistent, the primary node detects whether a routing table needs to be forwarded, if so, the primary node automatically allocates a communication channel to a secondary node, records parameters in the communication channel and the routing table, simultaneously issues parameters in the routing table to the secondary node, records the parameters in the routing table and the communication channel, and simultaneously feeds back the parameters in the routing table to the central node; if forwarding is not needed, directly discarding the node; similarly, generating the ad hoc network of the wireless network;
the rest nodes are used for collecting sensor data, storing parameters in the routing table, the communication channel parameters and data transmission, and have a relay function, so that data forwarding among the nodes is realized according to the parameters in the routing table.
9. The wireless network ad hoc network system according to claim 8, wherein said central node is further configured to detect a communication status of each of said nodes, and if there is an offline node, regenerate a new routing table according to a distance between each two connected neighboring nodes among the online nodes, allocate communication channel parameters to all online nodes according to parameters in the new routing table, and send the parameters in the routing table to all online nodes, so as to generate an ad hoc network of the new wireless network.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210345630.7A CN114866170B (en) | 2022-04-02 | 2022-04-02 | Wireless network ad hoc network method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210345630.7A CN114866170B (en) | 2022-04-02 | 2022-04-02 | Wireless network ad hoc network method and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114866170A CN114866170A (en) | 2022-08-05 |
| CN114866170B true CN114866170B (en) | 2023-09-15 |
Family
ID=82629968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210345630.7A Active CN114866170B (en) | 2022-04-02 | 2022-04-02 | Wireless network ad hoc network method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114866170B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769897A (en) * | 2018-05-14 | 2018-11-06 | 北京蓝涟科技有限责任公司 | It is a kind of based on distance weighted routing algorithm and its node-routing function module |
| CN109511091A (en) * | 2018-11-26 | 2019-03-22 | 广州鲁邦通物联网科技有限公司 | A kind of BLE MESH network routing algorithm based on location information |
| CN109874162A (en) * | 2019-03-21 | 2019-06-11 | 东南大学 | The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network |
| CN110809305A (en) * | 2019-11-11 | 2020-02-18 | 天津津航计算技术研究所 | Multi-node low-overhead wireless routing method |
| CN211236269U (en) * | 2019-11-06 | 2020-08-11 | 吉林大学 | Seismic data transmission system based on UWB multi-hop network architecture |
| KR20210067452A (en) * | 2019-11-29 | 2021-06-08 | 주식회사 보아스에스이 | METHOD OF DETERMINING NODE NICATION PATH WITHIN IoT WIRELESS NETWORK |
| CN112995043A (en) * | 2019-12-17 | 2021-06-18 | 阿里巴巴集团控股有限公司 | Information processing method and device in wireless mesh network and electronic equipment |
| CN114143248A (en) * | 2021-12-09 | 2022-03-04 | 国网重庆市电力公司营销服务中心 | Heterogeneous communication method, device, computer and readable medium based on dual-mode communication |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102026329B (en) * | 2009-09-10 | 2013-10-30 | 富士通株式会社 | Wireless communication network and self-adaptive route selecting communication method thereof |
| EP2584372B1 (en) * | 2011-10-17 | 2016-05-18 | Commissariat à l'Énergie Atomique et aux Énergies Alternatives | RSS based positioning method with limited sensitivity receiver |
-
2022
- 2022-04-02 CN CN202210345630.7A patent/CN114866170B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108769897A (en) * | 2018-05-14 | 2018-11-06 | 北京蓝涟科技有限责任公司 | It is a kind of based on distance weighted routing algorithm and its node-routing function module |
| CN109511091A (en) * | 2018-11-26 | 2019-03-22 | 广州鲁邦通物联网科技有限公司 | A kind of BLE MESH network routing algorithm based on location information |
| CN109874162A (en) * | 2019-03-21 | 2019-06-11 | 东南大学 | The hybrid Design of Routing Protocol optimization method of high-altitude high-speed mobile node ad hoc network |
| CN211236269U (en) * | 2019-11-06 | 2020-08-11 | 吉林大学 | Seismic data transmission system based on UWB multi-hop network architecture |
| CN110809305A (en) * | 2019-11-11 | 2020-02-18 | 天津津航计算技术研究所 | Multi-node low-overhead wireless routing method |
| KR20210067452A (en) * | 2019-11-29 | 2021-06-08 | 주식회사 보아스에스이 | METHOD OF DETERMINING NODE NICATION PATH WITHIN IoT WIRELESS NETWORK |
| CN112995043A (en) * | 2019-12-17 | 2021-06-18 | 阿里巴巴集团控股有限公司 | Information processing method and device in wireless mesh network and electronic equipment |
| CN114143248A (en) * | 2021-12-09 | 2022-03-04 | 国网重庆市电力公司营销服务中心 | Heterogeneous communication method, device, computer and readable medium based on dual-mode communication |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114866170A (en) | 2022-08-05 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109673035B (en) | Route establishing and maintaining method suitable for wireless self-organizing network | |
| US10708787B2 (en) | Mesh islands | |
| US7031321B2 (en) | Dynamic network and routing method for a dynamic network | |
| US10462844B2 (en) | Dynamic packet relay apparatus and method for sensor network | |
| US11533689B2 (en) | System and method for controlling dynamic transmit power in a mesh network | |
| US20060221927A1 (en) | Wireless communication apparatus and wireless communication system | |
| CN108770036B (en) | Inter-cluster-head communication method and wireless sensor network routing device | |
| CN108737142B (en) | Method for adjusting node detection parameters, node and mesh network | |
| EP3229528B1 (en) | Method, device and system for establishing on-demand route | |
| CN111148176B (en) | Routing method and device for wireless ad hoc network | |
| CN112040528B (en) | Method for selecting control node of wireless ad hoc network center | |
| CN110809305B (en) | Multi-node low-overhead wireless routing method | |
| US10536864B2 (en) | Method for managing a neighbor table and communication apparatus adapted for managing a neighbor table | |
| CN110831006A (en) | Ad hoc network system and data transmission method thereof | |
| CN107995668A (en) | A kind of optimization network-building method of wireless ad hoc network | |
| CN112261665B (en) | Networking method of self-organizing network | |
| CN114866170B (en) | Wireless network ad hoc network method and system | |
| CN116614856A (en) | Narrow-band wireless channel dynamic networking method suitable for complex environment | |
| CN116319530A (en) | Method, device, system and storage medium for message multipath routing | |
| US11457506B2 (en) | Adaptive multipath routing failure recovery in a wireless network | |
| KR101039815B1 (en) | Method for sharing a Time schedule information of Node | |
| CN113169938A (en) | Method for multi-channel discovery with partially disjoint paths | |
| Finke | SEREMA: Self-organized routing in heterogeneous mobile ad hoc networks | |
| CN112188559B (en) | Cross-layer load balancing method and device for self-organizing network of unmanned system | |
| KR100926333B1 (en) | A method for self routing of upsteam and downstream using beacon |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |