Data transmission method of mesh network, electronic device and storage medium

Abstract

The application discloses a data transmission method of a mesh network, an electronic device and a computer readable storage medium. The data transmission method of the mesh network comprises the following steps: a node receives a data packet, obtains a first network depth from the data packet, and obtains a second network depth of the node; the node determines a forwarding probability of the data packet based on the first network depth and the second network depth; and the node forwards the data packet based on the forwarding probability. In this way, the suppression effect of network flooding of the mesh network can be improved.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a data transmission method of a mesh network, an electronic device and a computer readable storage medium. BACKGROUND

[0002] A wireless mesh network is a new type of wireless local area network, which can include wifi mesh, Bluetooth mesh, zigbee mesh, etc. Nodes in the wireless mesh network can establish multi-hop links and forward related data packets. Network flooding is a method used by mesh technology to transmit information. Network flooding refers to the large-scale and directionless transmission of data packets in the mesh network. However, excessive and unnecessary network flooding can cause data packet conflicts, network congestion, bandwidth reduction, and even network paralysis in severe cases.

[0003] In related technologies, when dealing with network flooding in a mesh network, the following two methods are generally used: one is to control the unlimited forwarding of data packets based on the number of lives of each data packet; the other is to cache whether each relay (node) has forwarded the data packet to prevent repeated forwarding of the same data packet. However, both of these solutions cannot effectively control unnecessary forwarding and have poor network flooding suppression effects. This is because, in the first method, setting the number of lives has no effect, and setting it too high can prevent data packets from reaching the routing exit, and it is also impossible to control the multiple forwarding of the same data packet by a node. The second method can only prevent the forwarding of duplicate data packets, but eventually each data packet is transmitted throughout the network. SUMMARY

[0004] The technical problem solved by the present application is how to improve the network flooding suppression effect of a mesh network.

[0005] To solve the above technical problem, the present application provides a data transmission method of a mesh network. The data transmission method of the mesh network includes: a node receiving a data packet, obtaining a first network depth from the data packet and obtaining a second network depth of the node itself; the node determining a forwarding probability of the data packet based on the first network depth and the second network depth; and the node forwarding the data packet based on the forwarding probability.

[0006] To solve the above technical problem, the present application provides an electronic device. The electronic device includes a processor and a memory, the memory stores program data, and the processor is configured to execute the program data to implement the above data transmission method.

[0007] To solve the above technical problem, the present application provides a computer readable storage medium, which stores program data, and the program data can be executed by a processor to implement the above data transmission method.

[0008] The mesh network data transmission method of the present application can control the forwarding probability of the received data packet of the node with different network depth, so that the data packet can complete the data transmission without transmitting through the entire mesh network, thereby improving the inhibition effect of the mesh network network flooding.

[0009] Further, the present application can avoid a part of invalid transmission, reduce the data transmission redundancy of the entire mesh network, reduce the network load, and increase the network maximum capacity and communication bandwidth. BRIEF DESCRIPTION OF DRAWINGS

[0010] In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed in the embodiment description will be briefly introduced. Obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative labor.

[0011] Figure 1 is a flowchart of an embodiment of the mesh network data transmission method of the present application;

[0012] Figure 2 is a structure diagram of an embodiment of the data packet format of the present application;

[0013] Figure 3 is a structure diagram of another embodiment of the data packet format of the present application;

[0014] Figure 4 is a structure diagram of another embodiment of the data packet format of the present application;

[0015] Figure 5 is a flowchart of an embodiment of the mesh network data transmission method of the present application;

[0016] Figure 6 is a structure diagram of an embodiment of the mesh network of the present application;

[0017] Figure 7 is Figure 1 is a specific flowchart of step S12 in the embodiment;

[0018] Figure 8 is a flowchart of another embodiment of the mesh network data transmission method of the present application;

[0019] Figure 9 is a structural schematic diagram of an embodiment of an electronic device of the present application;

