A non-responsive simple communication method and device

Abstract

The present disclosure provides a non-response simple communication method, which comprises the following steps: a communication node acquires a data block, temporarily stores the data block in a storage queue; acquires the receiving times and / or sending times of the data block; and stops the sending processing of the data block when the receiving times and / or the times reach a preset condition. In the process of transmitting data, the sending times of the communication node are set to judge the sending processing, and there is no need to wait for the response of the receiving communication node. The method of the present disclosure realizes high reliability and high efficiency of information transmission of data, solves the reliability of data information transmission, improves the efficiency of network communication data information transmission, and solves the network paralysis problem caused by broadcast storm.

Description

Technical Field

[0001] This application relates to the field of Internet technology, specifically to the field of communication technology, and in particular to a simple communication method and apparatus without response. Background Technology

[0002] In the fields of communications and the Internet of Things (IoT), conventional data transmission uses a send-response method. However, in actual information data transmission, due to faults or other reasons, the receiving end may not respond or may be unable to respond. The sending end will then wait for a timeout and retransmit, leading to the occupation of communication channel resources and a reduction in communication efficiency. Furthermore, if the number of communication nodes in a network area increases, and data communication becomes more congested or interfered with, the communication nodes will repeatedly retransmit after timeouts, potentially causing network collapse and communication failure.

[0003] Currently, various fields use three-way handshake and four-way handshake communication methods to ensure communication reliability. The transmission of a single data item requires at least three or even four information sending and receiving transmissions to ensure the reliability of information transmission. During so many information transmissions, any abnormality at the sending end, receiving end, or transmission channel will lead to excessive data transmissions and excessive consumption of network resources. Furthermore, each transmission usually has network latency, which will also lead to a longer total transmission time and even cause network collapse. Summary of the Invention

[0004] This disclosure addresses the problems existing in data transmission in the prior art and proposes a simple communication method and apparatus without response, which can ensure the information strength of data in the communication medium, avoid broadcast storms and their occupation of channel resources, avoid data transmission errors and packet loss, and improve the reliability of data communication.

[0005] The first aspect of this disclosure provides a simple, non-response-based communication method: a data block is acquired through a communication node; the data block is temporarily stored in a storage queue; the number of times the data block is received and / or sent is obtained; when the number of times the data block is received and / or sent reaches a preset condition, the communication node stops processing the transmission of the data block. This communication method does not require the receiving end to provide response data, and the data transmission method is simple.

[0006] In some embodiments, the data block is temporarily stored in a storage queue; the communication node performs effective transmission processing on the data block, wherein each effective transmission processing includes at least one transmission operation; and the number of transmission operations is counted.

[0007] In some embodiments, when the number of receptions and the number of transmissions reach preset conditions, the data block is processed for effective transmission, including: setting the maximum transmission threshold and the maximum reception threshold of the communication node; and stopping the transmission of the data block when the number of transmissions reaches the maximum transmission threshold.

[0008] In this embodiment, the method further includes: when the number of receptions reaches the maximum reception threshold, then lowering the maximum transmission threshold or increasing the number of transmissions according to a preset setting. If the number of transmissions does not reach the maximum transmission threshold and the number of receptions reaches the maximum reception threshold, then the maximum transmission threshold is reduced according to the preset settings.

[0009] In some embodiments, the method further includes: networking at least two of the communication nodes, wherein the communication nodes can transmit data to each other; and stopping the transmission of the data block when the number of receptions or transmissions of the data block in any of the communication nodes in the network reaches the preset condition. In the multi-node communication of this disclosure, each communication node can both send and receive data blocks, and sending and receiving are mutually equal and overlapping, without a master-slave relationship or a central node. A data block can reach any communication node in the network after being transmitted through the network. Therefore, the network communication network composed of the communication nodes of this invention is a highly reliable decentralized peer-to-peer mesh network.

[0010] In some embodiments, the method further includes: adding service networking nodes; acquiring service data, forming service data blocks, and temporarily storing the service data blocks in a storage queue; acquiring the number of insertions and extractions of the service data blocks; and determining the processing of the service communication data blocks by the service networking nodes based on the number of insertions and extractions of the service data blocks.

[0011] In some embodiments, the method further includes: the communication node includes at least one corresponding storage queue for temporarily storing the data block to be processed; wherein the data block corresponds to the communication data block or the service data block; a storage queue includes at least one data storage unit; a data storage unit includes one data block and a transceiver control block, wherein the data block includes at least a data source ID, data generation time and data content, and the transceiver control block includes at least a data block transmission count, a data reception count, and a data extraction flag.

[0012] In some embodiments, the method further includes: each of the communication nodes having the same system time; and when forming the service data block, the data generation time of the service data block is added according to the system time when the data content enters the communication node.

[0013] In some embodiments, the method further includes: temporarily storing the data block to be processed in the storage queue, wherein the storage queue processes the data block according to a time priority principle, including: Determine the generation time of the data blocks; store the data blocks in order of their generation time, including: The data block is stored in a preset storage space of the storage queue, or the data block is overwritten by the data block whose generation time is earlier among the data blocks that meet the conditions.

[0014] In this embodiment, the method further includes: when the preset storage space has not reached the maximum preset space, storing the data block in the storage queue; When the preset storage space reaches its maximum preset space, then the following applies: Identify the data blocks that meet the conditions of the data blocks; If the data block does not meet the conditions of the data block in the storage queue, then the data block is stored in the storage queue. When the data block meets the conditions of the data block in the storage queue, the data block is directly overwritten by the data block with the earlier generation time. Alternatively, when the data block meets the conditions of the data block in the storage queue, the number of times the data block with the earlier generation time is sent is obtained. When the number of times the data block with the earlier generation time is sent reaches the maximum sending threshold, the data block is directly overwritten by the data block with the earlier generation time.

[0015] In some embodiments, the method further includes: when acquiring the data block, traversing the storage queue to confirm the receiving operation for the data block; If the data block is already stored in the storage queue, the receiving temporary storage operation is exited, and the number of times the data block is received is incremented by 1; if the data block is not stored in the storage queue, the data block is stored in the storage queue, and the number of times the data block is received is initialized. Alternatively, when acquiring the business data block, the storage queue is traversed to confirm the insertion operation of the business data block; the time of acquiring the business data block is confirmed and determined as the data generation time of the business data, and an initial value is assigned to the number of insertions of the business data block.

[0016] In some embodiments, the method further includes: when sending the data block, traversing the storage queue and confirming the sending operation for the data block according to a time priority principle, including: Confirm the data blocks that meet the conditions of the data blocks; Send the data block that meets the conditions and was generated earliest and has not been processed, and increment the sending count flag of the data block that meets the conditions by 1.

[0017] In some embodiments, the method further includes: when extracting the business data block, traversing the storage queue and confirming the extraction operation for the business data block according to a time priority principle, including: Confirm the data blocks that meet the conditions of the aforementioned business data blocks; Extract the data block that was generated earliest and has not been processed, and increment the extraction count flag of the data block that meets the conditions by 1.

[0018] In some embodiments, the method further includes: evolving the time priority principle during transmission based on the data priority transmission method of the number of transmissions, evolving the time priority principle during transmission based on the data priority transmission method of the number of receptions, and / or evolving the time priority principle during transmission based on the data priority transmission method at the data level.

[0019] In some embodiments, the method further includes: in any transmit / receive control block corresponding to the communication node, the initial value, maximum transmit threshold and / or maximum receive threshold of the data block in the storage queue can be customized to adjust the reliability of the communication network.

[0020] A second aspect of this disclosure provides a simple, non-responding communication device.

[0021] In some embodiments, the apparatus is applied to the simple communication method for a communication node to acquire a data block without response in the first aspect, characterized in that the apparatus includes at least: a communication node, a receiving communication port, and a sending communication port, wherein each of the communication nodes corresponds to one receiving communication port and one sending communication port; wherein the receiving communication port and the sending communication port are any physical, logical, hardware, or software medium, line, and interface capable of transmitting information and data.

[0022] In some embodiments, the apparatus is applied to the non-response simplified communication method for service network nodes to obtain service data blocks in the first aspect, characterized in that the apparatus includes at least: a service network node, a service insertion interface, and a service extraction interface, wherein each of the service network nodes corresponds to one service insertion interface and one service extraction interface; wherein the service insertion interface and the service extraction interface are any physical, logical, hardware, or software medium, line, and interface capable of transmitting information and data.

