A data transmission method, system, apparatus, and storage medium

Abstract

This invention discloses a data transmission method, system, apparatus, and storage medium, comprising: receiving a first suppression message and modifying its own level according to the first suppression message; broadcasting a second suppression message to surrounding areas according to the own level at preset time intervals; receiving cloud data, and if the level of the cloud data is greater than its own level, modifying the level of the cloud data to the level of its own level, and forwarding the modified cloud data. This invention can ensure transmission stability and suppress data storms, and can be widely applied in the field of network transmission technology.

Description

Technical Field

[0001] This invention relates to the field of network transmission technology, and in particular to a data transmission method, system, device, and storage medium. Background Technology

[0002] Currently, various industries are carrying out energy-saving renovations based on electrical intelligence. To achieve accurate carbon metering and intelligent control, a massive number of terminals need to be connected to the network. However, existing wired, Wi-Fi, and cellular networks are costly, making Mesh networks, with their low cost and flexibility, the first choice. But with the increasing popularity of Mesh networks, it has been found that in actual project delivery, to reduce deployment difficulty and ease of deployment, a one-size-fits-all approach is often used in data forwarding settings, leading to conflicts in both sparse and dense node scenarios. If the Time To Live (TTL) limit is too small, data can easily be lost when the TTL drops to 0 during forwarding in sparse node scenarios; while if the TTL is too large, it can easily cause data storms in dense node scenarios, also leading to some data loss, data backlog, and increased terminal power consumption. Summary of the Invention

[0003] In view of this, the purpose of the embodiments of the present invention is to provide a data transmission method, system, device and storage medium that can ensure transmission stability and suppress data storms.

[0004] On one hand, embodiments of the present invention provide a data transmission method, including:

[0005] Receive the first suppression message and modify its own level according to the first suppression message;

[0006] According to its own level, it broadcasts a second suppression message to the surrounding area at preset time intervals;

[0007] If the level of the cloud data is higher than the user's own level, the user modifies the level of the cloud data to the user's own level and forwards the modified cloud data.

[0008] Optionally, the method further includes:

[0009] A list of suppressed messages is determined based on the received first suppressed messages;

[0010] The suppression message list is updated based on the first suppression message.

[0011] Optionally, the first suppression message includes a node identifier and the node's own level, and updating the suppression message list based on the first suppression message includes:

[0012] In the suppressed message list, a preset number of the first suppressed messages are retained according to the node's own level; wherein, the first suppressed messages with the same node identifier are retained based on the one with the closest reception time.

[0013] Optionally, the method further includes:

[0014] If the number of the first suppressed messages in the suppressed message list is greater than the preset number, the first suppressed message with the highest level of the node itself will be deleted.

[0015] If there are multiple first suppression messages with the highest node priority, delete the first suppression message with the highest node priority and the earliest reception time.

[0016] Optionally, the method further includes:

[0017] In the suppressed message list, the first suppressed message whose reception time exceeds a preset time is deleted.

[0018] Optionally, the first suppression message further includes a clear flag, and updating the suppression message list according to the first suppression message includes:

[0019] If the clear identifier is the first identifier, then delete the first suppression message whose clear identifier is the second identifier from the suppression message list.

[0020] Optionally, modifying its own level according to the first suppression message includes:

[0021] Calculate the survival probability of the first suppressed message with the lowest level in the suppressed message list; the survival probability is determined based on the current time and the reception time.

[0022] If the cumulative value of the survival probability is greater than or equal to a preset value, the level of the individual is incremented by one.

[0023] If the cumulative value of the survival probability is less than a preset value, the level of the individual is increased by two.

[0024] On the other hand, embodiments of the present invention provide a data transmission system, including:

[0025] The first module is used to receive the first suppression message and modify its own level according to the first suppression message;

[0026] The second module is used to broadcast a second suppression message to the surrounding area at a preset time interval according to its own level;

[0027] The third module is used to receive cloud data. If the level of the cloud data is higher than its own level, the module modifies the level of the cloud data to its own level and forwards the modified cloud data.

