CN118400785B - Downstream routing system and method for wireless self-organizing MESH network - Google Patents
Downstream routing system and method for wireless self-organizing MESH network Download PDFInfo
- Publication number
- CN118400785B CN118400785B CN202410843915.2A CN202410843915A CN118400785B CN 118400785 B CN118400785 B CN 118400785B CN 202410843915 A CN202410843915 A CN 202410843915A CN 118400785 B CN118400785 B CN 118400785B
- Authority
- CN
- China
- Prior art keywords
- routing
- node
- data packet
- downlink
- packet
- 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
- 238000000034 method Methods 0.000 title claims abstract description 17
- 238000011144 upstream manufacturing Methods 0.000 claims description 12
- 230000004044 response Effects 0.000 claims description 10
- 230000003111 delayed effect Effects 0.000 claims description 4
- 238000010276 construction Methods 0.000 claims description 3
- 238000012423 maintenance Methods 0.000 claims description 3
- 238000012545 processing Methods 0.000 claims description 2
- 230000015556 catabolic process Effects 0.000 abstract description 3
- 238000004891 communication Methods 0.000 description 9
- 238000010586 diagram Methods 0.000 description 5
- 238000004590 computer program Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 241000854291 Dianthus carthusianorum Species 0.000 description 1
- 238000009825 accumulation Methods 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- QVFWZNCVPCJQOP-UHFFFAOYSA-N chloralodol Chemical compound CC(O)(C)CC(C)OC(O)C(Cl)(Cl)Cl QVFWZNCVPCJQOP-UHFFFAOYSA-N 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 239000000284 extract Substances 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/02—Topology update or discovery
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/54—Organization of routing tables
-
- 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
- H04W40/00—Communication routing or communication path finding
- H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
- H04W40/32—Connectivity information management, e.g. connectivity discovery or connectivity update for defining a routing cluster membership
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The embodiment of the invention discloses a downlink routing system and a method of a wireless self-organizing MESH network, wherein the system comprises a plurality of routing nodes, each routing node receives an uplink data packet from a member node, and the routing information carried by the uplink data packet is stored in a downlink routing table while forwarding. When receiving the downlink data packet, the routing node searches the downlink routing table, if the routing information of the destination node pointed in the downlink routing table exists, the downlink data packet is forwarded to the member node designated by the routing information, otherwise, the downlink data packet is forwarded to all the member nodes or the downlink data packet is broadcast on a broadcast channel. The invention effectively solves the problems of low efficiency, network overload and even breakdown caused by downlink flooding, and improves the reliability and availability of the wireless self-organizing MESH network.
Description
Technical Field
The invention relates to the field of Internet of things, in particular to a downlink routing system and method of a wireless self-organizing MESH network.
Background
The wireless self-organizing MESH network is an important networking scheme of an internet of things (IoT) service connection scheme, and a routing scheme of the self-organizing MESH network needs to balance node capabilities (power consumption, computing power, memory, wireless channels and the like). Some wireless ad hoc MESH networks support autonomous routing to provide fast adaptation capabilities to the environment, such as ADOV, DSR, etc.
However, on the one hand, the autonomous routing scheme based on the full routing table has high requirements on the computational power, the memory and the power consumption of the nodes; on the other hand, when the wireless environment changes, new routing information needs to be broadcast to each affected routing node in the network in time, which can cause overload of the wireless network, so that the autonomous routing method of the full routing table is not suitable for the wireless internet of things node scene with limited capability. In particular, narrowband low power wireless networks, such as Mesh networks based on LoRa or IEEE-802.15.4, typically have single hop bandwidths less than 200kbps, and are very sensitive to changes in network traffic. The cost of updating the full routing table would render such networks unusable. On the other hand, there are also serious limitations on processing power, energy consumption, bandwidth and memory of wireless nodes in the internet of things, and it is not feasible to trace paths of all other nodes in the routing table of each routing node.
Thus, wireless ad hoc MESH networks often employ a tree cluster topology to solidify the upstream path. The tree cluster topology is often formed by cascading a plurality of head nodes of a cluster into a tree topology, wherein the interior of a single cluster is formed by the head nodes and a plurality of member nodes, and the head node of one cluster can be a member node of another cluster. The member nodes may be routing nodes or non-routing nodes, and the head node is typically a routing node. The tree root of the tree topology is typically a gateway node that forwards the upstream data packets to the external network, while forwarding the downstream data packets of the external network to a destination node within the network. The gateway node is also a routing node.
Fig. 1 is an example of a wireless ad hoc MESH network in a typical tree cluster topology. The wireless ad hoc MESH network includes 9 communication nodes. In fig. 1, 110a-d are routing nodes (where 110a is a gateway node); 220a-e are non-routing nodes. Fig. 1 shows three clusters with dashed boxes, which constitute a tree cluster topology. Within a single cluster, head nodes hold subordinate member information, and member nodes hold head node information, establishing an association with each other. Such as routing node 110b, which is a head node, associates three member nodes 220a,220c, and 220d. In a single cluster, a data packet sent by a member node to a head node is an uplink data packet, and a data packet sent by the head node to the member node is a downlink data packet. When a packet needs to be forwarded across multiple clusters, the head node is required to have routing addressing capability.
In a wireless ad hoc MESH network of a tree cluster topology, a member node always forwards an uplink data packet to a head node, so that a fixed route of the uplink data packet is ensured. However, on the route of the downstream packet, there is no path information directly or indirectly reaching the destination node. One solution is to use a flooding mechanism, i.e. to forward or broadcast data packets to all neighboring nodes to reach the destination node.
As shown in fig. 2, fig. 2 is an example of member node-based flooding. Since the routing node has no downstream route to the destination node 220e, the routing node will forward the downstream data packets DDP in turn to all member routing nodes. For example, gateway node 110a forwards the DDP to member routing node 110b, and then 110b forwards the DDP to member routing nodes 110c and 110d, and then 110c forwards the DDP to member node 220e. Wherein the forwarding of packets from 110b to 110d is an invalid forwarding.
Fig. 3 is another example of wireless broadcast based flooding. Since the routing node does not have a downstream route to the destination node 220e, the routing node will broadcast the downstream data packet DDP on the broadcast channel, and the next routing node to receive the broadcast continues to broadcast until the destination node receives the DDP packet. For example, a DDP packet is first broadcast by gateway node 110a, 110b receives the DDP packet followed by broadcast, 110c receives the DDP and forwards the DDP to member node 220e. Wherein the forwarding from 110b to 220a, 110d and 220c is an invalid forwarding.
As wireless ad hoc MESH networks increase in size and hop count, branches in the network topology grow exponentially, and ineffective forwarding of flooding grows exponentially as well, with inefficiency in routing. Some internet of things focused on data acquisition may require little downstream traffic. However, the internet of things, such as industrial-grade internet of things, that require reliable transmission, the downstream traffic demand increases. For example, when using end-to-end automatic repeat request (ARQ), each time the destination node transmits an uplink packet, it may generate a responsive downlink channel traffic. Other situations, such as remote upgrades, downstream flooding of the upgrade package may cause network congestion and even crashes. Therefore, it is important to forward the downstream data packet through downstream routing addressing, so that the forwarding times are reduced as much as possible, and the robustness of the network is ensured.
Disclosure of Invention
The technical problem to be solved by the embodiment of the invention is to provide a downlink routing system and a method of a wireless self-organizing MESH network, so as to effectively solve the problems of low efficiency, network overload and even breakdown caused by downlink flooding and improve the reliability and the usability of the network.
In order to solve the technical problem, the embodiment of the invention provides a downlink routing system of a wireless self-organizing MESH network, which comprises a plurality of routing nodes, wherein each routing node is respectively associated with a plurality of member nodes, each routing node maintains a local downlink routing table, the downlink routing table comprises a plurality of pieces of routing information, and each piece of routing information comprises a sequence number, a TTL (transistor-transistor logic), a destination node address, a member node address and hop count information;
When each routing node receives a downlink data packet, extracting a header node address and destination node address information carried by a packet header of the downlink data packet, and if the destination node address is a member node of the routing node, editing the packet header of the downlink data packet by the routing node and forwarding the packet header to the member node; otherwise, judging whether the packet header hop limit field value of the downlink data packet is 0, if so, discarding the received downlink data packet by the routing node, if not, inquiring a local downlink routing table according to the destination node address, wherein if the routing information reaching the destination node exists, the routing node acquires a member node address associated with the destination node address, edits the packet header of the downlink data packet and forwards the packet header to the member node, and the edited packet header of the downlink data packet is: modifying the head node address carried by the packet header into the address of the route node, and decrementing the hop limit field; if the route information reaching the destination node does not exist, the routing node selects to forward the downlink data packet to all the associated member nodes or initiate broadcasting on a broadcasting channel according to the message code.
Correspondingly, the embodiment of the invention also provides a downlink routing method of the wireless self-organizing MESH network, the wireless self-organizing MESH network comprises a plurality of routing nodes, each routing node is respectively associated with a plurality of member nodes, the routing nodes comprise gateway nodes, and the method comprises the following steps:
The construction steps are as follows: constructing a local downlink routing table for each routing node, wherein the downlink routing table comprises a plurality of pieces of routing information, and each piece of routing information comprises a sequence number, a TTL (transistor-transistor logic), a destination node address, a member node address and hop count information;
A receiving step: when each routing node receives a downlink data packet, extracting a header node address and destination node address information carried by a packet header of the downlink data packet, and if the destination node address is a member node of the routing node, editing the packet header of the downlink data packet by the routing node and forwarding the packet header to the member node; otherwise, judging whether the header hop limit field value of the downlink data packet is 0, if so, discarding the received downlink data packet by the routing node, and if not, inquiring a local downlink routing table according to the destination node address;
And a forwarding step: if the routing information reaching the destination node exists, the routing node acquires the member node address associated with the destination node address, edits the packet header of the downlink data packet and forwards the packet header to the member node, and edits the packet header of the downlink data packet to be: modifying the head node address carried by the packet header into the address of the route node, and decrementing the hop limit field; if the route information reaching the destination node does not exist, the routing node selects to forward the downlink data packet to all the associated member nodes or initiate broadcasting on a broadcasting channel according to the message code.
The beneficial effects of the invention are as follows: the invention effectively solves the problems of low efficiency, network overload and even breakdown caused by downlink flooding, and improves the reliability and availability of the wireless self-organizing MESH network.
Drawings
Fig. 1 is a schematic diagram of a typical tree cluster topology wireless ad hoc MESH network.
Fig. 2 is a schematic diagram of member node-based flooding of a wireless ad hoc MESH network.
Fig. 3 is a schematic diagram of wireless broadcast-based flooding of a wireless ad hoc MESH network.
Fig. 4 is a schematic diagram illustrating the operation of a downlink routing system of a wireless ad hoc MESH network according to an embodiment of the present invention.
Fig. 5 is a schematic structural diagram of a specific device of a routing node according to an embodiment of the present invention.
Detailed Description
It should be noted that, without conflict, the embodiments of the present application and features of the embodiments may be combined with each other, and the present application will be further described in detail with reference to the drawings and the specific embodiments.
In the embodiment of the present invention, if there is a directional indication (such as up, down, left, right, front, and rear … …) only for explaining the relative positional relationship, movement condition, etc. between the components in a specific posture (as shown in the drawing), if the specific posture is changed, the directional indication is correspondingly changed.
In addition, the description of "first," "second," etc. in this disclosure is for descriptive purposes only and is not to be construed as indicating or implying a relative importance or implying an indication of the number of features being indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature.
Referring to fig. 1, the wireless ad hoc MESH network according to the embodiment of the present invention adopts a tree cluster topology. A typical tree-cluster topology wireless self-organizing MESH network is shown in FIG. 1, and the wireless self-organizing MESH network in the embodiment of the invention can also have topological variation when being implemented. For example, in the real internet of things, due to reliability considerations, member nodes may be associated with more than one head node and belong to multiple clusters. When the path of a certain cluster fails, the member node can select the head node of another cluster to send an uplink data packet. For another example, if only one gateway node is deployed in a MESH network, it is not beneficial to the expansion of the network capacity. Multiple gateway nodes may be deployed in a network and establish multiple communication paths with external networks. These changes directly affect the upstream routing but do not affect the wireless ad hoc MESH network downstream routing system and method of the present invention.
A new node joins the ad hoc MESH network to undergo three phases of network discovery, network access and data communication. In the network discovery phase, the new node monitors Beacon information of nearby routing nodes and selects candidate networks and candidate clusters. In the network access process stage, the new node interacts with an external network management entity to realize authentication, ID and key distribution, cluster head node association and the like. In the data communication stage, the new node realizes data receiving, transmitting, gathering and forwarding service according to the network role.
The downlink routing system of the wireless self-organizing MESH network adopts a tree cluster topological structure, and comprises one or more routing nodes participating in routing and one or more destination nodes. Each routing node, acting as a head node for one cluster, may be associated with one or more member nodes. The routing node receives the uplink data packet from the member node, and stores the routing information carried by the uplink data packet in the downlink routing table while forwarding the uplink data packet. When receiving the downlink data packet, the routing node searches the downlink routing table, if the routing information of the destination node pointed in the downlink routing table exists, the downlink data packet is forwarded to the member node designated by the routing information, otherwise, the downlink data packet is forwarded to all the member nodes or the downlink data packet is broadcast on a broadcast channel.
In the data communication stage, there is a forwarding service that forwards downlink data packets. The gateway node is used as an entrance of a downlink routing system, needs to cooperate with a plurality of routing nodes, and forwards the data packet to the destination node at low cost. Thus, each routing node (including gateway nodes) needs to maintain a local downstream routing table. The downstream route is shown in table 1, for example.
TABLE 1
The downlink routing table contains a certain amount of routing information, and each piece of routing information at least comprises information such as a serial number, a TTL, a destination node address, a member node address, a hop count and the like.
A. TTL represents the time-to-live of the routing information and may be expressed in terms of numbers.
B. And the routing information is queried by taking the destination node address as an index to obtain the member node address of the next hop.
C. the hop count represents the length or cost of the path.
Referring to fig. 4, each time the routing node receives a downstream packet DDP (521), it extracts the header node address and destination node address information carried by the header of the downstream packet DDP. If the destination node address is a member node of the routing node, the routing node compiles a DDP header and forwards it to the member node (522). Otherwise, it is determined whether the DDP header hop count limit field value is 0, and if so, the routing node discards the DDP packet (523). Otherwise, the local downstream routing table of the local routing node is queried (524). If the route information to the destination node exists in the local downstream routing table, the destination node obtains the member node address associated with the destination node address, edits the DDP packet header, and forwards the DDP packet header to the member node (525). If no routing information exists to the destination node, the routing node selects to forward the DDP to all member nodes or initiate broadcast on a broadcast channel based on the message code (526). When forwarding a packet, editing the DDP header contents includes changing the header node address to the home node address, and decrementing the hop limit field DHCL.
As an embodiment, the flow of updating the downlink routing table by the routing node is as follows: referring to fig. 4, after the routing node receives an uplink packet UDP from a member node (501), the routing node updates old routing information in the local downlink routing table by using the member node address and destination node address information carried by the packet header of the uplink packet UDP, or adds new routing information to the local downlink routing table (503). At this time, the TTL of the routing information should be set to the maximum. At the same time, the routing node edits the header of the upstream data packet UDP and forwards the upstream data packet UDP upward (502). Editing the content of the header of the uplink data packet includes changing the member node address of the header of the uplink data packet into the address of the routing node, and adding the hop count field UHC.
A typical packet format for the upstream packet UDP is shown in table 2.
TABLE 2
The header gives an association of the member node address and the destination node address. The hop count field UHC is incremented at each forwarding. The quality of service Qos is specified by the upper layer protocol that generates the UDP packet. The downlink response indication DRI is also specified by the upper layer protocol that generated the UDP packet, indicating whether this packet requires a downlink acknowledgement. The message code is used to identify the specific content of the message. The message content is filled by the upper layer protocol that generates the UDP packet, typically protected by security such as encryption. The packet sequence number is used to indicate the uniqueness of the packet in the network. The CRC is used to perform integrity checking on the data packet.
If a member node allows a head node to associate multiple different clusters, there are multiple upstream routes. A routing node may receive multiple upstream packets from the same destination node but different member nodes in a very small time window. At this time, the routing node selects one UDP packet to update the routing table according to the following rule:
e. firstly, according to a service grade field (Qos) of a UDP packet, selecting with high Qos grade;
f. secondly, according to a downlink response indication field (DRI) of the UDP packet, the DRI is 1;
g. again according to the hop count field (UHC) of the UDP packet, the UHC is less selected;
h. And finally, according to the arrival time of the UDP packet, the latest entry is selected.
A typical packet format for a downstream packet DDP is shown in table 3.
TABLE 3 Table 3
The header gives the destination node address and the header node address. The initial value of hop count limit DHCL is derived from the final accumulation of the hop count of the upstream data packet. Quality of service Qos is specified by the upper layer protocol that generates the DDP packet. The downlink response indicates the response of the DRI indicating whether the packet is a certain UDP packet. If so, the message code and the packet sequence number are those of a certain UDP packet, otherwise, the packet is a common downlink data packet. Message content is populated by the upper layer protocol that generates the DDP packets, typically protected by security such as encryption. The packet sequence number is used to indicate the uniqueness of the packet in the network. The CRC is used to perform integrity checking on the data packet.
The downstream routing table of the present invention is typically generated and updated from the information of the upstream packet UDP. However, in some cases, the generation of the UDP packet is delayed or lost, so that the routing information to a certain destination node cannot be added to the routing table in time. If the gateway node issues an upgrade packet to upgrade the destination node, downlink flooding still occurs, and network congestion is not available. Therefore, the gateway node will issue a downlink indication packet DIP to page the destination node, and let the node trigger a UDP packet to upload to the gateway, so that the downlink routing information related to the destination node is established on all routing nodes in the path.
Because of the limited routing nodes, the invention provides the life cycle of the TTL field maintenance routing information, and the effective routing information is saved and used as far as possible. The routing node periodically performs a TTL decrementing operation for each piece of routing information. When TTL becomes 0, the routing information is invalid and is preferably covered. If no one piece of routing information has TTL of 0, the routing information with the minimum TTL is preferably covered.
Referring to fig. 1 to 4, the wireless self-organizing MESH network in the embodiment of the present invention includes a plurality of routing nodes (i.e., nodes with routing functions), where each routing node is respectively associated with a plurality of member nodes, and the routing nodes include gateway nodes. The downlink routing method of the wireless self-organizing MESH network comprises the following steps:
The construction steps are as follows: constructing a local downlink routing table for each routing node, wherein the downlink routing table comprises a plurality of pieces of routing information, and each piece of routing information comprises a sequence number, a TTL (transistor-transistor logic), a destination node address, a member node address and hop count information;
Receiving step (forwarding step corresponds to step 521, step 522 and step 523 in fig. 4): when each routing node receives a downlink data packet, extracting a header node address and destination node address information carried by a packet header of the downlink data packet, and if the destination node address is a member node of the routing node, editing the packet header of the downlink data packet by the routing node and forwarding the packet header to the member node; otherwise, judging whether the header hop limit field value of the downlink data packet is 0, if so, discarding the received downlink data packet by the routing node, and if not, inquiring a local downlink routing table according to the destination node address;
Forwarding step (forwarding step corresponds to step 524, step 525 and step 526 in fig. 4): if the routing information reaching the destination node exists, the routing node acquires the member node address associated with the destination node address, edits the packet header of the downlink data packet and forwards the packet header to the member node, and edits the packet header of the downlink data packet to be: modifying the head node address carried by the packet header into the address of the route node, and decrementing the hop limit field; if the route information reaching the destination node does not exist, the routing node selects to forward the downlink data packet to all the associated member nodes or initiate broadcasting on a broadcasting channel according to the message code.
As an embodiment, the building step further comprises an updating step (the updating step corresponds to step 501, step 502, step 503, step 510 in fig. 4):
After receiving the uplink data packet from the member node, the routing node updates old routing information in the local downlink routing table by using the member node address and the destination node address information carried by the packet header of the uplink data packet, or adds new routing information to the local downlink routing table; meanwhile, the routing node edits the header of the uplink data packet, forwards the uplink data packet upwards, and editing the content of the header of the uplink data packet comprises changing the member node address of the header of the uplink data packet into the address of the routing node and adding the hop count field.
In one embodiment, in the updating step, if the routing node receives a plurality of uplink data packets from the same destination node but different member nodes within a preset time window, the routing node selects one uplink data packet to update the local downlink routing table according to the following rule:
a. firstly, selecting according to a service grade field of an uplink data packet, and selecting with high grade;
b. Secondly, selecting according to a downlink response indication field of the uplink data packet, wherein the downlink response indication field is 1;
c. selecting according to the hop count field of the uplink data packet, wherein the hop count field is less than the entry selection of a preset value;
d. and finally selecting the latest arrival time according to the arrival time of the uplink data packet.
As an embodiment, the forwarding step further comprises a maintenance step after: the routing node executes TTL decrementing operation of each piece of routing information when the routing information in the local downlink routing table is full or periodically executes TTL decrementing operation of each piece of routing information, when TTL becomes 0, the routing information is invalid, and the routing information is covered preferentially when the local downlink routing table is updated; if no TTL of one piece of routing information is 0, the routing information of the minimum TTL is preferentially covered when the local downlink routing table is updated.
As an embodiment, the updating step further comprises a loss handling step after: when the generation of the uplink data packet is delayed or lost, and the route information to the corresponding destination node cannot be updated to the local downlink route table in time, the gateway node firstly transmits a downlink indication packet to page the destination node, so that the destination node triggers an uplink data packet to upload to the gateway node, and the downlink route information related to the destination node is established on all route nodes in the path.
An example of a specific arrangement of routing nodes of the present invention is shown in fig. 5. The apparatus includes at least a controller module 820, a wireless communication module 810, and a power module 830. The controller module 820 contains one or more computing units 821, executes instructions that initiate computer programs, and processes data to run applications. The controller module 820 also contains one or more memory units 822 for storing data, such as a downstream routing table 823, for storing computer programs 824. The computer program 824 may be loaded into and executed by the computing unit 821 to implement all aspects of the present invention.
The apparatus also includes at least a wireless communication module 810 for sending and receiving commands, requests, messages, and data (e.g., data packets) to the routing system. The wireless communication module 810 includes at least one antenna 811 for transmitting and receiving commands, requests, and data (e.g., data packets). The wireless communication module 810 communicates with the controller module 820 via an internal data interface to exchange data.
The apparatus also includes a power module 830. The power module 830 provides components of the device with power, such as a battery and a regulator.
Although embodiments of the present invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made therein without departing from the spirit and scope of the invention as defined by the appended claims and their equivalents.
Claims (6)
1. The downlink routing system of the wireless self-organizing MESH network adopts a tree cluster topological structure, and comprises one or more routing nodes participating in routing and one or more destination nodes; each routing node is used as a head node of a cluster and is associated with one or more member nodes, and the method is characterized in that each routing node maintains a local downlink routing table, and the downlink routing table comprises a plurality of pieces of routing information, wherein each piece of routing information comprises a sequence number, a TTL (transistor-transistor logic), a destination node address, a member node address and hop count information;
When each routing node receives a downlink data packet, extracting a header node address and destination node address information carried by a packet header of the downlink data packet, and if the destination node address is a member node of the routing node, editing the packet header of the downlink data packet by the routing node and forwarding the packet header to the member node; otherwise, judging whether the packet header hop limit field value of the downlink data packet is 0, if so, discarding the received downlink data packet by the routing node, if not, inquiring a local downlink routing table according to the destination node address, wherein if the routing information reaching the destination node exists, the routing node acquires a member node address associated with the destination node address, edits the packet header of the downlink data packet and forwards the packet header to the member node, and the edited packet header of the downlink data packet is: modifying the head node address carried by the packet header into the address of the route node, and decrementing the hop limit field; if the route information reaching the destination node does not exist, the routing node selects to forward the downlink data packet to all the associated member nodes or initiate broadcasting on a broadcasting channel according to the message code;
After receiving the uplink data packet from the member node, the routing node updates old routing information in the local downlink routing table by using the member node address and the destination node address information carried by the packet header of the uplink data packet, or adds new routing information to the local downlink routing table; meanwhile, the routing node edits the packet header of the uplink data packet, forwards the uplink data packet upwards, wherein editing the content of the packet header of the uplink data packet comprises changing the member node address of the packet header of the uplink data packet into the address of the routing node, and adding the hop count field;
If the routing node receives a plurality of uplink data packets from the same destination node but different member nodes in a preset time window, the routing node selects one uplink data packet to update a local downlink routing table according to the following rule:
a. firstly, selecting according to a service grade field of an uplink data packet, and selecting with high grade;
b. Secondly, selecting according to a downlink response indication field of the uplink data packet, wherein the downlink response indication field is 1;
c. selecting according to the hop count field of the uplink data packet, wherein the hop count field is less than the entry selection of a preset value;
d. and finally selecting the latest arrival time according to the arrival time of the uplink data packet.
2. The downstream routing system of the wireless self-organizing MESH network as recited in claim 1, wherein the routing node performs or periodically performs a TTL decrementing operation of each piece of routing information when the routing information in the local downstream routing table is full, and when the TTL becomes 0, the routing information is invalid and is preferentially covered when the local downstream routing table is updated; if no TTL of one piece of routing information is 0, the routing information of the minimum TTL is preferentially covered when the local downlink routing table is updated.
3. The downstream routing system of the wireless self-organizing MESH network as recited in claim 1, wherein the routing nodes include gateway nodes, and when generation of upstream data packets is delayed or lost, and routing information to a corresponding destination node cannot be updated to a local downstream routing table in time, the gateway nodes first issue a downstream indication packet to page the destination node, so that the destination node triggers an upstream data packet to be uploaded to the gateway nodes, and downstream routing information related to the destination node is established on all routing nodes in the path.
4. A downstream routing method of a wireless self-organizing MESH network, the wireless self-organizing MESH network comprising a plurality of routing nodes, each routing node being respectively associated with a plurality of member nodes, the routing nodes comprising gateway nodes, the method comprising:
The construction steps are as follows: constructing a local downlink routing table for each routing node, wherein the downlink routing table comprises a plurality of pieces of routing information, and each piece of routing information comprises a sequence number, a TTL (transistor-transistor logic), a destination node address, a member node address and hop count information;
A receiving step: when each routing node receives a downlink data packet, extracting a header node address and destination node address information carried by a packet header of the downlink data packet, and if the destination node address is a member node of the routing node, editing the packet header of the downlink data packet by the routing node and forwarding the packet header to the member node; otherwise, judging whether the header hop limit field value of the downlink data packet is 0, if so, discarding the received downlink data packet by the routing node, and if not, inquiring a local downlink routing table according to the destination node address;
And a forwarding step: if the routing information reaching the destination node exists, the routing node acquires the member node address associated with the destination node address, edits the packet header of the downlink data packet and forwards the packet header to the member node, and edits the packet header of the downlink data packet to be: modifying the head node address carried by the packet header into the address of the route node, and decrementing the hop limit field; if the route information reaching the destination node does not exist, the routing node selects to forward the downlink data packet to all the associated member nodes or initiate broadcasting on a broadcasting channel according to the message code;
The building step further comprises an updating step after the building step:
After receiving the uplink data packet from the member node, the routing node updates old routing information in the local downlink routing table by using the member node address and the destination node address information carried by the packet header of the uplink data packet, or adds new routing information to the local downlink routing table; meanwhile, the routing node edits the packet header of the uplink data packet, forwards the uplink data packet upwards, wherein editing the content of the packet header of the uplink data packet comprises changing the member node address of the packet header of the uplink data packet into the address of the routing node, and adding the hop count field;
in the updating step, if the routing node receives a plurality of uplink data packets from the same destination node but different member nodes within a preset time window, the routing node selects one uplink data packet to update the local downlink routing table according to the following rule:
a. firstly, selecting according to a service grade field of an uplink data packet, and selecting with high grade;
b. Secondly, selecting according to a downlink response indication field of the uplink data packet, wherein the downlink response indication field is 1;
c. selecting according to the hop count field of the uplink data packet, wherein the hop count field is less than the entry selection of a preset value;
d. and finally selecting the latest arrival time according to the arrival time of the uplink data packet.
5. The downstream routing method of a wireless ad hoc MESH network as claimed in claim 4, wherein the forwarding step further comprises a maintenance step of: the routing node executes TTL decrementing operation of each piece of routing information when the routing information in the local downlink routing table is full or periodically executes TTL decrementing operation of each piece of routing information, when TTL becomes 0, the routing information is invalid, and the routing information is covered preferentially when the local downlink routing table is updated; if no TTL of one piece of routing information is 0, the routing information of the minimum TTL is preferentially covered when the local downlink routing table is updated.
6. The downstream routing method of a wireless ad hoc MESH network as claimed in claim 4, wherein the updating step further comprises a loss processing step of: when the generation of the uplink data packet is delayed or lost, and the route information to the corresponding destination node cannot be updated to the local downlink route table in time, the gateway node firstly transmits a downlink indication packet to page the destination node, so that the destination node triggers an uplink data packet to upload to the gateway node, and the downlink route information related to the destination node is established on all route nodes in the path.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410843915.2A CN118400785B (en) | 2024-06-27 | 2024-06-27 | Downstream routing system and method for wireless self-organizing MESH network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410843915.2A CN118400785B (en) | 2024-06-27 | 2024-06-27 | Downstream routing system and method for wireless self-organizing MESH network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN118400785A CN118400785A (en) | 2024-07-26 |
| CN118400785B true CN118400785B (en) | 2024-10-01 |
Family
ID=92001646
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410843915.2A Active CN118400785B (en) | 2024-06-27 | 2024-06-27 | Downstream routing system and method for wireless self-organizing MESH network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN118400785B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN119212034A (en) * | 2024-11-26 | 2024-12-27 | 深圳市艾森智能技术有限公司 | An optimal routing selection method based on routing cost |
Family Cites Families (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US7184421B1 (en) * | 2001-12-21 | 2007-02-27 | Itt Manufacturing Enterprises, Inc. | Method and apparatus for on demand multicast and unicast using controlled flood multicast communications |
| US7940669B2 (en) * | 2007-06-15 | 2011-05-10 | Silver Spring Networks, Inc. | Route and link evaluation in wireless mesh communications networks |
| CN104104605A (en) * | 2013-04-02 | 2014-10-15 | 富士通株式会社 | Downlink route acquisition and maintenance method and device |
| CN104853396A (en) * | 2014-02-13 | 2015-08-19 | 中国科学院沈阳自动化研究所 | Chain wireless sensor network oriented clustering routing system and methods thereof |
| CN104270799A (en) * | 2014-10-14 | 2015-01-07 | 北京源清慧虹信息科技有限公司 | Downlink routing setup method and downlink data transmission method in wireless network |
| US10687228B2 (en) * | 2018-06-20 | 2020-06-16 | MeshPlusPlus, Inc. | Data aggregation for distributed optimization of a wireless network |
| CN114599018B (en) * | 2020-12-04 | 2024-11-15 | 西蒙电气（中国）有限公司 | A Bluetooth Mesh network routing method based on automatic channel scheduling |
| FI20225851A1 (en) * | 2022-09-28 | 2024-03-29 | Wirepas Oy | A downlink routing solution for wireless communication networks |
| CN117042082A (en) * | 2023-08-09 | 2023-11-10 | 重庆邮电大学 | Method and device for establishing intelligent road cone ad hoc network route integrating unicast and flooding |
-
2024
- 2024-06-27 CN CN202410843915.2A patent/CN118400785B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN118400785A (en) | 2024-07-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110139319B (en) | Routing method for minimizing transmission delay of high dynamic delay network | |
| US7054271B2 (en) | Wireless network system and method for providing same | |
| US6044062A (en) | Wireless network system and method for providing same | |
| US5412654A (en) | Highly dynamic destination-sequenced destination vector routing for mobile computers | |
| EP2280517B1 (en) | Method and apparatus for controlling packet transmissions within wireless networks to enhance network formation | |
| US7310761B2 (en) | Apparatus and method for retransmitting data packets in mobile ad hoc network environment | |
| EP3061276B1 (en) | Distributed data transmission in data networks | |
| CN118400785B (en) | Downstream routing system and method for wireless self-organizing MESH network | |
| US20180262401A1 (en) | Systems and Methods for Selection of Parent Nodes in a Network | |
| Palta et al. | Comparison of OLSR and TORA routing protocols using OPNET Modeler | |
| KR20120071953A (en) | Method for transmitting routing information and routing apparatus in wireless network | |
| Medjiah et al. | GEAMS: a geographic energy-aware multipath stream-based routing protocol for WMSNs | |
| Margaryan et al. | Development of an Adaptive Routing Algorithm in MANET | |
| JP4611319B2 (en) | Network architecture | |
| CN116614856A (en) | Narrow-band wireless channel dynamic networking method suitable for complex environment | |
| CN110971514B (en) | Pilot frequency gateway equipment and data interaction method of pilot frequency network | |
| CN101719878B (en) | Method and equipment for optimizing route announcement and routing | |
| CN116016336B (en) | HRPL-based efficient inter-node communication method | |
| CN115412489B (en) | Software-defined satellite network southbound interface control method | |
| CN116155799B (en) | Self-organizing network communication system and message communication method thereof, and readable storage medium | |
| Vinayagam | Minimum Connected Dominating Set based Virtual Backbone Construction in OLSR Protocol | |
| KR20050079459A (en) | Secure router and method for routing thereof | |
| Shukla et al. | Advance Power Saving in MANET | |
| CN115942417A (en) | A low-overhead routing method for directional networking | |
| WO2020093190A1 (en) | Routing method and apparatus for mobile ad hoc network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |