CN115915263A - Data transmission method of mesh network, electronic equipment and storage medium - Google Patents
Data transmission method of mesh network, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN115915263A CN115915263A CN202211308058.3A CN202211308058A CN115915263A CN 115915263 A CN115915263 A CN 115915263A CN 202211308058 A CN202211308058 A CN 202211308058A CN 115915263 A CN115915263 A CN 115915263A
- Authority
- CN
- China
- Prior art keywords
- data packet
- node
- network depth
- network
- data
- 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.)
- Pending
Links
Images
Classifications
-
- 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 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 comprises the following steps: the method comprises the steps that a node receives a data packet, and a first network depth and a second network depth of the node are obtained from the data packet; the node determines the forwarding probability of the data packet based on the first network depth and the second network depth; and forwarding the data packet by the node based on the forwarding probability. By the method, the effect of inhibiting the network flooding of the mesh network can be improved.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to a data transmission method for a mesh network, an electronic device, and a computer-readable storage medium.
Background
The wireless mesh network is a new wireless local area network type and can include wifi mesh, bluetooth mesh, zigbee mesh, and the like. Multi-hop links can be established between nodes in the wireless mesh network and relevant data packets can be forwarded. Network flooding is a method for transmitting information by using a mesh technology, and refers to large-scale and non-directional transmission of data packets on a mesh network, but excessive and unnecessary network flooding can cause problems of data packet collision, network congestion, bandwidth reduction and the like, and even network paralysis can be caused in severe cases.
In the related art, when handling network flooding of the mesh network, the following two methods are generally adopted: one is that unlimited forwarding of data packets is controlled based on the number of lives of each data packet; alternatively, each relay (node) buffers whether the packet is forwarded or not, so as to prevent the same packet from being repeatedly forwarded. However, both of these two schemes cannot well control unnecessary forwarding, and the suppression effect of network flooding is poor, because the first method has no effect in setting the number of lives, which may result in that the data packet cannot reach the route exit, and the node cannot be controlled to forward the same data packet many times, and the second method only can prevent forwarding repeated data packets, and finally each data packet still passes through the whole network.
Disclosure of Invention
The method mainly solves the technical problem of how to improve the network flooding suppression effect of the mesh network.
In order to solve the technical problem, the application provides a data transmission method of a mesh network. The data transmission method of the mesh network comprises the following steps: the method comprises the steps that a node receives a data packet, and a first network depth and a second network depth of the node are obtained from the data packet; the node determines the forwarding probability of the data packet based on the first network depth and the second network depth; and forwarding the data packet by the node based on the forwarding probability.
In order to solve the technical problem, the application provides an electronic device. The electronic device includes: the processor is used for executing the program data to realize the data transmission method.
In order to solve the above technical problem, the present application provides a computer-readable storage medium storing program data, which can be executed by a processor to implement the above data transmission method.
The beneficial effect of this application is: according to the data transmission method of the mesh network, after a certain node of the mesh network receives a data packet, a first network depth and a second network depth of the node are obtained from the data packet, 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 method and the device can control the forwarding probability of the received data packet by the nodes with different network depths, so that the data packet can be transmitted without being transmitted through the whole mesh network, and the network flooding suppression effect of the mesh network can be improved.
Furthermore, the method and the device can avoid part of invalid transmission, reduce the data transmission redundancy of the whole mesh network, reduce the network load and increase the maximum capacity and the communication bandwidth of the network.
Drawings
In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings without creative efforts.
Fig. 1 is a schematic flow chart of an embodiment of a data transmission method of a mesh network according to the present application;
FIG. 2 is a block diagram of an embodiment of the present application packet format;
FIG. 3 is a schematic diagram of another embodiment of the present application;
FIG. 4 is a block diagram of another embodiment of the packet format of the present application;
fig. 5 is a schematic flowchart of an embodiment of a method for updating a second network depth in a data transmission method of a mesh network according to the present application;
fig. 6 is a schematic structural diagram of an embodiment of a mesh network according to the present application;
FIG. 7 is a flowchart illustrating a specific process of step S12 in the embodiment of FIG. 1;
fig. 8 is a schematic flow chart of another embodiment of a data transmission method of a mesh network according to the present application;
FIG. 9 is a schematic block diagram of an embodiment of an 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 Description
In the following description, for purposes of explanation and not limitation, specific details are set forth, such as particular system structures, techniques, etc. in order to provide a thorough understanding of 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 that depart from 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 will be understood that the terms "comprises" and/or "comprising," when used in this specification and the appended 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.
It is also to be understood that the terminology used in the description of the present application herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used in the specification of the present application 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.
It should be further understood that the term "and/or" as used in this specification and the appended claims refers to and includes any and all possible combinations of one or more of the associated listed items.
As used in this specification and the appended claims, the term "if" may be interpreted contextually as "when", "upon" or "in response to a determination" or "in response to a detection". Similarly, the phrase "if it is determined" or "if a [ described condition or event ] is detected" may be interpreted contextually to mean "upon determining" or "in response to determining" or "upon detecting [ described condition or event ]" or "in response to detecting [ described condition or event ]".
The technical solutions in the embodiments of the present application will be described clearly and completely with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
multi-hop links can be established among nodes in the mesh network and relevant data packets can be forwarded; the nodes in the mesh network communicate with other nodes in the mesh network in a flooding routing mode, the mesh network is provided with a plurality of nodes, and the plurality of nodes comprise nodes for forwarding data packets, nodes for processing application layer services and nodes serving as network outlets.
The present application first proposes a data transmission method of a mesh network, as shown in fig. 1, where fig. 1 is a schematic flow diagram of an embodiment of the data transmission method of the mesh network of the present application. The data transmission method of this embodiment may be used for a node in the mesh network for forwarding a data packet or a node serving as a network exit (hereinafter referred to as an egress node). The data transmission method of the embodiment specifically includes the following steps:
step S11: and the node receives the data packet, and acquires the first network depth and the second network depth from the data packet.
The data packet is transmitted through the mesh network, and after receiving the data packet, the node in the mesh network acquires a first network depth and a second network depth of the node from the data packet.
The transmission types of the data packets are uplink transmission, namely the data packets are transmitted to the mesh network from a source node in the mesh network and transmitted to an upper computer from an outlet node through the mesh network, and downlink transmission, namely the data packets are transmitted to the mesh network from the outlet node and transmitted to a target node of the mesh network.
The mesh network may be provided with one or more egress nodes; each node may calculate network depth information relative to the egress node.
When the data packet is transmitted in an uplink mode, a first network depth acquired by a node from the data packet is a second network depth of a previous node of the node for forwarding the data packet; and when the data packet is transmitted in a downlink mode, the first network depth acquired by the node from the data packet is the second network depth of the target node.
In order to distinguish the two transmission types, the present embodiment modifies the format of the data packet, and sets a transmission type field and a network depth field in the conventional data packet, where the network depth field is used to set the first network depth.
In a conventional communication protocol, a data packet is generally divided into three parts, namely a data header HDR, a Payload and check data crc. In the embodiment, a transmission type field UP/DOWN and a network depth field nwkDepth are inserted into a conventional data packet. UP/DOWN indicates whether the transmission type of the data packet is uplink transmission or downlink transmission. If there are fields UP/DOWN already in the HDR, no reinsertion is needed.
The field nwkDepth is used to record the network depth of the packet. The significance of the field nwkDepth is different when the data packet is transmitted in uplink and downlink. When a data packet is transmitted in an uplink mode, the nwkDepth field is used for indicating the network depth of a node sending the data packet, and the value changes as the data packet is forwarded by different nodes, that is, the node updates the network depth of the node to the nwkDepth field of the data packet before forwarding the data packet. When the data packet is transmitted in a downlink manner, the field nwkDepth represents the network depth of a target node, and once the data packet is generated, the value in the field nwkDepth is not changed in the process of forwarding the data packet.
The newly added fields UP/DOWN and nwkDepth of the packet may be added in the middle of the original data packet (as shown in fig. 2) or at the end of the original data packet (as shown in fig. 3).
When the data packet is transmitted in the mesh network with low reliability, a field appendix crc may be added in the data packet, and the reliability of the data information is increased by adding a check (as shown in fig. 4).
The network depth of the egress node may be defined as 0, and from top to bottom, the network depth is increased by 1 for every hop increase.
Because other nodes in the mesh network may have a plurality of different transmission paths relative to the egress node (in the mesh network, each transmission path of a node may be a transmission path through which the node transmits a data packet), the network depth of the transmission path corresponding to the minimum hop count may be used as a criterion.
Optionally, in order to improve the reliability of the mesh network for data packet transmission, the second network depth of the node itself may also be updated based on the data transmission quality of the mesh network. Specifically, the method as described in fig. 5 may be adopted to implement the update of the second network depth of the node itself, and the update method specifically includes step S51 to step S53.
Step S51: a plurality of transmission paths associated with the node are determined.
Other nodes in the mesh network may have a plurality of different transmission paths with respect to the egress node. For example, as shown in fig. 6, 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.
Step S52: and calculating the weighted value of the attenuation coefficient between the nodes to the hop count between the nodes aiming at each transmission path.
On the same transmission path, the second network depth of other nodes on the transmission path may be determined based on the second network depth of the node close to the egress node and the number of hops and attenuation coefficients between the node and other nodes on the transmission path.
For example, as shown in fig. 6, the second network depth of node a may be determined to be 10 in the same manner, and then the weighted values of the attenuation coefficient between node a and node B, the attenuation coefficient between node B and node C, and the hop count between node a and node B, and the hop count between node B and node C are calculated; and calculating the weighted value of the attenuation coefficients of the node A and the node C to the hop count between the node A and the node C.
Step S53: the second network depth of the node is updated based on the minimum of the weighted values.
For example, the attenuation coefficient of a transmission path formed by the nodes a, B, and C is 1, the hop count between the nodes is 1, and the weighted value of the transmission path is 1+ 1=2; the attenuation coefficient of a transmission path formed by the nodes a and C is 3, the hop count between the nodes is 1, the weighted value of the transmission path is 1 × 3=3, and if the second network depth of the node a is 11, the second network depth of the node C is determined to be 12.
It should be noted that the updating 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 may be performed separately.
The update regarding the second network depth of the node may be implemented in two ways, one with packet update and the other with proactive update. When the packet is updated, the node may dynamically evaluate its second network depth according to the received data packet, for example, by using a delay weighted sliding algorithm. During active updating, timing active detection or optional active detection (for example, when the network is in a halt state, and the current network load is relatively small) may be adopted, for example, an egress node (the second network depth is defined as 0, and no update is required) may actively initiate a network depth update, so that each node may immediately update its own second network depth.
Step S12: the node determines a forwarding probability for the packet based on the first network depth and the second network depth.
Alternatively, the present embodiment may implement step S12 by the method shown in fig. 7, and the method of the present embodiment may include step S71 and step S72.
Step S71: the node obtains a difference between the second network depth and the first network depth.
When the data packet is transmitted in an uplink mode, the node receiving the data packet calculates the difference between the second network depth of the node and the first network depth of the node which forwards the data packet last time (the node which forwards the data packet last time updates the second network depth of the node into the field nwkDepth of the data packet as the first network depth).
When the data packet is transmitted in a downlink mode, the node receiving the data packet calculates the difference value between the second network depth of the node and the second network depth of the target node, and the second network depth of the target node is always stored in the field nwkDepth in the forwarding process of the data packet and serves as the first network depth of the data packet.
Step S72: a forwarding probability for the packet is determined based on the difference.
The node receiving the data packet determines a forwarding probability for the data packet based on the difference.
The principle of upstream transmission of data packets is to make the data packets transmit in the direction of low network depth. Any node receives the packet and forwards the packet 100% if the second network depth selfDepth of the node of the received packet is less than nwkDepth of the received packet. If the second network depth selfdept of the node of the received packet is greater than nwkDepth of the received packet, the packet is probabilistically forwarded. For example, a node may update its self-selefdepth into the nwkDepth field, for example, if the self-selefdepth =2 of the node receives an upstream packet nwkDepth =4, decides to forward this packet, sets nwkDepth of the packet to 2, and forwards the packet. The nwkDepth field is 2 when this subsequent packet is received by other nodes.
When the data packet is transmitted in a downlink manner, the outlet 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 selfDepth of the node receiving the data packet is larger than nwkDepth of the data packet, the forwarding probability is appropriately reduced.
Alternatively, the present embodiment may implement step S72 through step S81 and step S82.
Step S81: and in response to the difference being greater than the first threshold, determining that the forwarding probability for the data packet is 0.
And responding to the difference value being larger than the first threshold value, 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, 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.
And responding to the difference value being less than or equal to the first threshold value, 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 a first threshold and selfDepth is a second net depth.
In a specific application scenario, the first threshold may be 1, and for a data packet with a difference greater than 1, the data packet is not forwarded, and the rest of the data packets are forwarded. When the data packet is transmitted in an uplink manner, if nwkDepth =5 of the data packet, and selfDepth =6 of a node receiving the data packet, calculating to obtain P =100%, and forwarding the data packet; if nwkDepth =5 of the data packet, and selfDepth =7 of the node receiving the data packet, calculating to obtain P =0%, and not forwarding the data packet; also for example, nwkddepth =5 of the packet, self depth =4 of the node receiving the packet, P =300% is calculated, and the packet is forwarded.
When the data packet is transmitted in a downlink manner, if the second network depth of the target node of the data packet is 5, if the nwkDepth value of the data packet is 5 and is not modified any more in the forwarding process of the data packet, if the self Depth =2 of the node of the data packet, P =500% is obtained through calculation, and the data packet is forwarded; if selfDepth =6 of the node receiving the data packet, calculating to obtain P =100%, and forwarding the data packet; if selfDepth =7 of the node receiving the data packet, P =0% is calculated, and 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 condition: p =100% - (self Depth-
nwkDepth) B%; wherein, B is the variation of the forwarding probability to the variation of the difference unit.
The forwarding probability becomes smaller and smaller as the difference between the second network depth and the first network depth increases. For example, for every 1 increase in the difference, the forwarding probability decreases by 25% (B = 25%), i.e. p =100% - (selfDepth-nwkDepth) · 25%. And the nodes with the difference value larger than or equal to 4 do not forward the data packet. For example, when a data packet is transmitted in an uplink, if nwkddepth =10, self depth =11 of a node receiving the data packet is calculated to obtain P =75%, which indicates that the data packet has a probability of being forwarded by 75%; if selfDepth =8 of the node receiving the data packet, calculating to obtain P =150%, and forwarding the data packet; if selfDepth =14 of the node receiving the data packet, P =0% is calculated, and the data packet is not forwarded. When the data packet is transmitted in the downlink, the forwarding probability of the data packet may also be obtained by using a similar method, which is not described in detail.
In another embodiment, the step S12 can be implemented by the following method:
and in response to the difference value being less than or equal to the second threshold value, determining that the forwarding probability for the data packet is 1. In response to the difference being greater than a second threshold, determining that the forwarding probability for the data 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.
In a specific application scenario, the second threshold may be 2, the difference is forwarded within 2, the difference is greater than 2, and the forwarding probability is reduced by 33.3% every time the difference is increased by one, that is, P =1-
(selfDepth–nwkDepth–2)*20％。
The uplink algorithm and the downlink algorithm can be set differently and optimized according to respective conditions, which is not described in detail.
Step S13: and forwarding the data packet by the node based on the forwarding probability.
And the node forwards the data packet based on the size of the P, wherein the P is less than or equal to 0%, the data packet is not forwarded, and the P is greater than or equal to 100%, and the data packet is forwarded definitely.
In the data transmission method of the mesh network in this embodiment, after a node of the mesh network receives a data packet, a first network depth and a second network depth of the node are obtained from the data packet, and the node determines a forwarding probability for 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 by the nodes with different network depths, so that the data packet can be transmitted without being transmitted through the whole mesh network, and the network flooding inhibition effect of the mesh network can be improved.
Further, the embodiment can avoid a part of invalid transmission, reduce the data transmission redundancy of the whole mesh network, reduce the network load, and increase the maximum capacity and the communication bandwidth of the network.
As shown in fig. 8, after a node receives a data packet and processes packet-following information, a transmission type of the data packet is determined, a forwarding probability of the data packet is determined by using a corresponding algorithm, and whether to forward the data packet is determined 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 that the transmission type of the data packet is uplink transmission, updating a second network depth of the node into a 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 the network depth of a source node sending the data packet; 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; and finally forwarding the data packet.
The present application further provides an electronic device, as shown in fig. 9, fig. 9 is a schematic structural diagram of an embodiment of the electronic device of the present application. The electronic device 100 of the present embodiment includes a processor 101, a memory 102 coupled to the processor 101, an input/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 configured to execute the program data to implement the data transmission method.
In the present embodiment, the processor 101 may also be referred to as a CPU (Central Processing Unit). The processor 101 may be an integrated circuit chip having signal processing capabilities. The processor 101 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 101 may be any conventional processor or the like.
The present application further provides a computer-readable storage medium, as shown in fig. 10, fig. 10 is a schematic structural diagram of an embodiment of the computer-readable storage medium of the present application. The computer-readable storage medium 131 has stored thereon program data 132, the program data 132 implementing the above-described data transmission method when executed by a processor (not shown).
The computer-readable storage medium 131 of this embodiment may be, but is not limited to, a usb disk, an SD card, a PD optical drive, a removable hard disk, a high-capacity floppy drive, a flash memory, a multimedia memory card, a server, etc.
According to the data transmission method of the mesh network, after a certain node of the mesh network receives a data packet, a first network depth and a second network depth of the node are obtained from the data packet, 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 method and the device can control the forwarding probability of the received data packet by the nodes with different network depths, so that the data packet can be transmitted without passing through the whole mesh network, and the network flooding suppression effect of the mesh network can be improved.
Furthermore, the method and the device can avoid part of invalid transmission, reduce the data transmission redundancy of the whole mesh network, reduce the network load and increase the maximum capacity and the communication bandwidth of the network.
In addition, if the above functions are implemented in the form of software functions and sold or used as a standalone product, the functions may be stored in a storage medium readable by a mobile terminal, that is, the present application also provides a storage device storing program data, which can be executed to implement the method of the above embodiments, the storage device may be, for example, a usb disk, an optical disk, a server, etc. That is, the present application may be embodied as a software product, which includes several instructions for causing an intelligent terminal to perform all or part of the steps of the methods described in the embodiments.
In the description of the present application, reference to the description of "one embodiment," "some embodiments," "an example," "a specific example," or "some examples" or the like is intended to mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the present application. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Moreover, various embodiments or examples and features of various embodiments or examples described in this specification can be combined and combined by one skilled in the art without being mutually inconsistent.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present application, "plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and the scope of the preferred embodiments of the present application includes other implementations in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the present application.
The logic and/or steps represented in the flowcharts or otherwise described herein, such as an ordered listing of executable instructions that can be viewed as implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device (e.g., a personal computer, server, network device, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions). For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). Additionally, 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, via for instance optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner if necessary, and then stored in a computer memory.
If the technical scheme of the application relates to personal information, a product applying the technical scheme of the application clearly informs personal information processing rules before processing the personal information, and obtains personal independent consent. If the technical scheme of the application relates to sensitive personal information, before the sensitive personal information is processed, a product applying the technical scheme of the application obtains individual consent and simultaneously meets the requirement of 'explicit consent'. For example, at a personal information collection device such as a camera, a clear and significant identifier is set to inform that the personal information collection range is entered, the personal information is collected, and if the person voluntarily enters the collection range, the person is regarded as agreeing to collect the personal information; or on the device for processing the personal information, under the condition of informing the personal information processing rule by using obvious identification/information, obtaining personal authorization in the modes of pop-up window information or asking the person to upload personal information thereof and the like; the personal information processing rule may include information such as a personal information processor, a personal information processing purpose, a processing method, and a type of personal information to be processed.
The above description is only an example of the present application and is not intended to limit the scope of the present application, and all modifications of equivalent structures and equivalent processes, which are made by the contents of the specification and the drawings, or which are directly or indirectly applied to other related technical fields, are intended to be included within the scope of the present application.
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.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211308058.3A CN115915263A (en) | 2022-10-24 | 2022-10-24 | Data transmission method of mesh network, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211308058.3A CN115915263A (en) | 2022-10-24 | 2022-10-24 | Data transmission method of mesh network, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115915263A true CN115915263A (en) | 2023-04-04 |
Family
ID=86486301
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211308058.3A Pending CN115915263A (en) | 2022-10-24 | 2022-10-24 | Data transmission method of mesh network, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115915263A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117201388A (en) * | 2023-11-06 | 2023-12-08 | 浙江大华技术股份有限公司 | Network node control method, electronic device, and computer-readable storage medium |
-
2022
- 2022-10-24 CN CN202211308058.3A patent/CN115915263A/en active Pending
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117201388A (en) * | 2023-11-06 | 2023-12-08 | 浙江大华技术股份有限公司 | Network node control method, electronic device, and computer-readable storage medium |
| CN117201388B (en) * | 2023-11-06 | 2024-02-02 | 浙江大华技术股份有限公司 | Network node control method, electronic device, and computer-readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109756903B (en) | Method and related apparatus for optimizing a moving edge computing system | |
| US11824771B2 (en) | Packet processing method, related device, and computer storage medium | |
| KR101986929B1 (en) | A method for routing packets, a multi-hop wireless network, and a node that routes packets | |
| EP1850538A1 (en) | Radio communication device, communication route control device, communication route control method, and communication system | |
| US20130279339A1 (en) | Communication device and method | |
| JP5706989B2 (en) | Method for establishing on-demand route and network node apparatus | |
| US20230283492A1 (en) | Traffic charging method, network device and storage medium | |
| CN115915263A (en) | Data transmission method of mesh network, electronic equipment and storage medium | |
| US20130343195A1 (en) | Congestion control method and wireless communication equipment | |
| KR20230023775A (en) | Flow control method and device | |
| EP1434389A2 (en) | Communication apparatus in radio network, transmission control method, threshold value control method, and radio network system | |
| JP6201669B2 (en) | COMMUNICATION METHOD, COMMUNICATION DEVICE, COMMUNICATION PROGRAM, AND COMMUNICATION SYSTEM | |
| JPWO2018150514A1 (en) | Communication terminal, communication method and communication program in wireless ad hoc network | |
| CN109039896B (en) | Routing method and device suitable for spatial information network | |
| JP4881194B2 (en) | Wireless communication system, wireless communication apparatus, and wireless communication method | |
| US7787475B2 (en) | Apparatus for processing a received signal in a communication network | |
| EP3051919B1 (en) | Device and method for wireless communication used in wireless ad hoc network | |
| US10965585B2 (en) | Method for transmitting path load information and network node | |
| JP5648743B2 (en) | Data communication method and data communication system | |
| CN113422637A (en) | Data packet forwarding method and device, electronic equipment and storage medium | |
| CN108055679B (en) | Mesh network flow control method | |
| CN111629416A (en) | Message transmission method, system, terminal device and computer readable storage medium | |
| CN114630344A (en) | Rerouting method and device and communication equipment | |
| Chong et al. | Mitigating false blocking problem in wireless ad hoc networks | |
| US11777789B1 (en) | Stable passive clustering |
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 |