[0028] On the other hand, embodiments of the present invention provide a data transmission device, including:

[0029] At least one processor;

[0030] At least one memory for storing at least one program;

[0031] When the at least one program is executed by the at least one processor, the at least one processor performs the method described above.

[0032] On the other hand, embodiments of the present invention provide a computer-readable storage medium storing a processor-executable program, which, when executed by a processor, is used to perform the above-described method.

[0033] Implementing this embodiment of the invention has the following beneficial effects: After receiving a first suppression message from the cloud gateway or other forwarding nodes, the forwarding node in this embodiment modifies its own level according to the information carried in the first suppression message, which can quickly adjust the level of the forwarding node. According to its own level, it broadcasts a second suppression message to the surrounding nodes at a preset time interval, thereby enabling the surrounding nodes to adaptively adjust their levels and receive cloud data. If the level of the cloud data is greater than its own level, the level of the cloud data is modified to its own level, and the modified cloud data is forwarded. Forwarding cloud data according to the node level can both ensure transmission stability and suppress data storms. Attached Figure Description

[0034] Figure 1 This is a schematic diagram of the structure of a data transmission system provided in an embodiment of the present invention;

[0035] Figure 2 This is a flowchart illustrating the steps of a data transmission method provided in an embodiment of the present invention;

[0036] Figure 3 This is a flowchart illustrating the steps of another data transmission method provided in an embodiment of the present invention;

[0037] Figure 4 This is a flowchart of a forwarding node receiving suppressed messages provided in an embodiment of the present invention;

[0038] Figure 5 This is a flowchart illustrating how to calculate the suppression level of a message itself, as provided in an embodiment of the present invention.

[0039] Figure 6 This is a schematic diagram of a data transmission method in a specific embodiment of the present invention;

[0040] Figure 7This is a schematic diagram of a data transmission method in another specific embodiment provided by the present invention;

[0041] Figure 8 This is a schematic diagram of a data transmission method in another specific embodiment provided by the present invention;

[0042] Figure 9 This is a schematic diagram of a data transmission method in another specific embodiment provided by the present invention;

[0043] Figure 10 This is a structural block diagram of a data transmission system provided in an embodiment of the present invention;

[0044] Figure 11 This is a structural block diagram of a data transmission device provided in an embodiment of the present invention. Detailed Implementation

[0045] The present invention will now be described in further detail with reference to the accompanying drawings and specific embodiments. The step numbers in the following embodiments are only for ease of explanation and do not limit the order of the steps. The execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.

[0046] It should be noted that although functional modules are divided in the device schematic diagram and a logical order is shown in the flowchart, in some cases, the steps shown or described may be performed in a different order than the module division in the device or the order in the flowchart. The terms "first," "second," etc., used in the specification, claims, and the foregoing drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that the embodiments of this application described herein can be implemented, for example, in orders other than those illustrated or described herein. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion; for example, a process, method, system, product, or apparatus that comprises a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to such processes, methods, products, or apparatuses.

[0047] Unless otherwise defined, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this application belongs. The terminology used herein is for the purpose of describing embodiments of this application only and is not intended to limit this application.

[0048] The following explains some of the technical terms used in this embodiment.

[0049] A mesh network is a communication architecture in which nodes (devices) can communicate directly with one or more peer nodes without needing a central node for relaying. In a mesh network, each node is not only a data receiver but also a data forwarder, meaning it can resend received data packets to other nodes until the packets reach their destination.

[0050] Node: A device or point in a mesh network. A mesh network is a wireless network architecture where each device (i.e., a mesh node) acts as a router, not only receiving signals but also forwarding them to other nodes. This network design allows signals to travel through multiple paths, enhancing network stability and coverage. In a mesh network, the connections between nodes form a mesh structure, ensuring network robustness even if a node fails, data can still be transmitted through other paths.

