CN115915263A - Data transmission method of mesh network, electronic equipment and storage medium - Google Patents

Abstract

The application discloses a data transmission method of a mesh network, electronic equipment and a computer-readable storage medium. The data transmission method of the mesh network includes: the node receives the data packet, obtains the first network depth from the data packet and obtains its own second network depth; the node determines the forwarding probability of the data packet based on the first network depth and the second network depth ; The node forwards the packet based on the forwarding probability. In this way, the effect of suppressing network flooding of the mesh network can be improved.

Description

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

technical field

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

Background technique

Wireless mesh network is a new type of wireless local area network, which can include wifi mesh, bluetooth mesh, zigbeemesh, etc. Nodes in a wireless mesh network can establish multi-hop links and forward related data packets. Network flooding is the method used by mesh technology to transmit information. Network flooding refers to the large-scale and non-directional transmission of data packets on the mesh network. However, excessive and unnecessary network flooding will cause data packet collisions. , network congestion, bandwidth drop and other problems, even lead to network paralysis in severe cases.

In related technologies, when dealing with network flooding in a mesh network, the following two methods are generally adopted: one is to control the unlimited forwarding of data packets based on the number of lives of each data packet; the other is to control the unlimited forwarding of data packets in each Whether the relay (node) cache has forwarded the data packet to prevent repeated forwarding of the same data packet. However, neither of these two solutions can control unnecessary forwarding very well, and the suppression effect of network flooding is poor, because the life count setting in the first method has no effect, and if the setting is too large, the data packet cannot reach the routing exit. Moreover, it is impossible to control the node to forward the same data packet multiple times. The second method can only prevent repeated data packets from being forwarded, and finally each data packet is still transmitted throughout the entire network.

Contents of the invention

The technical problem mainly solved by this application is how to improve the suppression effect of network flooding in the mesh network.

In order to solve the above technical problems, the present application provides a data transmission method of a mesh network. The data transmission method of the mesh network includes: the node receives the data packet, obtains the first network depth from the data packet and obtains its own second network depth; the node determines the forwarding probability of the data packet based on the first network depth and the second network depth ; The node forwards the packet based on the forwarding probability.

In order to solve the above technical problems, the present application provides an electronic device. The electronic device includes: a processor and a memory, wherein program data is stored in the memory, and the processor is used to execute the program data to realize the above-mentioned data transmission method.

In order to solve the above-mentioned technical problems, the present application provides a computer-readable storage medium, which stores program data, and implements the above-mentioned data transmission method when the program data can be executed by a processor.

The beneficial effects of the present application are: in the data transmission method of the mesh network of the present application, after a certain node of the mesh network receives the data packet, the first network depth and the second network depth of the node are obtained from the data packet, and the 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 received data packets by nodes with different network depths, so that the data packets can complete the data transmission without spreading the entire mesh network, thus improving the suppression effect of network flooding in the mesh network.

Furthermore, the present application can avoid part of invalid transmission, reduce data transmission redundancy of the entire mesh network, reduce network load, and increase maximum network capacity and communication bandwidth.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings that need to be used in the description of the embodiments will be briefly introduced below. Obviously, the drawings in the following description are only some embodiments of the present application. For those skilled in the art, other drawings can also be obtained based on these drawings without creative effort.

Fig. 1 is the schematic flow chart of an embodiment of the data transmission method of the mesh network of the present application;

Fig. 2 is a schematic structural diagram of an embodiment of the data packet format of the present application;

Fig. 3 is a schematic structural diagram of another embodiment of the data packet format of the present application;

FIG. 4 is a schematic structural diagram of another embodiment of the data packet format of the present application;

Fig. 5 is a schematic flow chart of an embodiment of an update method of the second network depth in the data transmission method of the mesh network of the present application;

Fig. 6 is a schematic structural diagram of an embodiment of the mesh network of the present application;

Fig. 7 is a specific flow diagram of step S12 in the embodiment of Fig. 1;

8 is a schematic flow diagram of another embodiment of the data transmission method of the mesh network of the present application;

FIG. 9 is a schematic structural diagram of an embodiment of the electronic device of the present application;