[0023] In some embodiments, the apparatus is applied to any possible implementation of the first aspect described above, and the apparatus includes: a receiving unit for receiving data blocks through a communication node; a storage unit for temporarily storing the data blocks in a storage queue; a processing unit for obtaining the number of times the data blocks are received and the number of times they are sent; and a sending unit for stopping the sending processing of the data blocks by the communication node when the number of times the data blocks are received and the number of times the data blocks are sent reach a preset condition.

[0024] In some embodiments, the sending unit further includes: setting a maximum sending threshold and a maximum receiving threshold for the communication node; and stopping the sending of the data block when the number of sending attempts reaches the maximum sending threshold.

[0025] In some embodiments, the sending unit further includes: when the number of receptions reaches the maximum reception threshold, reducing the maximum sending threshold or increasing the number of transmissions according to a preset setting; when the number of transmissions does not reach the maximum sending threshold and the number of receptions reaches the maximum reception threshold, reducing the maximum sending threshold according to a preset setting.

[0026] In some embodiments, the apparatus further includes: a networking unit, configured to network at least two of the communication nodes, wherein the communication nodes can transmit data to each other; when the number of times the data block is received or sent in any of the communication nodes in the network reaches the preset condition, the sending process of the data block is stopped.

[0027] In some embodiments, the apparatus further includes: a service networking unit for adding service networking nodes; Acquire business data, form business data blocks, and temporarily store the business data blocks in a storage queue; Obtain the number of insertions and extractions for the business data block; The processing of the service data block by the service network node is determined based on the number of insertions and extractions of the service data block.

[0028] In some embodiments, the apparatus further includes: a service networking unit for adding service networking nodes; The communication node includes at least one corresponding storage queue for temporarily storing the data blocks to be processed. The data block may correspond to the communication data block or the service communication data block; One of the storage queues contains at least one data storage unit; A data storage unit includes a data block and a transmit / receive control block, wherein the data block includes at least a data source ID, data generation time, and data content, and the transmit / receive control block includes at least a data block transmission count, a data reception count, and a data extraction flag.

[0029] In some embodiments, the apparatus further includes: a storage processing unit, configured to temporarily store the data block to be processed in the storage queue, wherein the storage queue processes the data block according to a time priority principle, including: The generation time of the data block is confirmed; The data blocks are stored in order of their generation time, including: The data block is stored in a preset storage space of the storage queue, or the data block is overwritten by the data block whose generation time is earlier among the data blocks that meet the conditions.

[0030] In some embodiments, the apparatus further includes a receiving unit or an insertion unit; The receiving unit is configured to, when acquiring the data block, traverse the storage queue to confirm the receiving operation for the data block; if the data block is already stored in the storage queue, exit the receiving temporary storage operation and increment the count of receiving the data block by 1; if the data block is not stored in the storage queue, store the data block in the storage queue and initialize the count of receiving the data block. Alternatively, an insertion unit is configured to, when acquiring the business data block, traverse the storage queue, confirm the insertion operation of the business data block; confirm the time of acquiring the business data block, determine it as the data generation time of the business data, and assign an initial value to the number of insertions of the business data block.

[0031] In some embodiments, the apparatus further includes: a transmission processing unit, configured to traverse the storage queue and confirm the transmission operation for the data block according to a time priority principle when transmitting the data block, including: Confirm the data block that meets the conditions; send the data block that meets the conditions that was generated earliest and has not been processed, and increment the sending count flag of the data block that meets the conditions by 1.

[0032] A third aspect of this disclosure provides a communication device comprising: a memory for storing processor-executable instructions; and a processor connected to the memory; wherein the processor is configured to perform any possible implementation of the method of the first aspect.

[0033] A fourth aspect of this disclosure provides a communication device that, when instructions in the storage medium are executed by a computer's processor, enables the computer to perform any method that may be implemented as in the first aspect.

[0034] The technical solutions provided by the embodiments of this disclosure may include the following beneficial effects: In the process of data transmission, the embodiments of this disclosure determine whether the effective forwarding technology has reached the maximum transmission threshold based on the set maximum transmission threshold and the forwarding count technology of the communication node. If the maximum transmission threshold is reached, forwarding stops without waiting for the response from the receiving communication node. This achieves highly reliable and efficient data transmission, which solves the reliability problem of data transmission, improves the efficiency of network communication data transmission, and can also solve the problem of network paralysis caused by broadcast storms. Attached Figure Description

[0035] The present disclosure will be further described in detail below with reference to the accompanying drawings and preferred embodiments. However, those skilled in the art will appreciate that these drawings are drawn for the purpose of explaining the preferred embodiments only and should therefore not be construed as limiting the scope of the present disclosure.

[0036] Figure 1 This is a schematic diagram of a communication node according to an exemplary embodiment; Figure 2 This is a schematic diagram illustrating the logical sending and receiving communication ports according to an exemplary embodiment; Figure 3 This is a flowchart illustrating a simple, non-responding communication method according to an exemplary embodiment; Figure 4 This is a schematic diagram of a simple multi-node data transmission device without response, according to an exemplary embodiment. Figure 5 This is a schematic diagram of a service networking node according to an exemplary embodiment; Figure 6 This is a schematic diagram of a data storage unit according to an exemplary embodiment; Figure 7 This is a communication node receiving and processing flow illustrated according to an exemplary embodiment; Figure 8 This is a service insertion processing flow for a communication node according to an exemplary embodiment; Figure 9 This is an exemplary embodiment illustrating a communication node sending communication data processing flow; Figure 10 A service proposal processing flow for a communication node is illustrated according to an exemplary embodiment; Figure 11 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application; Figure 12 This is a schematic diagram of the structure of a communication device provided in an embodiment of this application.

[0037] Example The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0038] like Figure 1 As shown in this embodiment, the no-response simplified communication method discloses a communication node for data transmission, including a communication data block storage queue, a sending communication port, and a receiving communication port.

[0039] The communication data block storage queue is used to temporarily store communication data blocks that need to be transmitted; the sending communication port is used to effectively send communication data blocks that need to be transmitted; and the receiving communication port is used to receive communication data blocks that need to be transmitted from the outside. Figure 2 As shown, this disclosure can combine two WiFi transceivers, one Bluetooth transceiver, one PLC transceiver, and one Ethernet transceiver into a single logical transmit and receive communication port.

[0040] The communication node can invoke a stored program to execute a data transmission method according to any of the embodiments.

[0041] The first aspect of this disclosure provides a simple, non-response communication method, such as Figure 3 The flowchart shown illustrates a simplified communication method without response. The method includes the following steps: S310: Obtain data blocks through communication nodes; S320: Temporarily store the data block in a storage queue; S330: Obtain the number of times the data block was received and / or sent; S340: When the number of receptions and the number of transmissions reach a preset condition, the communication node stops processing the transmission of the data block.

[0042] In this embodiment, the acquired data block is temporarily stored in a storage queue. The communication node performs effective sending processing on the data block. Each effective sending process includes at least one sending operation. The number of sending operations is counted. When the number of sending operations reaches a preset threshold, the communication node stops sending the data block and does not wait for sending confirmation.

[0043] The effective transmission process refers to the fact that during at least one transmission operation, the communication node can reliably send the communication data block to the communication medium without being blocked inside the communication node.

[0044] After receiving a communication data block, the communication node does not respond to the side that sent the data block. When sending a communication data block, the communication node does not need to wait for a response from the receiving node. This communication method does not require feedback from the receiving end, simplifying data transmission.

[0045] The determination of the data block as the source communication data to be acquired includes at least: determining the data block to be transmitted before acquiring the data block; and processing the original communication data without modification into the data block.

[0046] Therefore, this method ensures that the communication nodes receive the communication data blocks and resend them from all communication ports without modification.

[0047] In this disclosure, the receiving communication port reads whether any of the communication transceivers are receiving data through the communication port adapter driver layer. As soon as any communication transceiver receives data, the receiving communication port considers the data received and immediately uses the receiving processing mechanism of this invention to verify the data. After successful verification, the received data is stored in the communication data storage queue for transmission processing by the sending communication port of this disclosure.

[0048] After receiving data from any transceiver, the receiving communication port of this disclosure stores the data in a communication data storage queue. When the transmitting communication port processes the data, it sends it to all transceivers on the logic port, including the transceiver that received the data. For example, after the receiving communication port receives data A from the PLC transceiver via UART, the transmitting communication port processes data A by sending it through WiFi transceiver 1, WiFi transceiver 2, Bluetooth transceiver, PLC transceiver, and Ethernet transceiver.

[0049] In some embodiments, the step of stopping the transmission of the data block when the number of receptions and / or the number of transmissions reaches a first preset condition includes: setting a maximum transmission threshold and a maximum reception threshold for the communication node; and stopping the transmission of the data block when the number of transmissions reaches the maximum transmission threshold.

[0050] Each communication node has a preset maximum sending threshold (SendCount Max). By acquiring and determining whether the sending count of the data block to be processed has reached the maximum sending threshold, the corresponding processing is performed on the communication data block to be processed.

[0051] If the number of transmissions reaches the maximum transmission threshold, the communication node stops transmitting the data block.

[0052] If the number of transmissions has not reached the maximum transmission threshold, the communication node continues to process the data block for effective transmission.

[0053] In this embodiment, after the communication node receives a data block from the receiving communication port, it temporarily stores the data block in the data storage queue. When it needs to be sent, the communication data block is retrieved from the communication data storage queue without modification and handed over to the sending communication port for transmission.

[0054] In this embodiment, when transmission is required, the decision is made through a communication node, and a stored program is invoked to execute any of the data transmission methods described in this embodiment.

[0055] It should be noted that when the communication node of this disclosure receives any number and type of data through the communication port adapter driver, as long as one of the hardware or software interfaces receives the data and verifies it correctly, it is considered to have received valid data, and then the data is stored in the communication data storage queue.

[0056] When the communication node of this disclosure sends the data block, it passes the data to the communication port adapter driver. The communication port adapter driver sends the data to each hardware and software interface one by one. Only after all interfaces have completed the data transmission is the data considered to have been effectively transmitted once, and the transmission count is incremented by 1.

[0057] In this embodiment, when the number of receptions reaches the maximum reception threshold, the maximum transmission threshold is reduced according to a preset setting; when the number of transmissions does not reach the maximum transmission threshold but the number of receptions reaches the maximum reception threshold, the maximum transmission threshold is reduced according to a preset setting.

[0058] In a network environment with communication nodes, or in a network of multiple communication nodes, it is only necessary to check whether the data block has reached a given maximum sending threshold and / or maximum receiving threshold.

[0059] By determining whether the number of times a data block is sent reaches a given maximum sending threshold or whether the number of times a data block is received reaches a given maximum receiving threshold, it can be determined that the data has been reliably transmitted.

[0060] On the other hand, in the transmission method of the multi-node data transmission device in this embodiment, when the number of times a data block is sent has not yet reached the maximum sending threshold, but the number of times it is received has reached the maximum receiving threshold, the maximum sending threshold of the data block can be reduced according to a certain calculation rule, so that the number of times the data block is sent can quickly reach the maximum sending threshold and the sending of the data block can be stopped. In this way, the number of times the data block is sent is reduced, communication resources are saved and communication efficiency is improved.

[0061] Alternatively, once the maximum reception threshold is reached, the maximum transmission threshold can be lowered according to preset settings, or the transmission count can be increased to quickly reach the maximum transmission threshold for data blocks. Specifically, the control module can automatically set the maximum transmission threshold or set the data block transmission count according to certain rules. This allows for the determination and control of the reception count to preemptively reduce the transmission count, ensuring the data block transmission count reaches the maximum transmission threshold most effectively.

[0062] In some embodiments, a simple multi-node communication method without response is disclosed, comprising: At least two of the communication nodes are networked together, wherein the communication nodes can transmit data to each other; When the number of times a data block is received or sent in any of the communication nodes within the network reaches the preset condition, the sending process of the data block is stopped.

[0063] The multi-node communication method corresponds to the multi-node communication device, which includes at least two communication nodes. For example, a first communication node is used to forward data packets it receives or stores to at least one second communication node via a sending module, and to count the number of times the forwarded data blocks are sent. The second communication node is used to forward data blocks received from the first communication node to other communication nodes.

[0064] like Figure 4 As shown, a simple multi-node data transmission device without response includes communication node 1, communication node 2 and communication node n.

[0065] Communication node 1, communication node 2, and communication node n all include a communication data storage queue, a sending communication port, and a receiving communication port.

[0066] Specifically, the transmitting communication port of communication node 1 is connected to the receiving communication port of communication node 2 and the receiving communication port of communication node n via a data link; the receiving communication port of communication node 1 is connected to the transmitting communication port of communication node 2 and the transmitting communication port of communication node n via a data link.

[0067] Similarly, communication node 2 is connected to communication node 1 and communication node n via data link transmission in the same way, and communication node n is connected to communication node 1 and communication node 2 via data link transmission in the same way.

[0068] In this simple multi-node communication device without response, each communication node uses a transmitting communication port and a receiving communication port to send and receive communication data blocks to each other.

[0069] During the data transmission process of the multi-node data transmission device disclosed herein, the data block sent by each communication node will be received by at least one other communication node. Each other communication node that receives the data block will also perform the above-mentioned simplified communication steps without response to effectively send the data block without modification. In this way, the data block will be effectively sent by at least two communication nodes during the communication process.

[0070] Similarly, during the data transmission process of a multi-node data transmission device, each communication node's receiving communication port will receive the same data block sent by other nodes at least once. The communication node temporarily stores the received same data block in the same data storage unit of the communication data storage queue and counts the number of times the same data block is received.

[0071] During data transmission, if a data block is successfully sent and then sent out by other nodes, or if the same data block is received at least once, it indicates that the data block has been successfully sent and transmitted in the communication medium or communication space.

[0072] In the data transmission process of the multi-node data transmission device disclosed herein, each communication node can both send and receive communication data blocks, and the sending and receiving are mutually equal and intersecting. There is no master-slave relationship or central node. After a communication data block is transmitted through the network, it can reach any communication node in the network. Therefore, the networking communication network composed of the communication nodes of the present invention is a highly reliable decentralized peer-to-peer mesh network.

[0073] In another embodiment, this disclosure also specifically discloses another simple communication method without response, including: Add service networking nodes; Acquire business data, form business data blocks, and temporarily store the business data blocks in a storage queue; Obtain the number of insertions and extractions for the business data block; The processing of the service communication data block by the service networking node is determined based on the number of insertions and extractions of the service data block.

[0074] like Figure 5 The diagram illustrates a service networking node, which includes a data block storage queue, a sending communication port, a receiving communication port, a service insertion interface, and a service extraction interface. For ease of description, the communication node with the added service insertion and service extraction interfaces is referred to as a service networking node.

[0075] In this embodiment, in addition to performing data networking communication transmission on the network side, the communication node is equipped with a service insertion interface and a service extraction interface, which are used for service-side data information to enter the communication network side for communication networking transmission.

[0076] The service insertion interface of the service networking node is used to insert service data from the service side into the data block storage queue.

[0077] The service extraction interface of the service networking node is used to extract the required service data from the communication data storage queue according to the service data extraction rules.

[0078] In some embodiments, the data block storage queue of the communication section includes at least one data storage unit, each data storage unit stores a service data packet to be transmitted, and each data storage unit includes two parts: a communication data block and a transmit / receive control block.

[0079] like Figure 6 As shown, a data storage unit includes a communication data block and a transceiver control block. It should be noted that the terms "data block" and "communication data block" have the same meaning in this disclosure.

[0080] The communication data block includes at least the data source ID, data generation time, and data content.

[0081] The data source ID is used to identify the unique device code or device address code from which the business data originates, distinguishing which device in the network communication network the business data comes from.

[0082] Data generation time is used to identify the time point when business data is inserted into the communication node from the business insertion interface.

[0083] The data content refers to the content of the business data that needs to be transmitted in network communication.

[0084] The transceiver control block includes at least data transmission technology, data reception technology, and data extraction flags.

[0085] The data sending count is used to count the number of communication data block sending operations. The data sending count is incremented by 1 each time a communication data block is sent. The data sending count can be negative. For ease of description, the data sending count is defined as DataSend_Count.

[0086] The data extraction flag is used to identify whether the data has been extracted from the data extraction interface to avoid duplicate data extraction. The flag is 0 when the data has not been extracted, and it is incremented by 1 every time the data is extracted. For ease of description, the data receiving count is defined as DataFind_Flag.

[0087] For example, the communication data storage queue in this embodiment includes at least one storage block space containing at least one data storage unit. The communication data storage queue in this embodiment contains five data storage units for the storage and management of communication data blocks.

[0088] Each data storage unit consists of two parts: a data block and a transmit / receive control block. Each data block contains the data source ID, data generation time, and data content.

[0089] The data source ID field can be 4 bytes, 6 bytes, 8 bytes, or 128 bytes, depending on the length of the system communication device ID.

[0090] The data generation time field is determined based on the precision of the system's communication network timing unit. When the precision of the timing unit is at the second level, the field length is 4 bytes. When the precision of the timing unit is at the millisecond, microsecond, or nanosecond level, the field length is 8 bytes. The first 4 bytes identify the second timing, and the last 4 bytes identify the millisecond, microsecond, or nanosecond timing.

[0091] Data content field; This field is determined based on the maximum frame length of data transmitted at one time in the system communication network application. The maximum frame length can be 16 to 2048 bytes, that is, the length of the data content field in this embodiment of the invention is 16 to 2048 bytes.

[0092] The transmit / receive control block includes a data receiving technology field, a data sending technology field, and a data extraction flag field.

[0093] The data reception count field is determined based on the data transmission efficiency of the system's communication network. In low-speed transmission networks, this field is 4 bytes long, while in high-speed transmission networks, it is 8 bytes long.

[0094] The data transmission count field is determined based on the data transmission efficiency of the system's communication network. In low-speed transmission networks, this field is 4 bytes long, while in high-speed transmission networks, it is 8 bytes long.

[0095] The data extraction flag field has a length of 2 bytes.

[0096] In some embodiments, in the method of simple data transmission without response, the communication node includes at least a corresponding storage queue for temporarily storing the data blocks to be processed; wherein the data blocks correspond to the communication data blocks or the service communication data blocks; One of the storage queues contains at least one data storage unit; A data storage unit includes a data block and a transmit / receive control block, wherein the data block includes at least a data source ID, data generation time, and data content, and the transmit / receive control block includes at least a data block transmission count, a data reception count, and a data extraction flag.

[0097] Furthermore, the communication data storage queue contains at least one data storage unit. Operations on the communication data storage queue or the service communication storage queue follow a time-priority principle. That is, during insertion and / or reception, communication data blocks with more recent data generation times overwrite communication data blocks with older data generation times. During transmission and / or retrieval, communication data blocks with older data generation times take precedence over communication data blocks with more recent data generation times.

[0098] For example, when a service network node transmits communication data blocks using the aforementioned simplified communication method without response, it uses the data transmission count field of the transceiver control block to count and record the number of times the communication data blocks are transmitted, and uses the data reception count field of the transceiver control block to count and record the number of times the communication data blocks are received.

[0099] After the service network node extracts the required service data from the service extraction interface according to the service data extraction rules, it will increment the data extraction flag of the send / receive control block of the corresponding data storage unit by 1, indicating that the service data has been successfully extracted by the service network node.

[0100] In some embodiments, each of the communication nodes has the same system time; When the service data block is formed, the data generation time of the service data block is added according to the system time when the data content enters the communication node.

[0101] It should be noted that the aforementioned communication nodes and service networking nodes all have the same system time or the same time timing unit; the data generation time point filled in when inserting service data all comes from this time timing unit, and data communication transmission is based on the data generation time.

[0102] This disclosure utilizes a clock synchronization protocol to ensure that the timing units of all nodes are in phase and frequency, and that the time remains consistent. That is, the time of each node remains accurate and consistent throughout the entire network transmission process of the communication data block.

[0103] Furthermore, in order to improve the reliability of network communication and reduce the bit error rate and packet loss rate, the accuracy of the clock synchronization protocol can be improved as needed, so that the time timing units of all nodes can reach the time accuracy of milliseconds, microseconds or even nanoseconds. Therefore, the data generation time in the communication data block will also reach the corresponding time accuracy level.

[0104] Furthermore, when all communication nodes and service networking nodes in this disclosure are used for international interconnection communication transmission, the timekeeping units of all nodes will be consistent with the international standard calendar time, and high-precision satellite time synchronization will be used to ensure the accuracy and consistency of time for each node during communication transmission.

[0105] In this embodiment, a simple method for transmitting data without response is provided, applied to a service network node. The method includes the following steps: Service network nodes insert and copy service data to the service network nodes through service interfaces; The business data is temporarily stored in a storage queue and formed into a business communication data block; The service networking node performs effective transmission processing on the communication data block. Each effective transmission processing includes at least one transmission operation, and the first communication node counts the number of transmission operations.

[0106] When the number of transmissions reaches a preset value, the first communication node stops sending communication data blocks and does not wait for transmission confirmation.

[0107] When a service network node needs to transmit service data via network communication, it inserts the service data into the data content field of a data storage unit in the communication data storage queue through the service insertion interface on the service side. When inserting and copying service data, the service network node also writes the unique device code or device address code of the source of the service data into the data source ID field and writes the time point when the service data is inserted into the data generation time field.

[0108] The data source ID, data generation time, and data content form a communication data block, which is then transmitted as a whole via the sending communication port.

[0109] In this embodiment, after the communication data block is inserted into the data storage unit of the service network node by the service side, it remains unchanged and unmodified throughout the subsequent network communication transmission, sending, receiving, and storage processes of all nodes, until it is overwritten by other communication data blocks in the data storage unit. In some embodiments, the method for simple data transmission without response further includes: temporarily storing the data block to be processed in the storage queue, wherein the storage queue processes the data block according to the time priority principle, including: The generation time of the data block is confirmed; The data blocks are stored in order of their generation time, including: The data block is stored in a preset storage space of the storage queue, or the data block is overwritten by the data block whose generation time is earlier among the data blocks that meet the conditions.

[0110] In this embodiment, the method further includes; When the preset storage space has not reached the maximum preset space, the data block is stored in the storage queue; When the preset storage space reaches its maximum preset space, then the following applies: Identify the data blocks that meet the conditions of the data blocks; If the data block does not meet the conditions of the data block in the storage queue, then the data block is stored in the storage queue. When the data block meets the conditions of the data block in the storage queue, the data block is directly overwritten by the data block with the earlier generation time, and the count flag of the data block is incremented by 1. Alternatively, when the data block meets the conditions of the data block in the storage queue, the number of times the data block with the earlier generation time is sent is obtained. When the number of times the data block with the earlier generation time is sent reaches the maximum sending threshold, the data block is directly overwritten by the data block with the earlier generation time.

[0111] In this disclosure, when sending the data block, the data block with the earlier data time is sent first, and there is no data block overwriting relationship.

[0112] In this disclosure, after obtaining the corresponding data block or business data block through the communication node, the data block needs to be stored. There are two possible storage methods: First, search for an empty space in the storage queue to store the data. If space is available, store it directly; otherwise, search for and overwrite the oldest data block in the storage queue. Second, search for an empty space in the storage queue to store the data. If space is available, store it directly; otherwise, check if the oldest data block in the storage queue has reached the maximum transmission threshold. If it has, overwrite it directly; otherwise, discard the inserted data block. Alternatively, when inserting business data, the same two methods are followed.

[0113] It should be noted that the data blocks that are determined to meet the conditions are compared based on their specific data generation time, data source ID, and / or data content. For example, the data generation time and data source ID of a data block can be used to compare its compatibility with other data blocks in the storage queue. Alternatively, the data content of a data block can be used to directly compare its compatibility with other data blocks in the storage queue. Furthermore, the generation time, data source ID, and data content of a data block can all be used to compare its compatibility with other data blocks in the storage queue.

[0114] In some embodiments, the method further includes: When acquiring the data block, the storage queue is traversed to confirm the receiving operation of the data block; if the data block is already stored in the storage queue, the receiving temporary storage operation is exited, and the number of times the data block is received is incremented by 1; if the data block is not stored in the storage queue, the data block is stored in the storage queue, and the number of times the data block is received is initialized.