[0051] See Figure 1 A mesh network consists of multiple nodes. Nodes transmit data through broadcasts, and nodes that are far apart exchange data via intermediate nodes. Some of these nodes are called cloud gateways, which have the ability to upload data to cloud servers. Cloud data originates from a data source node, passes through forwarding nodes to the cloud gateway, and is then transmitted to the cloud server via public network protocols.

[0052] See Figure 2 This invention provides a data transmission method applied to a forwarding node, comprising:

[0053] S100: Receive the first suppression message and modify its own level according to the first suppression message;

[0054] S200: Broadcast a second suppression message to the surrounding area at preset time intervals according to its own level;

[0055] S300 receives cloud data. If the level of the cloud data is higher than its own level, it modifies the level of the cloud data to its own level and forwards the modified cloud data.

[0056] See Figure 1 and Figure 3The cloud gateway broadcasts a Level 0 first suppression message to surrounding forwarding nodes. The forwarding nodes adjust their own levels based on the level of the received first suppression message or message timeout. The forwarding nodes broadcast a second suppression message to surrounding nodes at preset time intervals based on their own levels. The data source nodes embed their own levels into the cloud data and send the cloud data to the forwarding nodes. After receiving the data, the forwarding nodes only forward cloud data whose own levels are lower than those of the data source nodes and modify the level in the cloud data to their own level. After receiving the cloud data, the cloud gateway uploads it to the cloud service.

[0057] It should be noted that each node broadcasts a suppression message of its own level to surrounding nodes at a preset time interval not exceeding time W. Here, W is a threshold representing the maximum tolerable time for local data loss, typically between 15 seconds and 10 minutes. All suppression messages include the node's ID, its own level, and a clear flag. Suppression messages are not forwarded; they are only received by surrounding nodes. Suppression messages can be embedded within other messages to reduce wireless network overhead.

[0058] Implementing this embodiment of the invention has the following beneficial effects: After receiving a first suppression message from the cloud gateway or other forwarding nodes, the forwarding node in this embodiment modifies its own level according to the information carried in the first suppression message, which can quickly adjust the level of the forwarding node. According to its own level, it broadcasts a second suppression message to the surrounding nodes at a preset time interval, thereby enabling the surrounding nodes to adaptively adjust their levels and receive cloud data. If the level of the cloud data is greater than its own level, the level of the cloud data is modified to its own level, and the modified cloud data is forwarded. Forwarding cloud data according to the node level can both ensure transmission stability and suppress data storms.

[0059] Optionally, the data transmission method further includes:

[0060] S400. Determine a list of suppression messages based on the received first suppression messages;

[0061] S500: Update the suppression message list based on the first suppression message.

[0062] The suppression message list includes information such as the reception time of the first suppression message, node identifier, node's own level, and clear flag. Specifically, the forwarding node determines the suppression message list by sorting several received first suppression messages according to a certain characteristic, such as sorting according to the node's own level; when the suppression message list needs to be updated, it is updated according to the information of the first suppression messages, such as updating the suppression message list according to the first suppression message's own level or reception time.

[0063] Optionally, the first suppression message includes a node identifier and the node's own level. The suppression message list is updated based on the first suppression message, including:

[0064] S510. In the suppression message list, a preset number of first suppression messages are retained according to the node's own level; among them, the first suppression messages with the same node identifier are retained with the earliest reception time.

[0065] It should be noted that the preset quantity is determined based on the actual application, and this embodiment does not impose a specific limit. The node identifier is determined based on the actual application, and this embodiment does not impose a specific limit, such as node ID. Except for the cloud gateway, other forwarding nodes maintain a list of received suppressed packets. This list is arranged in ascending order of the suppressed packet level, and a maximum of L packets are retained, such as L being 5-8 packets. For the same node ID, this suppressed packet list only retains the most recent suppressed packet, i.e., the one whose reception time is closest to the current time.

[0066] Optionally, the data transmission method further includes:

[0067] S520. If the number of the first suppression message in the suppression message list is greater than the preset number, delete the first suppression message with the highest level of the node itself.

