CN115297192A - 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
- CN115297192A CN115297192A CN202210701165.6A CN202210701165A CN115297192A CN 115297192 A CN115297192 A CN 115297192A CN 202210701165 A CN202210701165 A CN 202210701165A CN 115297192 A CN115297192 A CN 115297192A
- Authority
- CN
- China
- Prior art keywords
- node
- data packet
- data
- mesh
- 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.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 87
- 238000000034 method Methods 0.000 title claims abstract description 48
- 238000001514 detection method Methods 0.000 claims description 12
- 230000004044 response Effects 0.000 claims description 9
- 230000002194 synthesizing effect Effects 0.000 claims description 2
- 238000012546 transfer Methods 0.000 abstract description 3
- 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
- 238000012545 processing Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000000694 effects 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
- 230000003287 optical effect Effects 0.000 description 1
Images
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 acquires a destination node address of a data packet; the first node searches for effective nodes capable of transmitting the data packet to the destination node from the equipment information general table, and obtains an effective transmission path of the data packet; 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 mode, 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 communication 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 as IOT) transmission, and more IOT devices begin to use Mesh for wide-range networking and communication. Most of the current Mesh network communication is based on a network flooding broadcast mode, when a certain Mesh network node (Mesh node for short) is to send data to a Mesh node of a remote destination, the data needs to be forwarded through a relay node, and thus 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 the invalid transfer times of data packets and reduce 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 first node searches for effective nodes capable of transmitting the data packet to the destination node from the equipment information general table, and obtains an effective transmission path of the data packet; 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 searching, by the first node, for an effective 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 a destination node; responding to the first node address in the effective node address list, and judging the first node as an effective node; in response to the absence of the first node address from the list of valid node addresses, a relay node capable of transmitting the data packet to the destination node is searched, the relay node being a valid node capable of directly/indirectly receiving the data packet from the first node
In one embodiment, the searching for the relay node capable of transmitting the data packet to the destination node comprises: the method comprises the steps that a first node obtains a relay node address list, whether a first node address exists in the relay node address list or not is searched, and the relay node list is a Mesh node address list capable of transmitting data to each effective node; and in response to the first node address existing in the relay node address list, taking the effective node as the relay node.
In one embodiment, the relay node includes an N-class relay node, and searching for a relay node capable of transmitting the data packet to the destination node includes: the first node obtains an address list of each stage of relay nodes, searches whether the address list of the relay nodes has a first node address step by step until the first stage of relay nodes are found, and the first stage of relay nodes can directly receive data packets from the first nodes and can transmit the data packets to a destination node through N-stage forwarding.
In one embodiment, setting the lifetime of the data packet according to the forwarding times of the data packet in the effective transmission path comprises: if the first node is a valid node, setting the life cycle of the data packet to be 0; and if the first node is not the effective node, setting the life cycle number of the data packet according to the stage number of the relay node, wherein the life cycle number of the data packet is equal to the stage number of the relay node.
In one embodiment, the first node broadcasts a data packet and a data packet's lifecycle; 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 or not; responding to the data packet with the life cycle number of 0, and the second node does not forward the data packet any more; in response to the number of lifetime cycles of the packet not being 0, the second node forwards the packet.
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 or not; responding that the number of times of forwarding the data packet to a transmission path of a destination node through the relay of the second node is equal to the life cycle number of the data packet, and forwarding the data packet by the second node; and responding to the condition that the number of times of forwarding the data packet to the destination node in the transmission path of the data packet forwarded by the second node relay is not equal to the life cycle number of the data packet, and the second node does not forward the data packet any more.
In one embodiment, a first node receives a detection packet sent by a source Mesh node, wherein the detection packet carries a source Mesh node address; recording a source Mesh node address, and constructing an equipment information table; broadcasting the equipment information table, and receiving the equipment information tables of other Mesh nodes; and synthesizing the equipment information individual tables of the Mesh nodes to construct an equipment information summary table.
In one embodiment, the Mesh network performs data transmission based on bluetooth.
In order to solve the technical problem, the invention adopts another technical scheme that: there is provided a Mesh network node comprising a processor for executing instructions to implement a Mesh network data transmission method of any of the above.
In order to solve the technical problem, 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 invention has the beneficial effects that: different from the situation of the prior art, the method and the device can know the forwarding times of the data packet by planning the transmission path of the data packet in advance, and correspondingly set the life cycle of the data packet according to the forwarding times of the data packet, so that the data packet can be forwarded more quickly, the invalid forwarding times are reduced, and further 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 purpose, technical solution and effect of the present application clearer and clearer, the present application is 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 according to an embodiment of the present disclosure. In this embodiment, a Mesh network is provided, the Mesh network being a Mesh network having a topology of: all nodes in the network are connected with each other, and each node is connected with at least two other nodes, and all the nodes form an integral network. When the Mesh network is used for data transmission, data is generally sent in a broadcast mode, so that all nodes in communication connection with the current node can receive the broadcast data and all the nodes can continuously forward the broadcast data to other nodes in the Mesh network. However, some data only needs to be sent to a certain destination node, and all nodes in the Mesh network do not need to receive the data, and the existing broadcasting mode causes a large amount of redundant data in the Mesh network, and occupies network resources.
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 a life cycle of the data packet is set according to the forwarding times of the data packet, so that the transfer times of the data packet can be controlled, the invalid sending times are reduced, and further redundant data packets are reduced.
Referring to fig. 2, fig. 2 is a schematic flow chart of a Mesh network data transmission method according to 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 a Mesh network, and may be capable of sending data and receiving data. In this embodiment, the first node is an initial 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 start node for sending data only based on the division of its identity function, which is intended to make the scheme of the present application more clearly illustrated, and does not represent that the node can only send data, and in other embodiments, the first node may also serve as a destination node for receiving data, or may also serve as a relay node for forwarding data. In other words, each node in the Mesh network is the same, and the same node may play different roles in different data transmission paths.
S120: and the first node searches effective nodes 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 table of each Mesh node at least stores Mesh device information which can reach the node in the Mesh network. The Mesh node can share the own device information tables to other Mesh nodes in the same Mesh network, so that one Mesh node can store the device information tables of a plurality of Mesh nodes. Preferably, the device information tables sharing the Mesh nodes can be broadcast in the Mesh network, so that each Mesh node stores Mesh device information which can reach the Mesh node and can reach other nodes, and a device information summary table is formed, and the device information summary table stores the Mesh device information which can reach each Mesh node. By the mode, any Mesh node can inquire the information of the Mesh equipment which can reach a certain Mesh node. For example, in this embodiment, the first node may obtain, by querying the device information summary table stored therein, effective node information that can reach the destination node, that is, at least which Mesh node can transmit the data packet to the destination node, and may plan a data packet transmission path. The number of the effective nodes may be multiple, that is, there may be multiple data transmission paths from the start node to the destination node, and an optimized transmission path may be selected as an effective transmission path according to a requirement to transmit data. For example, in an embodiment, a mode with the minimum 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.
Wherein, the TTL (Time To Live) life cycle is a value of an IP protocol, and the TTL value is subtracted by 1 after a data packet is forwarded once by a relay, and the data packet is not forwarded again until the TTL value is 0. TTL is mainly used to limit the time a packet is present in the network. In the existing method, TTL values are generally configured based on a default of a network/operating system, for example, the TTL default values are 32, 64, or 128, and after receiving a data packet, each node finds that the TTL value of the data packet is not 0, and the data packet will continue to be forwarded, and at this time, a destination node may have already received the data packet, and these forwarding operations will be invalid, and may cause data redundancy and occupy network resources. In the embodiment, the TTL value of the data packet is dynamically configured according to the number of times the data packet is forwarded in the effective transmission path, so that the number of times the data packet is inefficiently forwarded can be reduced, and data redundancy can be reduced.
In an embodiment, assuming that the first node can directly send the data packet to the destination node, that is, the number of forwarding times of the data packet in the transmission path is 0, 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, the TTL value of the data packet is obtained, whether the TTL value of the data packet is 0 or not is judged, and if the TTL value is 0 through detection, the second node does not forward the data packet any more. 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. Similarly, the second node is defined as a node that receives data only based on its identity function, and does not represent that the node can only receive data, and in other data transmission paths, the second node can also serve as an initial node for sending data. Further, the data packet is transmitted in a broadcast manner, the second node may be a plurality of nodes, 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 packet is 0, and does not forward the packet any more. The fact is that the destination node has received the packet, and the packet no longer needs to be forwarded. Therefore, in this way, the time for the data packet to exist 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 packet to the destination node and needs to relay and forward the packet, where the number of times of relay and forwarding may be one or more times, that is, the number of times of forwarding the packet in the transmission path is one or more times, which may be denoted as N times, and the TTL value of the packet is set to N by using the data transmission method provided in the present application. And the second node receives the data packet, acquires a TTL value of the data packet, judges whether the TTL value of the data packet is 0 or not, and if the TTL value of the data packet is not 0 through detection, indicates that the data packet needs to be relayed and forwarded. In this case, any second node that receives the data packet may relay the data packet, which may also cause certain invalid forwarding and data redundancy, but the number of invalid forwarding times may be controlled and the data redundancy may be reduced to a certain extent compared to the existing default configuration method by adjusting the configured TTL value. When the second node performs relay forwarding on the data packet, the second node enables the function of sending data, which is equivalent to executing the operation of 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 packet is not 0, it may be determined whether the number of times the packet is forwarded in the transmission path through which the second node relays and forwards the packet to the destination node is equal to the TTL value of the packet, and if the number of times the packet is forwarded in the transmission path through which the second node relays and forwards the packet to the destination node is equal to the TTL value of the packet, it is determined that the second node is a relay node on an effective transmission path, and can forward the packet to the destination node, where the second node performs an operation of forwarding the packet. If the number of times that the data packet is forwarded in the transmission path of forwarding the data packet to the destination node through the relay of the second node is not equal to the TTL value of the data packet, it indicates that the second node cannot relay the data packet to the destination node, or even if the second node can relay the data packet to the destination node, the relay forwarding path is not the optimal path, and the second node does not forward the data packet any more. By the method, when the TTL value of the data packet is not 0, all the second nodes do not transmit data, the transmission times of the data packet can be effectively controlled, and data redundancy is prevented. The second node directly judges that the number of times of forwarding the data packet in a transmission path of forwarding the data packet to the destination node through the relay of the second node is equal to the TTL value of the data packet after obtaining the TTL value of the data packet; or judging whether the TTL value of the data packet is 0 or not, and judging that 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 TTL value of the data packet only when the TTL value of the data packet is judged not to be 0.
Referring to fig. 1 and fig. 3 in combination, fig. 3 is a schematic flowchart of a process of constructing a Mesh network according to an embodiment of the present application. In the embodiment, a Mesh network is constructed, the Mesh network can be a bluetooth-based Mesh network, and in other embodiments, the Mesh network can also be a Wi-Fi-based Mesh network, and can be applied to the technical field of internet of things communication.
Specifically, network access is initialized, and after all Mesh nodes successfully access the network, detection packets are broadcast and sent, wherein the detection packets at least carry Mesh node addresses, and the detection packets are mutually forwarded in the Mesh network. And after receiving the detection packets sent by other Mesh nodes, a certain Mesh node records the short address and the rssi of the source Mesh node. The source Mesh node is a Mesh node for sending a detection packet, and the Mesh short address is the address of the node in the Mesh network and is generally a 16-bit code. rssi is a received signal strength indication. If the Mesh node can receive the detection packet sent by the source Mesh node, the source Mesh node can send data to the Mesh node, the information of the source Mesh node is recorded, and an equipment information list is constructed. The device information table at least comprises a source Mesh node short address capable of reaching the self node, and also can comprise rssi. The source Mesh nodes can be sorted according to the rssi signal strength and stored in a valid _ nodes _ info array, and as shown in table 1, all Mesh device information that can reach the own node is recorded.
Table 1: device information list
Each Mesh node shares its own valid _ nodes _ info data (device information table), and for example, device information table sharing between nodes can be performed by broadcasting. Or, each Mesh node broadcasts its own device information table, and may also receive device information tables broadcast by other Mesh nodes. Through the sharing of the device information tables, each Mesh node stores all Mesh device information which can reach each Mesh node. That is, the Mesh node may synthesize the device information tables of each Mesh node to construct a device information summary table, where the device information summary table stores the Mesh device information that can reach each Mesh node, as shown in table 2.
Table 2: equipment information summary table
Referring to fig. 4, fig. 4 is a schematic flowchart illustrating a Mesh network data transmission method according to an embodiment of the present application. In this embodiment, the Mesh network data transmission method includes:
when data needs to be sent, the initial node of the data to be sent obtains a data packet to be sent, analyzes the data packet, and obtains a destination node address to be sent.
The originating node looks up valid nodes that can transmit data to the destination node from its own stored device information summary table (table 2 above). Specifically, the device information summary table includes an effective node address list, where an effective node refers to 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 the destination node. As shown in table 2, if the destination node is a 0x0001 node, the valid nodes are 0x0002 node and 0x0003 node.
The start node may first traverse to find whether the effective node address list of the destination node includes its own short address, that is, whether the effective node address list of the destination node includes the start node address, and if the effective node address list of the destination node includes the start node address, it indicates that the start node may directly send data to the destination node, and relay forwarding is not required, that is, the own node itself is an effective node. And based on the effective nodes, acquiring the effective transmission path of the data packet as an initial node- > a destination node. As shown in table 2, if a node (originating node) with an address of 0x0003 is to send data to a node 0x0001 (target node), the query finds that the valid nodes that can reach the node 0x0001 include the node 0x0003, and the optimal path is 0x0003- >0x0001, and no relay node is needed.
The starting 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 out that the starting node can directly send the data to the destination node, the data packet does not need to be forwarded in a relay way, and the TTL value of the data packet is set to be 0.
The start node sends the data packet and the life cycle of the data packet. Generally, a Mesh node sends 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 receiving the data packet, each Mesh node acquires the TTL of the data packet, detects that the TTL value of the data packet is 0, and does not forward the data packet any more. At this time, the destination node already receives the data packet, and other Mesh nodes receiving the data packet do not unnecessarily forward the data packet any more, thereby reducing redundant data. In other embodiments, if the originating node has found that it can send data directly to the destination node, it may also send the data packet directly to the destination node in a unicast manner.
Referring to fig. 4, if the start node finds that the effective node address list of the destination node does not include its own short address, it indicates that the start node may not directly send data to the destination node, the start node may not be an effective node of the destination node, and if it wants to send data to the destination node and needs to relay and forward, 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 originating node, in other words, the relay node is an effective node of the destination node, and is capable of transmitting data to the destination node, and the relay node is capable of receiving data from the originating node, that is, a data packet of the originating node can be forwarded to the destination node through the relay node.
And 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 an effective node, namely, the Mesh node capable of transmitting data to the effective node needs to be found, and then the effective node sends the data to a target node. If the starting node address exists in the relay node address list, the starting node can send data to the effective node, the data can be transmitted to the destination node through relay forwarding of the effective node, and the effective node can serve as the relay node.
The transmission path of the data packet acquired by the initial node based on the obtained relay node is the initial node- > the relay node- > the destination node. When a plurality of relay nodes exist, the relay nodes can be sequenced according to the rssi signal strength of each relay node, and a path where the relay node with a strong rssi signal is located is selected as an effective transmission path. As shown in table 2, if a node (originating node) with an address of 0x0004 is to send data to a node 0x0001 (target node), the query finds that valid nodes that can reach the node 0x0001 only include nodes 0x0002 and 0x0003, and nodes 0x0004 are not included, and at this time, the Mesh node that can reach the node 0x0002 or 0x0003 is continuously searched; finding out that Mesh nodes which can reach 0x0002 nodes comprise 0x0001 nodes and 0x0003 nodes and still do not comprise 0x0004 nodes, namely the 0x0002 nodes cannot serve as relay nodes from the 0x0004 nodes to the 0x0001 nodes; finding out that the Mesh nodes which can reach the node 0x0003 have the node 0x0001 and the node 0x0004, and obtaining an effective transmission path 0x0004- >0x0003- >0x0001.
And the starting 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 out that the initial node can send data to the destination node after one-time relay forwarding, the relay forwarding times of the data packet is 1, and the TTL value of the data packet is set to be 1.
The start node broadcasts a data packet, and a plurality of Mesh nodes including the relay node can receive the data packet. After receiving the data packet, each Mesh node acquires the TTL of the data packet, and if the TTL value of the data packet is detected to be not 0, the received data packet needs to be forwarded. Each Mesh node receiving the data packet continues to broadcast the data packet, and meanwhile, the TTL value of the data packet is reduced by 1, so that a plurality of Mesh nodes including the relay node may receive the forwarded data packet. After receiving the data packet, each Mesh node acquires the TTL of the data packet, detects that the TTL value of the data packet is 0, and does not forward the data packet any more. At this time, the destination node has already received the data packet, and other Mesh nodes that have received the data packet do not unnecessarily forward the data packet any more. In this embodiment, although the Mesh nodes receiving the data packet except the relay node also forward the data packet after the start node broadcasts the data packet, the forwarding is performed only once, and the redundant data of the method is greatly reduced compared with the forwarding times of the data packet with the default configuration TTL value. In other embodiments, if the start node finds an effective transmission path that can relay and forward the data packet to the destination node, the start node may also directly send the data packet to the relay node in a unicast manner, and the relay node sends the data packet to the destination node in a unicast manner.
Referring to fig. 4, if the start node finds that the relay node address list does not have the start node address, it indicates that the start node cannot directly send data to the valid node, and one-time relay forwarding cannot send data to the destination node. There may be multiple relay nodes, that is, the data packet of the start node needs to be forwarded by multiple relay nodes to reach the destination node.
When multi-stage forwarding is needed, the starting node can obtain an address list of each stage of relay node, whether the starting node address exists in the address list of the relay node is searched step by step, and until the one-stage relay node is found, the one-stage relay node can directly receive a data packet from the starting node and can transmit the data packet to a destination node through multi-stage forwarding. And obtaining an effective transmission path of the data packet based on the obtained relay nodes at all levels.
And the starting 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 starting node is found to need to be subjected to relay forwarding for N times, the data packet can be sent to the destination node, the relay forwarding times of the data packet are N, and the TTL value of the data packet is set to be N. The value of N may be greater than or equal to 2 and less than 127, 127 is the maximum TTL value specified by the protocol in this system, and in other embodiments, the value range of N may be determined according to the network capacity and the communication protocol.
The data packet is broadcast by the start node, and the data packet can be received by a plurality of Mesh nodes including the first-level relay node. After receiving the data packet, each Mesh node acquires the TTL of the data packet, and if the TTL value of the data packet is detected to be not 0, 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 by analogy, each stage of relay node forwards the data packet until the TTL value of the data packet is 0.
In an embodiment, after acquiring the TTL values of the packets, a plurality of Mesh nodes that receive the packets, including the relay node, may first determine whether the TTL values of the packets are 0, and directly determine whether to forward the data. In other embodiments, after acquiring TTL values of packets, a plurality of Mesh nodes that receive packets, including a relay node, may acquire the TTL values of the packets, determine whether the number of times that the packets are forwarded in a transmission path through which the packets are relayed by their own node to a destination node is equal to the TTL values of the packets, and if the number of times that the packets are forwarded in a transmission path through which the packets are relayed by their own node to the destination node is equal to the TTL values of the packets, forward the packets by the Mesh node; if the number of times of forwarding the data packet in a transmission path for forwarding the data packet to the destination node through the self node relay is not equal to the number of life cycles of the data packet, it is indicated that the data packet cannot be successfully and effectively forwarded to the destination node through the Mesh node, and the Mesh node does not forward the data packet any more. By the method, when the Mesh node which is not the relay node receives the data packet, the data packet is not forwarded no matter whether the TTL value of the data packet is 0 or not, and data redundancy is further reduced. In other embodiments, if the start node finds an effective transmission path that can relay and forward data to the destination node, the start node may also directly send data to each stage of relay nodes in a unicast manner step by step until sending the data to the destination node.
Referring to fig. 4, if the node address of the source node cannot be found through the entire device information summary table, it indicates that the source node cannot send data to the destination node, and the packet is discarded.
According to the embodiment, the transmission path of the data packet is planned in advance, the forwarding times of the data packet can be known, and the TTL is correspondingly set according to the forwarding times of the data packet, so that the data packet can be quickly finished and forwarded, the invalid forwarding times are reduced, and data redundancy is reduced.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a Mesh network node according to an embodiment of the present disclosure. In this embodiment, the Mesh network node includes an obtaining module 51, a searching 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, from the device information summary table, an effective node capable of transmitting the data packet to the destination node, and obtain an effective transmission path of the data packet; the setting module 53 is configured to set a lifetime of the data packet according to the forwarding number 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 according to an embodiment of the present disclosure. In this embodiment, the 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. The 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.
The Mesh network node 61 may further comprise a memory (not shown in the figure) for storing instructions and data required for the processor 62 to operate.
The processor 62 is configured to execute instructions to implement the method provided by any of the embodiments of the Mesh network data transmission method of the present application and any non-conflicting combinations thereof.
Referring to fig. 7, fig. 7 is a schematic structural diagram of a computer-readable storage medium according to an embodiment of the present disclosure. The computer readable storage medium 71 of the embodiments of the present application stores instructions/program data 72, and the instructions/program data 72, when executed, implement the method provided by any embodiment of the Mesh network data transmission method of the present application and any non-conflicting combination. The instructions/program data 72 may form a program file stored in the storage medium 71 in the form of a software product, so as to enable a computer device (which may be a personal computer, a server, or a network device) or a processor (processor) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium 71 includes: various media capable of storing program codes, such as a usb disk, a portable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, or terminal devices such as a computer, a server, a mobile phone, and a tablet.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The above description is only an embodiment of the present application, and not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes performed by the content of the present specification and the attached drawings, or applied to other related technical fields directly or indirectly, are included in the scope of the present invention.
Claims (11)
1. A Mesh network data transmission method is characterized by comprising the following steps:
a first node acquires a destination node address of a data packet;
the first node searches for an effective node capable of transmitting the data packet to the destination node from an equipment information summary table, and obtains an effective transmission path of the data packet, wherein the equipment information summary table stores Mesh equipment information capable of reaching each Mesh node;
and setting the life cycle of the data packet according to the forwarding times of the data packet in the effective transmission path.
2. The Mesh network data transmission method of claim 1, wherein the first node searching for an effective node capable of transmitting the data packet to the destination node from a device information summary table comprises:
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;
in response to the first node address being present in the list of valid node addresses, determining that the first node is the valid node;
and responding to the absence of the first node address in the effective node address list, and 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.
3. The Mesh network data transmission method of claim 2, wherein the searching for the 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 which can transmit data to reach each effective node;
in response to the first node address being present in the relay node address list, treating the active node as the relay node.
4. The Mesh network data transmission method of claim 3, wherein the relay node comprises an N-class relay node, and the searching for the relay node capable of transmitting the data packet to the destination node comprises:
the first node obtains an address list of relay nodes at all levels, searches whether the first node address exists in the address list of the relay nodes 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.
5. The Mesh network data transmission method according to claim 2, wherein the setting the life cycle of the data packet according to the forwarding number of the data packet in the effective transmission path comprises:
if the first node is the valid node, setting the life cycle of the data packet to be 0;
if the first node is not the effective node, setting the life cycle number of the data packet according to the stage number of the relay node, wherein the life cycle number of the data packet is equal to the stage number of the relay node.
6. The Mesh network data transmission method according to any one of claims 1 to 5, wherein 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 or not;
in response to the number of lifecycle of the data packet being 0, the second node no longer forwards the data packet;
in response to the number of lifecycle of the data packet not being 0, the second node forwards the data packet.
7. The Mesh network data transmission method according to any one of claims 1 to 5, wherein 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 relaying and forwarding the data packet to the destination node through the second node is equal to the life cycle number of the data packet;
in response to the number of times that the data packet is forwarded in a transmission path that relays the data packet to the destination node via the second node being equal to the number of lifetime cycles of the data packet, the second node forwarding the data packet;
and in response to the number of times that the data packet is forwarded in the transmission path for relaying and forwarding the data packet to the destination node via the second node being not equal to the number of the lifetime cycles of the data packet, the second node no longer forwards the data packet.
8. The Mesh network data transmission method according to any one of claims 1 to 5, wherein the method comprises:
the first node receives a detection packet sent by a source Mesh node, wherein the detection packet carries a source Mesh node address;
recording the source Mesh node address, and constructing an equipment information individual table;
broadcasting the equipment information table, and receiving the equipment information tables of other Mesh nodes;
and synthesizing the equipment information individual tables of the Mesh nodes to construct and obtain the equipment information summary table.
9. The Mesh network data transmission method according to any one of claims 1 to 5, wherein the method comprises:
the Mesh network carries out data transmission based on a Bluetooth mode.
10. A Mesh network node, comprising: a processor for executing instructions to implement the Mesh network data transmission method of any one of claims 1-9.
11. A computer-readable storage medium for storing instructions/program data executable to implement the Mesh network data transmission method according to any one of claims 1-9.
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 true CN115297192A (en) | 2022-11-04 |
| CN115297192B 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 |
|---|---|
| CN115297192B (en) | 2024-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10999712B2 (en) | Network methods and apparatus | |
| CN112787685B (en) | Method, apparatus and system for supporting wireless communication | |
| US8687558B2 (en) | Methods and apparatus to route emergency communication sessions | |
| JP5185456B2 (en) | Method and system for utilization of well-connected nodes in a peer-to-peer wireless network | |
| US8767690B2 (en) | Wireless communication device, wireless communication system, wireless communication method, and program | |
| US11102702B2 (en) | Method for establishing network clusters between networked devices | |
| US10171986B2 (en) | Radio relay device and system with waiting time optimization | |
| JP2017517972A (en) | System and method for selective connection | |
| JP2014161025A (en) | Methods and systems for peer-to-peer network discovery using multi-user diversity | |
| WO2013169974A1 (en) | Context-aware peer-to-peer communication | |
| JP2006314009A (en) | Radio communication system, device and method for access point management, device and method for radio communication, and computer program | |
| US20180213460A1 (en) | Networking devices and methods | |
| JP6239636B2 (en) | System, apparatus, and method for range expansion of wireless communication (RANGEEXTENSION) | |
| CN111510365B (en) | Wi-Fi data packet-based device bridging cloud method, device and medium | |
| WO2018188337A1 (en) | Method and device for packet broadcasting | |
| US10149134B2 (en) | Near field discovery method, user equipment, and storage medium | |
| JP2017022763A (en) | Service information finding method and device | |
| US20190068489A1 (en) | Use of directionality to reduce flooding in a wireless mesh network | |
| WO2017214137A1 (en) | Methods, devices and systems for supporting wireless communication | |
| US20140198770A1 (en) | Node device, communication method, and storage medium | |
| US20190281444A1 (en) | Wireless communication apparatus, communication system and wireless communication apparatus control method to exchange services | |
| CN115297192B (en) | Mesh network data transmission method, mesh network node and storage medium | |
| US10506510B2 (en) | Method for increasing lifetime of network devices in a multi-hop structured wireless communication system | |
| US20150365202A1 (en) | Communication apparatus and communication method | |
| CN109982427B (en) | Information processing method and device |
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 |