[0115] Alternatively, when acquiring the business data block, the storage queue is traversed to confirm the insertion operation of the business data block; the time of acquiring the business data block is confirmed and determined as the data generation time of the business data, and an initial value is assigned to the number of insertions of the business data block.

[0116] When the communication node of this disclosure receives a communication data block from the receiving communication port, it searches the communication data storage queue for a data storage unit space that meets the conditions to store the communication data block according to the time priority principle. The detailed steps are as follows: Traverse the communication data storage queue and compare whether the communication data block has been stored in the queue. If it has been stored in the queue, increment the data reception count of the data storage unit that temporarily stores the communication data block by 1, indicating that the communication node has received the communication data block again, and then exit the receiving and temporary storage operation.

[0117] determining that the received communication data block belongs to new data that is not stored in the communication data storage queue, traversing the queue to find the data storage unit with the oldest data generation time according to the time-first principle, and comparing the data generation time Time_old in the found data storage unit with the data generation time Time_recv in the received communication data block.

[0118] if it is determined that Time_old < Time_recv, the received communication data block is used to overwrite the found data storage unit, and the data sending count, data receiving count and data extraction flag are assigned initial values; otherwise, the received communication data block is directly discarded.

[0119] when acquiring a data block through a communication node, it is necessary to determine whether the data block has been received, that is, whether it is already stored in the storage queue. If the data block has been received, increment the reception count flag of the data block by 1; if the data block has not been received, find an empty pre-stored storage space for storage. It is further necessary to determine whether there is a preset storage space in the storage queue for storage. If there is no free storage space, similar to the above insertion processing method, there are two processing modes; initial value assignment is also required in the same way; if there is no free storage space, directly find and overwrite the earliest-timed data in the storage queue, or find whether the earliest-timed data in the storage queue reaches the maximum sending threshold, if the maximum sending threshold is reached, directly overwrite, if the maximum sending threshold is not reached, discard the acquired data.

[0120] or, when acquiring corresponding service data blocks through networking nodes, the same principle is as described above, and reference can be made to the storage of inserted service data blocks in the above embodiments, which will not be repeated here.

[0121] whether acquiring data blocks or service data blocks, corresponding initial value assignment shall be performed according to the above judgment, and counting marks shall be performed for the reception times of data blocks or the insertion times of service data blocks.

[0122] for example, the initial values assigned when receiving a data block are: number of sending times = 0, number of receiving times = 1, extraction flag = 0. The default initial values assigned when inserting a service data block are: number of sending times = 0, number of receiving times = 0, extraction flag = 0. Further, in order to increase communication reliability and increase the sending times of service data inserted when a data block enters the network for the first time, the number of sending times at insertion is assigned a negative number (number of sending times = -1 / -3).

[0123] Further, in the method of this embodiment, comparing and determining whether the data block has been received may refer to the comparison method in the foregoing embodiment for comparing whether a data block meets the condition of a data block in a storage queue, or may be determined in combination with counting by a control unit in the foregoing method.

[0124] For example, as Figure 7 , a reception communication processing procedure of a communication node is disclosed, which specifically includes the following steps: 1. Judging the correctness of the received communication data block, and exiting if not; 2. Extracting the data generation time Time_old of the communication data block; 3. Traversing the communication data storage queue to judge that the received communication data block exists, and incrementing the data reception count by 1 if it exists; 4. Traversing and searching for the data storage unit with the oldest data generation time; 5. Extracting the data generation time Time_old of the data storage unit; 6. Comparing the data generation time, judging whether Time_old < Time_recv holds, and exiting if not; 7. Overwriting the found data storage unit with the received communication data block; 8. Assigning the data transmission count, the data reception count and the data extraction flag to initial values; 9. Exiting.

[0125] In this embodiment, when service data is inserted at a service insertion interface of a service networking node, the service data, a data source ID and a data generation time are integrated together to generate a communication data block, and the communication data storage queue is traversed according to a time priority principle to find a qualified data storage unit space for storing the data communication block. The detailed steps are as follows: A temporary data communication block is created, the unique device code or device address code of the service data source is written into the data source ID field of the temporary data communication block, and the time point Time_ins when the service data is inserted is written into the data generation time field of the temporary data communication block. The service data is copied to the data content field of the temporary data communication block.

[0126] The communication data storage queue is traversed to find the data storage unit with the oldest data generation time, the data generation time Time_old in the found data storage unit is compared with the inserted data generation time Time_insert, if Time_old < Time_insert, the found data storage unit is overwritten with the created temporary communication data block, and the data transmission count, the data reception count and the data extraction flag are assigned to initial values, otherwise the service data is discarded.

[0127] In this embodiment, the communication data block is only generated together based on the data source ID and the data generation time when the service insertion interface performs service data insertion. In the subsequent networking transmission, sending, receiving and temporary storage processes, the communication data block remains intact and is not modified, and will only disappear after being overwritten by another updated communication data block.

[0128] The communication data block generated when the service insertion interface performs service data insertion in this embodiment can uniquely identify one piece of service data in a communication network by using the data source ID and the data generation time, and the service data will not be modified no matter which node it is transmitted through, which ensures data reliability and traceability.

[0129] For example, Figure 8 , a service insertion processing procedure step of a communication node is disclosed, 1. Determine the correctness of the service data, and exit if the result is no; 2. Create a temporary communication data block; 3. Acquire the data insertion time Time_insert and store it in the temporary communication data block 4. Acquire the data source ID and store it in the temporary communication data block 5. Store the service data in the temporary communication data block 6. Traverse to find the data storage unit with the earliest data generation time 7. Extract the data generation time Time_old of the data storage unit 8. Compare that Time_old < Time_insert, and exit if the result is no; 9. Overwrite the found data storage unit with the temporary communication data block; 10. Assign the data sending count, data receiving count and data extraction flag to the initial values; 11. End and exit.

[0130] In some embodiments, the non-response simple data transmission method further comprises: When sending the data block, traverse the storage queue, and confirm the sending operation on the data block according to the time priority principle, which comprises: confirming the data block that meets the data block condition; sending the qualified data block which has the earliest generation time and is not processed, and incrementing the sending count flag of the qualified data block by 1.

[0131] When the communication node of this embodiment sends a communication data block to a communication transmitting port, according to the time priority principle, it traverses the communication data storage queue to find the unprocessed effectively sent data storage unit that meets the condition and has the oldest data generation time to perform effective sending processing on the communication data block. The detailed steps are as follows: Determine whether the data storage unit contains communication data blocks; When the number of data receptions in the data storage unit reaches the maximum reception threshold, the maximum transmission threshold is recalculated according to the specified rules and adjusted accordingly. If the number of data transmissions in the data storage unit reaches the maximum transmission threshold, the search continues. After traversing and finding the oldest data storage unit that has not been effectively sent and processed, the communication data block is extracted and sent once using the sending communication port, and the data transmission count in the send / receive control block is incremented by 1.

[0132] For example, such as Figure 9 The present invention discloses a process for a communication node to send communication data. 1. A temporary time variable stores the current time point; 2. Loop through the communication data storage queue; 3. Determine if the data in the data storage unit is valid; otherwise, proceed to step 8. 4. If the receive count reaches the maximum receive threshold, adjust the maximum send threshold accordingly. 5. If the sending count reaches the maximum sending threshold, proceed to step 8; 6. Check if the temporary time variable is greater than the data generation time; if not, proceed to step 8. 7. Temporary time variable stores the data generation time; 8. Check if the communication data storage queue has been traversed in a loop. If not, proceed to step 2. 9. Determine if a data communication unit that has not been effectively sent and processed has been found; if not, exit. 10. Sending communication data blocks; 11. Data transmission count +1; 12. Exit.

[0133] In some embodiments, the method further includes: when extracting the business data block, traversing the storage queue and confirming the extraction operation of the business data block according to the time priority principle, including: confirming the data block that meets the conditions of the business data block; extracting the data block that meets the conditions and has the earliest generation time and has not been processed, and incrementing the extraction count flag of the data block that meets the conditions by 1.

[0134] The service extraction interface of the service networking node traverses the communication data storage queue and extracts the required service data according to the service data extraction rules. After each extraction of a communication data block of a data storage unit, the data extraction flag is incremented by 1 to indicate that the data has been extracted once.