[0068] S530. If there are multiple first suppression messages with the highest self-level of a node, delete the first suppression message with the highest self-level of the node and the earliest reception time.

[0069] Specifically, if the number of first suppression messages in the suppression message list is greater than the preset number, the first suppression message with the highest level of the node itself will be deleted. If there are multiple highest levels, the first suppression message with the earliest reception time will be deleted, and the first suppression message with the most recent reception time will be retained.

[0070] Optionally, the data transmission method further includes:

[0071] S540. In the suppression message list, delete the first suppression message whose reception time exceeds the preset time.

[0072] It should be noted that the preset time is determined based on the actual application, and this embodiment does not impose specific limitations. For example, the suppression message list automatically deletes the first suppression message whose reception time exceeds the current time minus W*Timeout, where Timeout is a threshold, typically 120%.

[0073] Optionally, the first suppression message also includes a clear flag, and the suppression message list is updated according to the first suppression message, including:

[0074] S550. If the clear identifier is the first identifier, delete the first suppression message with the clear identifier as the second identifier from the suppression message list.

[0075] It should be noted that the clear flag is determined based on the actual application, and this embodiment does not impose specific restrictions. For example, the clear flag can only be 1 or 0. When the clear flag is 1, it means that the previous message with a flag of 0 is ignored.

[0076] In one specific embodiment, see Figure 4 If the RSSI of a suppressed message received by a forwarding node is less than the threshold Rmax, the message is ignored and the process exits. If the clear flag in the message is 1, the message with a clear flag of 0 is deleted from the suppressed message list. If the message node ID does not appear in the suppressed message list and the suppressed message level is greater than the highest level in the suppressed message list, the message is ignored and the process exits. Adjust the suppressed message list: add suppressed messages to the list, delete messages with the same node ID and messages that exceed the list length limit. If adjusting the suppressed message list changes the message with the lowest level in the list, recalculate its own level.

[0077] In addition to the cloud gateway, other forwarding nodes adjust the suppression message list and recalculate their own level when the reception time of a certain message in the suppression message list has exceeded W from the current time.

[0078] When a node's level changes or it receives a suppression message that clears the Flag to 1, it broadcasts a suppression message indicating its own level. If the level change was caused by receiving a suppression message that clears the Flag to 1, the broadcast suppression message will have the clear Flag set to 1; otherwise, it will have 0. Nodes at level Max do not broadcast suppression messages with a clear Flag set to 0.

[0079] Optionally, modify its own level based on the first suppression message, including:

[0080] S110. Calculate the survival probability of the first suppressed message with the lowest level in the suppressed message list; the survival probability is determined based on the current time and the reception time.

[0081] S120. If the cumulative value of the survival probability is greater than or equal to the preset value, increase the level by one.

[0082] S130. If the cumulative value of the survival probability is less than the preset value, increase the level by two.

[0083] See Figure 5If the node is a cloud gateway, the level is fixed at 0; if the node is not a cloud gateway, select all the suppressed messages with the lowest level in the suppressed message list; if the suppressed message list is empty, the level is a maximum threshold value, such as 31; calculate the survival probability of each message in the suppressed message list and accumulate it until it is greater than 50%. If it still does not exceed 50% after the accumulation, its own level is the suppressed message level plus 2, otherwise it is the suppressed message level plus 1, but the maximum does not exceed Max.

[0084] It should be noted that the survival probability is determined based on the actual application, and this embodiment does not impose specific limitations. In a specific embodiment, the survival probability of suppressed packets is calculated as follows: Where Now is the current time and Rt is the message reception time.

[0085] If the cloud service detects a significant change in the Mesh network, such as a failure of a cloud gateway, it can issue instructions to other cloud gateways in the same Mesh network, prompting them to broadcast a suppression message with a flag of 1 cleared within the Mesh network.