Fig. 10 is a schematic structural diagram of an embodiment of a computer-readable storage medium of the present application.

Detailed ways

In the following description, specific details such as specific system structures and technologies are presented for the purpose of illustration rather than limitation, so as to thoroughly understand the embodiments of the present application. It will be apparent, however, to one skilled in the art that the present application may be practiced in other embodiments without these specific details. In other instances, detailed descriptions of well-known systems, devices, circuits, and methods are omitted so as not to obscure the description of the present application with unnecessary detail.

It should be understood that when used in this specification and the appended claims, the term "comprising" indicates the presence of described features, integers, steps, operations, elements and/or components, but does not exclude one or more other features. , whole, step, operation, element, component and/or the presence or addition of a collection thereof.

It should also be understood that the terminology used in the specification of this application is for the purpose of describing particular embodiments only and is not intended to limit the application. As used in this specification and the appended claims, the singular forms "a", "an" and "the" are intended to include plural referents unless the context clearly dictates otherwise.

It should also be further understood that the term "and/or" used in the description of the present application and the appended claims refers to any combination and all possible combinations of one or more of the associated listed items, and includes these combinations .

As used in this specification and the appended claims, the term "if" may be construed as "when" or "once" or "in response to determining" or "in response to detecting" depending on the context . Similarly, the phrase "if determined" or "if [the described condition or event] is detected" may be construed, depending on the context, to mean "once determined" or "in response to the determination" or "once detected [the described condition or event] ]” or “in response to detection of [described condition or event]”.

The following will clearly and completely describe the technical solutions in the embodiments of the present application with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only part of the embodiments of the present application, not all of them. Based on the embodiments in this application, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the scope of protection of this application.

Nodes in the mesh network can establish multi-hop links and forward related data packets; nodes in the mesh network communicate with other nodes in the mesh network through flooding routing, and the mesh network has multiple nodes. The multiple nodes include a node for forwarding data packets, a node for processing application layer services, and a node serving as a network egress.

The present application first proposes a data transmission method of a mesh network, as shown in FIG. 1 , which is a schematic flowchart of an embodiment of a data transmission method of a mesh network of the present application. The data transmission method of this embodiment may be used for a node in a mesh network for forwarding data packets or a node serving as a network egress (hereinafter referred to as an egress node). The data transmission method in this embodiment specifically includes the following steps:

Step S11: The node receives the data packet, obtains the first network depth and obtains its own second network depth from the data packet.

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, it obtains the first network depth and the second network depth of the node itself from the data packet.

The transmission type of the data packet is divided into uplink transmission, that is, the data packet is transmitted from the source node in the mesh network to the mesh network, and transmitted from the exit node to the host computer through the mesh network, and downlink transmission, that is, the data packet is transmitted from the exit node to the mesh network. network and transmit it to the target node of the mesh network.

A mesh network can have one or more exit nodes; each node can calculate the network depth information relative to the exit node.

Wherein, when the data packet is transmitted upstream, 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 of the node; when the data packet is transmitted downstream, the first network depth obtained by the node from the data packet The network depth is the second network depth of the target node.

In order to distinguish these two transmission types, this embodiment modifies the format of the data packet, and sets the transmission type field and the network depth field in the traditional data packet, wherein the network depth field is used to set the first network depth.

In traditional communication protocols, data packets are usually divided into three parts: data header HDR, payload Payload, and verification data crc. In this embodiment, the transmission type field UP/DOWN and the network depth field nwkDepth are inserted into the traditional 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 HDR, there is no need to reinsert it.

The field nwkDepth is used to record the network depth of the data packet. The meaning of the field nwkDepth is different when the data packet is transmitted uplink and downlink. When a data packet is transmitted upstream, the nwkDepth field is used to indicate the network depth of the node sending the data packet, and as the data packet is forwarded by different nodes, this value will change, that is, before the node forwards the data packet, it will The depth is updated to the field nwkDepth of the data packet. When the data packet is transmitted downlink, the field nwkDepth represents the network depth of the target node. Once the data packet is generated, the value in the field nwkDepth will not change during the data packet forwarding process.