[0135] For example, such as Figure 10The present invention discloses a service proposal processing procedure for a communication node. 1. Determine the compliance of the business extraction rules; if not, terminate and exit. 2. Loop through the communication data storage queue; 3. Determine if the data storage unit meets the extraction rules; if not, proceed to step 6. 4. Data extraction flag +1; 5. The data content is returned to the extractor through the business extraction interface; 6. Determine if the communication data storage queue has been traversed in a loop. If not, proceed to step 2. 7. Exit.

[0136] In some embodiments, when a new communication data block is temporarily stored in the communication data storage queue, the service insertion interface and the receiving communication port need to set the data sending count, data receiving count, and data extraction flag to initial values. By default, this invention sets the data sending count to 0, the data receiving count to 0, and the data extraction flag to 0. In some embodiments, the method further includes: in any transmit / receive control block corresponding to the communication node, the initial value, maximum transmit threshold and / or maximum receive threshold of the data block in the storage queue can be customized to adjust the reliability of the communication network.

[0137] In the embodiments of this disclosure, by setting different maximum sending thresholds and maximum receiving thresholds, as well as initial values ​​for data sending counts and initial values ​​for data receiving counts, the number of times the service networking nodes and communication nodes send effective data blocks can be adjusted to ensure the reliability and simplicity of data transmission during network communication. By default, this invention sets the maximum sending threshold to 1 and the maximum receiving threshold to the maximum value that the variable can store. That is, the service networking node that inserts the service data source sends effective data block transmission 2 or 4 times, and the communication node that forwards the communication data block sends effective data block transmission 1 time. If 10 nodes are in network communication, reliable transmission of one service data to the entire network only requires (2 × 1) + (1 × 9) = 11 communications, while transmission using the send-response confirmation mode requires at least 3 × 10 = 30 communications. The communication network transmission efficiency of this invention is much higher than that of the send-response confirmation mode.

[0138] Specifically, in one embodiment, a communication node that can implement a simple data transmission method without response is disclosed. The communication node of this embodiment needs to manage the communication data storage queue and use the transmit / receive control block of each data storage unit to control the number of times the communication data block of the communication node is received and sent.

[0139] For example, the communication node includes one data structure and four processing flows, such as... Figure 5 Specifically, this includes a communication data storage queue data structure, a service insertion processing flow, a service extraction processing flow, a sending communication processing flow, and a receiving communication processing flow.

[0140] The data structure of the communication data storage queue, and the corresponding memory management of the communication data storage queue; The business insertion process refers to the handling of business data insertion when corresponding business insertion interfaces are used. The business extraction processing flow refers to the processing of business data extraction when using the corresponding business extraction interface. The communication processing flow is sent, and the corresponding communication port is used to effectively send communication data blocks. The receiving communication processing flow involves receiving and processing communication data blocks at the corresponding receiving communication port.

[0141] Due to inconsistencies in communication rates between the hardware and software interfaces of the communication nodes disclosed herein, the data transmitted varies, with some communication interfaces transmitting data faster and others slower. Preferably, the data transmission speed is determined based on the hardware and software interface with the lowest communication rate.

[0142] Furthermore, in the various embodiments of this disclosure, by default, the insertion, transmission, and reception of communication data blocks are all performed using a fixed timeline and in accordance with the time priority principle to ensure reliable transmission of each data packet and avoid data loss and transmission errors caused by old data overwriting new data. However, in actual network applications, due to limitations in time accuracy, the level of real data, and different network topologies, application evolution is required based on this time priority principle.

[0143] In some embodiments, the method, regarding the time priority principle for sending data blocks, includes: evolving the time priority principle for sending based on a data priority sending method based on the number of transmissions, evolving the time priority principle for sending based on a data priority sending method based on the number of receptions, and / or evolving the time priority principle for sending based on a data priority sending method at the data level.

[0144] This disclosure further provides three evolution methods: data priority transmission based on the number of transmissions, data priority transmission adjusted based on the number of receptions, and data priority transmission based on the data level.

[0145] The data priority sending method based on the number of transmissions stipulates that when several communication data blocks are transmitted at similar times (less than 1 second or 100 ms), the data blocks with negative transmission counts are sent first, followed by the data blocks with smaller transmission counts, and finally the data blocks with larger transmission counts.

[0146] By prioritizing the transmission frequency through this disclosure, different data in the communication data storage queue of the communication node are sent out for network transmission to the maximum extent. Limited network transmission resources are allocated to these different data to improve the network transmission throughput and reduce transmission latency.

[0147] The data priority transmission method based on the number of receptions can gradually adjust the maximum transmission threshold according to the number of times the communication data block is received, thereby reducing the number of data transmissions. Specifically, a multi-level adjustment table is defined, specifying the percentage reduction in the maximum transmission threshold when the number of data receptions reaches a certain value or a certain condition is met, until the maximum transmission threshold is reduced to the "1" position, and the maximum transmission threshold cannot be lower than "1".

[0148] In this disclosed method, the probability of a communication data block being reliably received by other neighboring nodes can be determined by the number of data receptions. Once it is determined that the communication data block has been reliably received by other neighboring nodes, the repeated transmission of the same data can be reduced and avoided, reducing the repeated occupation of communication medium resources. Instead, other communication data blocks that have not been transmitted before can be transmitted, thereby improving the communication efficiency and throughput of network transmission.

[0149] This data-priority transmission method adds a data priority field to communication data blocks to identify the transmission priority of the data content. When transmitting data, communication nodes send high-priority data first, followed by low-priority data. Data priorities are divided into transmission delay priority and transmission reliability priority. For data with high transmission delay priority, the network transmission delay should be minimized. For data with transmission reliability priority, the network transmission must ensure data transmission reliability, and bit errors and packet loss are not allowed.

[0150] Therefore, data with high transmission delay priority is sent earlier to reduce the time and latency of data storage and waiting in communication nodes. For data with transmission reliability priority, the maximum sending threshold is increased to increase the number and intensity of data retransmissions. If a communication data block has both transmission delay priority and transmission reliability priority, it is sent earlier with increased retransmission frequency. In this approach, by defining different types of data priorities, different network service data have different transmission characteristics, meeting different user needs. It can satisfy both the rapid and reliable transmission of urgent data and the general transmission of ordinary data.

[0151] In the priority transmission principle disclosed herein, any of the above methods can be introduced, or data based on a hybrid of the above three modes can be transmitted with priority.

[0152] Specifically, the three different priority modes mentioned above—priority of sending number of times, priority of receiving number of times, and priority of data level—are arranged and combined according to certain rules to calculate a comprehensive data sending priority for data transmission.

[0153] The specific method is to define a 4-digit priority number from 0000 to 9999. Based on flexible configuration, the priority of sending number, receiving number, transmission delay, and transmission reliability are arranged and combined according to the units, tens, hundreds, and thousands to determine a permutation and combination rule. Each communication data block calculates a comprehensive data sending priority based on the number of data sent, the number of data received, the transmission delay priority, and the transmission reliability priority to determine the order of data transmission.

[0154] By combining the three methods disclosed herein, more flexible data transmission and processing priorities can be achieved through hybrid operations, adapting to various data transmission and processing application scenarios. This allows for more flexible and comprehensive network transmission, better meeting the heterogeneous needs of IoT networking.

[0155] Furthermore, to reduce the impact of low-speed communication ports on communication network efficiency, the communication throughput can be improved by increasing the number of low-speed communication interfaces, such as... Figure 1 An RF wireless transceiver can achieve a communication rate of 10 Mbps via the SPI bus, while an RS485 transceiver can only achieve a communication rate of 2.5 Mbps. By using an interface aggregation matching driver, four RS485 transceivers can be aggregated for communication, transmitting different data respectively, achieving a communication rate of 10 Mbps, thus maintaining the rate of the transmitting and receiving communication ports at 10 Mbps.

[0156] A second aspect of this disclosure provides a simple, non-responding communication device. In some embodiments, the apparatus is applied to the simple communication method for a communication node to acquire a data block without response in the first aspect, characterized in that the apparatus includes at least: a communication node, a receiving communication port, and a sending communication port, wherein each of the communication nodes corresponds to one receiving communication port and one sending communication port; wherein the receiving communication port and the sending communication port are any physical, logical, hardware, or software medium, line, and interface capable of transmitting information and data.