[0086] For significant changes in the Mesh network that cloud services cannot detect, no special identification is required. Newly added nodes and existing nodes can quickly adjust their own levels according to the method of this embodiment of the invention. The path for reporting fault data is available and forwarding is effectively suppressed. If a large number of nodes are added, they can quickly adjust their own levels by receiving suppression messages broadcast from surrounding nodes. If a large number of forwarding nodes go offline, surrounding forwarding nodes can quickly adjust their own levels by expiring suppression messages. When a data source node generates cloud data, it includes its own level in the data packet. When a forwarding node receives cloud data, it checks the level in the cloud data packet. If the level of the cloud data is higher than its own level, it forwards it; otherwise, it does not forward it.

[0087] In a specific application scenario, such as energy-saving smart buildings, intelligent IoT terminals involving various components of lighting, air conditioning, and other equipment—including sensing and control terminals—are distributed throughout the building. While a small number connect via wired network or Wi-Fi, most terminals, such as the numerous lighting terminals, connect through a mesh network. Data in the mesh network is transmitted through broadcasting and relaying, with most data needing to be transmitted to a cloud server. Some areas of the building have a high terminal density, such as office lighting fixtures, while others have a low density, such as fire sensors in the parking lot. Therefore, setting data transmission relay limits for these terminals is a difficult and cumbersome task. If the relay limit is too low, data from some edge nodes is easily lost. If the relay limit is too high, a large amount of data is repeatedly broadcast, causing a data storm in the mesh network, resulting in data accumulation, data loss, and increased device power consumption. Generally, mesh networks use data forwarding suppression methods, such as ensuring a data packet is forwarded only once within the same mesh node and limiting the maximum number of forwards for a single data packet. This invention mimics the apical dominance of plant growth, such as the downward propagation of growth hormones from the plant apex to suppress their forwarding in a mesh network. This provides a more effective suppression method, not only effectively inhibiting data forwarding but also rapidly adapting to changes in the mesh network. The following example demonstrates how to build a mesh network using BLE broadcasting:

[0088] S1, see reference Figure 6 After the cloud gateway starts up and connects to the cloud server, it broadcasts a suppressor message 4E20-0-0 every 15 seconds. The first number is the node ID, the second is the node level, and the third is the flag to clear. In practice, bit compression is used to compress the message to 3 bytes for transmission, allowing it to be appended to other data packets for transmission, reducing the power consumption of the wireless network.

[0089] S2. Node A056, upon receiving the suppression message 4E20-0-0, will add the message to the suppression message list and record the reception time if the received wireless signal strength exceeds the threshold. At this point, its own level is calculated using this method. Since the reception time equals the current time, the survival probability is... The threshold has exceeded 50%, so the node's own level should be adjusted to 1. Furthermore, if the node receives other suppression messages with a level greater than 0 before this message times out, this method will not affect the node's level.

[0090] After S3 and node A056 adjust their own level to 1, they broadcast the suppression message A056-1-0.

[0091] S4. If node BD0E does not receive 4E20-0-0, or if the signal strength of 4E20-0-0 received is below the threshold, and it also does not receive other messages of level 0, but it can receive A056-1-0, and the signal strength of A056-1-0 is above the threshold, then A056-1-0 is added to its own message list. Similarly, its survival probability can be calculated to be greater than 50%, so its own level can be adjusted to 2. After adjustment, BD0E broadcasts the message BD0E-2-0, which it has suppressed.

[0092] S5. Similarly, each node will adjust its own level based on the suppression messages it receives.

[0093] S6. If node BD76 generates data to the cloud, the level in the data packet will be 2. BD0E and C145, because their own level is not less than 2, will not forward this data. Only A056 will forward it, and when forwarding, it will change the level in the data to 1. Node 4E20 will then upload the received data to the cloud server, while node A054, because its own level is not less than 1, will not forward the data.

[0094] S7. Similarly, if the data to the cloud is generated by node BD0E, it can be reported through both cloud gateways after being forwarded by nodes A056 and AEF9.

[0095] S8. Now, assuming node 4E20 fails and stops broadcasting 4E20-0-0, after message 4E20-0-0 times out, nodes A056 and A054 will readjust their own priority levels and broadcast new suppression messages. See [link / reference]. Figure 7 .