The newly added field UP/DOWN and field nwkDepth of the data packet can be added in the middle of the original data message (as shown in FIG. 2 ) or at the end of the original data message (as shown in FIG. 3 ).

When transmitting a data packet in a mesh network with low reliability, a new field Appendcrc can also be added to the data packet to increase the reliability of the data information by adding a checksum (as shown in Figure 4).

The network depth of the exit node can be defined as 0, and the network depth is increased by 1 for each additional hop from top to bottom.

Since other nodes in the mesh network can have multiple different transmission paths relative to the exit node (in the mesh network, each transmission path of a node may be the transmission path for the node to transmit data packets), it can correspond to the minimum number of hops The network depth of the transmission path shall prevail.

Optionally, in order to improve the reliability of the mesh network for data packet transmission, the second network depth of the node itself may be updated based on the data transmission quality of the mesh network. Specifically, the method as shown in FIG. 5 can be used to update the second network depth of the node itself, and the updating method specifically includes steps S51 to S53.

Step S51: Determine multiple transmission paths associated with the nodes.

Compared with the exit node, other nodes in the mesh network can have multiple different transmission paths. For example, as shown in FIG. 6, there are two transmission paths from node A to node C, one is node A-node C, and the other is node A-node B-node C.

Step S52: For each transmission path, calculate the weighted value of the attenuation coefficient between nodes to the number of hops between nodes.

On the same transmission path, the second network depth of other nodes on the transmission path can be determined based on the second network depth of the node close to the exit node and the number of hops and attenuation coefficients between the node and other nodes on the transmission path .

For example, as shown in Figure 6, the second network depth of node A can be determined to be 10 in the same way, and then calculate the attenuation coefficient between node A and node B, and the attenuation coefficient between node B and node C to node A The weighted value of the number of hops between node B and the number of hops between node B and node C; calculate the weighted value of the attenuation coefficient of node A and node C on the number of hops between node A and node C.

Step S53: Updating the second network depth of the node based on the minimum value among the weighted values.

For example, the attenuation coefficient of the transmission path composed of node A-node B-node C is 1, and the number of hops between nodes is 1. The weighted value of the transmission path is 1*1+1*1=2; node A-node The attenuation coefficient of the transmission path composed of C is 3, the number of hops between nodes is 1, the weight value of this transmission path is 1*3=3, if the second network depth of node A is 11, then determine the second network depth of node C The network depth is 12.

It should be noted that the update of the second network depth of the node of the present application and the forwarding of the data packet by the node of the present application are two independent processes, which can be performed separately.

The update of the second network depth of the node can be implemented in two ways, one is update with the package, and the other is active update. Wherein, when updating with the packet, the node can dynamically evaluate its second network depth according to the data packet it receives, for example, by using a delay-weighted sliding algorithm. When actively updating, you can use regular active detection or active detection depending on the situation (for example, when the network is stuck, the current network load is relatively small), such as the exit node (the second network depth is defined as 0, no update is required) can actively initiate network depth update, So that each node can immediately update its own second network depth.

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

Optionally, this embodiment may implement step S12 through the method shown in FIG. 7 , and the method of this embodiment may include step S71 and step S72.

Step S71: the node acquires the difference between the second network depth and the first network depth.

When the data packet is transmitted uplink, the node that receives the data packet calculates its own second network depth and the first network depth of the node that forwarded the data packet last time (the node that forwarded the data packet last time updates its second network depth to the field nwkDepth of the packet as the difference between the first network depth).

When the data packet is transmitted downlink, the node receiving the data packet calculates the difference between its own 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 The field nwkDepth is used as the first network depth of the data packet.

Step S72: Determine the forwarding probability of the data packet based on the difference.

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

The principle of data packet uplink transmission is to try to make the data packet transmit towards the direction with low network depth. When any node receives a data packet, if the second network depth selfDepth of the node receiving the data packet is smaller than the nwkDepth of the received data packet, then the data packet is 100% forwarded. If the second network depth selfDepth of the node of the received data packet is greater than the nwkDepth of the received data packet, then the data packet is probabilistically forwarded. For example, a node can update its own selfDepth to the nwkDepth field. For example, if the node's own selfDepth=2 and receives an uplink data packet with nwkDepth=4, it decides to forward the data packet and sets the nwkDepth of the data packet to 2. Forward the packet. When this data packet is subsequently received by other nodes, the nwkDepth field is 2.