[0020] Figure 10 is a structural schematic diagram of an embodiment of a computer-readable storage medium of the present application. DETAILED DESCRIPTION

[0021] In the following description, for purposes of explanation and not limitation, specific details are set forth such as particular architectures, techniques, etc. in order to provide a thorough understanding of the embodiments of the present application. However, it will be apparent to those skilled in the art that the present application can be practiced in other embodiments that depart from these specific details. In other instances, detailed descriptions of well-known methods, devices, circuits, and

[0022] It is to be understood that the terminology "includes", "has", "holds", "contains" and / or "comprising", when used in this specification and in the following claims, indicates the presence of the described features, integers, steps, operations, elements, and / or components, but does not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0023] It is also to be understood that the terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting. As used in this specification and the appended claims, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise.

[0024] It will be further understood that the terms "comprises" and / or "comprising", when used in this specification and the following claims, specify the presence of stated features, integers, steps, operations, elements, and / or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and / or groups thereof.

[0025] As used in this specification and the appended claims, the term "if' can, depending upon the context, be interpreted as meaning "when", or "once", or "in response to a determination", or "in response to detecting", for example. Similarly, the phrase "if it is determined" or "if [a described condition or event] is detected" can, depending upon the context, be interpreted to mean "once it is determined", or "in response to determining", or "once [the described condition or event] is detected", or "in response to detecting [the described condition or event]”.

[0026] With reference to the drawings of the embodiments of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described. Obviously, the described embodiments are only a part of the embodiments of the present application, but not all the embodiments of the present application. Based on the embodiments of the present application, all the other embodiments obtained by those of ordinary skill in the art without creative work fall within the scope of the present application.

[0027] The nodes in the mesh network can establish multi-hop links between the nodes and forward related data packets. The nodes in the mesh network communicate with other nodes in the mesh network through a flooding routing mode. The mesh network has a plurality of nodes, including nodes for forwarding data packets, nodes for processing application layer services, and nodes as network outlets.

[0028] The present application first proposes a data transmission method of a mesh network, as shown in Figure 1 Figure 1 is a flowchart of an embodiment of the data transmission method of the mesh network of the present application. The data transmission method of the present application can be used for nodes for forwarding data packets or nodes as network outlets (hereinafter referred to as outlet nodes) in the mesh network. The data transmission method of the present application specifically includes the following steps:

[0029] Step S11: The node receives a data packet, obtains a first network depth from the data packet, and obtains a second network depth of the node itself.

[0030] The data packet is a data packet that needs to be transmitted through the mesh network. After the node in the mesh network receives the data packet, the first network depth and the second network depth of the node itself are obtained from the data packet.

[0031] The transmission type of the data packet is divided into uplink transmission, that is, the data packet is transmitted from a source node in the mesh network to the mesh network, and is transmitted from the outlet node to the upper computer through the mesh network, and downlink transmission, that is, the data packet is transmitted from the outlet node to the mesh network, and is transmitted to a target node in the mesh network.

[0032] The mesh network can have one or more outlet nodes. Each node can calculate the network depth information relative to the outlet node.

[0033] When the data packet is transmitted uplink, the first network depth obtained by the node from the data packet is the second network depth of the previous node forwarding the data packet. When the data packet is transmitted downlink, the first network depth obtained by the node from the data packet is the second network depth of the target node.

[0034] ​In order to distinguish the two transmission types, the embodiment modifies the format of the data packet, sets a transmission type field and a network depth field in the conventional data packet, wherein the network depth field is used to set the first network depth.

[0035] The conventional communication protocol divides the data packet into three parts, i.e., a data header HDR, a payload, and a check data crc. The embodiment inserts a transmission type field UP / DOWN and a network depth field nwkDepth in the conventional data packet. UP / DOWN indicates whether the transmission type of the data packet is uplink transmission or downlink transmission. If there is already a field UP / DOWN in the HDR, it is not necessary to insert it again.