[0096] S9. Upon receiving a new suppression message, nodes A054, A056, and BD76 also update their message lists, recalculate their own levels, downgrade them to 3, and broadcast the new suppression message. (See also...) Figure 8 .

[0097] S10. Upon receiving a new suppression message, node A054 also refreshes its message list, recalculates its own level, lowers it to 4, and broadcasts the new suppression message, as shown in the appendix. Figure 9 As shown.

[0098] S11. If node BD76 generates cloud data at this point, the cloud data packet will have a level of 3. Since A056 and A054 have a level of at least 3, they will not forward this data. Only BD0E will forward it, changing the level in the data to 2 during forwarding. The forwarded packet will then be forwarded again by node AEF9, which has a level of 1. Node 4A55 will then receive the data and upload it to the cloud server, while node A056, having a level of at least 1, will not forward the data.

[0099] S12. If the cloud server detects the 4E20 failure in time, it doesn't need to wait for the 4E20-0-0 timeout. The cloud server directly issues a command, and the cloud gateway 4A55 broadcasts the suppression message 4A55-0-1. Then, AEF9 recalculates the level but remains unchanged, and broadcasts the suppression message AEF9-1-1. Similarly, node BD0E recalculates the level and broadcasts BD0E-2-1. At this point, nodes A056 and BD76 receive BD0E-2-1 and their wireless signal strength exceeds the threshold. They then delete the suppression message that clears the Flag to 0, recalculate the level to 2+1=3, and broadcast the new suppression message. Similarly, A054 will also adjust its level to 4 based on the new suppression message. The final result is consistent with the result of the 4E20-0-0 timeout.

[0100] S13. If the problem is not with the cloud gateway but with a regular node, the same principle applies, leading to local adjustments.

[0101] See Figure 10 This invention provides a data transmission system, comprising:

[0102] The first module is used to receive the first suppression message and modify its own level according to the first suppression message;

[0103] The second module is used to broadcast a second suppression message to the surrounding area at preset time intervals according to its own level.

[0104] The third module is used to receive cloud data. If the level of the cloud data is higher than its own level, the module will modify the level of the cloud data to its own level and forward the modified cloud data.

[0105] It is evident that the content of the above method embodiments is applicable to this system embodiment. The specific functions implemented in this system embodiment are the same as those in the above method embodiments, and the beneficial effects achieved are also the same as those achieved in the above method embodiments.

[0106] See Figure 11 This invention provides a data transmission device, comprising:

[0107] At least one processor;

[0108] At least one memory for storing at least one program;

[0109] When at least one program is executed by at least one processor, the at least one processor performs the method described above.

[0110] The memory, as a non-transitory computer-readable storage medium, can be used to store non-transitory software programs and non-transitory computer-executable programs. The memory may include high-speed random access memory, and may also include non-transitory memory, such as at least one disk storage device, flash memory device, or other non-transitory solid-state storage device. In some embodiments, the memory may optionally include remote memory located remotely relative to the processor, which can be connected to the processor via a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.

[0111] It is evident that the content of the above method embodiments is applicable to this device embodiment. The specific functions implemented in this device embodiment are the same as those in the above method embodiments, and the beneficial effects achieved are also the same as those achieved in the above method embodiments.

[0112] Furthermore, this application also discloses a computer program product or computer program stored in a computer-readable storage medium. A processor of a computer device can read the computer program from the computer-readable storage medium, and the processor executes the computer program, causing the computer device to perform the described method. Similarly, the content of the above method embodiments is applicable to this storage medium embodiment. The specific functions implemented in this storage medium embodiment are the same as those in the above method embodiments, and the beneficial effects achieved are also the same as those achieved in the above method embodiments.

[0113] This invention also provides a computer-readable storage medium storing a processor-executable program that, when executed by a processor, implements the above-described method.