When the data packet is transmitted downlink, the egress node will set the second network depth of the destination node of the data packet to the nwkDepth field of the data packet, and this value will not be modified during 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.

Optionally, in this embodiment, step S72 may be implemented through step S81 and step S82.

Step S81: In response to the difference being greater than the first threshold, determine that the forwarding probability of the data packet is 0.

In response to the difference being greater than the first threshold, the node determines that the forwarding probability of the data packet is 0, and does not forward the data packet.

Step S82: In response to the difference being less than or equal to the first threshold, determine that the forwarding probability of the data packet is 1; wherein, the first threshold is a natural number greater than or equal to 1.

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

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

In a specific application scenario, the first threshold may be 1, and the data packets whose difference is greater than 1 are not forwarded, and the rest are forwarded. When the data packet is transmitted upstream, such as nwkDepth=5 of the data packet, selfDepth=6 of the node receiving the data packet, the calculated P=100%, forward the school bag; If selfDepth=7, the calculated P=0%, the data packet is not forwarded; for another example, if nwkDepth=5 of the data packet, selfDepth=4 of the node receiving the data packet, the calculated P=300%, the data packet is forwarded.

When the data packet is transmitted downlink, if the second network depth of the target node of the data packet is 5, then if the nwkDepth value of the data packet is 5 and will not be modified during the forwarding process of the data packet, if the selfDepth of the node of the data packet= 2. Calculate P=500%, forward the data packet; if the selfDepth of the node receiving the data packet=6, calculate P=100%, forward the data packet; if the selfDepth of the node receiving the data packet=7, calculate P=0%, the data packet is not forwarded.

In another embodiment, the forwarding probability in step S12 may decrease as the difference increases. For example, the forwarding probability P satisfies the following conditions: P=100%–(selfDepth–

nwkDepth)*B%; wherein, B is the change amount of forwarding probability to difference unit change amount.

As the gap between the depth of the second network and the depth of the first network increases, the forwarding probability becomes smaller and smaller. For example, every time the difference increases by 1, the forwarding probability decreases by 25% (B=25%), that is, p=100%-(selfDepth−nwkDepth)*25%. Nodes with a difference greater than or equal to 4 do not forward the data packet. For example, when a data packet is transmitted upstream, if nwkDepth=10 of the data packet, selfDepth=11 of the node receiving the data packet, the calculated P=75%, means that the data packet has a 75% probability of being forwarded; if the node receiving the data packet If the selfDepth=8, the calculated P=150%, the data packet is forwarded; if the selfDepth=14 of the node receiving the data packet, the calculated P=0%, the data packet is not forwarded. When the data packet is transmitted downlink, a similar method may also be used to obtain the forwarding probability of the data packet, which will not be repeated here.

In another embodiment, the following method can also be used to implement step S12:

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 sending probability decreases as the difference increases; wherein the second threshold is a natural number greater than or equal to 1.

In a specific application scenario, the second threshold can be 2, and the difference is within 2, all forwarding, and the difference is more than 2, and the forwarding probability decreases by 33.3% for every increase of the difference, that is, P=1–

(selfDepth–nwkDepth–2)*20%.

The uplink algorithm and the downlink algorithm can be set differently, and are optimized according to their respective situations, and will not be repeated here.

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

The node forwards the data packet based on the size of P above. If P is less than or equal to 0%, the data packet will not be forwarded, and if P is greater than or equal to 100%, the data packet must be forwarded.

In the data transmission method of the mesh network in this embodiment, after a certain node of the mesh network receives the data packet, the first network depth and the second network depth of the node are obtained from the data packet, and the node is based on the first network depth And the second network depth determines the forwarding probability of the data packet, and forwards the data packet based on the forwarding probability. This embodiment can control the forwarding probability of received data packets by nodes with different network depths, so that the data packets can complete the data transmission without spreading the entire mesh network, and thus can improve the suppression effect of network flooding in the mesh network.

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