[0036] The field nwkDepth is used to record the network depth of the data packet. When the data packet is transmitted in uplink and downlink, the meaning of the field nwkDepth is different. When the data packet is transmitted in uplink, the field nwkDepth is used to indicate the network depth of the node that transmits the data packet, and the value changes as the data packet is forwarded by different nodes, i.e., before forwarding the data packet, the node updates the network depth of itself to the field nwkDepth of the data packet. When the data packet is transmitted in downlink, the field nwkDepth represents the network depth of the target node, and the value in the field nwkDepth does not change during the forwarding of the data packet after the data packet is generated.

[0037] The added fields UP / DOWN and nwkDepth of the data packet can be added in the middle of the original data packet (as shown in Figure 2 ) or the tail of the original data packet (as shown in Figure 3 ).

[0038] When the data packet is transmitted in the mesh network with low reliability, a field Appendcrc can also be added in the data packet to increase the reliability of the data information by increasing the check (as shown in Figure 4 ).

[0039] The network depth of the exit node can be defined as 0, and the network depth increases by 1 for each hop from top to bottom.

[0040] Since the other nodes in the mesh network can have multiple different transmission paths relative to the exit node (each transmission path of the node in the mesh network can be a transmission path of the node for transmitting the data packet), the network depth of the transmission path with the minimum hop number can be used as the reference.

[0041] Optionally, in order to improve the reliability of the mesh network for data packet transmission, the second network depth of the node itself can also be updated based on the data transmission quality of the mesh network. Specifically, the method shown in Figure 5The method realizes updating of the second network depth of the node itself, and the updating method specifically comprises steps S51 to S53.

[0042] Step S51: determining a plurality of transmission paths associated with the node.

[0043] There can be a plurality of different transmission paths in the mesh network with respect to the exit node. For example, as shown in FIG. 1, there are two transmission paths from node A to node C, one being node A-node C and the other being node A-node B-node C. Figure 6

[0044] Step S52: calculating, for each transmission path, a weighted value of the attenuation coefficient between nodes with respect to the hop count between nodes.

[0045] For the same transmission path, the second network depth of the other nodes on the transmission path can be determined based on the second network depth of the node close to the exit node, the hop count between the node and the other nodes on the transmission path, and the attenuation coefficient.

[0046] For example, as shown in FIG. 2, the second network depth of node A can be determined to be 10 in the same way, and then the attenuation coefficient between node A and node B, the attenuation coefficient between node B and node C, and the weighted value of the hop count between node A and node B and the hop count between node B and node C are calculated; and the weighted value of the hop count between node A and node C with respect to the attenuation coefficient between node A and node C is calculated. Figure 6

[0047] Step S53: updating the second network depth of the node based on the minimum value in the weighted value.

[0048] For example, the attenuation coefficient of the transmission path composed of node A-node B-node C is 1, the hop count between nodes is 1, and the weighted value of the transmission path is 1*1+1*1=2; the attenuation coefficient of the transmission path composed of node A-node C is 3, the hop count between nodes is 1, and the weighted value of the transmission path is 1*3=3. If the second network depth of node A is 11, the second network depth of node C is determined to be 12.

[0049] It should be noted that the updating of the second network depth of the node and the forwarding of the data packet by the node are two independent processes, and can be performed separately.

[0050] ​​The updating of the second network depth of the node can be realized in two ways, one is updating with the packet, and the other is active updating. In the updating with the packet, the node can dynamically evaluate its second network depth according to the data packet it receives, for example, using a delay weighted sliding algorithm. In the active updating, a timing active detection or a case-based active detection (such as when the network is jammed or the current network load is relatively small) can be used, for example, the egress node (the second network depth is defined as 0 and does not need to be updated) can actively initiate the network depth updating, so that each node can immediately update its second network depth.

[0051] Step S12: The node determines the forwarding probability of the data packet based on the first network depth and the second network depth.