[0114] It is understood that all or some of the steps and systems in the methods disclosed above can be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0115] It is understood that all or some of the steps and systems in the methods disclosed above can be implemented as software, firmware, hardware, and suitable combinations thereof. Some or all of the physical components can be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit. Such software can be distributed on a computer-readable medium, which can include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and is accessible to a computer. Furthermore, as is known to those skilled in the art, communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0116] It should be understood that in this application, "at least one (item)" means one or more, and "more than" means two or more. "And / or" is used to describe the relationship between related objects, indicating that three relationships can exist. For example, "A and / or B" can represent three cases: only A exists, only B exists, and both A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the preceding and following related objects are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) of a, b, or c can represent: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple.

[0117] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection between apparatuses or units through some interfaces, and may be electrical, mechanical, or other forms.

[0118] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0119] The above is a detailed description of the preferred embodiments of the present invention. However, the present invention is not limited to the embodiments described. Those skilled in the art can make various equivalent modifications or substitutions without departing from the spirit of the present invention. All such equivalent modifications or substitutions are included within the scope defined by the claims of this application.

Claims

1. A data transmission method, characterized in that, include: Receive the first suppression message, modify the forwarding node's own level according to the first suppression message, and determine the suppression message list according to the received first suppression messages; According to its own level, it broadcasts a second suppression message to the surrounding area at preset time intervals; If the level of the cloud data is higher than the user's own level, the user modifies the level of the cloud data to the user's own level and forwards the modified cloud data. The step of modifying the forwarding node's own level according to the first suppression message includes: Calculate the survival probability of the first suppressed message with the lowest level in the suppressed message list; the survival probability is determined based on the current time and the reception time. If the cumulative value of the survival probability is greater than or equal to a preset value, the level of the individual is incremented by one. If the cumulative value of the survival probability is less than a preset value, the level of the individual is increased by two.

2. The method according to claim 1, characterized in that, The method further includes: The suppression message list is updated based on the first suppression message.

3. The method according to claim 2, characterized in that, The first suppression message includes a node identifier and the node's own level. Updating the suppression message list based on the first suppression message includes: In the suppressed message list, a preset number of the first suppressed messages are retained according to the node's own level; wherein, the first suppressed messages with the same node identifier are retained based on the one with the closest reception time.

4. The method according to claim 3, characterized in that, The method further includes: If the number of the first suppressed messages in the suppressed message list is greater than the preset number, the first suppressed message with the highest level of the node itself will be deleted. If there are multiple first suppression messages with the highest node level, delete the first suppression message with the highest node level and the earliest reception time.

5. The method according to claim 3, characterized in that, The method further includes: In the suppressed message list, the first suppressed message whose reception time exceeds a preset time is deleted.

6. The method according to claim 2, characterized in that, The first suppression message further includes a clear flag, and updating the suppression message list based on the first suppression message includes: If the clear identifier is the first identifier, then delete the first suppression message whose clear identifier is the second identifier from the suppression message list.

7. A data transmission system, characterized in that, include: The first module is used to receive the first suppression message, modify the level of the forwarding node itself according to the first suppression message, and determine the suppression message list according to the received first suppression messages. The second module is used to broadcast a second suppression message to the surrounding area at a preset time interval according to its own level; The third module is used to receive cloud data. If the level of the cloud data is greater than its own level, the module modifies the level of the cloud data to its own level and forwards the modified cloud data. The step of modifying the forwarding node's own level according to the first suppression message includes: Calculate the survival probability of the first suppressed message with the lowest level in the suppressed message list; the survival probability is determined based on the current time and the reception time. If the cumulative value of the survival probability is greater than or equal to a preset value, the level of the individual is incremented by one. If the cumulative value of the survival probability is less than a preset value, the level of the individual is increased by two.

8. A data transmission device, characterized in that, include: At least one processor; At least one memory for storing at least one program; When the at least one program is executed by the at least one processor, the at least one processor performs the method as described in any one of claims 1-6.

9. A computer-readable storage medium storing a processor-executable program, characterized in that, The processor-executable program, when executed by the processor, is used to perform the method as described in any one of claims 1-6.

Images