As shown in Figure 8, after the node receives the data packet and processes the accompanying information, determine the transmission type of the data packet, and use the corresponding algorithm to determine the forwarding probability of the data packet, and determine 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 sending 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 receiving the data packet; finally forward the data packet.

The present application further proposes an electronic device, as shown in FIG. 9 , which is a schematic structural diagram of an embodiment of the electronic device of the present application. The electronic device 100 in this embodiment includes a processor 101 , a memory 102 coupled to the processor 101 , an input and output device 103 and a bus 104 .

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

In this embodiment, the processor 101 may also be referred to as a CPU (Central Processing Unit, central processing unit). The processor 101 may 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 may be a microprocessor or the processor 101 may be any conventional processor or the like.

The present application further proposes a computer-readable storage medium, as shown in FIG. 10 , which is a schematic structural diagram of an embodiment of the computer-readable storage medium of the present application. The computer-readable storage medium 131 stores program data 132 thereon, and when the program data 132 is executed by a processor (not shown in the figure), the above-mentioned data transmission method is implemented.

The computer-readable storage medium 131 of this embodiment may be, but not limited to, a USB flash drive, an SD card, a PD optical drive, a mobile hard disk, a large-capacity floppy drive, a flash memory, a multimedia memory card, a server, and the like.

In the data transmission method of the mesh network of the present application, after a certain node of the mesh network receives the data packet, the first network depth and the second network depth of the node are obtained from the data packet, and the node is based on the first network depth and The second network depth determines the forwarding probability of the data packet, and forwards the data packet based on the forwarding probability. The application can control the forwarding probability of received data packets by nodes with different network depths, so that the data packets can complete the data transmission without spreading the entire mesh network, thus improving the suppression effect of network flooding in the mesh network.

Furthermore, the present application can avoid part of invalid transmission, reduce data transmission redundancy of the entire mesh network, reduce network load, and increase maximum network capacity and communication bandwidth.

In addition, if the above-mentioned functions are implemented in the form of software functions and sold or used as independent products, they can be stored in a storage medium that can be read by a mobile terminal, that is, the application also provides a storage device that stores program data, so The above program data can be executed to implement the methods of the above embodiments, and the storage device can be, for example, a U disk, an optical disk, a server, and the like. That is to say, the present application may be embodied in the form of a software product, which includes several instructions for enabling an intelligent terminal to execute all or part of the steps of the method described in each embodiment.

In the description of this application, reference to the terms "one embodiment," "some embodiments," "example," "specific examples," or "some examples" means that specific features described in connection with that embodiment or example , structure, material or characteristic is included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the described specific features, structures, materials or characteristics may be combined in any suitable manner in any one or more embodiments or examples. In addition, those skilled in the art can combine and combine different embodiments or examples and features of different embodiments or examples described in this specification without conflicting with each other.

In addition, the terms "first" and "second" are used for descriptive purposes only, and cannot be interpreted as indicating or implying relative importance or implicitly specifying the quantity of indicated technical features. Thus, the features defined as "first" and "second" may explicitly or implicitly include at least one of these features. In the description of the present application, "plurality" means at least two, such as two, three, etc., unless otherwise specifically defined.

Any process or method descriptions in flowcharts or otherwise described herein may be understood to represent modules, segments or portions of code comprising one or more executable instructions for implementing specific logical functions or steps of the process , and the scope of preferred embodiments of the present application includes additional implementations in which functions may be performed out of the order shown or discussed, including in substantially simultaneous fashion or in reverse order depending on the functions involved, which shall It should be understood by those skilled in the art to which the embodiments of the present application belong.

The logic and/or steps represented in the flowcharts or otherwise described herein, for example, can be considered as a sequenced listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium, For the use of instruction execution systems, devices or equipment (which may be personal computers, servers, network equipment or other systems that can fetch instructions from instruction execution systems, devices or devices and execute instructions), or in combination with these instruction execution systems, devices or devices And use. For the purposes of this specification, a "computer-readable medium" may be any device that can contain, store, communicate, propagate or transmit a program for use in or in conjunction with an instruction execution system, device or device. More specific examples (non-exhaustive list) of computer-readable media include the following: electrical connection with one or more wires (electronic device), portable computer disk case (magnetic device), random access memory (RAM), Read Only Memory (ROM), Erasable and Editable Read Only Memory (EPROM or Flash Memory), Fiber Optic Devices, and Portable Compact Disc Read Only Memory (CDROM). In addition, the computer-readable medium may even be paper or other suitable medium on which the program can be printed, since the program can be read, for example, by optically scanning the paper or other medium, followed by editing, interpretation or other suitable processing if necessary. The program is processed electronically and stored in computer memory.