[0052] Optionally, the embodiment can realize step S12 by the method as shown in Figure 7 The method of the embodiment can include step S71 and step S72.

[0053] Step S71: The node obtains the difference between the second network depth and the first network depth.

[0054] When the data packet is transmitted upwards, the node receiving the data packet calculates the difference between its second network depth and the first network depth of the node forwarding the data packet last time (the node forwarding the data packet last time updates its second network depth to the field nwkDepth of the data packet as the first network depth).

[0055] When the data packet is transmitted downwards, the node receiving the data packet calculates the difference between its second network depth and the second network depth of the target node, and the second network depth of the target node is always saved in the field nwkDepth as the first network depth of the data packet in the forwarding process of the data packet.

[0056] Step S72: The forwarding probability of the data packet is determined based on the difference.

[0057] The node receiving the data packet determines the forwarding probability of the data packet based on the difference.

[0058] The principle of the data packet uplink transmission is to make the data packet transmit toward the direction of low network depth. Any node receiving the data packet, if the second network depth selfDepth of the node receiving the data packet is less than the nwkDepth of the data packet, then the data packet is 100% forwarded. If the second network depth selfDepth of the node receiving the data packet is greater than the nwkDepth of the data packet, then the data packet is probabilistically forwarded. For example, the node can update the selfDepth thereof to the nwkDepth field, such as the selfDepth of the node is 2, and an uplink data packet with nwkDepth=4 is received, it is decided to forward the data packet, and the nwkDepth of the data packet is set to 2, and the data packet is forwarded. When the data packet is received by other nodes subsequently, the nwkDepth field is 2.

[0059] When the data packet is downlink transmitted, the exit node sets the second network depth of the target node of the data packet to the nwkDepth field of the data packet, and the value is not modified in the transmission process. If the selfDepth of the node receiving the data packet is greater than the nwkDepth of the data packet, then the forwarding probability is appropriately reduced.

[0060] Optionally, the embodiment can implement the step S72 through the step S81 and the step S82.

[0061] The step S81: in response to the difference being greater than the first threshold value, it is determined that the forwarding probability of the data packet is 0.

[0062] In response to the difference being greater than the first threshold value, the node determines that the forwarding probability of the data packet is 0, and the data packet is not forwarded.

[0063] The step S82: in response to the difference being less than or equal to the first threshold value, it is determined that the forwarding probability of the data packet is 1; wherein the first threshold value is a natural number greater than or equal to 1.

[0064] In response to the difference being less than or equal to the first threshold value, the node determines that the forwarding probability of the data packet is 1, and the data packet is forwarded.

[0065] Wherein, the forwarding probability P satisfies: P=100%–(selfDepth–nwkDepth–N1)*100%; wherein N1 is the first threshold value, and selfDepth is the second network depth.

[0066] In a specific application scenario, the first threshold value can be 1, and the data packet is not forwarded if the difference value is greater than 1, and the rest are forwarded. When the data packet is transmitted upwards, for example, if the nwkDepth of the data packet is 5 and the selfDepth of the node receiving the data packet is 6, P is calculated as 100%, and the data packet is forwarded; for example, if the nwkDepth of the data packet is 5 and the selfDepth of the node receiving the data packet is 7, P is calculated as 0%, and the data packet is not forwarded; for example, if the nwkDepth of the data packet is 5 and the selfDepth of the node receiving the data packet is 4, P is calculated as 300%, and the data packet is forwarded.

[0067] When the data packet is transmitted downwards, for example, if the second network depth of the target node of the data packet is 5, if the nwkDepth of the data packet is 5 and is not modified in the data packet forwarding process, if the selfDepth of the node receiving the data packet is 2, P is calculated as 500%, and the data packet is forwarded; if the selfDepth of the node receiving the data packet is 6, P is calculated as 100%, and the data packet is forwarded; if the selfDepth of the node receiving the data packet is 7, P is calculated as 0%, and the data packet is not forwarded.