[0157] In some embodiments, the apparatus is applied to the non-response simplified communication method for service network nodes to obtain service data blocks in the first aspect, characterized in that the apparatus includes at least: a service network node, a service insertion interface, and a service extraction interface, wherein each of the service network nodes corresponds to one service insertion interface and one service extraction interface; wherein the service insertion interface and the service extraction interface are any physical, logical, hardware, or software medium, line, and interface capable of transmitting information and data.

[0158] The term "transmitting communication port" and "receiving communication port" in this disclosure refers to any physical, logical, hardware, or software medium, line, or interface capable of transmitting information and data. These mediums, lines, and interfaces capable of transmitting information and data are collectively referred to as "data interfaces."

[0159] In this embodiment, the transmitting and receiving communication ports consist of a set of at least one data interface, which can be a combination of different media, different lines, and different interfaces.

[0160] In the implementation of this disclosure, the physical medium, lines, and interfaces can be WiFi transceivers, Bluetooth transceivers, LoRa wireless transceivers, Zigbee wireless transceivers, other radio transceivers, infrared transceivers, acoustic transceivers, satellite link transceivers, GSM, 4G, 5G, and other radio transceivers of various frequency bands. They can also be Ethernet communication interfaces, fiber optic communication interfaces, RS232 transceivers, RS485 transceivers, PLC transceivers, and other wired communication modules and data communication transceivers.

[0161] The logic medium, lines, and interfaces disclosed herein can be any number and any type of logic combination of the various wired and wireless communication modules and data communication transceivers described above, such as... Figure 2 As shown, this disclosure can combine two WiFi transceivers, one Bluetooth transceiver, one PLC transceiver, and one Ethernet transceiver into a single logical transmit and receive communication port.

[0162] The transmit and receive communication ports disclosed herein are configured to treat any number and type of communication transceivers as a single communication port through a communication port adapter driver layer for data transmission and reception.

[0163] In some embodiments of the second aspect of this disclosure, such as Figure 11 The schematic diagram of the device shown is applied to any possible method implemented in the first aspect described above. The device includes: a receiving unit for receiving data blocks through a communication node; a storage unit for temporarily storing the data blocks in a storage queue; a processing unit for obtaining the number of times the data blocks are received and the number of times they are sent; and a sending unit for stopping the sending processing of the data blocks by the communication node when the number of times the data blocks are received and the number of times the data blocks are sent reach a preset condition.

[0164] A third aspect of this disclosure provides a communication device, comprising: a memory for storing processor-executable instructions; and a processor connected to the memory; wherein the processor is configured to perform any possible implementation of the method of the first aspect. Furthermore, the application of this method is not limited to the processor referred to in this disclosure, but can also be executed in a corresponding logic chip.

[0165] A fourth aspect of this disclosure provides a communication device that, when instructions in the storage medium are executed by a computer's processor, enables the computer to perform any method that may be implemented as in the first aspect.

[0166] Figure 12 This is a block diagram illustrating a communication device 600 according to an exemplary embodiment. The methods or apparatus according to embodiments of this disclosure can also be implemented using the architecture of a computing device. 12 shows a schematic diagram of the architecture of an exemplary computing device according to an embodiment of this disclosure. As shown in 12, the computing device 600 may include a bus 601, one or more CPUs 602, a read-only memory (ROM) 603, a random access memory (RAM) 604, a communication port 605 connected to a network, an input / output component 606, a hard disk 607, etc. Storage devices in the computing device 600, such as ROM 603 or hard disk 607, may store various data or files used for processing and / or communication in the data processing method based on inter-node data sharing provided in this disclosure, as well as program instructions executed by the CPU. The computing device 600 may also include a user interface 608. Of course, Figure 12 The architecture shown is merely exemplary and can be omitted as needed when implementing different devices. Figure 12 One or more components in the computing device shown.

[0167] According to another aspect of this disclosure, a computer-readable storage medium is also provided, on which computer-readable instructions are stored. When the computer-readable instructions 601 are executed by a processor, a data processing method based on inter-node data sharing according to an embodiment of this disclosure, as described with reference to the above figures, can be performed. The computer-readable storage medium includes, but is not limited to, volatile memory and / or non-volatile memory. The volatile memory may, for example, include random access memory (RAM) and / or cache memory. The non-volatile memory may, for example, include read-only memory (ROM), hard disk, flash memory, etc.

[0168] Those skilled in the art will understand that the contents disclosed herein can be varied and modified in many ways. For example, the various devices or components described above can be implemented in hardware, or in software, firmware, or a combination of some or all of the three.

[0169] Furthermore, while this disclosure makes various references to certain units in systems according to embodiments of this disclosure, any number of different units may be used and run on clients and / or servers. The units described are merely illustrative, and different aspects of the systems and methods may use different units.

[0170] Those skilled in the art will understand that all or part of the steps in the above methods can be implemented by a program instructing related hardware, and the program can be stored in a computer-readable storage medium, such as a read-only memory, a disk, or an optical disk. Optionally, all or part of the steps in the above embodiments can also be implemented using one or more integrated circuits. Accordingly, each module / unit in the above embodiments can be implemented in hardware or as a software functional module. This disclosure is not limited to any particular combination of hardware and software.

[0171] Unless otherwise defined, all terms used herein (including technical and scientific terms) shall have the same meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. It should also be understood that terms such as those defined in a common dictionary shall be interpreted as having a meaning consistent with their meaning in the context of the relevant art, and not as having an idealized or highly formalized meaning, unless expressly defined herein.

[0172] The foregoing description is intended to illustrate the present disclosure and should not be construed as limiting it. While several exemplary embodiments of the present disclosure have been described, those skilled in the art will readily understand that many modifications may be made to the exemplary embodiments without departing from the novel teachings and advantages of the present disclosure. Therefore, all such modifications are intended to be included within the scope of the present disclosure as defined by the claims. It should be understood that the foregoing description is intended to illustrate the present disclosure and should not be construed as limiting it to the specific embodiments disclosed, and modifications to the disclosed embodiments and other embodiments are intended to be included within the scope of the appended claims. The present disclosure is defined by the claims and their equivalents.

Claims

1. A simple communication method without response, characterized in that, Data blocks are obtained through communication nodes; The data block is temporarily stored in a storage queue; The number of times the data block is received and the number of times it is sent are obtained; when the number of times the data block is received and the number of times it is sent reach a preset condition, the communication node stops sending the data block. When the number of receptions and the number of transmissions reach a preset condition, the communication node stops processing the transmission of the data block, including: Set the maximum sending threshold and maximum receiving threshold for the communication node; Once the number of transmissions reaches the maximum transmission threshold, the transmission of the data block will stop. The method further includes: When the number of receptions reaches the maximum reception threshold, the maximum transmission threshold is lowered or the number of transmissions is increased according to the preset settings. If the number of transmissions does not reach the maximum transmission threshold and the number of receptions reaches the maximum reception threshold, then the maximum transmission threshold is reduced according to the preset settings.

2. The simple communication method without response according to claim 1, characterized in that, The method further includes: temporarily storing the data block in a storage queue; The communication node performs effective transmission processing on the data block, wherein each effective transmission processing includes at least one transmission operation. The number of times the sending operation is performed is counted.

3. The simple communication method without response according to claim 1, characterized in that, The method further includes: networking at least two of the communication nodes, wherein the communication nodes can transmit data to each other; when the number of times the data block is received or sent in any of the communication nodes in the network reaches the preset condition, the sending process of the data block is stopped.

4. The simple communication method without response according to claim 1, characterized in that, The method further includes: Add service networking nodes; Acquire business data, form business data blocks, and temporarily store the business data blocks in a storage queue; Obtain the number of insertions and extractions for the business data block; The processing of the service data block by the service network node is determined based on the number of insertions and extractions of the service data block.

5. A simple communication method without response according to claim 1 or 4, characterized in that, The method includes: The communication node includes at least one corresponding storage queue for temporarily storing the data blocks to be processed; wherein the data blocks correspond to communication data blocks or service data blocks. One of the storage queues contains at least one data storage unit; A data storage unit includes a data block and a transceiver control block, wherein the data block includes at least a data source ID, a data generation time, and data content, and the transceiver control block includes at least a data transmission count, a data reception count, and a data extraction flag.

