CN115297192B - Mesh network data transmission method, mesh network node and storage medium - Google Patents
Mesh network data transmission method, mesh network node and storage medium Download PDFInfo
- Publication number
- CN115297192B CN115297192B CN202210701165.6A CN202210701165A CN115297192B CN 115297192 B CN115297192 B CN 115297192B CN 202210701165 A CN202210701165 A CN 202210701165A CN 115297192 B CN115297192 B CN 115297192B
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- mesh
- data
- relay
- 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
- 230000005540 biological transmission Effects 0.000 title claims abstract description 85
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000004044 response Effects 0.000 claims description 10
- 238000001514 detection method Methods 0.000 claims description 7
- 238000004891 communication Methods 0.000 description 8
- 238000010586 diagram Methods 0.000 description 8
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 239000000523 sample Substances 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000006855 networking Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/16—Implementation or adaptation of Internet protocol [IP], of transmission control protocol [TCP] or of user datagram protocol [UDP]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/12—Protocols specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a Mesh network data transmission method, a Mesh network node and a storage medium, wherein the Mesh network data transmission method comprises the steps that a first node obtains a destination node address of a data packet; the method comprises the steps that a first node searches an effective node capable of transmitting a data packet to a destination node from an equipment information summary table, and an effective transmission path of the data packet is obtained; and setting the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path. By the method, the invalid transfer times of the data packet can be reduced, and redundant data can be reduced.
Description
Technical Field
The present invention relates to the field of network communications technologies, and in particular, to a Mesh network data transmission method, a Mesh network node, and a storage medium.
Background
Mesh networks (i.e., wireless Mesh networks) have become a widely used technology in the field of internet of things (Internet of Things, abbreviated IOT) transmission, and more IOT devices begin to use Mesh for wide-range networking and communication. Most of current Mesh network communication is based on a network flooding broadcast mode, when a certain Mesh network node (Mesh node for short) needs to send data to a remote destination Mesh node, the data needs to be forwarded through a relay node, so that a large amount of repeated redundant data exists in the network, and network resources are occupied.
Disclosure of Invention
The invention mainly solves the technical problem of providing a Mesh network data transmission method, a Mesh network node and a storage medium, which can reduce invalid transfer times of data packets and redundant data.
In order to solve the technical problems, the invention adopts a technical scheme that: the Mesh network data transmission method comprises the steps that a first node obtains a destination node address of a data packet; the method comprises the steps that a first node searches an effective node capable of transmitting a data packet to a destination node from an equipment information summary table, and an effective transmission path of the data packet is obtained; and setting the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path.
In one embodiment, the first node searching for a valid node capable of transmitting a data packet to a destination node from the device information summary table includes: the first node searches whether a first node address exists in an effective node address list, wherein the effective node address list is a Mesh node address list capable of transmitting data to a destination node; responding to the existence of a first node address in the effective node address list, and judging the first node as an effective node; in response to the first node address not being present in the list of valid node addresses, searching for a relay node capable of transmitting the data packet to the destination node, the relay node being a valid node capable of directly/indirectly receiving the data packet from the first node
In one embodiment, searching for a relay node capable of transmitting a data packet to a destination node includes: the first node acquires a relay node address list, searches whether a first node address exists in the relay node address list, and the relay node list is a Mesh node address list capable of transmitting data to reach each effective node; and in response to the first node address in the relay node address list, taking the effective node as a relay node.
In one embodiment, the relay node comprises an N-level relay node, and searching for the relay node capable of transmitting the data packet to the destination node comprises: the first node acquires the address list of each level of relay node, searches whether the address list of the relay node has the first node address step by step until the first level relay node is found, and the first level relay node can directly receive the data packet from the first node and can transmit the data packet to the destination node through N levels of forwarding.
In one embodiment, setting the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path includes: if the first node is an effective node, setting the life cycle of the data packet to 0; if the first node is not a valid node, setting the life cycle number of the data packet according to the number of the relay node, wherein the life cycle number of the data packet is equal to the number of the relay node.
In one embodiment, a first node broadcasts a data packet and a lifecycle of the data packet; the second node receives the data packet, acquires the life cycle number of the data packet, and judges whether the life cycle number of the data packet is 0; responsive to the number of life cycles of the data packet being 0, the second node no longer forwarding the data packet; the second node forwards the data packet in response to the number of life cycles of the data packet being other than 0.
In one embodiment, a first node broadcasts a data packet and a lifecycle of the data packet; the second node receives the data packet, acquires the life cycle number of the data packet, and judges whether the number of times of forwarding the data packet in a transmission path for forwarding the data packet to the destination node through the relay of the second node is equal to the life cycle number of the data packet; the second node forwards the data packet in response to the number of times the data packet is forwarded in the transmission path for forwarding the data packet to the destination node via the second node being equal to the number of life cycles of the data packet; in response to the number of times the data packet is forwarded in the transmission path of forwarding the data packet through the second node relay to the destination node not being equal to the number of life cycles of the data packet, the second node no longer forwards the data packet.
In one embodiment, a first node receives a probe packet sent by a source Mesh node, where the probe packet carries an address of the source Mesh node; recording a source Mesh node address and constructing an equipment information table; broadcasting an equipment information table, and receiving equipment information tables of other Mesh nodes; and integrating the equipment information tables of the Mesh nodes, and constructing and obtaining an equipment information summary table.
In one embodiment, the Mesh network performs data transmission based on bluetooth.
In order to solve the technical problems, the invention adopts another technical scheme that: there is provided a Mesh network node comprising a processor configured to execute instructions to implement a Mesh network data transmission method according to any one of the above.
In order to solve the technical problems, the invention adopts another technical scheme that: there is provided a computer readable storage medium for storing instructions/program data executable to implement the Mesh network data transmission method of any one of the above.
The beneficial effects of the invention are as follows: compared with the prior art, the method and the device have the advantages that the transmission path of the data packet is planned in advance, the forwarding times of the data packet can be known, the life cycle of the data packet is correspondingly set according to the forwarding times of the data packet, the data packet can be ended and forwarded relatively quickly, the invalid forwarding times are reduced, and then the data redundancy is reduced.
Drawings
Fig. 1 is a schematic diagram of a Mesh network structure in an embodiment of the present application;
fig. 2 is a schematic flow chart of a Mesh network data transmission method in an embodiment of the present application;
fig. 3 is a schematic flow chart of constructing a Mesh network in an embodiment of the present application;
fig. 4 is a schematic flow chart of a Mesh network data transmission method in an embodiment of the present application;
fig. 5 is a schematic structural diagram of a Mesh network node in an embodiment of the present application;
fig. 6 is a schematic structural diagram of a Mesh network node in an embodiment of the present application;
fig. 7 is a schematic structural diagram of a computer-readable storage medium in an embodiment of the present application.
Detailed Description
In order to make the objects, technical solutions and effects of the present application clearer and more specific, the present application will be further described in detail below with reference to the accompanying drawings and examples.
Referring to fig. 1, fig. 1 is a schematic diagram of a Mesh network structure in an embodiment of the present application. In this embodiment, a Mesh network is provided, the Mesh network being a Mesh network, the topology of the Mesh network being: all nodes in the network are connected with each other, and each node is connected with at least two other nodes, so that an integral network is formed between all the nodes. When the Mesh network is used for data transmission, data is generally transmitted in a broadcast mode, and then nodes in communication connection with the current node can all receive the broadcast data and can all continuously transmit the broadcast data to other nodes in the Mesh network. However, some data only need to be sent to a certain destination node, and all nodes in the Mesh network are not required to receive the data, so that a large amount of repeated redundant data exists in the Mesh network in the existing broadcasting mode, and network resources are occupied.
Based on the above, the application provides a Mesh network data transmission method, in which a transmission path of a data packet from a current Mesh node to a destination Mesh node is planned in advance, so that the data packet is transmitted along a specific path, and the life cycle of the data packet is set according to the forwarding times of the data packet, so that the forwarding times of the data packet can be controlled, invalid sending times are reduced, and redundant data packets are further reduced.
Referring to fig. 2, fig. 2 is a flow chart of a Mesh network data transmission method in an embodiment of the present application. In this embodiment, the Mesh network data transmission method includes:
s110: the first node obtains the destination node address of the data packet.
The first node may be any Mesh node in the Mesh network, and may be capable of sending data and receiving data. In this embodiment, the first node is a starting node for sending data, and any Mesh node in the Mesh network that needs to send data may be executed according to the data transmission mode of the first node. It should be noted that, the first node is defined as a starting node for transmitting data only based on the division of its identity function, which is intended to facilitate a clearer description of the scheme of the present application, and is not representative of that the node can only transmit data, and in other embodiments, the first node may also be used as a destination node for receiving data, or may also be used as a relay node for forwarding data. In other words, each node in the Mesh network is the same, and the same node can play different roles in different data transmission paths.
S120: the first node searches an effective node capable of transmitting the data packet to the destination node from the equipment information summary table, and acquires an effective transmission path of the data packet.
The device information of each Mesh node is at least stored in a device information table of each Mesh node, wherein the Mesh device information can reach the Mesh node in the Mesh network. The Mesh nodes can share the own device information tables with other Mesh nodes in the same Mesh network, so that the device information tables of a plurality of Mesh nodes can be stored in one Mesh node. Preferably, a device information table sharing each Mesh node may be broadcasted in the Mesh network, so that each Mesh node stores Mesh device information that can reach itself and other nodes, to form a device information table, and the device information table stores Mesh device information that can reach each Mesh node. In this way, any Mesh node can query Mesh device information that can reach a Mesh node. For example, in this embodiment, the first node may learn, by querying the total table of device information stored in the first node, information about valid nodes that can reach the destination node, that is, at least which Mesh node can transmit the data packet to the destination node, so as to plan a transmission path of the data packet. The number of the effective nodes can be multiple, that is, a plurality of data transmission paths from the starting node to the destination node can exist, and an optimized transmission path can be selected as an effective transmission path according to requirements to transmit data. For example, in one embodiment, the mode with the least number of data forwarding times and the shortest path may be selected as the effective transmission path.
S130: and setting the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path.
The TTL (Time To Live) life cycle is a value of an IP protocol, and the TTL value is reduced by 1 after the data packet is forwarded once by the relay until the TTL value is 0, and the data packet is not forwarded any more. TTL is mainly used to limit the time that a data packet exists in a network. In the prior art, the TTL value is generally configured based on network/operating system default, for example, the TTL default value is 32, 64 or 128, etc., each node finds that the TTL value of the data packet is not 0 after receiving the data packet, and the data packet will continue to be forwarded, and at this time, the destination node may already receive the data packet, and these forwarding will be invalid, which will cause data redundancy and occupy network resources. In the embodiment, the TTL value of the data packet is dynamically configured according to the forwarding times of the data packet in the effective transmission path, so that the invalid forwarding times of the data packet can be reduced, and the data redundancy is reduced.
In an embodiment, it is assumed that the first node can directly send the data packet to the destination node, that is, the forwarding number of the data packet in the transmission path is 0, and the TTL value of the data packet is set to 0 by using the data transmission method provided in the present application. The first node broadcasts the data packet and the TTL value of the data packet, the second node receives the data packet, acquires the TTL value of the data packet, judges whether the TTL value of the data packet is 0, and if the TTL value is detected to be 0, the second node does not forward the data packet. The second node is a node for receiving data, and the second node may be any node except the first node in the Mesh network. Likewise, the second node is defined as a node that receives data only based on the division of its identity function, and does not represent that the node can only receive data, but can also act as a starting node for transmitting data in other data transmission paths. Further, the data packet is sent in a broadcast manner, and the second node may be multiple, and the second node may be a relay node or a destination node. In this embodiment, the second node (relay node/destination node) detects that the TTL value of the data packet is 0, and no further forwarding is performed on the data packet. The fact is that the destination node has received the packet and the packet no longer needs to be forwarded. Thus, in this way, the time that the data packet exists in the network is shortened, and the number of invalid forwarding times is reduced.
In another embodiment, it is assumed that the first node cannot directly send the data packet to the destination node, and relay forwarding is required, where the number of relay forwarding may be one or more, that is, the number of forwarding of the data packet in the transmission path may be one or more, and may be recorded as N times, and the TTL value of the data packet is set to N by using the data transmission method provided in the present application. The second node receives the data packet, acquires the TTL value of the data packet, judges whether the TTL value of the data packet is 0, and if the TTL value of the data packet is detected to be not 0, the data packet needs to be relayed and forwarded. At this time, any second node that receives the data packet may forward the data packet in a relay manner, which may bring about a certain invalid forwarding and data redundancy, but the TTL value that is configured in an adjustment manner may be controlled with respect to the existing default configuration manner, so that the number of times of invalid forwarding may be reduced to some extent. When the second node forwards the data packet in a relay way, the second node has the function of enabling the data transmission, which is equivalent to the operation of executing the first node, the node receiving the data packet is the second node, and the second node is a relay node or a destination node. In other embodiments, when the second node detects that the TTL value of the data packet is not 0, it may be determined whether the number of times the data packet is forwarded in the transmission path for forwarding the data packet to the destination node through the second node relay is equal to the TTL value of the data packet, and if the number of times the data packet is forwarded in the transmission path for forwarding the data packet to the destination node through the second node relay is equal to the TTL value of the data packet, this indicates that the second node is a relay node on the effective transmission path, and is capable of forwarding the data packet to the destination node, at this time, the second node performs the operation of forwarding the data packet. If the number of times of forwarding the data packet in the transmission path from the second node to the destination node is not equal to the TTL value of the data packet, it indicates that the second node cannot forward the data packet in the relay to the destination node, or even if the second node can forward the data packet in the relay to the destination node, the relay path is not the optimal path, and the second node does not forward the data packet any more. In this way, when the TTL value of the data packet is not 0, not all the second nodes forward the data, so that the forwarding times of the data packet can be effectively controlled, and the data redundancy is prevented. The second node may directly determine that the number of times of forwarding the data packet in the transmission path from the second node to the destination node after obtaining the TTL value of the data packet is equal to the TTL value of the data packet; or firstly judging whether the TTL value of the data packet is 0, and judging that the number of times of forwarding the data packet in a transmission path for forwarding the data packet to a destination node through the second node relay is equal to the TTL value of the data packet when the TTL value of the data packet is not 0.
Referring to fig. 1 and fig. 3 in combination, fig. 3 is a schematic flow chart of constructing a Mesh network in an embodiment of the present application. In the embodiment, a Mesh network is constructed, and the Mesh network can be a Mesh network based on Bluetooth, and in other embodiments, the Mesh network can also be a Mesh network based on Wi-Fi, so that the Mesh network can be applied to the technical field of Internet of things communication.
Specifically, initializing network access, broadcasting and sending a detection packet after all Mesh nodes are successful in network access, wherein the detection packet at least carries a Mesh node address, and the detection packets are mutually forwarded in a Mesh network. After receiving the detection packets sent by other Mesh nodes, a Mesh node records the short address and rsi of the source Mesh node. The source Mesh node is a Mesh node sending the probe packet, and the Mesh short address is the address of a node in the Mesh network, typically a 16bit code. rsti is a received signal strength indication. If the Mesh node can receive the detection packet sent by the source Mesh node, the Mesh node indicates that the source Mesh node can send data to the Mesh node, the information of the source Mesh node is recorded, and an equipment information table is constructed. The device information table at least comprises a source Mesh node short address which can reach the self node, and also comprises rsti. The source Mesh nodes can be ordered according to rssi signal strength, stored in a valid_nodes_info array, and all Mesh device information capable of reaching the own node is recorded as shown in table 1.
Table 1: device information personal table
The Mesh nodes share the valid_nodes_info data (device information table), and for example, device information table sharing between the nodes can be performed by broadcasting. Or, each Mesh node broadcasts its own device information table, and may also receive the device information tables broadcast by other Mesh nodes. Through sharing the device information tables, each Mesh node stores all Mesh device information which can reach each Mesh node. That is, the Mesh nodes may integrate the device information tables of the Mesh nodes to construct a device information table, where Mesh device information capable of reaching each Mesh node is stored in the device information table, as shown in table 2.
Table 2: device information summary
Referring to fig. 4, fig. 4 is a flow chart of a Mesh network data transmission method in an embodiment of the present application. In this embodiment, the Mesh network data transmission method includes:
when data needs to be sent, the starting node of the data to be sent acquires the data packet to be sent, analyzes the data packet and acquires the address of the destination node to be sent.
The originating node looks up valid nodes that can transmit data to the destination node from its own stored table of device information (e.g., table 2 above). Specifically, the device information table includes an effective node address list, where an effective node is a node capable of directly communicating and interacting with a destination node, and the effective node address list is a Mesh node address list capable of transmitting data to reach the destination node. As shown in table 2 above, if the destination node is a 0x0001 node, then its valid nodes are a 0x0002 node and a 0x0003 node.
The starting node can firstly traverse and search whether the effective node address list of the destination node contains the own short address, namely whether the effective node address list of the destination node contains the starting node address, if the effective node address list of the destination node contains the starting node address, the starting node can directly send data to the destination node without relay forwarding, namely the own node is the effective node. Based on the effective node, the effective transmission path of the data packet is acquired as an initial node- > a destination node. As shown in table 2, if a node (start node) with an address of 0x0003 is to send data to a node (target node) of 0x0001, the node (start node) that is found to be valid for reaching the node 0x0001 includes the node 0x0003, and the best path is 0x0003- >0x0001, and no relay node is needed.
The initial node sets the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path. If the searching discovers that the starting node can directly send data to the destination node, the data packet does not need to be forwarded in a relay mode, and the TTL value of the data packet is set to be 0.
The originating node transmits the data packet and the lifecycle of the data packet. In general, mesh nodes send data in a broadcast manner, that is, an originating node broadcasts a data packet, and a plurality of Mesh nodes including a destination node may receive the data packet. After each Mesh node receives the data packet, the TTL of the data packet is obtained, and the TTL value of the data packet is detected to be 0, so that the data packet can not be forwarded. At this time, the destination node has received the data packet, and other Mesh nodes that have received the data packet do not have redundant forwarding of the data packet, thereby reducing redundant data. In other embodiments, if the originating node has found that it can send data directly to the destination node, it can also send data packets directly to the destination node in a unicast manner.
With continued reference to fig. 4, if the starting node finds that the effective node address list of the destination node does not include the short address of the starting node, it indicates that the starting node cannot directly send data to the destination node, and the starting node cannot serve as the effective node of the destination node, if the starting node wants to send data to the destination node and needs to relay, it needs to find a relay node capable of transmitting data to the destination node. The relay node is an effective node capable of directly/indirectly communicating with the start node, in other words, the relay node is an effective node of the destination node, capable of transmitting data to the destination node, and capable of receiving data from the start node, that is, a data packet of the start node can be forwarded to the destination node through the relay node.
The starting node traverses the effective nodes which can reach the destination node, acquires the relay node address list of each effective node, and searches whether the starting node address exists in the relay node address list. The equipment information summary table comprises a relay node address list, wherein the relay node address list is a Mesh node list capable of transmitting data to reach an effective node, namely a Mesh node capable of transmitting data to reach the effective node needs to be found, and then the data is sent to a destination node through the effective node. If the address list of the relay node has the address of the starting node, the starting node can send data to the effective node, and the data can be transmitted to the destination node through the relay forwarding of the effective node, namely the effective node can be used as the relay node.
The transmission path of the data packet acquired by the initial node based on the acquired relay node is the initial node- > relay node- > destination node. The effective nodes capable of relay forwarding may have a plurality of forwarding schemes, and when a plurality of relay nodes exist, the relay nodes can be ordered according to the rssi signal strength of each relay node, and a path where the relay node with strong rssi signal is located is selected as an effective transmission path. As shown in table 2, if the node (the start node) with the address of 0x0004 is to send data to the 0x0001 node (the target node), the query finds that the valid node that can reach the 0x0001 node is only the 0x0002 node and the 0x0003 node, and does not include the 0x0004 node, and at this time, the query continues to search for the Mesh node that can reach the 0x0002 node or the 0x0003 node; the search finds that the Mesh node which can reach the 0x0002 node has the 0x0001 node and the 0x0003 node, and still does not contain the 0x0004 node, namely the 0x0002 node cannot serve as a relay node from the 0x0004 node to the 0x0001 node; the Mesh node which can reach the 0x0003 node is found to have the 0x0001 node and the 0x0004 node, and an effective transmission path of 0x0004- >0x0003- >0x0001 is obtained.
The initial node sets the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path. If finding that the initial node can send data to the destination node after one-time relay forwarding, the data packet relay forwarding frequency is 1, and the TTL value of the data packet is 1.
The data packet is broadcast by the initial node, and a plurality of Mesh nodes including the relay node can receive the data packet. After each Mesh node receives the data packet, acquiring the TTL of the data packet, and detecting that the TTL value of the data packet is not 0, so that the received data packet needs to be forwarded. Each Mesh node receiving the data packet continues broadcasting the data packet, and the TTL value of the data packet is reduced by 1, so that a plurality of Mesh nodes including the relay node can receive the forwarded data packet. After each Mesh node receives the data packet, the TTL of the data packet is obtained, and the TTL value of the data packet is detected to be 0, so that the data packet can not be forwarded. At this time, the destination node has already received the data packet, and other Mesh nodes that have received the data packet do not have redundant forwarding of the data packet. In this embodiment, after the data packet is broadcast by the start node, the data packet is forwarded by Mesh nodes which receive the data packet except the relay node, but the data packet is forwarded only once, so that compared with the data packet forwarding times of the existing default configuration TTL value, the redundant data of the method is greatly reduced. In other embodiments, if the originating node has found an effective transmission path capable of relaying the data packet to the destination node, the data packet may also be directly sent to the relay node in a unicast manner, and the relay node then sends to the destination node in a unicast manner.
With continued reference to fig. 4, if the start node finds that the address list of the relay node does not include the start node address, it indicates that the start node cannot directly send data to the active node, and the data cannot be sent to the destination node by one relay forwarding. There may be multiple relay nodes, i.e. the data packet of the originating node may need to be forwarded by multiple relay nodes to reach the destination node.
When multi-stage forwarding is needed, the starting node can acquire the address list of each stage of relay node, and find out whether the address list of the relay node has the address of the starting node step by step until the first stage relay node is found, the first stage relay node can directly receive the data packet from the starting node, and the data packet can be transmitted to the destination node through multi-stage forwarding. And obtaining the effective transmission path of the data packet based on the obtained relay nodes at each level.
The initial node sets the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path. If the searching discovers that the starting node needs to transmit the data packet to the destination node after N times of relay forwarding, the relay forwarding times of the data packet are described as N, and the TTL value of the data packet is set as N. The value of N may be greater than or equal to 2 and less than 127, 127 being the TTL maximum value specified by the protocol under the system, and in other embodiments, the range of N may be determined according to the network capacity and the communication protocol.
The data packet is broadcast by the initial node, and a plurality of Mesh nodes including the primary relay node can receive the data packet. After each Mesh node receives the data packet, acquiring the TTL of the data packet, and detecting that the TTL value of the data packet is not 0, so that the received data packet needs to be forwarded. And each Mesh node which receives the data packet continuously broadcasts the data packet, meanwhile, the TTL value of the data packet is subtracted by 1, and the relay nodes at all levels forward until the TTL value of the data packet is 0.
In an embodiment, after the Mesh nodes that receive the data packet, including the relay node, acquire the TTL value of the data packet, the Mesh nodes may first determine whether the TTL value of the data packet is 0, and directly determine whether to forward the data. In other embodiments, after obtaining the TTL value of the data packet, the Mesh node that receives the data packet and includes the relay node may obtain the TTL value of the data packet, determine whether the number of times the data packet is forwarded in the transmission path that forwards the data packet to the destination node through the relay node is equal to the TTL value of the data packet, and if the number of times the data packet is forwarded in the transmission path that forwards the data packet to the destination node through the relay node is equal to the TTL value of the data packet, forward the data packet by the Mesh node; if the number of times of forwarding the data packet in the transmission path of forwarding the data packet to the destination node through the relay of the self node is not equal to the life cycle number of the data packet, the Mesh node can not successfully and effectively forward the data packet to the destination node, and the Mesh node can not forward the data packet. In this way, when the Mesh node which is not the relay node receives the data packet, no matter whether the TTL value of the data packet is 0 or not, the data packet is not forwarded any more, and the data redundancy is further reduced. In other embodiments, if the starting node has found an effective transmission path capable of relaying the forwarding data to the destination node, the data may be directly sent to the relay nodes of each level in a unicast manner step by step until the forwarding data is sent to the destination node.
With continued reference to fig. 4, if the starting node cannot find its own node address by traversing the entire device information table, it is indicated that the data cannot be sent from the node to the destination node, and the message is discarded.
According to the embodiment, the transmission path of the data packet is planned in advance, so that the forwarding times of the data packet can be known, TTL is correspondingly set according to the forwarding times of the data packet, the data packet can be ended to be forwarded relatively quickly, invalid forwarding times are reduced, and data redundancy is further reduced.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a Mesh network node in an embodiment of the present application. In this embodiment, the Mesh network node includes an acquisition module 51, a search module 52, and a setting module 53.
The obtaining module 51 is configured to obtain a destination node address of the data packet; the searching module 52 is configured to search an effective node capable of transmitting the data packet to the destination node from the device information table, and obtain an effective transmission path of the data packet; the setting module 53 is configured to set a life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path.
Referring to fig. 6, fig. 6 is a schematic structural diagram of a Mesh network node in an embodiment of the present application. In this embodiment, mesh network node 61 comprises a processor 62.
The processor 62 may also be referred to as a CPU (Central Processing Unit ). The processor 62 may be an integrated circuit chip having signal processing capabilities. Processor 62 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor 62 may be any conventional processor or the like.
Mesh network node 61 may further include a memory (not shown) for storing instructions and data needed for processor 62 to operate.
The processor 62 is configured to execute instructions to implement the method provided by any of the embodiments and any non-conflicting combinations of Mesh network data transmission methods described above.
Referring to fig. 7, fig. 7 is a schematic structural diagram of a computer readable storage medium according to an embodiment of the present application. The computer readable storage medium 71 of the embodiments of the present application stores instruction/program data 72, which when executed, implements the method provided by any of the embodiments of the Mesh network data transmission method and any non-conflicting combination of the present application. The instructions/program data 72 may form a program file stored in the storage medium 71 as a software product, so that a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) performs all or part of the steps of the methods according to the embodiments of the present application. And the aforementioned storage medium 71 includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, an optical disk, or other various media capable of storing program codes, or a terminal device such as a computer, a server, a mobile phone, a tablet, or the like.
In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods may be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of elements is merely a logical functional division, and there may be additional divisions of actual implementation, e.g., multiple elements or components may be combined or integrated into another system, or some features may be omitted, or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.
The foregoing description is only of embodiments of the present application, and is not intended to limit the scope of the patent application, and all equivalent structures or equivalent processes using the descriptions and the drawings of the present application or direct or indirect application in other related technical fields are included in the scope of the present application.
Claims (9)
1. The Mesh network data transmission method is characterized by comprising the following steps of:
the first node obtains a destination node address of a data packet;
the first node searches an effective node capable of transmitting the data packet to the destination node from an equipment information summary table, and acquires an effective transmission path of the data packet, wherein Mesh equipment information capable of reaching each Mesh node is stored in the equipment information summary table;
setting the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path;
wherein the first node searching for a valid node capable of transmitting the data packet to the destination node from the device information summary table includes:
the first node searches whether a first node address exists in an effective node address list, wherein the effective node address list is a Mesh node address list capable of transmitting data to reach the destination node;
responding to the existence of the first node address in the effective node address list, and judging that the first node is the effective node;
in response to the first node address not existing in the effective node address list, searching a relay node capable of transmitting the data packet to the destination node, wherein the relay node is an effective node capable of directly/indirectly receiving the data packet from the first node;
the relay node comprises an N-level relay node, and the searching the relay node capable of transmitting the data packet to the destination node comprises the following steps:
the first node acquires a relay node address list of each level, searches whether the first node address exists in the relay node address list step by step until a first-level relay node is found, and the first-level relay node can directly receive the data packet from the first node and can transmit the data packet to the destination node through N-level forwarding.
2. The Mesh network data transmission method according to claim 1, wherein the searching for a relay node capable of transmitting the data packet to the destination node comprises:
the first node acquires a relay node address list, and searches whether the first node address exists in the relay node address list, wherein the relay node list is a Mesh node address list capable of transmitting data to each effective node;
and responding to the existence of the first node address in the relay node address list, and taking the effective node as the relay node.
3. The Mesh network data transmission method according to claim 1, wherein the setting the life cycle of the data packet according to the number of forwarding times of the data packet in the effective transmission path includes:
if the first node is the effective node, setting the life cycle of the data packet to 0;
and if the first node is not the effective node, setting the life cycle number of the data packet according to the number of stages of the relay node, wherein the life cycle number of the data packet is equal to the number of stages of the relay node.
4. A Mesh network data transmission method according to any one of claims 1-3, characterized in that the method comprises:
the first node broadcasts the data packet and a lifecycle of the data packet;
the second node receives the data packet, acquires the life cycle number of the data packet, and judges whether the life cycle number of the data packet is 0;
in response to the number of life cycles of the data packet being 0, the second node no longer forwarding the data packet;
the second node forwards the data packet in response to the number of life cycles of the data packet being other than 0.
5. A Mesh network data transmission method according to any one of claims 1-3, characterized in that the method comprises:
the first node broadcasts the data packet and a lifecycle of the data packet;
the second node receives the data packet, acquires the life cycle number of the data packet, and judges whether the number of times of forwarding the data packet in a transmission path for forwarding the data packet to the destination node through the relay of the second node is equal to the life cycle number of the data packet;
in response to the number of times the data packet is forwarded in a transmission path for forwarding the data packet to the destination node via the second node relay being equal to the number of life cycles of the data packet, the second node forwards the data packet;
in response to the number of times the data packet is forwarded in the transmission path of forwarding the data packet to the destination node via the second node relay being unequal to the number of life cycles of the data packet, the second node no longer forwards the data packet.
6. A Mesh network data transmission method according to any one of claims 1-3, characterized in that the method comprises:
the first node receives a detection packet sent by a source Mesh node, wherein the detection packet carries the address of the source Mesh node;
recording the source Mesh node address and constructing an equipment information table;
broadcasting the equipment information tables and receiving the equipment information tables of other Mesh nodes;
and integrating the equipment information tables of the Mesh nodes, and constructing and obtaining the equipment information table.
7. A Mesh network data transmission method according to any one of claims 1-3, characterized in that the method comprises:
the Mesh network performs data transmission based on a Bluetooth mode.
8. A Mesh network node, comprising: a processor configured to execute instructions to implement a Mesh network data transmission method according to any one of claims 1-7.
9. A computer readable storage medium for storing instruction/program data executable to implement the Mesh network data transmission method of any one of claims 1-7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210701165.6A CN115297192B (en) | 2022-06-17 | 2022-06-17 | Mesh network data transmission method, mesh network node and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210701165.6A CN115297192B (en) | 2022-06-17 | 2022-06-17 | Mesh network data transmission method, mesh network node and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115297192A CN115297192A (en) | 2022-11-04 |
| CN115297192B true CN115297192B (en) | 2024-03-12 |
Family
ID=83820872
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210701165.6A Active CN115297192B (en) | 2022-06-17 | 2022-06-17 | Mesh network data transmission method, mesh network node and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115297192B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103068002A (en) * | 2012-12-27 | 2013-04-24 | 重庆邮电大学 | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network |
| CN107846718A (en) * | 2016-09-18 | 2018-03-27 | 华为技术有限公司 | Data transmission method and via node |
| CN109862548A (en) * | 2019-03-06 | 2019-06-07 | 乐鑫信息科技（上海）股份有限公司 | Method for being handled at the node in bluetooth Mesh network data packet |
| CN111417165A (en) * | 2020-04-01 | 2020-07-14 | 南通大学 | Bluetooth Mesh energy efficiency routing method based on awakening time prediction |
| WO2020156340A1 (en) * | 2019-01-30 | 2020-08-06 | 电信科学技术研究院有限公司 | Data transmission method and apparatus |
| CN111542030A (en) * | 2020-04-21 | 2020-08-14 | 深圳市中科蓝讯科技股份有限公司 | Optimal TTL value calculation method of Bluetooth Mesh, system thereof and computer readable storage medium |
| CN111614557A (en) * | 2020-04-02 | 2020-09-01 | 深圳创维－Rgb电子有限公司 | Data transmission method and device of Mesh network, gateway and storage medium |
| CN112954045A (en) * | 2021-02-07 | 2021-06-11 | 游密科技(深圳)有限公司 | Data transmission method, device, medium and electronic equipment in node |
| CN113225688A (en) * | 2020-01-21 | 2021-08-06 | 海信视像科技股份有限公司 | Data transmission method and display device |
| CN113261249A (en) * | 2019-01-17 | 2021-08-13 | 深圳市柔宇科技股份有限公司 | Data transmission method, related equipment and computer storage medium |
| CN115297526A (en) * | 2022-07-01 | 2022-11-04 | 浙江猫精人工智能科技有限公司 | Message sending method, intelligent interconnection system of equipment, related equipment and storage medium |
-
2022
- 2022-06-17 CN CN202210701165.6A patent/CN115297192B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103068002A (en) * | 2012-12-27 | 2013-04-24 | 重庆邮电大学 | Efficient routing method of high rate-wireless personal area network (HR-WPAN) mesh network |
| CN107846718A (en) * | 2016-09-18 | 2018-03-27 | 华为技术有限公司 | Data transmission method and via node |
| CN113261249A (en) * | 2019-01-17 | 2021-08-13 | 深圳市柔宇科技股份有限公司 | Data transmission method, related equipment and computer storage medium |
| WO2020156340A1 (en) * | 2019-01-30 | 2020-08-06 | 电信科学技术研究院有限公司 | Data transmission method and apparatus |
| CN109862548A (en) * | 2019-03-06 | 2019-06-07 | 乐鑫信息科技（上海）股份有限公司 | Method for being handled at the node in bluetooth Mesh network data packet |
| CN113225688A (en) * | 2020-01-21 | 2021-08-06 | 海信视像科技股份有限公司 | Data transmission method and display device |
| CN111417165A (en) * | 2020-04-01 | 2020-07-14 | 南通大学 | Bluetooth Mesh energy efficiency routing method based on awakening time prediction |
| CN111614557A (en) * | 2020-04-02 | 2020-09-01 | 深圳创维－Rgb电子有限公司 | Data transmission method and device of Mesh network, gateway and storage medium |
| CN111542030A (en) * | 2020-04-21 | 2020-08-14 | 深圳市中科蓝讯科技股份有限公司 | Optimal TTL value calculation method of Bluetooth Mesh, system thereof and computer readable storage medium |
| CN112954045A (en) * | 2021-02-07 | 2021-06-11 | 游密科技(深圳)有限公司 | Data transmission method, device, medium and electronic equipment in node |
| CN115297526A (en) * | 2022-07-01 | 2022-11-04 | 浙江猫精人工智能科技有限公司 | Message sending method, intelligent interconnection system of equipment, related equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115297192A (en) | 2022-11-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10999712B2 (en) | Network methods and apparatus | |
| KR101544131B1 (en) | Hybrid modes for peer discovery | |
| US8767690B2 (en) | Wireless communication device, wireless communication system, wireless communication method, and program | |
| US11102702B2 (en) | Method for establishing network clusters between networked devices | |
| US9288273B2 (en) | Systems and methods for pre-association discovery of services on a network | |
| KR101050037B1 (en) | Distributed Dynamic Channel Selection in Telecommunication Networks | |
| CN113473518B (en) | Network access method and device | |
| US10171986B2 (en) | Radio relay device and system with waiting time optimization | |
| JP2014161025A (en) | Methods and systems for peer-to-peer network discovery using multi-user diversity | |
| JP6014761B2 (en) | Method and device for discovering service information | |
| WO2018188337A1 (en) | Method and device for packet broadcasting | |
| US10149134B2 (en) | Near field discovery method, user equipment, and storage medium | |
| US20160183176A1 (en) | Service discovery technique in wireless communication network for forming p2p group | |
| EP2369791B1 (en) | Apparatus and method for establishing connections with a plurality of virtual networks | |
| CN115297192B (en) | Mesh network data transmission method, mesh network node and storage medium | |
| CN107786441B (en) | Communication method, OpenFlow switch and communication system | |
| CN114760719B (en) | Method, apparatus, device and storage medium for discovering and connecting to soft access device | |
| CN113660646A (en) | Communication method, gateway device, and computer-readable storage medium | |
| CN114845349A (en) | Communication method and system for wireless mesh network ad hoc network | |
| CN113316143A (en) | Wireless network access method, wireless access equipment and terminal equipment |
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 |