[0068] In another embodiment, the forwarding probability in step S12 can decrease with the increase of the difference value. For example, the forwarding probability P satisfies the following condition: P = 100% - (selfDepth - nwkDepth) * B%; wherein B is the change of the forwarding probability per unit change of the difference value.

[0069] nwkDepth) * B%; wherein B is the change of the forwarding probability per unit change of the difference value.

[0070] With the increase of the difference between the second network depth and the first network depth, the forwarding probability becomes smaller and smaller. For example, the forwarding probability decreases by 25% (B = 25%) per 1 increase of the difference value, that is, P = 100% - (selfDepth - nwkDepth) * 25%. The node does not forward the data packet if the difference value is greater than or equal to 4. For example, when the data packet is transmitted upwards, if the nwkDepth of the data packet is 10 and the selfDepth of the node receiving the data packet is 11, P is calculated as 75%, indicating that the data packet has a 75% probability of being forwarded; if the selfDepth of the node receiving the data packet is 8, P is calculated as 150%, and the data packet is forwarded; if the selfDepth of the node receiving the data packet is 14, P is calculated as 0%, and the data packet is not forwarded. When the data packet is transmitted downwards, the forwarding probability of the data packet can also be obtained by using a similar method, which will not be described herein.

[0071] In another embodiment, step S12 can also be implemented by using the following method:

[0072] In response to the difference being less than or equal to the second threshold, it is determined that the forwarding probability of the data packet is 1. In response to the difference being greater than the second threshold, it is determined that the forwarding probability of the data packet is less than 1, and the forwarding probability decreases with the increase of the difference; wherein the second threshold is a natural number greater than or equal to 1.

[0073] In a specific application scenario, the second threshold can be 2, the difference within 2 is forwarded, and the difference above 2, the forwarding probability decreases by 33.3% for each increase of 1, that is, P = 1 - 0.333x.

[0074] (selfDepth - nwkDepth - 2) * 20%.

[0075] The uplink algorithm and the downlink algorithm can be set to be different, and are optimized according to respective situations, and will not be described again.

[0076] Step S13: The node forwards the data packet based on the forwarding probability.

[0077] The node forwards the data packet based on the size of P, wherein P is less than or equal to 0%, the data packet is not forwarded, and P is greater than or equal to 100%, the data packet is definitely forwarded.

[0078] In the data transmission method of the mesh network of the embodiment, after a node of the mesh network receives a data packet, the first network depth is obtained from the data packet, and the second network depth of the node itself is obtained, and the node determines the forwarding probability of the data packet based on the first network depth and the second network depth, and forwards the data packet based on the forwarding probability. The embodiment can control the forwarding probability of the received data packet of the node with different network depths, so that the data transmission of the data packet can be completed without passing through the entire mesh network, and therefore the inhibition effect of the network flooding of the mesh network can be improved.

[0079] Further, the embodiment can avoid a part of invalid transmission, reduce the data transmission redundancy of the entire mesh network, reduce the network load, increase the maximum capacity and communication bandwidth of the network.

[0080] As Figure 8As shown, after the node receives the data packet and processes the packet information, the node determines the transmission type of the data packet and determines the forwarding probability of the data packet by using a corresponding algorithm, and determines whether to forward the data packet based on the forwarding probability; after the node determines to forward the data packet, before the node forwards the data packet, further, in response to the transmission type of the data packet being uplink transmission, the second network depth of the node is updated to the network depth field in the data packet to update the first network depth of the data packet, wherein the initial value in the network depth field is the network depth of the source node of the data packet; in response to the transmission type being downlink transmission, the first network depth in the network depth field is maintained, wherein the first network depth is the network depth of the target node of the data packet; and finally the data packet is forwarded.

[0081] The application further provides an electronic device, such as Figure 9 As shown, Figure 9 Fig. 1 is a structural schematic diagram of an embodiment of the electronic device of the application. The electronic device 100 of the embodiment comprises a processor 101, a memory 102 coupled with the processor 101, an input / output device 103, and a bus 104.

[0082] The processor 101, the memory 102, and the input / output device 103 are connected with the bus 104 respectively, and the memory 102 stores program data, and the processor 101 is used to execute the program data to realize the data transmission method.

[0083] In the embodiment, the processor 101 can also be referred to as a CPU (Central Processing Unit). The processor 101 can be an integrated circuit chip with signal processing capability. The processor 101 can 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 devices, discrete gate or transistor logic devices, discrete hardware components. The general-purpose processor can be a microprocessor or the processor 101 can also be any conventional processor or the like.

[0084] The application further provides a computer-readable storage medium, such as Figure 10 As shown, Figure 10 Fig. 1 is a structural schematic diagram of an embodiment of the computer-readable storage medium of the application. The computer-readable storage medium 131 stores program data 132 thereon, and the program data 132 is executed by a processor (not shown in the figure) to realize the data transmission method.

[0085] The computer-readable storage medium 131 of the embodiment can be but is not limited to a U disk, an SD card, a PD optical drive, a mobile hard disk, a large-capacity floppy disk drive, a flash memory, a multimedia memory card, a server, or the like.

[0086] In the data transmission method of the mesh network, after a node of the mesh network receives a data packet, the first network depth is obtained from the data packet and the second network depth of the node itself is obtained, and the node determines the forwarding probability of the data packet based on the first network depth and the second network depth, and forwards the data packet based on the forwarding probability. The application can control the forwarding probability of the node of different network depths to the received data packet, so that the data packet can complete the data transmission without passing through the entire mesh network, thereby improving the suppression effect of network flooding of the mesh network.

[0087] Further, the application can avoid a part of invalid transmission, reduce the data transmission redundancy of the entire mesh network, reduce the network load, increase the maximum capacity and communication bandwidth of the network.

[0088] In addition, when the above functions are realized in the form of software functions and sold or used as independent products, they can be stored in a mobile terminal readable storage medium, that is, the application also provides a storage device storing program data, which can be executed to realize the method of the above embodiments. The storage device can be, for example, a U disk, an optical disk, a server, etc. That is, the application can be embodied in the form of a software product, which includes a plurality of instructions for causing an intelligent terminal to execute all or part of the steps of the method described in each embodiment.

[0089] In the description of the application, the description of the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" means that the specific features, structures, materials or characteristics described in connection with the embodiment or example are included in at least one embodiment or example of the application. In the description, the illustrative description of the above terms does not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described can be combined in any suitable manner in any one or more embodiments or examples. In addition, the skilled in the art can combine and combine the different embodiments or examples described in the specification and the features of the different embodiments or examples without contradiction.

[0090] In addition, the terms "first", "second" are only for descriptive purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include at least one of the features. In the description of the application, the meaning of "a plurality of" is at least two, for example, two, three, etc., unless otherwise specifically limited.

[0091] Any processes or methods described in the flowcharts or otherwise described herein represent embodiments of processes that can be employed, and the scope of preferred embodiments of the present application encompasses numerous additional implementations that would be apparent to those of ordinary skill in the art, such as implementations involving the execution of one or more steps at various times, implementations involving the performance of the steps by a different logic or set of logic devices, implementations involving the performance of the steps by one or more hardware logic devices, implementations involving the performance of the steps by one or more hardware logic devices in combination with software on one or more computing devices, and the like.

[0092] Logic and / or steps represented in the flowcharts or otherwise described herein, for example, can be embodied in computer-readable instructions, such as software and / or data that can be otherwise referred to as computer program code, that is stored in any computer-readable medium. Programs (i.e., software modules) coding routine designs, formulas, commands, and / or data that enables a computer-based system to perform a certain function can be stored in one or more computer-readable medium. As used herein, the term "computer-readable medium" encompasses only the tangible computer-readable media that can be accessed from a general purpose computing device, such as a personal computer, server, network device, or the like. By way of example, and not limitation, a computer-readable medium can comprise RAM, read-only memory (ROM), electrically erasable programmable read only memory (EEPROM), or flash memory. Note that the computer-readable medium could even be paper or another suitable medium upon which the program is printed, as the program can be electronically captured, for example via an optical scanner, and then compiled, interpreted, or otherwise processed in a suitable manner, if necessary, and stored in a computer memory.

[0093] If the technical solutions of the present application involve personal information, the product applying the technical solutions of the present application has been explicitly informed of the personal information processing rules before processing the personal information, and has obtained the personal independent consent. If the technical solutions of the present application involve sensitive personal information, the product applying the technical solutions of the present application has obtained the personal independent consent before processing the sensitive personal information, and at the same time meets the requirement of "explicit consent". For example, at the personal information collection device such as camera, a clear and prominent mark is set to inform that it has entered the personal information collection range and will collect personal information. If the individual voluntarily enters the collection range, it is considered to agree to collect personal information. Or, on the device for processing personal information, the personal information processing rules are informed by using obvious marks / information, and the personal authorization is obtained by means of pop-up information or asking the individual to upload his / her personal information. The personal information processing rules can include personal information processor, personal information processing purpose, processing method and personal information type, etc.

[0094] The above is only an embodiment of the present application, and does not limit the patent scope of the present application. Any equivalent structure or equivalent process transformation using the content of the present application specification and drawings, or direct or indirect application in other related technical fields, are also included in the patent protection scope of the present application.

Claims

1. A method of data transmission for a mesh network, characterized in that, The mesh network is provided with a plurality of nodes, and the data transmission method comprises: The node receives a data packet, obtains a first network depth from the data packet, and obtains a second network depth of itself; The node determines a forwarding probability of the data packet based on the first network depth and the second network depth; The node forwards the data packet based on the forwarding probability; The determination of the forwarding probability of the data packet based on the first network depth and the second network depth comprises: obtaining a difference value between the second network depth and the first network depth; determining the forwarding probability of the data packet based on the difference value; The forwarding probability decreases with the increase of the difference value; Or, the determination of the forwarding probability of the data packet based on the difference value comprises: in response to the difference value being less than or equal to a second threshold value, determining the forwarding probability of the data packet as 1; in response to the difference value being greater than the second threshold value, determining the forwarding probability of the data packet as less than 1, and the forwarding probability decreases with the increase of the difference value; The second threshold value is a natural number greater than or equal to 1; The data packet is provided with a transmission type field and a network depth field, and the network depth field is used to set the first network depth. After forwarding the data packet, the method further comprises: determining the transmission type of the data packet based on the transmission type field in the data packet; in response to the transmission type being uplink transmission, updating the second network depth of the node to the network depth field in the data packet to update the first network depth of the data packet, wherein the initial value in the network depth field is the network depth of the source node of the data packet; in response to the transmission type being downlink transmission, maintaining the first network depth in the network depth field, wherein the first network depth is the network depth of the target node of the data packet.

2. The data transmission method of claim 1, wherein, Further comprising: updating the second network depth of the node itself.

3. The data transmission method of claim 2, wherein, The updating of the second network depth of the node itself comprises: determining a plurality of transmission paths associated with the node; for each transmission path, calculating a hop number weighted value of an attenuation coefficient between nodes; updating the second network depth of the node based on the minimum value in the hop number weighted value.

4. An electronic device, comprising: It comprises: a processor and a memory, the memory storing program data, and the processor being used to execute the program data to realize the data transmission method according to any one of claims 1-3.

5. A computer readable storage medium, characterized in that, The computer readable storage medium stores program data, and the program data can be executed by the processor to realize the data transmission method according to any one of claims 1-3.

Images