If the technical solution of this application involves personal information, the product applying the technical solution of this application has clearly notified the personal information processing rules and obtained the individual's independent consent before processing personal information. If the technical solution of this application involves sensitive personal information, the products applying the technical solution of this application have obtained individual consent before processing sensitive personal information, and at the same time meet the requirements of "express consent". For example, at a personal information collection device such as a camera, a clear and prominent sign is set up to inform that it has entered the scope of personal information collection, and personal information will be collected. If an individual voluntarily enters the collection scope, it is deemed to agree to the collection of his personal information; or On the personal information processing device, when the personal information processing rules are informed with obvious signs/information, personal authorization is obtained through pop-up information or by asking individuals to upload their personal information; among them, the personal information processing rules may include Information such as the information processor, the purpose of personal information processing, the method of processing, and the type of personal information processed.

The above is only an embodiment of the application, and does not limit the patent scope of the application. Any equivalent structure or equivalent process conversion made by using the specification and drawings of the application, or directly or indirectly used in other related technologies fields, are all included in the scope of patent protection of this application in the same way.

Claims (10)

1. A data transmission method of a mesh network is characterized in that the mesh network is provided with a plurality of nodes, and the data transmission method comprises the following steps:

the node receives a data packet, and acquires a first network depth and a second network depth from the data packet;

the node determining a forwarding probability for 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.

2. The data transmission method according to claim 1, wherein the data packet is provided with a transmission type field and a network depth field, the network depth field is used for setting the first network depth, and after the data packet is forwarded, the method further comprises:

determining a transmission type of the data packet based on the transmission type field in the data packet;

in response to that the transmission type is uplink transmission, updating a second network depth of the node into the network depth field in the data packet to update a first network depth of the data packet, wherein an initial value in the network depth field is a network depth of a source node which sends the data packet;

and in response to the transmission type being downlink transmission, maintaining a first network depth in the network depth field, wherein the first network depth is a network depth of a target node receiving the data packet.

3. The data transmission method of claim 2, wherein the determining the forwarding probability for the data packet based on the first network depth and the second network depth comprises:

obtaining a difference between the second network depth and the first network depth;

determining a forwarding probability for the packet based on the difference.

4. The method of claim 3, wherein the determining the forwarding probability for the data packet based on the difference value comprises:

in response to the difference being greater than a first threshold, determining that a forwarding probability for the data packet is 0;

in response to the difference value being less than or equal to the first threshold value, determining that the forwarding probability for the data packet is 1;

wherein the first threshold is a natural number greater than or equal to 1.

5. A method according to claim 3, characterized in that the forwarding probability decreases as the difference increases.

6. The data transmission method of claim 3, wherein the determining the forwarding probability for the data packet based on the difference value comprises:

in response to the difference being less than or equal to a second threshold, determining that the forwarding probability for the data packet is 1;

in response to the difference being greater than the second threshold, determining that a forwarding probability for the packet is less than 1, and the forwarding probability decreases as the difference increases;

wherein the second threshold is a natural number greater than or equal to 1.

7. The data transmission method according to any one of claims 1 to 6, further comprising:

updating the second network depth of the node itself.

8. The data transmission method according to claim 7, wherein the updating the second network depth of the node itself comprises:

determining a plurality of transmission paths associated with the node;

calculating the weighted value of the attenuation coefficient between the nodes to the hop count between the nodes aiming at each transmission path;

updating the second network depth of the node based on a minimum of the weighting values.

9. An electronic device, comprising: a processor and a memory, the memory having stored therein program data, the processor being configured to execute the program data to implement the data transfer method of any of claims 1-8.

10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores program data which, when executed by a processor, implements the data transmission method according to any one of claims 1 to 8.

Images