6. The simple communication method without response according to claim 5, characterized in that, The method includes: Each of the aforementioned communication nodes has the same system time; When the service data block is formed, the data generation time of the service data block is added according to the system time when the data content enters the communication node.

7. The simple communication method without response according to claim 5, characterized in that, The method further includes: After temporarily storing the data block to be processed in the storage queue, the storage queue processes the data block according to the time priority principle, including: Determine the generation time of the data block; The data blocks are stored in order of their generation time, including: Identify the data blocks that meet the conditions of the data blocks; The data block is stored in a preset storage space of the storage queue, or the data block is overwritten by the data block whose generation time is earlier among the data blocks that meet the conditions.

8. A simple communication method without response according to claim 7, characterized in that, The method further includes: When the preset storage space has not reached the maximum preset space, the data block is stored in the storage queue; when the preset storage space has reached the maximum preset space, the process includes: determining the data block that meets the conditions of the data block. If the data block does not meet the conditions of the data block in the storage queue, then the data block is stored in the storage queue. When the data block meets the conditions of the data block in the storage queue, the data block is directly overwritten by the data block with the earlier generation time, and the receive count flag of the data block is incremented by 1. Alternatively, when the data block meets the conditions of the data block in the storage queue, the number of times the data block with the earlier generation time is sent is obtained. When the number of times the data block with the earlier generation time is sent reaches the maximum sending threshold, the data block is directly overwritten by the data block with the earlier generation time.

9. A simple communication method without response according to claim 4, characterized in that, The method further includes: when acquiring the data block, traversing the storage queue to confirm the receiving operation of the data block; if the data block is already stored in the storage queue, exiting the receiving temporary storage operation and incrementing the count of receiving the data block by 1; if the data block is not stored in the storage queue, storing the data block in the storage queue and assigning an initial value to the count of receiving the data block. Alternatively, when acquiring the business data block, the storage queue is traversed to confirm the insertion operation of the business data block; the time of acquiring the business data block is confirmed and determined as the data generation time of the business data, and an initial value is assigned to the number of insertions of the business data block.

10. A simple communication method without response according to claim 1, characterized in that, The method further includes: when sending the data block, traversing the storage queue and confirming the sending operation for the data block according to the time priority principle, including: Confirm the data blocks that meet the conditions of the data blocks; Send the data block that meets the conditions and was generated earliest and has not been processed, and increment the sending count flag of the data block that meets the conditions by 1.

11. A simple communication method without response according to claim 4, characterized in that, The method further includes: when extracting the business data block, traversing the storage queue and confirming the extraction operation of the business data block according to the time priority principle, including: Confirm the data blocks that meet the conditions of the aforementioned business data blocks; Extract the data block that was generated earliest and has not yet been processed, and increment the extraction count flag of the data block that meets the conditions by 1.

12. The simple communication method without response according to claim 10, characterized in that, The method further includes: The time priority principle during transmission is evolved based on the data priority transmission method based on the number of transmissions, the time priority principle during transmission is evolved based on the data priority transmission method based on the number of receptions, and / or the time priority principle during transmission is evolved based on the data level.

13. A simple communication method without response according to claim 5, characterized in that, The method further includes: in any of the transmit / receive control blocks corresponding to the communication node, the initial value, maximum transmit threshold and / or maximum receive threshold of the data block in the storage queue can be customized to adjust the reliability of the communication network.

14. A simple communication device without response, characterized in that, The simple communication method without response as described in claim 1 is characterized in that the device includes at least: a communication node, a receiving communication port and a sending communication port, wherein each of the communication nodes corresponds to one receiving communication port and one sending communication port; The receiving communication port and the transmitting communication port are any physical, logical, hardware or software medium, line or interface that can transmit information and data.

15. A simple communication device without response, characterized in that, The simple communication method without response as described in claim 4 is characterized in that the device comprises at least: The service networking node includes a service insertion interface and a service extraction interface, wherein each of the service networking nodes corresponds to one service insertion interface and one service extraction interface. The service insertion interface and the service extraction interface mentioned therein can be any physical, logical, hardware or software medium, line or interface that can transmit information and data.

16. A simple, non-responding communication device, applied to the non-responding simple communication method according to any one of claims 1 to 13, characterized in that, The device includes: A receiving unit, used to receive data blocks through a communication node; A storage unit is used to temporarily store the data block in a storage queue; A processing unit is used to obtain the number of times the data block is received and / or the number of times it is sent; The sending unit is used to stop the communication node from sending the data block when the number of receptions and the number of transmissions reach a preset condition.

17. A simple communication device without response according to claim 16, characterized in that, The sending unit further includes: setting the maximum sending threshold and the maximum receiving threshold of the communication node; Once the number of transmissions reaches the maximum transmission threshold, the transmission of the data block is stopped.

18. A simple communication device without response according to claim 17, characterized in that, The transmitting unit further includes: When the number of receptions reaches the maximum reception threshold, the maximum transmission threshold is lowered or the number of transmissions is increased according to the preset settings. If the number of transmissions does not reach the maximum transmission threshold and the number of receptions reaches the maximum reception threshold, then the maximum transmission threshold is reduced according to the preset settings.

19. A simple communication device without response according to claim 16, characterized in that, The device further includes: A networking unit is used to network at least two of the communication nodes, wherein the communication nodes can transmit data to each other; when the number of times the data block is received or sent in any of the communication nodes in the network reaches the preset condition, the transmission processing of the data block is stopped.

20. A simple communication device without response according to claim 16, characterized in that, The device further includes: Service networking unit, used to add service networking nodes; Acquire business data, form business data blocks, and temporarily store the business data blocks in a storage queue; Obtain the number of insertions and extractions for the business data block; The processing of the service data block by the service network node is determined based on the number of insertions and extractions of the service data block.

21. A simple communication device without response according to claim 16, characterized in that, The device further includes: The communication node includes at least one corresponding storage queue for temporarily storing the data blocks to be processed; wherein the data blocks correspond to communication data blocks or service data blocks. One of the storage queues contains at least one data storage unit; A data storage unit includes a data block and a transmit / receive control block, wherein the data block includes at least a data source ID, data generation time, and data content, and the transmit / receive control block includes at least a data transmission count, a data reception count, and a data extraction flag.

22. A simple communication device without response according to claim 21, characterized in that, The device further includes: A storage processing unit is configured to temporarily store the data block to be processed in the storage queue, wherein the storage queue processes the data block according to a time-priority principle, including: Determine the generation time of the data block; The data blocks are stored in order of their generation time, including: Identify the data blocks that meet the conditions of the data blocks; The data block is stored in a preset storage space of the storage queue, or the data block is overwritten by the data block whose generation time is earlier among the data blocks that meet the conditions.

23. A simple communication device without response according to claim 16 or 20, characterized in that, The device further includes: A receiving unit is used to traverse the storage queue and confirm the receiving operation for the data block when acquiring the data block; Determine whether the data block meets the conditions of the data blocks in the storage queue; When the data block has been stored in the storage queue, the receiving temporary storage operation is exited, and the number of times the data block has been received is incremented by 1. If the data block is not stored in the storage queue, the data block is stored in the storage queue, and the receive count flag of the data block is assigned an initial value.

24. A simple, non-responding communication device according to claim 16 or 20, characterized in that, The device further includes: An insertion unit is used to traverse the storage queue and confirm the insertion operation for the data block when the data block is acquired.

25. A simple communication device without response according to claim 16, characterized in that, The device further includes: A sending processing unit is configured to, when sending the data block, traverse the storage queue and determine the sending operation for the data block according to a time priority principle, including: Confirm the data blocks that meet the conditions of the data blocks; Send the data block that meets the conditions and was generated earliest and has not been processed, and increment the sending count flag of the data block that meets the conditions by 1.

26. A communication device, characterized in that, include: Memory used to store processor-executable instructions; A processor connected to the memory; wherein the processor is configured to perform the method as described in any one of claims 1 to 13.

27. A non-transitory computer-readable storage medium, wherein instructions in the storage medium, when executed by a processor of a computer, enable the computer to perform the method as described in any one of claims 1 to 13.

Images