CN106888493B - Routing method and device of wireless MESH MESH network - Google Patents
Routing method and device of wireless MESH MESH network Download PDFInfo
- Publication number
- CN106888493B CN106888493B CN201710075618.8A CN201710075618A CN106888493B CN 106888493 B CN106888493 B CN 106888493B CN 201710075618 A CN201710075618 A CN 201710075618A CN 106888493 B CN106888493 B CN 106888493B
- Authority
- CN
- China
- Prior art keywords
- routing information
- destination node
- node
- stored
- message
- 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
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- 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/34—Modification of an existing route
-
- 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
Abstract
The invention discloses a routing method and a device of a wireless mesh network.A current node receives a message of a destination node; the current node generates destination node routing information and a serial number of the destination node routing information according to the message of the destination node; when the current node judges that the sequence of the generated destination node routing information minus the sequence number of the destination node routing information stored by the current node is equal to 1, adopting the corresponding routing information with smaller metric value in the generated destination node routing information and the stored destination node routing information as the routing information to the destination node; and when the current node judges that the sequence number of the generated destination node routing information minus the sequence number of the destination node routing information stored by the current node is more than or equal to 2, replacing the stored destination node routing information with the generated destination node routing information. The invention can reduce the real-time performance and solve the problem of replacing a high-quality path by a poor-quality path caused by busy system and network burst factors.
Description
Technical Field
The embodiment of the invention relates to the field of communication, in particular to a routing method and a routing device of a wireless MESH (MESH) network.
Background
The wireless mesh network consists of routers (mesh routers) and clients (mesh clients), wherein the mesh routers form a backbone network, are connected with a wired internet network and are responsible for providing multi-hop wireless internet connection for the mesh clients. The wireless Mesh network is also called a multi-hop (multi-hop) network, and is a new wireless network technology completely different from a traditional wireless network.
In the wireless Mesh network, a Mesh topological structure is adopted, and the Mesh network is a multipoint-to-multipoint network topological structure.
The wireless Mesh network adopts a Mesh topology structure, any wireless device node can be used as an Access Point (AP) and a router at the same time, each wireless device node in the network can send and receive signals, and each wireless device node can directly communicate with one or more peer wireless device nodes. If the nearest AP is congested due to excessive traffic, the data may be automatically rerouted to a neighboring node with less traffic for transmission. And so on, the data packet can be further routed to the next node closest to the data packet for transmission according to the situation of the network until the final destination is reached. Such an access method is a multi-hop access.
In contrast to conventional switched networks, wireless Mesh networks remove the wiring requirements between nodes, but still have the redundancy mechanisms and rerouting functionality provided by distributed networks.
According to the definition of 802.11s, the WIFI MESH network adopts a Hybrid Wireless MESH routing Protocol (HWMP), a Hybrid routing principle of HWMP: a Portal node is configured in the MESH network and the root Portal broadcasts AN advertisement with parameter AN ═ 1 and uses hybrid routing in registered mode. When a Mesh node S sends data to node D but there is no path to node D in the routing table, node S can send data frames to the root Portal immediately without initiating a path lookup to node D. Because the root Portal knows all Mesh nodes in the registration mode, the root Portal can identify that the node D is in the Mesh network, and then forwards a data frame with a mark to the destination node, so that the node S and the node D are both in the Mesh network. This triggers a route lookup for node S to node D. Based on the data forwarded later, an optimal path between node S and node D is set. Compared with a single search process, under the mixed route condition, the communication of the Mesh node in the network has no potential first frame data. During best path establishment, data may follow a known path (usually not optimal) along the tree structure to the root Portal. This also reduces the initial latency path learning process and reduces the delay of data when initially establishing a route.
The HWMP protocol implements a Path Request (PREQ) message, a Path Response (PREP) message, a Path Error (PERR) message, a Path response acknowledgement (PREP ACK) message, and a root announcement rann (root announcement) message. PREQ messages are used for route requests, PREP messages are used for replies to route request messages, PERR messages are used for replies or maintenance when a link has an error, and RANN messages are used for broadcast of messages for the own root node identity.
Two key links in the routing process are: the air propagation time link criterion is the measurement and selection of the air time link Metric value (AirtimeLink Metric).
As shown in fig. 1, a schematic structural diagram of a Mesh network in the prior art is shown, where the Mesh network includes a plurality of nodes: nodes A, B, C, D, E, F, G, H, I, J and K, assuming node a wants to find the path of node H, node a sends a broadcast data frame of a PREQ message, and each node receiving the PREQ message forwards the PREQ message and updates the corresponding routing table entry. After receiving the PREQ message, the final H node selects an optimal path and then responds with a PREP message.
The Metric (Metric) is a decisive parameter for link selection, and when each PREQ is forwarded by an intermediate node, the intermediate node updates the Metric field in the PERQ message, adds the Metric value from the previous hop node to the current node link, and forwards the result to the next node. The destination node of the PREQ is many PREQ messages propagated by different paths of different nodes, and the selection of the best path is judged according to the metric value of the whole link, when the PREQ has the same or updated sequence number and the metric is more optimal (smaller) or smallest, the destination node will select the path as the more optimal path and update the routing table entry.
The air interface metric of each link mainly represents the transmission time of one 8192bits data frame (data frame) on the air interface, and the calculation formula is as follows:
Cais the air interface link metric value of the current link, O represents the head overhead, including the time length consumed by the preamble and the plcpherad, BtIs a fixed value 8192, r is the transmission rate, efRepresenting the bit error rate of the current link, the final metric value is an integer in units of 0.01TUAnd (4) weighing by times. The smaller the metric value is, the shorter the time for occupying the empty port by the current mesh link is, the higher the efficiency is, and the better path is.
When realizing HWMP, the Linux kernel updates a local mesh routing table under the triggering of the following two events: and after receiving a reply message of the inquired node or an inquiry message of a certain node, the kernel updates the mesh routing table. For example, node a sends an inquiry packet to destination node B via N nodes in the network, and node B sends a reply packet to sender node a via N-1 nodes and finally via node C. When node a receives the reply message, it updates the routes to destination nodes B and C. The node C directly sends a wireless message to the node A, so the link quality between the node C and the node A can be calculated according to some parameters, and in addition, when the message replied by the node B passes through the intermediate nodes in the network, each node can update related information, so the link condition of the node B and the node A can be known according to the content in the message.
The on-demand routing of the HWMP protocol is based on RM-AODV (radio measurement AODV), the on-demand routing in the HWMP protocol uses PREQ and PREP mechanisms to establish routing between two nodes, the nodes use PREQ and PREP messages to carry out measurement information interaction, and sequence numbers (sequences) are adopted in the PREQ to ensure the timeliness of the routing.
Mechanism of use for sequence:
1. when the device sends a routing inquiry message, the device firstly obtains a sequence value of a corresponding destination from a local routing table, if the sequence value does not exist, the initial value is 0, and then the sequence value is added with 1 and carried in the message.
2. Any device will record the latest sequence value in the routing table when updating the reason table.
3. If the value of sequence is larger, the route information corresponding to the sequence is more new, and a new route is always selected in the mesh network to adapt to the change of the network topology and the jitter of the link condition.
The routing table generally includes the following fields:
destination mac destination address of route
Metric-the Metric of the path to the destination, larger indicating worse link
Sequence: the larger the path information, the more new the path information
Next hop, mac address of the Next hop device to reach the destination mac
And Flag, which is used for identifying whether the routing information is overtime, and when the routing information is overtime and then sends data to the corresponding target mac next time, the routing path needs to be redetected through the inquiry message.
The above strategy has a problem in the following scenario, as shown in fig. 2, which is a schematic diagram of a mesh network structure in the prior art, where the mesh network includes nodes A, B and C.
The nodes A and C communicate, the link quality between the nodes A and B is M1, the link quality between the nodes B and C is M2, the link quality between the nodes A and C is M3, and M1+ M2< M3, so the ideal situation is that the nodes A and C forward data through the node B better than the nodes A and C forward data directly.
However, if nodes a and C both have routing information of the other party and have timed out, node a needs to send data to node C, query the entire network through the query packet, the entire process is normally performed, and the next hop of the route to node C is successfully updated to node B.
Because the network between the nodes A-B-C is busy (video stream transmission), the routing information from the node C to the node A reaches the timeout time before the routing from the node A to the node C, and the node C-A path of the query message sent by the node C reaches the node A preferentially to the node C-B-A path, the problem that the path of the small metric is replaced by the path of the large metric because the sequence value in the query message from the node A to the node C is larger (new) than the routing information in the local routing table occurs.
If there are two routes for nodes A to C:
nodes A-C: dst: macC, metric:500, next hop: macC, sequence:200
Nodes A-B-C: dst: macC, metric:200, next hop: macB, sequence:199
Only one local routing table exists, when the node A receives the query message or the reply message, one local routing table is generated, and the system can decide to discard new information or replace the existing local routing table with the new information according to the judgment logic described above.
In the above situation, in the actual measurement of throughput, once the situation occurs, in each routing table information refresh period, the routing from the node a to the node C is switched once, that is, most of the time, the node a sends data to the node C through the node B, and there is a short time point when the node a directly sends data to the node C. Jamming occurs periodically when node a sends real-time video to node C.
Disclosure of Invention
The embodiment of the invention provides a routing method and a routing device of a wireless MESH MESH network, which can reduce the real-time property and solve the problem that a poor path replaces a high-quality path due to busy system and network burst factors.
One aspect of the present invention provides a routing method for a wireless MESH network, including:
the current node receives a message of a destination node;
the current node generates destination node routing information and a sequence number sequence of the destination node routing information according to the message of the destination node;
when the current node judges that the sequence of the generated destination node routing information minus the sequence of the destination node routing information stored by the current node is equal to 1, adopting the corresponding routing information with a smaller Metric value in the generated destination node routing information and the stored destination node routing information as the routing information to the destination node;
and when the current node judges that the sequence of the generated destination node routing information minus the sequence of the destination node routing information stored by the current node is more than or equal to 2, replacing the stored destination node routing information with the generated destination node routing information.
Optionally, the method further includes: and the current node inserts the routing information of the destination node which is determined to be adopted into a routing table maintained by the current node.
Optionally, the routing information of the destination node includes: the media access of the destination node controls the MAC address, the link quality, the next hop node address, the zone bit and the survival time.
Optionally, the metric value of the destination node routing information generated according to the destination node packet and the metric value corresponding to the stored destination node routing information are both calculated by using the following calculation formula:
Cais the air interface link metric value of the current link, O represents the head overhead, including the time length consumed by the preamble and the plcpherad, BtIs a fixed value 8192, r is the transmission rate, efRepresenting the error rate of the current link, the final metric value is measured by an integer multiple of 0.01TU unit.
Optionally, the method further includes: and if the corresponding routing information with the smaller Metric value is the destination node routing information generated according to the destination node message, replacing the stored destination node routing information with the destination node routing information generated according to the destination node message.
Optionally, the method further includes: and if the corresponding routing information with the smaller Metric value is the target node routing information stored by the current node, not updating the stored target node routing information.
Optionally, the larger the Metric is, the worse the link is, and the larger the sequence is, the newer the time is, the closer to the current time is.
Another aspect of the present invention provides a routing apparatus, including:
the receiver is used for receiving the message of the destination node;
the processor is used for generating destination node routing information and a sequence number sequence of the destination node routing information according to the message of the destination node; when the sequence of the generated destination node routing information minus the sequence of the destination node routing information stored by the current node is judged to be equal to 1, adopting the corresponding routing information with a smaller Metric value in the generated destination node routing information and the stored destination node routing information as the routing information to the destination node; and when the sequence obtained by subtracting the sequence of the target node routing information stored by the current node from the sequence of the generated target node routing information is judged to be more than or equal to 2, replacing the stored target node routing information with the generated target node routing information.
Optionally, the routing device further includes: a memory for storing a routing table;
the processor is further configured to insert the destination node routing information determined to be employed into a routing table maintained by the memory.
Optionally, the routing information of the destination node includes: the media access of the destination node controls the MAC address, the link quality, the next hop node address, the zone bit and the survival time.
Optionally, the routing device further includes: and an updating module, configured to replace the stored destination node routing information with the destination node routing information generated according to the destination node packet if the corresponding routing information with a smaller Metric value is the destination node routing information generated according to the destination node packet.
Optionally, the processor is further configured to determine not to update the stored destination node routing information if the corresponding routing information with a smaller Metric value is the stored destination node routing information.
The routing method and the device of the wireless MESH MESH network provided by the embodiment of the invention can reduce the real-time performance and solve the problem that the poor path replaces the high-quality path due to the busy system and the network burst factor.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and those skilled in the art can also obtain other drawings according to the drawings without creative efforts.
Fig. 1 is a schematic structural diagram of a Mesh network in the prior art;
fig. 2 is a schematic diagram of another mesh network structure in the prior art;
fig. 3 is a schematic diagram of a mesh network structure according to an embodiment of the present invention;
fig. 4 is a schematic flow chart of a mesh network routing method according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a mesh network routing device according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
As shown in fig. 3, which is a schematic view of a mesh network structure according to an embodiment of the present invention, the mesh network includes a current node 301, a next hop node 302, and a destination node 303, and referring to fig. 3, a method for routing a wireless mesh network according to an embodiment of the present invention is shown in fig. 4, which is a schematic view of a flow of a method for routing a wireless mesh network.
For example, the message of the target node may be a query message or a reply message of the destination node.
The current node 301 generates destination node routing information according to a message of the destination node 303, where the generated destination node routing information includes, in addition to a Media Access Control (MAC) address field of the destination node, information such as link quality, a next hop node 302 address (also a MAC address), some flag bits, and survival time, the next hop 302 in the generated destination node routing information is the MAC address for directly sending the message to the current node 301, and other information required by the generated destination node routing information is automatically generated by the system, and is generally assigned with an initial value.
The current node 301 generates the sequence of the destination node routing information according to the message of the destination node 303.
The sequence of the routing information describes the time of updating the routing information, for example, when a node maintains a routing table, the value of a newly generated routing information (inserted into a local routing table) is 0, and later, each time the node actively sends an inquiry message, the value is added with 1 and sent to the mesh network. The new sequence value can be transmitted in the network through the inquiry and reply messages, and the sequence value is kept unchanged in one inquiry.
In step 403, the current node determines whether it stores destination node routing information.
For example, the current node 301 determines whether its memory stores destination node routing information, the routing table stored in the memory includes a field for describing the destination node 303 routing information, the destination node routing information includes information such as link quality, next hop node 302 address (also MAC address), some flags, and survival time in addition to a Media Access Control (MAC) address field of the destination node, and the current node 301 detects whether its memory stores a field describing the route of the destination node 303.
If the current node determines that it does not store the destination node routing information, step 404 is performed, and if the current node determines that it stores the destination node routing information, step 405 and 407 are performed.
The destination node routing information maintained by the memory also has a sequence.
The sequence of the routing information describes the time of updating the routing information, for example, when a node maintains a routing table, the value of a newly generated routing information (inserted into a local routing table) is 0, and later, each time the node actively sends an inquiry message, the value is added with 1 and sent to the mesh network. The new sequence value can be transmitted in the network through the inquiry and reply messages, and the sequence value is kept unchanged in one inquiry.
The current node 301 inserts the destination node routing information into the routing table maintained by the current node 301.
For example, the sequence of the destination node routing information generated by the current node 301 according to the destination node 303 packet, and there is also a sequence corresponding to the destination node routing information currently maintained by the current node 301, and both the metric value of the destination node routing information generated according to the destination node packet and the metric value corresponding to the stored destination node routing information can be calculated by adopting the following calculation formula:
Cais the air interface link metric value of the current link, O represents the head overhead, including the time length consumed by the preamble and the plcpherad, BtIs a fixed value 8192, r isTransmission rate, efRepresenting the error rate of the current link, the final metric value is measured by an integer multiple of 0.01TU unit. The smaller the metric value is, the shorter the time for occupying the empty port by the current mesh link is, the higher the efficiency is, and the better path is.
If the current node 301 determines that the sequence of the destination node routing information generated according to the destination node message minus the sequence of the destination node routing information stored by the current node 301 is equal to 1, it is determined to use the corresponding routing information with a smaller Metric value among the generated destination node routing information and the stored destination node routing information as the routing information to the destination node.
If the corresponding routing information with a smaller Metric value is destination node routing information generated according to a destination node message, the current node 301 updates the routing table, that is, replaces the stored destination node routing information with the destination node routing information generated according to the destination node message.
If the corresponding routing information with the smaller Metric value is the destination node routing information stored by the current node 301, the current node 301 does not update the stored destination node routing information.
For example, there may be many routes (more than 2) from the current node 301 to the destination node 303, and the current node 301 needs to compare two dimensions, Metric and sequence, when deciding which route to use, the larger Metric is, the worse the link is, and the larger sequence is, the newer the time is, and the closer the current time is. Therefore, the principle of time-first (sequence is large) and then path-first (metric is small) is basically adopted for mesh network path selection.
Thus, according to the description of the above embodiment routing policies: by adopting the principle of time priority (sequence is large) and then path priority (metric is small), the strategy reduces the real-time property to a certain extent, solves the problem that poor paths replace high-quality paths due to busy system and network burst factors, improves the experience of large-flow application (video) in the mesh network, and obviously improves the video transmission effect of the mesh network with fixed equipment positions in actual measurement.
As shown in fig. 5, which is a schematic structural diagram of a routing device in a mesh network according to another embodiment of the present invention, the routing device is a current node or a part of the current node, and includes a processor 501, a sink 502, a memory 503, and an update module 504, and the processor 501, the sink 502, the memory 503, and the update module 504 are communicatively connected to each other through a BUS.
The receiver 502 is configured to receive a packet of a target node.
For example, the message of the target node may be a query message or a reply message of the destination node.
The processor 501 is configured to generate destination node routing information and a sequence number (sequence) of the destination node routing information according to a packet of a destination node.
The generated destination node routing information includes not only a Media Access Control (MAC) address field of the destination node, but also information such as link quality, a next hop node address (also a MAC address), some flag bits, and survival time, where the next hop in the generated destination node routing information is the MAC address that directly sends the packet to the current node, and other information required by the generated destination node routing information is automatically generated by the system, and is generally given an initial value.
The sequence of the routing information describes the time of updating the routing information, for example, when a node maintains a routing table, the value of a newly generated routing information (inserted into a local routing table) is 0, and later, each time the node actively sends an inquiry message, the value is added with 1 and sent to the mesh network. The new sequence value can be transmitted in the network through the inquiry and reply messages, and the sequence value is kept unchanged in one inquiry.
The memory 503 is used for storing a routing table.
The processor 501 is further configured to determine whether the memory 503 stores destination node routing information.
For example, the memory stores a routing table including a field for describing destination node routing information including information such as link quality, next hop node address (also MAC address), some flag bits, and survival time in addition to a Media Access Control (MAC) address field of the destination node, and the processor 501 detects whether the memory 503 stores a field for describing a route of the destination node.
If the processor 501 determines that the memory 503 does not store destination node routing information, the updating module 504 is configured to insert the generated destination node routing information into a routing table maintained by the memory 503.
The destination node routing information maintained by the memory 503 also has a sequence.
The sequence of the routing information describes the time of updating the routing information, for example, when a node maintains a routing table, the value of a newly generated routing information (inserted into a local routing table) is 0, and later, each time the node actively sends an inquiry message, the value is added with 1 and sent to the mesh network. The new sequence value can be transmitted in the network through the inquiry and reply messages, and the sequence value is kept unchanged in one inquiry.
If the processor 501 determines that the memory 503 stores destination node routing information, the processor 501 is further configured to determine a size relationship between a sequence of the generated destination node routing information and a sequence of the stored destination node routing information, as described below.
For example, the processor 501 is further configured to determine that, when the sequence of the destination node routing information generated according to the destination node packet minus the sequence of the destination node routing information stored in the memory 503 is equal to 1, corresponding routing information with a smaller Metric value among the generated destination node routing information and the stored destination node routing information is used as the routing information to the destination node.
For example, the processor 501 generates a sequence of destination node routing information according to a destination node packet, and there is also a sequence corresponding to the destination node routing information currently maintained by the memory 503, and both a metric value of the destination node routing information generated by the processor 501 according to the destination node packet and a metric value corresponding to the stored destination node routing information can be calculated by using the following calculation formula:
Cais the air interface link metric value of the current link, O represents the head overhead, including the time length consumed by the preamble and the plcpherad, BtIs a fixed value 8192, r is the transmission rate, efRepresenting the error rate of the current link, the final metric value is measured by an integer multiple of 0.01TU unit. The smaller the metric value is, the shorter the time for occupying the empty port by the current mesh link is, the higher the efficiency is, and the better path is.
If the processor 501 determines that the sequence obtained by subtracting the sequence of the destination node routing information stored in the memory 503 from the sequence of the destination node routing information generated according to the destination node packet is equal to 1, it determines that the corresponding routing information with a smaller Metric value in the generated destination node routing information and the stored destination node routing information is used as the routing information to the destination node.
If the processor 501 determines that the corresponding routing information with a smaller Metric value is destination node routing information generated according to a destination node packet, the updating module 504 is further configured to replace the stored destination node routing information with the destination node routing information generated according to the destination node packet.
If the processor 501 determines that the corresponding routing information with a smaller Metric value is the destination node routing information stored in the memory 503, the processor 501 determines not to update the stored destination node routing information.
For example, the processor 501 is further configured to replace the stored destination node routing information with the destination node routing information generated according to the destination node packet when determining that the sequence of the destination node routing information generated according to the destination node packet minus the sequence of the destination node routing information stored in the memory 503 is greater than or equal to 2.
For example, there may be many path choices (more than 2) from the current node to the destination node, and the memory 503 of the current node needs to compare two dimensions, Metric and sequence, when deciding which route to use, the larger the Metric, the worse the link, the larger the sequence, the newer the time, and the closer the current time. Therefore, the principle of time-first (sequence is large) and then path-first (metric is small) is basically adopted for mesh network path selection.
The above-described embodiments of the apparatus are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (10)
1. A routing method of a wireless MESH MESH network is characterized by comprising the following steps:
the current node receives a message of a destination node;
the current node generates destination node routing information and a destination node routing information serial number according to the message of the destination node;
when the current node judges that the sequence number of the generated destination node routing information minus the sequence number of the destination node routing information stored by the current node is equal to 1, adopting the corresponding routing information with smaller metric value in the generated destination node routing information and the stored destination node routing information as the routing information to the destination node;
and when the current node judges that the sequence number of the generated destination node routing information minus the sequence number of the destination node routing information stored by the current node is more than or equal to 2, replacing the stored destination node routing information with the generated destination node routing information.
2. The method of claim 1, wherein the method further comprises: and the current node inserts the routing information of the destination node which is determined to be adopted into a routing table maintained by the current node.
3. The method of claim 1, wherein the routing information of the destination node comprises: the media access of the destination node controls the MAC address, the link quality, the next hop node address, the zone bit and the survival time.
4. The method of claim 1, wherein the method further comprises:
and if the corresponding routing information with the smaller metric value is the destination node routing information generated according to the destination node message, replacing the stored destination node routing information with the destination node routing information generated according to the destination node message.
5. The method of claim 1, wherein the method further comprises:
and if the corresponding routing information with the smaller metric value is the target node routing information stored by the current node, not updating the stored target node routing information.
6. A routing device, comprising:
the receiver is used for receiving the message of the destination node;
the processor is used for generating destination node routing information and a serial number of the destination node routing information according to the message of the destination node; when the serial number of the generated destination node routing information minus the serial number of the stored destination node routing information is judged to be equal to 1, adopting the corresponding routing information with smaller metric value in the generated destination node routing information and the stored destination node routing information as the routing information to the destination node; and when the sequence number of the generated destination node routing information minus the sequence number of the stored destination node routing information is judged to be more than or equal to 2, replacing the stored destination node routing information with the generated destination node routing information.
7. The apparatus of claim 6, further comprising: a memory for storing a routing table;
the processor is further configured to insert the destination node routing information determined to be employed into a routing table maintained by the memory.
8. The apparatus of claim 6, wherein the routing information of the destination node comprises: the media access of the destination node controls the MAC address, the link quality, the next hop node address, the zone bit and the survival time.
9. The apparatus of claim 6, further comprising: and the updating module is used for replacing the stored target node routing information with the target node routing information generated according to the target node message if the corresponding routing information with the smaller metric value is the target node routing information generated according to the target node message.
10. The apparatus of claim 6, wherein the processor is further configured to determine not to update the stored target node routing information if the corresponding routing information with a smaller metric value is the stored target node routing information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710075618.8A CN106888493B (en) | 2017-02-13 | 2017-02-13 | Routing method and device of wireless MESH MESH network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710075618.8A CN106888493B (en) | 2017-02-13 | 2017-02-13 | Routing method and device of wireless MESH MESH network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106888493A CN106888493A (en) | 2017-06-23 |
| CN106888493B true CN106888493B (en) | 2020-10-16 |
Family
ID=59179347
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710075618.8A Active CN106888493B (en) | 2017-02-13 | 2017-02-13 | Routing method and device of wireless MESH MESH network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106888493B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110234154B (en) * | 2019-06-17 | 2021-11-30 | 广东工业大学 | Outdoor team communication system supporting ad hoc network |
| CN112218352B (en) * | 2020-09-29 | 2022-01-14 | 北京智芯微电子科技有限公司 | Address management method and device of mesh network node, and route creation and maintenance method |
| CN116506351B (en) * | 2023-06-21 | 2023-09-19 | 杭州海康威视数字技术股份有限公司 | MPLS-VPN Qos route selection method, device and equipment |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101057153A (en) * | 2004-11-08 | 2007-10-17 | 网状网络公司 | System and method to decrease the route convergence time and find optimal routes in a wireless communication network |
| CN101171807A (en) * | 2005-05-06 | 2008-04-30 | 英特尔公司 | Methods and apparatus for providing a dynamic on-demand routing protocol |
| CN101305559A (en) * | 2005-11-09 | 2008-11-12 | 汤姆森特许公司 | Route selection in wireless network |
| CN101326773A (en) * | 2005-12-01 | 2008-12-17 | 阿德利亚网络公司 | A method and system for an adaptive wireless routing protocol in a mesh network |
| CN101330298A (en) * | 2007-08-21 | 2008-12-24 | 刘西钉 | Method for processing inertness of frequency-hopping FHSS wireless network facing to multi-interference circumstance application |
| JP4358725B2 (en) * | 2004-12-06 | 2009-11-04 | 日本電信電話株式会社 | Shortest path selection method on multiple domains, apparatus to which the method is applied, and program for realizing the method |
| CN101754321A (en) * | 2009-11-27 | 2010-06-23 | 西安电子科技大学 | Cognitive routing method based on MIMO link |
| CN101969682A (en) * | 2005-11-09 | 2011-02-09 | 汤姆森特许公司 | Method and system for discovering route between source node and destination node |
| US7961642B2 (en) * | 2008-05-29 | 2011-06-14 | International Business Machines Corporation | System and method for obtaining network link state information from sequential distance vector routing tables |
| CN105430708A (en) * | 2015-11-05 | 2016-03-23 | 华北电力大学（保定） | Wireless sensor routing method based on routing table node energy |
-
2017
- 2017-02-13 CN CN201710075618.8A patent/CN106888493B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101057153A (en) * | 2004-11-08 | 2007-10-17 | 网状网络公司 | System and method to decrease the route convergence time and find optimal routes in a wireless communication network |
| JP4358725B2 (en) * | 2004-12-06 | 2009-11-04 | 日本電信電話株式会社 | Shortest path selection method on multiple domains, apparatus to which the method is applied, and program for realizing the method |
| CN101171807A (en) * | 2005-05-06 | 2008-04-30 | 英特尔公司 | Methods and apparatus for providing a dynamic on-demand routing protocol |
| CN101305559A (en) * | 2005-11-09 | 2008-11-12 | 汤姆森特许公司 | Route selection in wireless network |
| CN101969682A (en) * | 2005-11-09 | 2011-02-09 | 汤姆森特许公司 | Method and system for discovering route between source node and destination node |
| CN101326773A (en) * | 2005-12-01 | 2008-12-17 | 阿德利亚网络公司 | A method and system for an adaptive wireless routing protocol in a mesh network |
| CN101330298A (en) * | 2007-08-21 | 2008-12-24 | 刘西钉 | Method for processing inertness of frequency-hopping FHSS wireless network facing to multi-interference circumstance application |
| US7961642B2 (en) * | 2008-05-29 | 2011-06-14 | International Business Machines Corporation | System and method for obtaining network link state information from sequential distance vector routing tables |
| CN101754321A (en) * | 2009-11-27 | 2010-06-23 | 西安电子科技大学 | Cognitive routing method based on MIMO link |
| CN105430708A (en) * | 2015-11-05 | 2016-03-23 | 华北电力大学（保定） | Wireless sensor routing method based on routing table node energy |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106888493A (en) | 2017-06-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7450521B2 (en) | Cost-based routing using backoff scheme | |
| US7856001B2 (en) | Wireless mesh routing protocol utilizing hybrid link state algorithms | |
| KR100898681B1 (en) | System and method for routing data between different types of nodes in a wireless network | |
| US8797913B2 (en) | Reduction of message and computational overhead in networks | |
| US8958339B2 (en) | Method for supporting routing decisions in a wireless mesh network and wireless mesh network | |
| US7656851B1 (en) | Adaptive message routing for mobile ad HOC networks | |
| EP3389310B1 (en) | Method for establishing routing table, electronic device and network | |
| US9392482B2 (en) | Method for optimizing the capabilities of an ad hoc telecommunication network | |
| KR20070032717A (en) | System and method for improving the performance of the on-demand routing protocol in wireless networks | |
| US20140064142A1 (en) | Updating multicast group information of a client device of a wireless mesh network | |
| EP3229528B1 (en) | Method, device and system for establishing on-demand route | |
| CN106888493B (en) | Routing method and device of wireless MESH MESH network | |
| US8023435B2 (en) | Distribution scheme for distributing information in a network | |
| EP3200404B1 (en) | Content-centric network on-demand distance vector route method | |
| US20110085546A1 (en) | Method and devices for multicast distribution optimization | |
| Baccelli et al. | OSPF multipoint relay (MPR) extension for ad hoc networks | |
| JP2009260720A (en) | Route control method, communication system and communication apparatus | |
| CN104053208B (en) | Method for routing based on channel distribution, device in wireless self-networking | |
| CN106211255B (en) | A kind of combined optimization method of Wireless ad hoc networks layer and MAC layer | |
| EP1564938A1 (en) | A cost-based routing using backoff scheme | |
| JPH06232872A (en) | Information communication equipment | |
| US20080089315A1 (en) | Adaptive route time-out for dynamic multi-hop networks | |
| JP2010178310A (en) | Route control system and route control apparatus | |
| CN101383758B (en) | Multi-address space mobile network structure, router device and data transmitting method | |
| CN104994131A (en) | Adaptive uploading acceleration method based on distributed agent servers |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200410 Address after: 318015 no.2-3167, zone a, Nonggang City, no.2388, Donghuan Avenue, Hongjia street, Jiaojiang District, Taizhou City, Zhejiang Province Applicant after: Taizhou Jiji Intellectual Property Operation Co., Ltd Address before: 201616 Shanghai city Songjiang District Sixian Road No. 3666 Applicant before: Phicomm (Shanghai) Co.,Ltd. |
|
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200713 Address after: 201616 Shanghai city Songjiang District Sixian Road No. 3666 Applicant after: Phicomm (Shanghai) Co.,Ltd. Address before: 318015 no.2-3167, zone a, Nonggang City, no.2388, Donghuan Avenue, Hongjia street, Jiaojiang District, Taizhou City, Zhejiang Province Applicant before: Taizhou Jiji Intellectual Property Operation Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200922 Address after: 518000 Pengji Business Space-time Building 1511, No. 50, Bagua Road, Hualin Community, Yuanling Street, Futian District, Shenzhen City, Guangdong Province Applicant after: Shenzhen Lianjue Technology Co.,Ltd. Address before: 201616 Shanghai city Songjiang District Sixian Road No. 3666 Applicant before: Phicomm (Shanghai) Co.,Ltd. |