WO2023143030A1 - 无应答简易通信方法及装置 - Google Patents

无应答简易通信方法及装置 Download PDF

Info

Publication number
WO2023143030A1
WO2023143030A1 PCT/CN2023/071441 CN2023071441W WO2023143030A1 WO 2023143030 A1 WO2023143030 A1 WO 2023143030A1 CN 2023071441 W CN2023071441 W CN 2023071441W WO 2023143030 A1 WO2023143030 A1 WO 2023143030A1
Authority
WO
WIPO (PCT)
Prior art keywords
data block
data
sending
communication
receiving
Prior art date
Application number
PCT/CN2023/071441
Other languages
English (en)
French (fr)
Inventor
潘进
Original Assignee
武汉微智创大科技有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 武汉微智创大科技有限公司 filed Critical 武汉微智创大科技有限公司
Publication of WO2023143030A1 publication Critical patent/WO2023143030A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L43/00—Arrangements for monitoring or testing data switching networks
    • H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
    • H04L43/0823—Errors, e.g. transmission errors
    • H04L43/0829—Packet loss
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L47/00—Traffic control in data switching networks
    • H04L47/10—Flow control; Congestion control
    • H04L47/32—Flow control; Congestion control by discarding or delaying data units, e.g. packets or frames
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W24/00—Supervisory, monitoring or testing arrangements
    • H04W24/08—Testing, supervising or monitoring using real traffic
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Definitions

  • the present application relates to the field of Internet technology, in particular to the field of communication technology, and in particular to a simple communication method and device without response.
  • the communication methods of three-stage handshake and four-stage handshake are adopted.
  • the transmission of a data needs to be transmitted at least three times or even four times to ensure the reliability of information transmission.
  • it will cause too many data transmissions and consume too many network resources; and, usually, each transmission will have a network delay. , which will also lead to a longer total transmission time, and even cause a network crash.
  • This disclosure aims at the problems existing in data transmission in the prior art, and proposes a non-response simple communication method and device to ensure the information strength of data in the communication medium, avoid broadcast storms and occupy channel resources, and avoid Data transmission errors and packet loss improve the reliability of data communication.
  • the first aspect of the present disclosure provides a simple non-response communication method: obtain a data block through a communication node; temporarily store the data block in a storage queue; obtain the receiving times and/or sending times of the data blocks; respond When the number of times of receiving and/or the number of times of sending reaches a preset condition, the communication node stops sending the data block.
  • the communication method does not require the receiving end to feed back response data, and the data transmission method is simple.
  • the communication node after the data block is temporarily stored in the storage queue; the communication node performs effective sending processing on the data block, wherein each effective sending process includes at least one sending operation; the sending Count the number of operations.
  • effectively sending the data block includes: setting a maximum sending threshold and a maximum receiving threshold of the communication node; responding to When the number of times of sending reaches the maximum sending threshold, the sending of the data block is stopped.
  • the non-response simple communication method further includes: in response to the receiving times reaching the maximum receiving threshold, reducing the maximum sending threshold according to preset settings, or increasing the sending times; responding When the number of sending times does not reach the maximum sending threshold and the number of receiving times reaches the maximum receiving threshold, the maximum sending threshold is lowered according to a preset setting.
  • the non-response simple communication method further includes: forming a network with at least two communication nodes, wherein the communication nodes can perform data transmission with each other; When the number of times of receiving or sending the data block in any of the communication nodes reaches the preset condition, the processing of sending the data block is stopped.
  • each communication node can not only send data blocks, but also receive data blocks, and the sending and receiving are equal to each other and cross each other, there is no master-slave relationship, no central node, After a 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 non-center peer-to-peer mesh network.
  • the non-response simple communication method further includes: adding a service networking node; obtaining service data, forming a service data block, and temporarily storing the service data block in a storage queue; obtaining the service data block The number of times of insertion and extraction of the service data block; the processing of the service communication data block by the service group node is determined according to the number of insertion and extraction times of the service data block.
  • the communication node includes at least one corresponding storage queue
  • the non-response simple communication method further includes: temporarily storing the data block to be processed in the storage queue; wherein, the The data block corresponds to the communication data block or the service data block; one of the storage queues contains at least one data storage unit; one of the data storage units contains one of the data blocks and one sending and receiving control block, wherein the The data block at least includes a data source ID, data generation time and data content, and the sending and receiving control block includes at least a data block sending count, a data receiving count, and a data extraction flag.
  • each of the communication nodes has the same system time; in the case of forming the service data block, the data generation time of the service data block is when the data content enters the The communication node is added according to the system time.
  • the non-response simple communication 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 principle of time priority, including : confirm the generation time of the data block; store the data block according to the order in which the data block was generated first, including: storing the data block in the preset storage space of the storage queue, or storing the data block in the preset storage space of the storage queue The data block covers a data block generated earlier in the data block meeting the condition.
  • the non-response simple communication method further includes: in response to the preset storage space not reaching the maximum preset space, storing the data block in the storage queue; in response to the preset The maximum preset space is reached in the storage space, and the data block that meets the condition of the data block is determined; in response to the fact that the data block does not meet the condition of the data block in the storage queue, the data block is stored in the In the storage queue; in response to the data block meeting the condition of the data block in the storage queue, the data block directly overwrites the data block whose generation time is earlier, or in response to the data block being in the storage queue The conditions of the data blocks in the queue are met, and the number of times of sending the data blocks with the earlier generation time is acquired, and in response to the number of times of sending the data blocks with the earlier generation time reaching the maximum sending threshold, the data blocks are directly overwritten The generation time preceding data block.
  • the non-response simple communication method further includes: in the case of obtaining the data block, traversing the storage queue, confirming the receiving operation of the data block; In the case of the storage queue, exit the receiving temporary storage operation, and count + 1 the number of times the data block is received; if the data block is not stored in the storage queue, the The data block is stored in the storage queue, and an initial value is assigned to the receiving times of the data block; or, in the case of obtaining the service data block, traversing the storage queue, confirming that the service The insertion operation of the data block; confirming the time of obtaining the business data block, determining the data generation time of the business data, and assigning an initial value to the insertion times of the business data block.
  • the non-response simple communication method further includes: in the case of sending the data block, traversing the storage queue, and confirming the sending operation of the data block according to the principle of time priority, including: confirming and The data blocks that meet the conditions of the data blocks: send the data blocks that meet the conditions that have not been processed at the earliest generation time, and add (+) 1 to the sending count flag of the data blocks that meet the conditions.
  • the non-response simple communication method further includes: in the case of extracting the service data block, traversing the storage queue, and confirming the extracting operation of the service data block according to the principle of time priority, including: Confirm the data blocks that meet the conditions of the business data blocks; extract the data blocks that meet the conditions that have not been processed at the earliest generation time, and add (+) the extraction count flag of the data blocks that meet the conditions 1.
  • the non-response simple communication method further includes: evolving the time priority principle when sending based on the way of sending data preferentially based on the number of times of sending, and the way of sending data preferentially based on the number of times of receiving
  • the time priority principle during sending is evolved, and/or the time priority principle during sending is evolved based on a data level-based data priority sending manner.
  • the non-responsive simple communication method further includes: in the sending and receiving control block corresponding to any of the communication nodes, the initial value, the maximum sending threshold and the maximum sending threshold of the data block in the storage queue can be customized and/or a maximum reception threshold to regulate the reliability of the communication network.
  • a second aspect of the present disclosure provides a no-response simple communication device.
  • the non-response simple communication device is applied to the non-response simple communication method for the communication node to obtain the data block in the first aspect, at least including: a communication node, a receiving communication port and a sending communication port, each of which Each communication node 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, Software media, circuits and interfaces.
  • the non-response simple communication device is applied to the non-response simple communication method for the service networking node to obtain the service data block in the first aspect, and at least includes: a service networking node, a service insertion interface and a service extraction interface, Each of the service networking nodes corresponds to a service insertion interface and a service extraction interface; wherein the service insertion interface and the service extraction interface are any physical , logic, hardware, software media, lines and interfaces.
  • the non-response simple communication device is applied to any possible implementation method of the first aspect above, including: a receiving unit, configured to receive a data block through a communication node; a storage unit, configured to temporarily save the data block Stored in the storage queue; the processing unit is used to obtain the receiving times and sending times of the data block; the sending unit is used to stop the communication node from receiving the data block when the receiving times and the sending times reach a preset condition. The sending process of the data block.
  • the sending unit further includes: setting a maximum sending threshold and a maximum receiving threshold of the communication node; and stopping sending the data block in response to the sending times reaching the maximum sending threshold.
  • the sending unit further includes: reducing the maximum sending threshold according to preset settings or increasing the sending times in response to the receiving times reaching the maximum receiving threshold; in response to the After the number of sending times does not reach the maximum sending threshold and the number of receiving times reaches the maximum receiving threshold, the maximum sending threshold is lowered according to a preset setting.
  • the non-responsive simple communication device further includes: a networking unit, configured to network at least two of the communication nodes, wherein the communication nodes can perform data transmission with each other; in response to After the number of times of receiving or sending the data block in any of the communication nodes in the network reaches the preset condition, the process of sending the data block is stopped.
  • a networking unit configured to network at least two of the communication nodes, wherein the communication nodes can perform data transmission with each other; in response to After the number of times of receiving or sending the data block in any of the communication nodes in the network reaches the preset condition, the process of sending the data block is stopped.
  • the non-responsive simple communication device further includes: a service networking unit, configured to add service networking nodes; acquire service data, form a service data block, and temporarily store the service data block in a storage queue ; Acquiring the insertion times and extraction times of the service data block; determining the processing of the service data block by the service group node according to the insertion times and the extraction times of the service data block.
  • a service networking unit configured to add service networking nodes; acquire service data, form a service data block, and temporarily store the service data block in a storage queue ; Acquiring the insertion times and extraction times of the service data block; determining the processing of the service data block by the service group node according to the insertion times and the extraction times of the service data block.
  • the non-responsive simple communication device further includes: a service networking unit, used to add a service networking node; the communication node includes at least one corresponding storage queue, used to temporarily store pending The data block; wherein, 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; one of the data storage units contains one of the data block and a sending and receiving control block, wherein, the data block includes at least a data source ID, data generation time and data content, and the sending and receiving control block includes at least a data block sending count, a data receiving count, and a data extraction flag.
  • a service networking unit used to add a service networking node
  • the communication node includes at least one corresponding storage queue, used to temporarily store pending The data block
  • 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
  • one of the data storage units contains one of the data block and a sending and receiving control block
  • the non-response simple communication device further includes: a storage processing unit, configured to temporarily store the data block to be processed in the storage queue, and the storage queue follows the time for the data block Processing based on the principle of priority, including: confirming the generation time of the data block; storing the data block according to the order in which the data block was generated earlier, including: storing the data block in the preset storage queue In the storage space, or overwrite the data block with the data block that was generated earlier in the data block that meets the condition.
  • a storage processing unit configured to temporarily store the data block to be processed in the storage queue, and the storage queue follows the time for the data block Processing based on the principle of priority, including: confirming the generation time of the data block; storing the data block according to the order in which the data block was generated earlier, including: storing the data block in the preset storage queue In the storage space, or overwrite the data block with the data block that was generated earlier in the data block that meets the condition.
  • the non-response simple communication device further includes a receiving unit or an insertion unit; the receiving unit is configured to traverse the storage queue and confirm receipt of the data block when the data block is acquired Operation; in response to the data block has been stored in the storage queue, exit the receiving temporary storage operation, and count the number of times the data block is received + 1 processing; in response to the data block not being stored in the storage queue In the queue, the data block is stored in the storage queue, and the receiving times of the data block are assigned an initial value; or an insertion unit is used to traverse the The storage queue confirms the insertion operation of the service data block; confirms the time of obtaining the service data block, determines the data generation time of the service data, and assigns an initial value to the insertion times of the service data block.
  • the non-response simple communication device further includes: a sending processing unit, configured to traverse the storage queue when sending the data block, and confirm the sending operation of the data block according to the principle of time priority, The method includes: confirming the data block that meets the condition of the data block; sending the data block that meets the condition that has not been processed at the earliest generation time, and adds 1 to the sending count flag of the data block that meets the condition.
  • a sending processing unit configured to traverse the storage queue when sending the data block, and confirm the sending operation of the data block according to the principle of time priority, The method includes: confirming the data block that meets the condition of the data block; sending the data block that meets the condition that has not been processed at the earliest generation time, and adds 1 to the sending count flag of the data block that meets the condition.
  • a third aspect of the present disclosure provides a communication device, including: a memory for storing processor-executable instructions; a processor connected to the memory; wherein, the processor is configured to execute any possibility of the first aspect. method of implementation.
  • a fourth aspect of the present disclosure provides a non-transitory computer-readable storage medium.
  • the instructions in the storage medium are executed by a processor of a computer, the computer can execute any method that may be implemented in the first aspect.
  • a fifth aspect of the present disclosure provides a computer program product, including a computer program, wherein, when the computer program is executed by a processor, any method that may be implemented in the first aspect is implemented.
  • the forwarding technology in the process of transmitting data, according to the setting of the maximum sending threshold and the forwarding times technology of the communication node, it is judged whether the effective forwarding technology reaches the maximum sending threshold, and if the maximum sending threshold is reached, the forwarding is stopped , without waiting for the response of the receiving communication node, it realizes the highly reliable and efficient information transmission of data, which not only solves the reliability of data information transmission, but also improves the efficiency of network communication data information transmission, and can also solve the problem caused by broadcast storms. resulting in network paralysis.
  • Fig. 1 is a schematic diagram of a communication node shown according to an exemplary embodiment
  • Fig. 2 is a schematic diagram of a logical sending communication port and a receiving communication port shown according to an exemplary embodiment
  • Fig. 3 is a schematic flowchart of a simple communication method without response according to an exemplary embodiment
  • Fig. 4 is a schematic diagram of a non-response multi-node simple data transmission device according to an exemplary embodiment
  • Fig. 5 is a schematic diagram of a service networking node according to an exemplary embodiment
  • Fig. 6 is a schematic diagram of a data storage unit according to an exemplary embodiment
  • Fig. 7 is a receiving communication processing flow of a communication node shown according to an exemplary embodiment
  • Fig. 8 is a service insertion processing flow of a communication node shown according to an exemplary embodiment
  • Fig. 9 is a process flow showing a communication node sending communication data according to an exemplary embodiment
  • Fig. 10 shows a service proposal processing flow of a communication node according to an exemplary embodiment
  • Fig. 11 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • Fig. 12 is a schematic structural diagram of a communication device provided by an embodiment of the present application.
  • the non-response simple communication method of this embodiment discloses a communication node for data transmission, including a communication data block storage queue, a sending communication port, and a receiving communication port.
  • the communication data block storage queue is used to temporarily store the communication data blocks that need to be communicated and transmitted; the sending communication port is used to effectively send and process the communication data blocks that need to be communicated and transmitted; the receiving communication port is used to receive from the outside that needs to communicate
  • the transmitted communication data block as shown in Figure 2, this disclosure can combine 2 WiFi communication transceivers, 1 Bluetooth communication transceiver, 1 PLC communication transceiver, and 1 Ethernet communication transceiver into a logical transmission comm port and receive comm port.
  • the communication node can call a stored program for executing the data transmission method of any one embodiment.
  • the first aspect of the present disclosure provides a non-response simple communication method, as shown in FIG. 3 , a schematic flowchart of the non-response simple communication method, and the method includes the following steps S310 to S340.
  • S320 Temporarily store the data block in a storage queue.
  • the obtained data blocks are temporarily stored in the storage queue, and the communication node performs effective sending processing on the data blocks, each effective sending processing includes at least one sending operation, and counts the sending times of the sending operation , when the count of sending times reaches a preset threshold, the communication node stops sending the data block and does not wait for sending confirmation.
  • the efficient sending process means that during at least one sending operation of the communication node, the communication node can reliably send the communication data block to the communication medium without being blocked inside the communication node.
  • the communication node After the communication node receives the communication data block, it does not respond to the side that sent the data block. When the communication node sends the communication data block, it does not need to wait for the response from the communication node receiving the data block.
  • the communication method does not require the receiving end to feed back response data, and the data transmission method is simple.
  • determining the data block as the acquired source communication data at least includes: before acquiring the data block, determining the data block to be transmitted; processing the original communication data without modification into the data block .
  • this method ensures that the communication data block received by the communication node is intact and sent out from all communication ports without modification.
  • the receiving communication port reads whether all communication transceivers have received data through the communication port adaptation driver layer. As long as any communication transceiver receives the data, the receiving communication port considers that the data is received, and the receiving communication port immediately uses the receiving processing mechanism of the present disclosure to verify the data. After passing the verification, the received data is stored in the communication data storage queue, so as to facilitate the sending and processing of the data by the sending communication port of the present disclosure.
  • the receiving communication port of the present disclosure After the receiving communication port of the present disclosure receives data from any communication transceiver, it stores the data in the communication data storage queue. When the sending communication port sends the data, it will send it to all communication transceivers of the logical port, including the communication transceiver receiving the data. For example, after the receiving communication port receives data A from the PLC communication transceiver by the UART, when the sending communication port transmits the data A, it will pass through the WiFi communication transceiver 1, WiFi communication transceiver 2, Bluetooth communication transceiver, PLC Communication transceiver, Ethernet communication transceiver to send.
  • the communication node in response to the number of times of receiving and/or the number of times of sending reaching a first preset condition, stops sending the data block, including: setting a maximum sending time of the communication node a threshold and a maximum receiving threshold; in response to the number of sending times reaching the maximum sending threshold, stop sending the data block.
  • Each of the communication nodes is preset with a maximum sending threshold (SendCount Max), and by acquiring and judging whether the count of sending times of the data block to be processed reaches the maximum sending threshold, the communication data block to be processed is processed accordingly.
  • SendCount Max a maximum sending threshold
  • the communication node stops sending the data block.
  • the communication node continues to effectively send the data block.
  • the communication node in this embodiment receives the data block from the receiving communication port, it temporarily stores the data block in the data storage queue, and then extracts the communication data from the communication data storage queue intact without modification when it needs to be sent block, and hand it over to the sending communication port for sending operations.
  • the receiving communication port of the communication node of the present disclosure receives any number and any type of data through the communication port adaptation driver, as long as one of the hardware and software interfaces receives the data and verifies it is correct, that is It is considered that a valid data is received, and then the data is stored in the communication data storage queue.
  • the communication node of the present disclosure transmits the data block
  • the data is passed to the communication port adaptation driver, and the communication port adaptation driver sends data to each hardware and software interface one by one, and all interfaces complete the data After the data is sent, it is considered that the data has been effectively sent once, and then the number of times of sending is added (+) 1.
  • the maximum sending threshold when the number of times of receiving reaches the maximum receiving threshold, the maximum sending threshold is lowered according to preset settings; when the number of sending does not reach the maximum sending threshold and the number of receiving reaches After the maximum receiving threshold is set, the maximum sending threshold is lowered according to the preset setting.
  • the transmission method of the multi-node data transmission device in this embodiment when the number of sending times of a certain data block has not reached the maximum sending threshold, but the number of receiving times has reached the maximum receiving threshold, it can be calculated according to certain calculation rules Reduce the maximum sending threshold for this communication data block, so that the count of sending times can quickly reach the maximum sending threshold, and stop the sending of this data block, so as to reduce the number of sending operations of this data block, save communication resources, and improve communication efficiency.
  • the maximum sending threshold when the receiving times reach the maximum receiving threshold, can be lowered according to preset settings, or the sending times can be increased, so that the sending times of data blocks can quickly reach the maximum sending threshold .
  • the maximum sending threshold can be automatically set in the control module, or the sending times of data blocks can be set according to certain rules, so that the number of sending times can be judged and controlled in advance by receiving times, so that the sending times of data blocks can reach the maximum sending times most effectively. threshold.
  • a non-response multi-node simple communication method including:
  • Networking at least two of the communication nodes, wherein the communication nodes can transmit data to each other;
  • the multi-node communication method corresponds to the multi-node communication device, which includes at least two communication nodes.
  • the first communication node is used to forward the data packets received or stored by the first communication node to at least one second communication node through the sending module, and the number of sending times of the forwarded data blocks is counted.
  • the second communication node is configured to forward the data block received from the first communication node to other communication nodes.
  • a non-response multi-node simple data transmission device includes a communication node 1, a communication node 2 and a communication node n.
  • the communication node 1, the communication node 2 and the communication node n all include a communication data storage queue, a sending communication port, and a receiving communication port.
  • the sending communication port of communication node 1 is connected with the receiving communication port of communication node 2 and the receiving communication port of communication node n for data link transmission; the receiving communication port of communication node 1 is connected with the sending communication port of communication node 2 and communication node n The send communication port of the data link transport connection.
  • communication node 2 is connected to communication node 1 and communication node n in the same manner for data link transmission
  • communication node n is connected to communication node 1 and communication node 2 for data link transmission connection in the same manner.
  • each communication node uses the sending communication port and the receiving communication port to send and receive communication data blocks with each other.
  • the data block sent by each communication node will be received by at least one other communication node, and each other communication node that receives the communication data block will also send the data block Execute the above-mentioned non-response simple communication steps intact and without modification for effective sending processing, so that the data block will be effectively sent by at least two communication nodes during the communication process.
  • the receiving communication port of each communication node will receive the same data block sent by other nodes at least once, and the communication node temporarily stores the received same data block in the communication data store in the same data storage unit of the queue, and count the times of receiving the same data block.
  • the same data block is sent out by other nodes, or the same data block is received at least once, indicating that the data block has been effectively validated in the communication medium or communication space Send and transmit.
  • each communication node can not only send communication data blocks, but also receive data blocks, and the sending and receiving are mutually equal and cross, and there is no master-slave There is no central node, and a communication data block can reach any communication node in the network after being transmitted through the network. Therefore, the networked communication network composed of communication nodes in the present disclosure is a highly reliable non-center peer-to-peer mesh network.
  • this disclosure also specifically discloses another non-response simple communication method, including:
  • the processing of the service communication data block by the service group node is determined according to the insertion times and extraction times of the service data block.
  • a schematic diagram of 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.
  • the communication node with added service insertion interface and service extraction interface is named as a service networking node.
  • the communication node in this embodiment adds a service insertion interface and a service extraction interface for data information on the service side to enter the communication network side for communication network transmission.
  • the service insertion interface of the service networking node is used to insert service data on the service side into the data block storage queue.
  • the service extraction interface of the service networking node is used to extract required service data from the communication data storage queue according to service data extraction rules.
  • 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 communicated and transmitted, and each data storage unit includes a communication data block and a sending and receiving control Block two parts.
  • a data storage unit includes a communication data block and a sending and receiving control block. It should be noted that the data block mentioned in this disclosure has the same meaning as the communication data block.
  • the communication data block at least includes a data source ID, data generation time, and data content.
  • the data source ID is a device unique code or device address code used to identify the source of business data, and distinguishes which device in the networking communication network the business data comes from.
  • the data generation time is used to identify the time point of data generation when the service data is inserted into the communication node from the service insertion interface.
  • Data content is the content of business data that needs to be transmitted through networking communication.
  • the sending and receiving control block at least includes a data sending technique, a data receiving technique, and a data extraction flag.
  • the data sending count is used to count the number of sending operations of the communication data block. Every time a communication data block is sent, the data sending count is +1; the data sending count can be negative when assigned; for the convenience of description, the data sending Count is defined as DataSend_Count.
  • the data extraction flag is used to identify whether the data is extracted from the data extraction interface to avoid repeated data extraction; the flag is 0 when the data is not extracted, and the flag is +1 every time the data is extracted; for the convenience of description, the data Receive count is defined as DataFind_Flag.
  • the communication data storage queue in this embodiment at least includes a storage block space containing at least 1 data storage unit, and the communication data storage queue in the embodiment of the present disclosure includes 5 data storage units for storage and storage of communication data blocks. manage.
  • Each data storage unit contains two parts: data block and sending and receiving control block:
  • the data block includes the data source ID, data generation time, and data content.
  • the data source ID field which can be 4 bytes, 6 bytes, 8 bytes or 128 bytes according to the length of the system communication device ID.
  • Data generation time field which is determined according to the accuracy of the time measurement unit of the system communication network.
  • the accuracy of the time measurement unit is second-level precision
  • the length of this field is 4 bytes
  • the accuracy of the time measurement unit is milliseconds, microseconds, nanoseconds
  • the length of this field is 8 bytes.
  • the first 4 bytes indicate the second timing
  • the last 4 bytes indicate the millisecond, microsecond, and nanosecond timing.
  • Data content field is determined according to the maximum frame length of the data transmitted at one time in the system communication networking application, and the maximum frame length can be 16-2048 bytes, that is, the data content field length of the embodiment of the present disclosure takes a value of 16-2048 bytes. 2048 bytes.
  • the sending and receiving control block includes a data receiving technology field, a data sending technology field, and a data extraction flag field.
  • the data receiving count field which is determined according to the data transmission efficiency of the system communication network.
  • the length of this field is 4 bytes
  • the length of this field is 8 bytes.
  • the data transmission count field which is determined according to the data transmission efficiency of the system communication network.
  • the length of this field is 4 bytes
  • the length of this field is 8 bytes.
  • the communication node in the method for simply transmitting data without a response, at least includes a corresponding storage queue for temporarily storing the data block to be processed; wherein, the data block corresponds to the The communication data block or the service communication data block;
  • one of said storage queues includes at least one data storage unit
  • One said data storage unit includes one said data block and a sending and receiving control block, wherein said data block includes at least a data source ID, data generation time and data content, and said sending and receiving control block includes at least a data block sending count , data reception count, data extraction flag.
  • the communication data storage queue includes at least one data storage unit, and the operation of the communication data storage queue or the business communication storage queue follows the principle of time priority, that is, when inserting and/or receiving, follow the communication data with a newer data generation time Blocks are processed based on the principle of overwriting data generation time of older communication data blocks. When sending and/or extracting, follow the principle that communication data blocks with older data generation time are prioritized over communication data blocks with newer data generation time.
  • the business network node when the business network node transmits communication data according to the above-mentioned non-response simple communication method, it uses the data sending count field of the sending and receiving control block to count and record the number of times the communication data block is sent, and uses the data receiving of the sending and receiving control block
  • the counting field counts and records the number of times the communication data block is received.
  • the service networking node After the service networking node extracts the required service data from the service extraction interface according to the service data extraction rules, it will add 1 to the data extraction flag of the sending and receiving control block of the corresponding data storage unit, indicating that the service data has been obtained by the service networking node. Extracted successfully.
  • each of said communication nodes has a same system time
  • the data generation time of the service data block is added according to the system time when the data content enters the communication node.
  • the aforementioned communication nodes and business networking nodes all have the same system time, or the same time timing unit; the data generation time points filled in when the business data is inserted all come from this time timing unit, and are based on the data Generate time to communicate data transfers.
  • This disclosure can use the clock synchronization protocol to ensure that the timing units of all nodes have the same frequency and phase, and the time is consistent, that is, the time of each node is accurate and consistent during the entire network transmission process of the communication data block.
  • the precision of the clock synchronization protocol can be improved as needed, so that the time timing units of all nodes can reach the time of milliseconds, microseconds or even nanoseconds Accuracy, so the data generation time in the communication data block will also reach the corresponding time accuracy level.
  • the time timing units of all nodes will be consistent with the international standard calendar time, and high-precision satellite time service guarantees The time accuracy and time consistency of each node in the communication transmission process.
  • a method for simply transmitting data without a response is provided, which is applied to service networking nodes, and includes the following steps:
  • the service group node inserts and copies the service data to the service networking node through the service socket;
  • the service networking node performs effective sending processing on the communication data block, each effective sending processing includes at least one sending operation, and the first communication node counts the number of sending operations.
  • the first communication node stops sending communication data blocks and does not wait for sending confirmation.
  • the business networking node When the business networking node has business data that needs to be networked and communicated, it inserts and copies the business data into the data content field of a data storage unit in the communication data storage queue through the business insertion interface on the business side, and inserts and copies the business data At the same time, the service networking node also writes the unique code or device address code of the service data source into the data source ID field, and writes the time point when the service data is inserted into the data generation time field.
  • the three fields of data source ID, data generation time, and data content form a communication data block, and the communication data block is transmitted as a whole by the sending communication port.
  • the communication data block is inserted into the data storage unit of the business networking node from the service side, during the subsequent process of all nodes performing network communication transmission, sending, receiving, and storage, the communication data
  • the block is always intact and not modified until the communication data block is overwritten by other communication data blocks in the data storage unit.
  • the method for simply transmitting data without a response 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 principle of time priority, include:
  • the storage processing of the data blocks is performed according to the order in which the data blocks are generated earlier, including:
  • the data block is stored in the preset storage space of the storage queue, or the data block is overwritten with the data block generated earlier in the data block meeting the condition.
  • the non-response simple communication method further includes;
  • the data block In response to the data block meeting the data block condition in the storage queue, the data block is directly overwritten with the data block generated earlier in time, and the count flag of the data block is +1, or in response to When the data block meets the condition of the data block in the storage queue, acquire the sending times of the data block whose generation time is earlier, and respond to the sending times of the data block whose generation time is earlier reaching the maximum sending time Threshold, the data block directly overwrites the data block generated earlier in time.
  • the data block whose data time is earlier is sent preferentially, and there is no coverage relationship of the data blocks.
  • the data block needs to be stored.
  • the comparison here determines that the data block meeting the data block condition is compared through the data generation time, data source ID and/or data content of the specific data block.
  • the data generation time and data source ID of the data block can be used to compare whether it is consistent with other data blocks in the storage queue, or the data content of the data block can be used to directly compare whether it is consistent with other data blocks in the storage queue. And it can be compared with other data blocks in the storage queue according to the generation time, data source ID and data content in the data block.
  • the non-response simple communication method also includes:
  • 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 it is determined as the business data block The data generation time, and assign the initial value to the insertion times of the business data block.
  • the communication node of the present disclosure When the communication node of the present disclosure receives the communication data block from the receiving communication port, according to the principle of time priority, it traverses the communication data storage queue to find the qualified data storage unit space to store the communication data block.
  • the detailed steps are as follows:
  • 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 as initial values; otherwise, the received communication data block is directly discarded.
  • a communication node receiving communication processing flow is disclosed, which specifically includes the following steps:
  • the service data, data source ID, and data generation time are integrated together to generate a communication data block, and according to the principle of time priority, the traversal communication
  • the data storage queue searches for qualified data storage unit space to store the data communication block.
  • the communication data block in this embodiment is only generated according to the data source ID and 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 is always It remains intact and will not be modified, and will only disappear after being overwritten by other updated communication data blocks.
  • the communication data block generated by the service insertion interface of this embodiment when inserting service data can uniquely identify a service data in the communication network by using the data source ID and data generation time, and no matter which node the service data is transmitted at will be modified to ensure data reliability and traceability.
  • the temporary communication data block covers the found data storage unit
  • the data sending count, data receiving count, and data extraction flag are assigned as initial values
  • the method for simply transmitting data without a response further includes:
  • the communication node in this embodiment sends a communication data block to the sending communication port, according to the principle of time priority, it traverses the communication data storage queue to find the data storage unit with the oldest data generation time that meets the conditions and has not been effectively sent and processed to communicate data
  • the effective sending processing of blocks, the detailed steps are as follows:
  • a processing flow step for sending communication data by a communication node is disclosed.
  • the time temporary variable temporarily stores the current time point
  • step 8 Judging that the data in the data storage unit is valid, if not, go to step 8;
  • the receiving count reaches the maximum receiving threshold, if the maximum sending threshold is adjusted
  • the sending count reaches the maximum sending threshold, if so, go to step 8;
  • the non-response simple communication method further includes: in the case of extracting the service data block, traversing the storage queue, and confirming the extracting operation of the service data block according to the principle of time priority, including: Confirm the data block that meets the condition of the business data block; extract the data block that is generated first and has not been processed and that meets the condition, and adds 1 to the extraction count flag of the data block that meets the condition.
  • 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; each time after extracting a communication data block of a data storage unit, the data extraction flag is +1 to identify the data was extracted once.
  • the data content is returned to the extractor through the service extraction interface
  • step 2 Determine whether the cyclic traversal of the communication data storage queue is completed, and if not, enter step 2;
  • the data sending count is assigned an initial value of 0
  • the data receiving count is assigned an initial value of 0
  • the data extraction flag is assigned an initial value of 0
  • the non-responsive simple communication method further includes: in the sending and receiving control block corresponding to any of the communication nodes, the initial value, the maximum sending threshold and the maximum sending threshold of the data block in the storage queue can be customized and/or a maximum reception threshold to regulate the reliability of the communication network.
  • the default disclosure sets the maximum sending threshold to 1, and sets the maximum receiving threshold to the maximum value that the variable can store, that is, the business
  • a communication node that can implement a simple data transmission method without response is disclosed.
  • the communication node in the embodiment of the present disclosure needs to organize the communication data storage queue, and use the sending and receiving control block of each data storage unit to control The number of reception and transmission times of the communication data block of the communication node.
  • the communication node includes one data structure and four processing flows, as shown in Figure 5, specifically including, communication data storage queue data structure, service insertion processing flow, service extraction processing flow, sending communication processing flow, receiving communication process.
  • the data structure of the communication data storage queue corresponds to the memory management of the communication data storage queue
  • Business insertion processing flow corresponding to the business insertion interface for processing when inserting business data
  • Business extraction processing flow corresponding to the business extraction interface for processing when extracting business data
  • Sending communication processing flow corresponding to the sending communication port for effective sending processing of communication data blocks
  • the receiving communication processing flow corresponds to the receiving communication port for receiving and processing communication data blocks.
  • the data sent is caused by some communication interfaces, which are relatively fast, and some communication interfaces are sent slowly. , Software interface to determine the data sending speed.
  • a fixed time axis is used to operate and process communication data blocks in a time-priority manner, so as to ensure Reliable transmission of each packet of data, avoiding data packet loss and transmission errors caused by old data overwriting new data.
  • a fixed time axis is used to operate and process communication data blocks in a time-priority manner, so as to ensure Reliable transmission of each packet of data, avoiding data packet loss and transmission errors caused by old data overwriting new data.
  • the non-response simple communication method includes: evolving the time priority principle when sending based on the data priority sending method of the number of times of sending, based on The way of sending data with the number of times of receiving first evolves the principle of time priority when sending, and/or the way of sending data based on data level first evolves the principle of time priority when sending.
  • the present disclosure further provides three evolution modes, which are: priority sending of data based on sending times, priority sending of data adjusted based on receiving times, and priority sending of data based on data level.
  • the method of sending data priority based on the number of sending times.
  • the number of times of priority sending data is first For the communication data block with a negative number, the communication data block with a small number of data transmission times will be sent first, and the communication data block with a large number of data transmission times will be sent last.
  • the number of transmissions is adjusted with priority, and the different data in the communication data storage queue in the communication node are sent out to the maximum extent for network transmission, and the limited network transmission resources are allocated to these different data , so as to improve the throughput rate of network transmission and reduce the delay of transmission at the same time.
  • the data priority sending method based on the adjustment of the receiving times can gradually adjust the maximum sending threshold according to the data receiving times of the communication data block, so as to reduce the times of data sending.
  • the specific method is to define a multi-level adjustment table. When the number of data reception times reaches a certain value or meets a certain condition, the maximum sending threshold is reduced by how much. Only when the maximum sending threshold is reduced to 1 position, the minimum sending threshold cannot be lower than 1 time.
  • the method of the present disclosure it can be judged whether the communication data block can be reliably received by other neighbor nodes with a high probability according to the number of times of data reception. Once it is determined that the communication data block is reliably received by other neighbor nodes, it can reduce and avoid repeated sending of the same data, reduce the repeated occupation of communication medium resources, and send other communication data blocks that have not been sent before, improving the communication efficiency of network transmission and Throughput rate.
  • a field of data priority level is added to the communication data block to identify the transmission priority of the data content.
  • the communication node When the communication node sends data, it first sends high priority data, and then sends low priority data.
  • Data priority is divided into transmission delay priority and transmission reliability priority.
  • transmission delay priority For data with high transmission delay priority, the network transmission delay is required to be as small as possible.
  • transmission reliability priority data it is required to ensure protection during network transmission. The reliability of data transmission does not allow bit errors and packet loss.
  • any one of the above methods may be introduced, or the data may be sent preferentially based on the above three mixed modes.
  • the above three different priority modes of sending times priority, receiving times adjustment priority, and data level priority are arranged and combined according to certain rules, and a comprehensive data sending priority is calculated to send data.
  • the specific method is to define a 4-digit priority number from 0000 to 9999.
  • the number of sending times, the number of receiving times, the priority of transmission delay, and the priority of transmission reliability are arranged and combined according to one, ten, hundred, and thousand to determine a Permutation and combination rules, each communication data block calculates a comprehensive data transmission priority based on the number of data transmission times, data reception times, transmission delay priority, and transmission reliability priority to determine the order of data transmission.
  • the combined application of the three methods disclosed in the present disclosure can have more flexible data transmission processing priorities through mixed operations to adapt to various data transmission and transmission application scenarios, making network transmission flexible and traversal, and more adaptable to objects. Heterogeneous requirements for networking.
  • the communication throughput can be improved by increasing the number of low-speed communication interfaces, as shown in Figure 1.
  • the RF wireless communication transceiver can achieve a communication rate of 10Mbps through the SPI bus, while the RS485 The communication transceiver can only reach a communication rate of 2.5Mbps.
  • the interface aggregation matching driver four RS485 communication transceivers are aggregated for communication, and different sending data are transmitted separately, which can reach a communication rate of 10Mbps, making the sending communication port and the receiving port The speed of the communication port can be maintained at 10Mbps.
  • the second aspect of the present disclosure provides a no-response simple communication device
  • the non-response simple communication device is applied to the non-response simple communication method for the communication node to obtain the data block in the first aspect, at least including: a communication node, a receiving communication port and a sending communication port, each of which Each communication node 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, Software media, circuits and interfaces.
  • the non-response simple communication device is applied to the non-response simple communication method for the service networking node to obtain the service data block in the first aspect, and at least includes: a service networking node, a service insertion interface and a service extraction interface, Each of the service networking nodes corresponds to a service insertion interface and a service extraction interface; wherein the service insertion interface and the service extraction interface are any physical , logic, hardware, software media, lines and interfaces.
  • the sending communication port and receiving communication port in this disclosure generally refer to any physical, logical, hardware, software media, lines and interfaces that can transmit information and data. This disclosure refers to these media that can transmit information and data, Lines and interfaces are collectively referred to as data interfaces.
  • the sending communication port and the receiving communication port in this embodiment are composed of a set of at least one data interface, and this set of interfaces may be a combination of different media, different lines, and different interfaces.
  • the physical medium, line, and interface may be WiFi communication transceivers, Bluetooth communication transceivers, LoRa wireless transceivers, zigbee wireless transceivers, other radio communication transceivers, infrared communication transceivers, and acoustic wave communication transceivers.
  • Transceivers, satellite link transceivers, radio communication transceivers in various frequency bands such as GSM, 4G, 5G, etc. can also be Ethernet communication interfaces, optical fiber communication interfaces, RS232 communication transceivers, RS485 communication transceivers, PLC communication transceivers, etc.
  • Various wired communication modules and data communication transceivers can be WiFi communication transceivers, Bluetooth communication transceivers, LoRa wireless transceivers, zigbee wireless transceivers, other radio communication transceivers, infrared communication transceivers, and acoustic wave communication transceivers.
  • the medium, circuit and interface of the logic of the present disclosure can be any number and any type of logical combination of the above-mentioned various wired and wireless communication modules and data communication transceivers. As shown in Figure 2, the present disclosure can combine 2 WiFi communication transceivers , 1 Bluetooth communication transceiver, 1 PLC communication transceiver, and 1 Ethernet communication transceiver are combined into a logical sending communication port and receiving communication port.
  • the sending communication port and the receiving communication port of the present disclosure regard the logical combination of any number and any kind of communication transceivers as a communication port to perform the data sending (Send) and data receiving (Recv) of the present disclosure through the communication port adaptation driver layer .
  • the non-response simple communication device is applied to any possible implementation method of the first aspect above, including: a receiving unit, configured to pass the communication node Receiving a data block; a storage unit for temporarily storing the data block in a storage queue; a processing unit for obtaining the number of times of receiving and sending the data block; a sending unit for when the number of times of receiving and the number of times of sending After the number of sending times reaches a preset condition, the communication node stops sending the data block.
  • a third aspect of the present disclosure provides a communication device, including: a memory for storing processor-executable instructions; a processor connected to the memory; wherein, the processor is configured to execute any possibility of the first aspect. method of implementation. Further, the application of the method is not limited to the processor referred to in the present disclosure, and may also be executed in a corresponding logic chip.
  • a fourth aspect of the present disclosure provides a communication device.
  • the computer can execute any method that may be implemented in the first aspect.
  • Fig. 12 is a block diagram showing a communication device 600 according to an exemplary embodiment.
  • the method or apparatus according to the embodiments of the present disclosure may also be implemented by means of the architecture of a computing device.
  • 12 shows a schematic diagram of the architecture of an exemplary computing device according to an embodiment of the disclosure.
  • computing device 600 may include bus 601, one or more CPUs 602, read only memory (ROM) 603, random access memory (RAM) 604, communication port 605 for connection to a network, input/output components 606 , hard disk 607, etc.
  • the storage device in computing device 600 can store various data or files used in the processing and/or communication of the data processing method based on inter-node data sharing provided in the present disclosure, and program instructions executed by the CPU.
  • Computing device 600 may also include user interface 608 .
  • the architecture shown in FIG. 12 is only exemplary, and one or more components in the computing device shown in FIG. 12 may be omitted according to actual needs when implementing different devices.
  • a computer-readable storage medium on which computer-readable instructions are stored.
  • the computer readable storage medium includes, but is not limited to, for example, volatile memory and/or nonvolatile memory.
  • the volatile memory may include, for example, random access memory (RAM) and/or cache memory (cache).
  • the non-volatile memory may include, for example, a read-only memory (ROM), a hard disk, a flash memory, and the like.
  • a computer program product including a computer program, wherein when the computer program is executed by a processor, the non-response simple communication method described in any one of the above embodiments is implemented.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Environmental & Geological Engineering (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

一种无应答简易通信方法，该方法通过通信节点获取数据块，将数据块暂存于存储队列中；获取数据块的接收次数和/或发送次数；当接收次数和/或发送次数达到预设条件后，通信节点停止对数据块的发送处理。采用该方法，在对数据进行传输的过程中，对通信节点的发送次数设置判断发送处理，无需等待接收通信节点的应答。

Description

无应答简易通信方法及装置
相关申请的交叉引用
本申请基于申请号为202210090529.1、申请日为2022年01月25日的中国专利申请提出，并要求该中国专利申请的优先权，该中国专利申请的全部内容在此引入本申请作为参考。
技术领域
本申请涉及互联网技术领域，具体涉及通信技术领域，尤其涉及一种无应答简易通信方法及装置。
背景技术
在通信领域和物联网络领域中，常规的数据传输都采用发送应答方式进行，但在实际的信息数据传输过程中，由于故障等原因导致接收端没有应答或无法做出应答，信息发送端会等待超时并重复发送，进而造成通信信道资源的占用和通信效率的降低。另外，若在一个网络区域内通信节点数量增多，在数据通信负荷增大，数据通信被干扰后，通信节点会反复进行超时重发，可能会造成网络崩溃而无法通信。
目前各领域为了保证通信的可靠性，采用的是三段式握手和四段式握手的通信方式，一个数据的传输需要进行至少三次甚至四次的信息发送应答的传输才能够保证信息传输的可靠性，在这么多次信息传输过程中，一旦发送端、接收端、传输信道出现一点异常都会导致数据传输的次数过多，消耗过多的网络资源；并且，通常每次传输都会具有网络延时，这样还会导致传输总时长较长，甚至造成网络崩溃。
发明内容
本公开针对现有技术中数据传输中所存在的问题，并提出了一种无应答简易通信方法及装置，用以保证数据在通信介质中的信息强度，避免广播风暴产生并占用信道资源，避免数据传输误码丢包，提高数据通信可靠性。
本公开的第一方面提供了一种无应答简易通信方法：通过通信节点获取数据块；将所述数据块暂存于存储队列中；获取所述数据块的接收次数和/或发送次数；响应于所述接收次数和/或所述发送次数达到预设条件，所述通信节点停止对所述数据块的发送处理。该通信方法无需接收端反馈应答数据，数据传输方法简单。
在一些实施例中，将所述数据块暂存于存储队列后；所述通信节点对所述数据块进行有效发送处理，其中每次所述有效发送处理包括至少一次发送操作；对所述发送操作的次数进行计数。
在一些实施例中，响应于所述接收次数和所述发送次数达到预设条件，对所述数据块做有效发送处理，包括：设置所述通信节点的最大发送阈值和最大接收阈值；响应于所述发送次数到达到所述最大发送阈值，停止发送所述数据块。
在本公开实施例中，所述无应答简易通信方法还包括：响应于所述接收次数达到所述最大接收阈值，按照预设设置降低所述最大发送阈值，或增大所述发送次数；响应于所述发送次数未达到所述最大发送阈值且所述接收次数达到所最大接收阈值，按照预设设置降低所述最大发送阈值。
在一些实施例中，所述无应答简易通信方法还包括：将至少两个所述通信节点进行组网，其中，所述通信节点之间可互相进行数据传输；响应于所述组网内的任意所述通信节点内的所述数据块的接收次数或发送次数达到所述预设条件，停止对所述数据块的发送处理。
在本公开的多节点通信中，每个通信节点既可以进行数据块的发送、也可进行数据块的接收，且发送和接收是相互对等相互交叉的，没有主从关系、没有中心节点，一个数据块经过网络传输后，可以抵达网络中任意一个通信节点。因此，本发明的通信节点组成的组网通信网络是一个高可靠的无中心的对等网状网络。
在一些实施例中，所述无应答简易通信方法还包括：增加业务组网节点；获取业务数据，形成业务数据块，将所述业务数据块暂存于存储队列中；获取所述业务数据块的插入次数和提取次数；根据所述业务数据块的插入次数和提取次数确定所述业务组节点对所述业务通信数据块的处理。
在一些实施例中，所述通信节点至少包括一个对应的所述存储队列，所述无应答简易通信方法还包括：将待处理的所述数据块暂存于所述存储队列；其中，所述数据块对应为所述通信数据块或所述业务数据块；一个所述存储队列包含至少一个数据存储单元；一个所述数据存储单元包含一个所述数据块和一个收发控制块，其中，所述数据块至少包含有数据源ID，数据生成时间和数据内容，所述收发控制块至少包含有数据块发送计数，数据接收计数，数据提取标志。
在一些实施例中，其中，每一个所述通信节点均具有一个相同的系统时间；在形成所述业务数据块的情况下，所述业务数据块的数据生成时间是在所述数据内容进入所述通信节点时根据所述系统时间添加的。
在一些实施例中，所述无应答简易通信方法还包括：将待处理的所述数据块暂存于所述存储队列后，所述存储队列对所述数据块遵循时间优先原则进行处理，包括：确实所述数据块的生成时间；根据所述数据块生成时间在前的顺序对所述数据块进行存储处理，包括：将所述数据块存储于存储队列的预设存储空间内，或将所述数据块覆盖所述条件符合的数据块中生成时间在前的数据块。
在一些实施例中，所述无应答简易通信方法还包括：响应于所述预设存储空间未达到最大预设空间，将所述数据块存储于所述存储队列中；响应于所述预设存储空间内达到最大预设空间，确定与所述数据块条件符合的数据块；响应于所述数据块与所述存储队列中的数据块条件不相符合，将所述数据块存储在所述存储队列中；响应于所述数据块与所述存储队列中的数据块条件符合，将所述数据块直接覆盖所述生成时间在前的数据块，或响应于所述数据块与所述存储队列中的数据块条件符合，获取所述生成时间在前的数据块的发送次数，响应于所述生成时间在前的数据块的发送次数达到所述最大发送阈值，将所述数据块直接覆盖所述生成时间在前的数据块。
在一些实施例中，所述无应答简易通信方法还包括：在获取所述数据块的情况下，遍历所述存储队列，确认对所述数据块的接收操作；在所述数据块已存储于所述存储队列中的情况下，则退出接收暂存操作，并对所述数据块的接收次数进行计数+1处理；在所述数据块未存储于所述存储队列中的情况下，则将所述数据块存储进所述存储队列中，并将所述数据块的接收次数进行初始值赋值；或，在获取所述业务数据块的情况下，遍历所述存储队列，确认对所述业务数据块的插入操作；确认获取所述业务数据块的时间，确定为所述业务数据的数据生成时间，并对所述业务数据块的插入次数进行初始值赋值。
在一些实施例中，所述无应答简易通信方法还包括：在发送所述数据块的情况下，遍历所述存储队列，根据时间优先原则确认对所述数据块的发送操作，包括：确认与所述数据块条件符合的数据块；将生成时间最前的且未被处理的所述条件符合的数据块进行发送，且将所述条件符合的数据块的发送计数标志加(+)1。
在一些实施例中，所述无应答简易通信方法还包括：在提取所述业务数据块的情况下，遍历所述存储队列，根据时间优先原则确认对所述业务数据块的提取操作，包括：确认与所述业务数据块条件符合的数据块；将生成时间最前的且未被处理的所述条件符合的数据块进行提取，且将所述条件符合的数据块的提取计数标志加(+)1。
在一些实施例中，所述无应答简易通信方法还包括：基于所述发送次数的数据优先发送的方式对发送时的所述时间优先原则进行演化，基于所述接收次数的数据优先发送的方式对发送时的所述时间优先原则进行演化，和/或基于数据级别的数据优先发送的方式对发送时的所述时间优先原则进行演化。
在一些实施例中，所述无应答简易通信方法还包括：在任意的所述通信节点对应的收发控制块中，均可自定义所述存储队列中的数据块的初始值、最大发送阈值和/或最大接收阈值，以调节通信网络的可靠性。
本公开的第二方面提供了一种无应答简易通信装置。
在一些实施例中，所述无应答简易通信装置应用于第一方面中通信节点获取数据块的无应答简易通信方法，至少包括：通信节点，接收通信端口和发送通信端口，其中每一个所述通信节点均对应于一个所述接收通信端口和一个所述发送通信端口；其中所述接收通信端口和所述发送通信端口均为任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口。
在一些实施例中，所述无应答简易通信装置应用于第一方面中业务组网节点获取业务数据块的无应答简易通信方法，至少包括：业务组网节点，业务插入接口和业务提取接口，其中每一个所述业务组网节点均对应于一个所述业务插入接口和一个所述业务提取接口；其中所述业务插入接口和所述业务提取接口均为任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口。
在一些实施例中，所述无应答简易通信装置应用于上述第一方面任意可能实现的方法，包括：接收单元，用于通过通信节点接收数据块；存储单元，用于将所述数据块暂存于存储队列中；处理单元，用于获取所述数据块的接收次数和发送次数；发送单元，用于当所述接收次数和所述发送次数达到预设条件后，所述通信节点停止对所述数据块的发送处理。
在一些实施例中，所述发送单元还包括：设置所述通信节点的最大发送阈值和最大接收阈值；响应于所述发送次数到达到所述最大发送阈值，停止发送所述数据块。
在一些实施例中，所述发送单元还包括：响应于所述接收次数达到所述最大接收阈值后，按照 预设设置降低所述最大发送阈值，或增大所述发送次数；响应于所述发送次数未达到所述最大发送阈值且所述接收次数达到所最大接收阈值后，按照预设设置降低所述最大发送阈值。
在一些实施例中，所述无应答简易通信装置还包括：组网单元，用于将至少两个所述通信节点进行组网，其中，所述通信节点之间可互相进行数据传输；响应于所述组网内的任意所述通信节点内的所述数据块的接收次数或发送次数达到所述预设条件后，停止对所述数据块的发送处理。
在一些实施例中，所述无应答简易通信装置还包括：业务组网单元，用于增加业务组网节点；获取业务数据，形成业务数据块，将所述业务数据块暂存于存储队列中；获取所述业务数据块的插入次数和提取次数；根据所述业务数据块的插入次数和提取次数确定所述业务组节点对所述业务数据块的处理。
在一些实施例中，所述无应答简易通信装置还包括：业务组网单元，用于增加业务组网节点；所述通信节点至少包括一个对应的所述存储队列，用于暂存待处理的所述数据块；其中，所述数据块可以对应为所述通信数据块或所述业务通信数据块；一个所述存储队列包含至少一个数据存储单元；一个所述数据存储单元包含一个所述数据块和一个收发控制块，其中，所述数据块至少包含有数据源ID，数据生成时间和数据内容，所述收发控制块至少包含有数据块发送计数，数据接收计数，数据提取标志。
在一些实施例中，所述无应答简易通信装置还包括：存储处理单元，用于将待处理的所述数据块暂存于所述存储队列后，所述存储队列对所述数据块遵循时间优先原则进行处理，包括：确实所述数据块的生成时间；根据所述数据块生成时间在前的顺序对所述数据块进行存储处理，包括：将所述数据块存储于存储队列的预设存储空间内，或将所述数据块覆盖所述条件符合的数据块中生成时间在前的数据块。
在一些实施例中，所述无应答简易通信装置还包括接收单元或插入单元；接收单元，用于在获取所述数据块的情况下，遍历所述存储队列，确认对所述数据块的接收操作；响应于所述数据块已存储于所述存储队列中，退出接收暂存操作，并对所述数据块的接收次数进行计数+1处理；响应于所述数据块未存储于所述存储队列中，将所述数据块存储进所述存储队列中，并将所述数据块的接收次数进行初始值赋值；或插入单元，用于在获取所述业务数据块的情况下，遍历所述存储队列，确认对所述业务数据块的插入操作；确认获取所述业务数据块的时间，确定为所述业务数据的数据生成时间，并对所述业务数据块的插入次数进行初始值赋值。
在一些实施例中，所述无应答简易通信装置还包括：发送处理单元，用于在发送所述数据块时，遍历所述存储队列，根据时间优先原则确认对所述数据块的发送操作，包括：确认与所述数据块条件符合的数据块；将生成时间最前的且未被处理的所述条件符合的数据块进行发送，且将所述条件符合的数据块的发送计数标志+1。
本公开的第三方面提供了一种通信设备，包括：用于存储处理器可执行指令的存储器；处理器，与所述存储器连接；其中，所述处理器被配置为执行第一方面任意可能实现的方法。
本公开的第四方面提供了一种非临时性计算机可读存储介质，当所述存储介质中的指令由计算机的处理器执行时，使得计算机能够执行如第一方面任意可能实现的方法。
本公开的第五方面提供了一种计算机程序产品，包括计算机程序，其中，所述计算机程序被处理器执行时实现如第一方面任意可能实现的方法。
本公开的实施例在对数据进行传输的过程中，根据设定最大发送阈值，并对通信节点的转发次数技术，判断有效转发的技术是否达到最大发送阈值，如果达到最大发送阈值，则停止转发，无需等待接收通信节点的应答，实现了数据的高可靠、高效率的信息传输，即解决了数据信息传输的可靠性，又提升了网络通信数据信息传输的效率，同时还可以解决因广播风暴导致的网络瘫痪问题。
附图说明
以下将结合附图和优选实施例来对本公开进行进一步详细描述，但是本领域技术人员将领会的是，这些附图仅是出于解释优选实施例的目的而绘制的，并且因此不应当作为对本公开范围的限制。
图1是根据一示例性实施例示出的通信节点的示意图；
图2是根据一示例性实施例示出的逻辑的发送通信端口和接收通信端口的示意图；
图3是根据一示例性实施例示出的一种无应答简易通信方法的流程示意图；
图4是根据一示例性实施例示出的一种无应答多节点简易数据传输装置示意图；
图5是根据一示例性实施例示出的业务组网节点的示意图；
图6是根据一示例性实施例示出的数据储存单元的示意图；
图7是根据一示例性实施例示出的一种通信节点的接收通信处理流程；
图8是根据一示例性实施例示出的一种通信节点的业务插入处理流程；
图9是根据一示例性实施例示出的一种通信节点发送通信数据处理流程；
图10根据一示例性实施例示出的一种通信节点的业务提出处理流程；
图11是本申请实施例提供的一种通信装置的结构示意图；
图12是本申请实施例提供的一种通信设备的结构示意图。
具体实施方式
下面将结合本公开实施例中的附图，对本公开实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本公开一部分实施例，而不是全部的实施例。基于本公开中的实施例，本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本公开保护的范围。
如图1所示，在本实施例的无应答简易通信方法，公开了一种用于数据传输的通信节点，包括通信数据块存储队列、发送通信端口、接收通信端口。
其中，通信数据块存储队列，用于暂存需要通信传输的通信数据块；发送通信端口，用于对需要进行通信传输的通信数据块进行有效发送处理；接收通信端口，从外部接收需要进行通信传输的通信数据块；如图2所示，本公开可以将2个WiFi通信收发器、1个蓝牙通信收发器、1个PLC通信收发器、1个以太网通信收发器组合成一个逻辑的发送通信端口和接收通信端口。
所述通信节点能够调用存储的程序，用于执行任意一实施例的种数据传输方法。
在本公开的第一方面提供了一种无应答简易通信方法，如图3所示的无应答简易通信方法的流程示意图，所述的方法包括以下步骤S310至S340。
S310：通过通信节点获取数据块。
S320：将所述数据块暂存于存储队列中。
S330：获取所述数据块的接收次数和/或发送次数。
S340：响应于所述接收次数和所述发送次数达到预设条件，所述通信节点停止对所述数据块的发送处理。
在本申请实施例中，将获取的所述数据块暂存于存储队列中，所述通信节点对数据块进行有效发送处理，每次有效发送处理包括至少一次发送操作，对发送操作发送次数计数，当所述发送次数计数达到预设阈值后，所述的通信节点停止发送数据块，并不进行发送确认等待。
所述的有效发送处理是指所述的通信节点至少一次发送操作过程中，通信节点能够可靠的将所述通信数据块发送到通信介质中，而不被阻塞在通信节点内部。
所述的通信节点接收到通信数据块后，不对发送该数据块的一侧进行应答反馈。所述的通信节点在发送通信数据块时，无需等待接收该数据块的通信节点的应答。该通信方法无需接收端反馈应答数据，数据传输方法简单。
其中，所述数据块确定为获取的源通信数据至少包括：在获取所述数据块前，确定待传输的所述数据块；将所述原始的通信数据不做修改的处理为所述数据块。
因此，该方法中保证了通信节点接收到通信数据块原封不动、不做修改的从所有通信端口再发送出去。
在本公开中，接收通信端口会通过通信端口适配驱动层读取所有通信收发器是否有数据接收。只要任意一个通信收发器接收到数据，接收通信端口即认为接收到数据，接收通信端口立即利用本公开的接收处理机制，进行数据的校验验证。验证通过后就将接收到的数据存储在通信数据存储队列中，以便于本公开的发送通信端口对该数据的发送处理。
本公开的接收通信端口从任意一个通信收发器接收到数据后，将数据存储在通信数据存储队列中后。发送通信端口对该数据进行发送处理时，会向逻辑端口的所有的通信收发器进行发送，包括接收数据的通信收发器。例如，接收通信端口由UART从PLC通信收发器接收到数据A后，发送通信端口对该数据A进行发送处理时，会通过WiFi通信收发器1、WiFi通信收发器2、蓝牙通信收发器、PLC通信收发器、以太网通信收发器进行发送。
在一些实施例中，响应于所述接收次数和/或所述发送次数达到第一预设条件，所述通信节点停止对所述数据块的发送处理，包括：设置所述通信节点的最大发送阈值和最大接收阈值；响应于所述发送次数到达到所述最大发送阈值，停止发送所述数据块。
所述的每一个通信节点预设有最大发送阈值(SendCount Max)，通过获取并且判断待处理的数据块的发送次数计数是否达到最大发送阈值，从而对到处理的通信数据块做出相应处理。
若所述的发送次数计数达到最大发送阈值后，所述通信节点停止发送所述数据块。
若所述的发送次数计数未达到最大发送阈值，所述通信节点继续对所述数据块进行有效发送处理。
本实施例的通信节点从接收通信端口接收到数据块后，将该数据块暂存在数据存储队列中，待需要进行发送时再从通信数据存储队列中原封不动、不做修改的提取通信数据块，并交由发送通信端口进行有发送操作。
本实施例中所述待需要进行发送时是通过通通信节点进行判断，调用存储的程序，用于执行任意一实施例的种数据传输方法。
需要说明的是，本公开的通信节点的接收通信端口通过通信端口适配驱动进行任意数量和任意类型的数据接收时，只要其中一个硬件的、软件的接口接收到数据并校验正确后，即认为接收到一个有效的数据，然后将该数据存储在通信数据存储队列中。
本公开的通信节点在对该数据块进行发送时，将数据传递给通信端口适配驱动，由通信端口适配驱动逐个的对每个硬件的、软件的接口进行数据发送，所有接口都完成数据的发送后，才认为该数据被有效发送操作一次，才对发送次数进行加(+)1处理。
在本公开实施例中，当所述接收次数达到所述最大接收阈值后，则按照预设设置降低所述最大发送阈值；当所述发送次数未达到所述最大发送阈值且所述接收次数达到所最大接收阈值后，则按照预设设置降低所述最大发送阈值。
在通信节点的网络环境中，或者多个通信节点形成的组网情况下，只需检查数据块是否达到一个给定的最大发送阈值和/或最大的接收阈值。
通过判断数据块的发送次数达到一个给定的最大发送阈值或者数据块的接收次数计数是否达到一个给定的最大接收阈值，即可判断确定该数据已经可靠的进行了通信传输。
另一方面，在本实施例中多节点数据传输装置的传输方法中，某数据块的发送次数计数还未达到最大发送阈值，而接收次数计数已经达到了最大接收阈值时，可以根据一定计算规则减少该次通信数据块发送的最大发送阈值，让发送次数计数能够快速达到最大发送阈值，而停止该数据块的发送，如此来减少该数据块的发送操作次数，节省通信资源，提高通信效率。
在一些实施例中，当该接收次数达到最大接收阈值后，可以按照预设设置降低所述最大发送阈值，也可以增大其发送次数，以使得数据块的发送次数能够快速的达到最大发送阈值。其中可以在控制模块中通过自动设置最大发送阈值，或者按照一定规则设置数据块的发送次数，能够实现通过接收次数来判断和控制提前减少发送次数，使得数据块的发送次数最有效的达到最大发送阈值。
在一些实施例中，公开了一种无应答多节点简易通信方法，包括：
将至少两个所述通信节点进行组网，其中，所述通信节点之间可互相进行数据传输；
响应于所述组网内的任意所述通信节点内的所述数据块的接收次数或发送次数达到所述预设条件后，停止对所述数据块的发送处理。
所述的多节点通信方法对应于所述的多节点通信装置，其中至少包括两个通信节点。例如，将第一通信节点，用于将其接受或存储的数据包通过发送模块转发至少一个第二通信节点，并对其转发的数据块进行发送次数计数。第二通信节点，用于将从第一通信节点接收的数据块进行转发给其他的通信节点。
如图4所示，一种无应答多节点简易数据传输装置，包括通信节点1，通信节点2和通信节点n。
通信节点1、通信节点2和通信节点n都包括了通信数据存储队列、发送通信端口、接收通信端口。
其中，通信节点1的发送通信端口与通信节点2的接收通信端口、通信节点n的接收通信端口进行数据链传输连接；通信节点1的接收通信端口与通信节点2的发送通信端口、通信节点n的发送通信端口数据链传输连接。
同理，通信节点2以同样的方式与通信节点1和通信节点n数据链传输连接，通信节点n以同样的方式与通信节点1和通信节点2数据链传输连接。
在该无应答多节点简易通信装置中，每个通信节点利用发送通信端口和接收通信端口相互进行通信数据块的发送和接收。
本公开的多节点数据传输装置的数据传输过程中，每个通信节点发送的数据块会被至少1个其它通信节点收到，每个收到通信数据块的其它通信节点同样会将该数据块原封不动、不做修改的执行上述无应答简易通信步骤做有效发送处理，如此该数据块在通信过程中就会被至少2个通信节点进行有效发送处理。
同理，多节点数据传输装置的数据传输过程中，每个通信节点的接收通信端口会至少1次接收其它节点发送的相同的数据块，通信节点对接收到的相同数据块暂存于通信数据存储队列的同一个数据存储单元中，并对该相同的数据块的接收次数进行计数。
在数据传输过程中，数据块被有效发送后，相同的数据块又被其他节点发送出来，或至少接收 到1次相同的数据块，表示该数据块在通信介质或通信空间中已经得到有效的发送和传输。
本公开的多节点数据传输装置的数据传输过程中，每个通信节点既可以进行通信数据块的发送、也可进行数据块的接收，且发送和接收是相互对等相互交叉的，没有主从关系、没有中心节点，一个通信数据块经过网络传输后，可以抵达网络中任意一个通信节点，因此本公开的通信节点组成的组网通信网络是一个高可靠的无中心的对等网状网络。
在另一实施例中，本公开还具体公开了另一种无应答简易通信方法，包括：
增加业务组网节点；
获取业务数据，形成业务数据块，将所述业务数据块暂存于存储队列中；
获取所述业务数据块的插入次数和提取次数；
根据所述业务数据块的插入次数和提取次数确定所述业务组节点对所述业务通信数据块的处理。
如图5所示，提供了业务组网节点的示意图，所述的包括数据块存储队列、发送通信端口、接收通信端口、业务插入接口和业务提取接口。为了描述方便，将增加了业务插入接口和业务提取接口的通信节点命名为业务组网节点。
本实施例中的通信节点除了进行网络侧的数据组网通信传输外，增加一个业务插入接口和一个业务提取接口，用于业务侧的数据信息进入通信网络侧进行通信组网传输。
所述的业务组网节点的业务插入接口，用于将业务侧的业务数据插入到数据块存储队列。
所述的业务组网节点的业务提取接口，用于从通信数据存储队列中根据业务数据提取规则提取需要的业务数据。
在一些实施例中，所述的通信节的数据块存储队列包含至少一个数据存储单元，每个数据存储单元存储一个待通信传输的业务数据包，每个数据存储单元包含通信数据块和收发控制块两个部分。
如图6所示，一个数据存储单元，包括通信数据块和收发控制块。需要说明的是，本公开中所提及的数据块和通信数据块的意义相同。
所述通信数据块至少包括数据源ID、数据生成时间、数据内容。
其中，数据源ID，用于标识业务数据来源的设备唯一编码或者设备地址编码，区分该业务数据来源于组网通信网络中的那一个设备。
数据生成时间，用以标识业务数据从业务插入接口插入通信节点时的数据生成的时间点。
数据内容，为需要进行组网通信传输的业务数据的内容。
所述收发控制块至少包含数据发送技术、数据接收技术、数据提取标志。
其中，数据发送计数，用以统计计数通信数据块发送操作的次数，通信数据块每发送一次，该数据发送计数就+1；该数据发送计数赋值时可以为负值；为了描述方便将数据发送计数定义为DataSend_Count。
数据提取标志，用以标识该数据是否被从数据提取接口提取出来，避免数据重复提取；数据未被提取时该标志为0，数据被每提取一次，该标志就+1；为了描述方便将数据接收计数定义为DataFind_Flag。
例如，本实施例中的通信数据存储队列是至少包括含至少1个数据存储单元的存储块空间，本公开的实施例的通信数据存储队列包含5个数据存储单元用于通信数据块的存储和管理。
每个数据存储单元包含数据块和收发控制块两个部分：
其中，数据块包含数据源ID、数据生成时间、数据内容。
数据源ID字段，该字段根据系统通信设备ID长度可以为4字节、6字节、8字节或者128字节。
数据生成时间字段，该字段根据系统通信组网的时间计时单元的精度确定，时间计时单元的精度为秒级精度时，该字段长度为4字节，时间计时单元的精度为毫秒、微妙、纳秒级精度时，该字段长度为8字节，前4字节标识秒计时，后4字节标识毫秒、微妙、纳秒计时。
数据内容字段；该字段根据系统通信组网应用中，一次性传输的数据最大帧长度确定，该最大帧长度可以为16～2048字节，即本公开实施例的数据内容字段长度取值16～2048字节。
收发控制块包含数据接收技术字段、数据发送技术字段、数据提取标志字段。
数据接收计数字段，该字段根据系统通信组网的数据传输效率确定，在低速传输组网中，该字段长度为4字节，在高速传输组网中，该字段长度为8字节。
数据发送计数字段，该字段根据系统通信组网的数据传输效率确定，在低速传输组网中，该字段长度为4字节，在高速传输组网中，该字段长度为8字节。
数据提取标志字段，该字段长度为2字节。
在一些实施例中，在无应答简易传输数据的方法中，所述通信节点至少包括对应的所述存储队 列，用于暂存待处理的所述数据块；其中，所述数据块对应为所述通信数据块或所述业务通信数据块；
一个所述存储队列包含至少一个数据存储单元；
一个所述数据存储单元包含一个所述数据块和一个收发控制块，其中，所述数据块至少包含有数据源ID，数据生成时间和数据内容，所述收发控制块至少包含有数据块发送计数，数据接收计数，数据提取标志。
进一步的，通信数据存储队列包含至少1个数据存储单元，针对通信数据存储队列或业务通信存储队列的操作遵循时间优先原则，即在插入和/或接收时均遵循数据生成时间较新的通信数据块覆盖数据生成时间较老的通信数据块的原则进行处理。在发送和/或提取时均遵循数据生成时间较老的通信数据块优先于数据生成时间较新的通信数据块的原则进行处理。
例如，业务组网节点在对通信数据块按照上述无应答简易通信方法进行通信数据传输时，利用收发控制块的数据发送计数字段对通信数据块发送次数进行计数记录，利用收发控制块的数据接收计数字段对通信数据块接收次数进行计数记录。
业务组网节点从业务提取接口根据业务数据提取规则提取所需要的业务数据后，会对相应的数据存储单元的收发控制块的数据提取标志+1，表明该业务数据已经被该业务组网节点成功提取。
在一些实施例中，每一个所述通信节点均具有一个相同的系统时间；
在形成所述业务数据块时，所述业务数据块的数据生成时间是在所述数据内容进入所述通信节点时根据所述系统时间添加的。
需要说明的是，前述的通信节点、业务组网节点都具有一个相同的系统时间，或同一个时间计时单元；业务数据插入时填写的数据生成时间点均来源于该时间计时单元，并依据数据生成时间来进行数据的通信传输。
本公开可利用时钟同步协议保证所有节点的时间计时单元同频同相，且时间保持一致，即通信数据块在整个网络传输过程中，各个节点的时间保持精准一致。
进一步的，为了提高组网通信的可靠性、降低误码率、丢包率，可以根据需要提高时钟同步协议的精度，让所有节点的时间计时单元达到毫秒级、微妙级甚至纳秒级的时间精度，因此通信数据块中的数据生成时间也会达到相应的时间精度级别。
进一步的，本公开的中的所有通信节点、业务组网节点在用于国际互联的通信传输时，所有节点的时间计时单元会与国际标准日历时间保持一致，并利用高精度的卫星时间授时保证各个节点在通信传输过程中时间的精度和时间的一致性。
在本公开实施例中，提供了一种无应答简易传输数据的方法，应用于业务组网节点，包括以下步骤：
业务组节点通过业务插口将业务数据插入拷贝到业务组网节点；
将所述业务数据暂存于存储队列中，并形成业务通信数据块；
所述业务组网节点对通信数据块进行有效发送处理，每次有效发送处理包括至少一次发送操作，所述第一通信节点对发送操作发送次数计数。
当所述发送次数计数达到预设值后，所述的第一通信节点停止发送通信数据块，并不进行发送确认等待。
业务组网节点在有业务数据需要组网通信传输时，通过业务侧的业务插入接口将业务数据插入拷贝到通信数据存储队列中的某一个数据存储单元的数据内容字段中，在插入拷贝业务数据时，业务组网节点同时还将业务数据来源的设备唯一编码或者设备地址编码写入数据源ID字段、将业务数据插入时的时间点写入数据生成时间字段。
如此数据源ID、数据生成时间、数据内容三个字段组成通信数据块，并由发送通信端口对通信数据块进行整体通信传输。
在本公开实施例中，通信数据块在数据由业务侧插入业务组网节点的数据存储单元后，在其后所有的节点进行组网通信传输、发送、接收、存储的过程中，该通信数据块始终原封不动、不做修改，直到该通信数据块在数据存储单元被其它通信数据块给覆盖掉。
在一些实施例中，该无应答简易传输数据的方法还包括；将待处理的所述数据块暂存于所述存储队列后，所述存储队列对所述数据块遵循时间优先原则进行处理，包括：
确实所述数据块的生成时间；
根据所述数据块生成时间在前的顺序对所述数据块进行存储处理，包括：
将所述数据块存储于存储队列的预设存储空间内，或将所述数据块覆盖所述条件符合的数据块中生成时间在前的数据块。
在本公开实施例中，该无应答简易通信方法还包括；
响应于所述预设存储空间未达到最大预设空间，将所述数据块存储于所述存储队列中；
响应于所述预设存储空间内达到最大预设空间，确定与所述数据块条件符合的数据块；
响应于所述数据块与所述存储队列中的数据块条件不相符合，将所述数据块存储在所述存储队列中；
响应于所述数据块与所述存储队列中的数据块条件符合，将所述数据块直接覆盖所述生成时间在前的数据块，且将所述数据块的计数标志+1，或响应于所述数据块与所述存储队列中的数据块条件符合时，获取所述生成时间在前的数据块的发送次数，响应于所述生成时间在前的数据块的发送次数达到所述最大发送阈值，将所述数据块直接覆盖所述生成时间在前的数据块。
在本公开中，对该数据块进行发送时，优先发送数据时间在前的数据块，并不存在数据块的覆盖关系。
在本公开中，通过通信节点获取到相应的数据块后或业务数据块后，需要对数据块进行存储。可以存在两种存储处理方式，第一种是在存储队列中查找一个空的空间进行数据存储，若有空间则直接存储，若没有空余的空间，则直接查找覆盖存储队列中时间最前的数据块；第二种在存储队列中查找一个空的空间进行数据存储，若有空间则直接存储，若没有空余的空间，则查找存储队列中时间最前数据块是否达到最大发送阈值，若达到最大发送阈值，就直接覆盖，若没有达到最大发送阈值，则将插入的数据块丢弃。或者在业务数据进行插入时，同样遵循上述的两种方式。
需要说明的是，这里比较确定与所述数据块条件符合的数据块是通过具体的数据块的数据生成时间、数据源ID和/或数据内容进行比较的。例如，可以通过数据块的数据生成时间和数据源ID来比较与存储队列中其他的数据块是否相符合，也可以通过数据块的数据内容直接比较与存储队列中其他的数据块是否相符合，以及可以根据数据块中生成时间、数据源ID和数据内容共同来比较与存储队列中其他的数据块是否相符合。
在一些实施例中，所述无应答简易通信方法还包括：
在获取所述数据块的情况下，遍历所述存储队列，确认对所述数据块的接收操作；当所述数据块已存储于所述存储队列中，则退出接收暂存操作，并对所述数据块的接收次数进行计数+1处理；在所述数据块未存储于所述存储队列中的情况下，将所述数据块存储进所述存储队列中，并将所述数据块的接收次数进行初始值赋值。
在一些实施例中，在获取所述业务数据块的情况下，遍历所述存储队列，确认对所述业务数据块的插入操作；确认获取所述业务数据块的时间，确定为所述业务数据的数据生成时间，并对所述业务数据块的插入次数进行初始值赋值。
本公开的通信节点在从接收通信端口接收到通信数据块时，根据时间优先原则，遍历通信数据存储队列查找符合条件的数据存储单元空间存储该通信数据块，详细步骤如下：
遍历通信数据存储队列，比较判断通信数据块是否已经存储在队列中，若已经存储在队列中，则将暂存该通信数据块的数据存储单元的数据接收计数+1，表明通信节点又接收到一次该通信数据块，随后退出接收暂存操作。
判断该接收通信数据块属于新数据未被通信数据存储队列存储，根据时间优先原则，遍历队列查找数据生成时间最老的数据存储单元，比较该查找到的数据存储单元中的数据生成时间Time_old和接收通信数据块中的数据生成时间Time_recv。
判断Time_old<Time_recv则用该接收通信数据块覆盖查找到的数据存储单元，并将数据发送计数、数据接收计数、数据提取标志赋值为初始值，否则将该接收通信数据块直接丢弃。
在通过通信节点获取数据块时，需要判断该数据块是否被接收过，也就是是否已经存储于存储队列中。若该数据块被接收过，则将该数据块的接收次数标志和+1；若该数据块未被接收过，则查找一个空的预存存储空间进行存储。进一步需要判断在存储队列中是否有预设存储空间进行存储，若没有空余的存储空间，和上述插入式的处理方式类似，分两种处理模式；同样的也需要进行赋值初始值；若没有空余的存储空间，则直接查找覆盖存储队列中时间最前的数据，或查找存储队列中时间最前的数据是否达到最大发送阈值，若达到最大发送阈值，就直接覆盖，若没有达到最大发送阈值，则将获取的数据丢弃。
当通过组网节点获取相应业务数据块时，相同的原理如上述，参考上述实施例中对插入业务数据块的存储，在此不再赘述。
无论是获取数据库还是业务数据块，均需要根据上述判断进行相应的初始值赋值，以及对数据块的接收次数或业务数据块的插入次数进行计数标记。
例如，对数据块接收时赋值初始值为：发送次数＝0、接收次数＝1、提取标志＝0。对业务数据块插入时赋值初始值默认为：发送次数＝0、接收次数＝0、提取标志＝0。进一步的，为了增加通信可靠性，增加数据块首次进入网络时插入的业务数据的发送次数，将插入时的发送次数赋值为负数(发 送次数＝-1/-3)。
进一步的，在本实施例的方法中，比较判断该数据块是否被接收过，可以参考上述实施例中比较数据块是否与存储队列中的数据块条件符合的比较方法，也可以在上述方法中结合控制单元的计数进行判断。
例如，如图7，公开了一种通信节点的接收通信处理流程，具体包括如下步骤：
1、判断接收的通信数据块正确性，若否结束退出；
2、提取通信数据块的数据生成时间Time_old；
3、遍历通信数据存储队列判断接收通信数据块存在，若是则数据接收计数+1；
4、遍历查找数据生成时间最老的数据存储单元；
5、提取数据存储单元的数据生成时间Time_old；
6、比较数据生产时间，判断Time_old<Time_recv是否成立，若否结束退出；
7、接收通信数据块覆盖查找到的数据存储单元；
8、数据发送计数、数据接收计数、数据提取标志赋值为初始值；
9、结束退出。
在本公开实施例中，在业务组网节点的业务插入接口有业务数据插入时，将该业务数据、数据源ID、数据生成时间一起整合生成一个通信数据块，并根据时间优先原则，遍历通信数据存储队列查找符合条件的数据存储单元空间存储该数据通信块，详细步骤如下：
创建一个临时数据通信块，将业务数据来源的设备唯一编码或者设备地址编码写入临时数据通信块的数据源ID字段，业务数据插入时的时间点Time_ins写入临时数据通信块的数据生成时间字段。将业务数据拷贝到临时数据通信块的数据内容字段。
遍历通信数据存储队列查找数据生成时间最老的数据存储单元，比较该查找到的数据存储单元中的数据生成时间Time_old和插入数据生成时间Time_insert，若Time_old<Time_insert则用创建的临时通信数据块覆盖查找到的数据存储单元，并将数据发送计数、数据接收计数、数据提取标志赋值为初始值，否则丢弃该业务数据。
本实施例的通信数据块只在业务插入接口进行业务数据插入时根据数据源ID和数据生成时间一起生成出来，在后续的组网传输、发送、接收、暂存过程中，该通信数据块始终原封不动、不做修改，只到被其它更新的通信数据块给覆盖后消失。
本实施例的业务插入接口在进行业务数据插入时生成的通信数据块，利用数据源ID和数据生成时间能够在通信网络中唯一标识一个业务数据，且该业务数据无论在那个节点进行传输都不会被修改，保证了数据可靠性和可朔源性。
例如，如图8，公开了一种通信节点的业务插入处理流程步骤，
1、判断业务数据正确性，若否结束退出；
2、创建临时通信数据块；
3、获取数据插入时间Time_insert存储入临时通信数据块
4、获取数据源ID存储入临时通信数据块
5、业务数据存储入临时通信数据块
6、遍历查找数据生成时间最老的数据存储单元
7、提取数据存储单元的数据生成时间Time_old
8、比较Time_old<Time_insert，若否结束退出；
9、临时通信数据块覆盖查找到的数据存储单元；
10、数据发送计数、数据接收计数、数据提取标志赋值为初始值；
11、结束退出。
在一些实施例中，该无应答简易传输数据的方法还包括：
在发送所述数据块时，遍历所述存储队列，根据时间优先原则确认对所述数据块的发送操作，包括：确认与所述数据块条件符合的数据块；将生成时间最前的且未被处理的所述条件符合的数据块进行发送，且将所述条件符合的数据块的发送计数标志+1。
本实施例的通信节点在向发送通信端口发送通信数据块时，根据时间优先原则，遍历通信数据存储队列查找符合条件的数据生成时间最老的未被有效发送处理完毕的数据存储单元进行通信数据块的有效发送处理，详细步骤如下：
判断数据存储单元有无通信数据块；
数据存储单元中的数据接收次数达到了最大接收阈值时，根据指定的规则重新计算，并调整最大发送阈值；
数据存储单元中的数据发送次数达到了最大发送阈值，则继续查找；
遍历查找到符合条件的数据生成时间最老的未被有效发送处理完毕的数据存储单元后，提取出通信数据块利用发送通信端口进行一次发送，将收发控制块中的数据发送计数+1。
例如，如图9，公开了一种通信节点发送通信数据处理流程步骤，
1、时间临时变量暂存当前时间点；
2、循环遍历通信数据存储队列；
3、判断数据存储单元数据有效，若否进入第8步；
4、接收计数达到最大接收阈值，若是调整最大发送阈值；
5、发送计数达到最大发送阈值，若是进入第8步；
6、判断时间临时变量>数据生成时间，若否进入第8步；
7、时间临时变量暂存数据生成时间；
8、通信数据存储队列循环遍历是否完毕，若否进入第2步；
9、判断是否找到未有效发送处理的数据通信单元，若否结束退出；
10、通信数据块发送；
11、数据发送计数+1；
12、结束退出。
在一些实施例中，所述无应答简易通信方法还包括：在提取所述业务数据块的情况下，遍历所述存储队列，根据时间优先原则确认对所述业务数据块的提取操作，包括：确认与所述业务数据块条件符合的数据块；将生成时间最前的且未被处理的所述条件符合的数据块进行提取，且将所述条件符合的数据块的提取计数标志+1。
业务组网节点的业务提取接口遍历通信数据存储队列，并根据业务数据提取规则提取需要的业务数据；每次提取了一个数据存储单元的通信数据块后，将数据提取标志+1，标识该数据被提取过一次。
例如，如图10，公开了一种通信节点的业务提出处理流程步骤，
1、判断业务提取规则合规性，若否结束退出；
2、循环遍历通信数据存储队列；
3、判断数据存储单元是否符合提取规则，若否进入第6步；
4、数据提取标志+1；
5、数据内容通过业务提取接口返回给提取者；
6、判断通信数据存储队列循环遍历是否完毕，若否进入第2步；
7、结束退出。
在一些实施例中，业务插入接口和接收通信端口在有新的通信数据块暂存到通信数据存储队列中时，需要将数据发送计数、数据接收计数、数据提取标志赋值为初始值，默认的本公开将数据发送计数赋初值为0，数据接收计数赋初始值为0，数据提取标志赋初值为0；
在一些实施例中，所述无应答简易通信方法还包括：在任意的所述通信节点对应的收发控制块中，均可自定义所述存储队列中的数据块的初始值、最大发送阈值和/或最大接收阈值，以调节通信网络的可靠性。
在本公开的实施例中，通过设定不同的最大发送阈值和最大接收阈值，以及数据发送计数初始值、数据接收计数初始值，可以调整业务组网节点和通信节点对通信数据块有效发送处理的发送次数，以保证数据在组网通信传输过程中的可靠性和简单的，默认的本公开将最大发送阈值设定为1，将最大接收阈值设定为变量能够存储的最大值，即业务数据来源插入的业务组网节点对通信数据块的有效发送处理发送2次或者4次，通信数据块转发的通信节点的有效发送处理发送1次；若10个节点进行组网通信，一个业务数据可靠传输到全网仅需要传输(2次×1)+(1次×9)＝11次通信，而采用发送应答确认的模式进行传输至少需要进行3次×10＝30次通信；本公开的通信组网传输效率远高于发送应答确认模式。
在一个实施例中，公开了一个可以实现无应答简易数据传输方法的通信节点，本公开的实施例的通信节点需要理好通信数据存储队列，并利用每个数据存储单元的收发控制块控制好通信节点的通信数据块的接收和发送次数。
例如，所述的通信节点包含1个数据结构和四个处理流程，如图5所述，具体包括，通信数据存储队列数据结构，业务插入处理流程，业务提取处理流程，发送通信处理流程，接收通信处理流程。
通信数据存储队列数据结构，对应通信数据存储队列的内存管理；
业务插入处理流程，对应业务插入接口进行业务数据插入时的处理；
业务提取处理流程，对应业务提取接口进行业务数据提取时的处理；
发送通信处理流程，对应发送通信端口进行通信数据块的有效发送处理；
接收通信处理流程，对应接收通信端口进行通信数据块的接收处理。
本公开的通信节点的硬件的、软件的接口由于通信速率的不一致，导致发送的数据，有的通信接口发送的较块，有的通信接口发送的较慢，优选的根据最低通信速率的硬件的、软件的接口来确定数据发送速度。
进一步的，在本公开的各个实施例中，默认在进行通信数据块的插入、发送、接收时均以一个固定的时间轴，按照时间优先原则的方式进行通信数据块的操作和处理，以保证每一包数据的可靠传输，避免老旧的数据覆盖新的数据造成数据丢包和传输误码。但在实际的网络应用中，受限于时间精度的高低、真实数据级别的高低，以及组网类型的不同，需要在该时间优先原则的基础上进行应用演化。
在一些实施例中，针对与数据块发送时的时间优选原则，所述无应答简易通信方法包括：基于所述发送次数的数据优先发送的方式对发送时的所述时间优先原则进行演化，基于所述接收次数的数据优先发送的方式对发送时的所述时间优先原则进行演化，和/或基于数据级别的数据优先发送的方式对发送时的所述时间优先原则进行演化。
本公开的进一步提供了三种演化方式，分别为：基于发送次数的数据优先发送，基于接收次数调整的数据优先发送，基于数据级别的数据优先发送。
基于发送次数的数据优先发送的方法，在进行通信数据块的发送时，若干个通信数据块的数据生成时间相差不大的情况下(小于1s或100ms可定义)，首先优先发送数据发送次数为负数的通信数据块，其次再优先发送数据发送次数小的通信数据块，最后在发送数据发送次数大的通信数据块。
通过本公开的方式，对发送次数进行优先发送调整，最大限度的将通信节点中通信数据存储队列中的不同的数据发送出去进行组网传输，将有限的组网传输资源分配给这些不同的数据，以提高组网传输的吞吐率，同时且降低了传输的延迟。
基于接收次数调整的数据优先发送的方法，可以根据通信数据块的数据接收次数，来逐步调整最大发送阈值，以减少数据发送的次数。具体方式是定义一个多级的调整表，当数据接收次数达到一个数值或者满足某个条件后，最大发送阈值降低多少比例，只到最大发送阈值降低到1次位置，最大发送阈值最低不能低于1次。
在本公开的方式中，通过数据接收次数能够判断该通信数据块大概率能否被其它邻居节点可靠接收。一旦判定通信数据块被其它邻居节点可靠接收后，就可以减少及避免重复发送相同数据，减少通信介质资源的重复占用，转而发送其它未发送过的通信数据块，提高网络传输的通信效率和吞吐率。
基于数据级别的数据优先发送的方式，将通信数据块增加一个数据优先级别的字段，用以标识数据内容的传输优先级。通信节点在进行数据发送时，首先发送高优先级的数据，然后在发送低优先级的数据。数据优先级分为传输延迟优先级和传输可靠优先级，针对传输延迟优先级高的数据，要求组网传输延迟尽量的少，对于传输可靠优先级的数据，要求组网传输时一定要保护保证数据的传输可靠性，不允许误码和丢包。
因此针对传输延迟优先级高的数据，优先提前发送，减少数据在通信节点中存储等待的时间和延迟。针对传输可靠优先级的数据，会增加最大发送阈值的数字，以增加数据重发发送的次数和强度。若某通信数据块同时具有传输延迟优先级和传输可靠优先级时，在增加数据重发次数的基础上，提前进行发送。在此方式中，通过定义不同类型的数据优先级，让不同的网络业务数据具有不同的传输特性，满足不同的用户需要，既能够满足紧急数据的快速传输、可靠传输，又能够满足普通数据的一般传输。
在本公开的优先发送原则中，可以将上述任一种方式引入，或者基于上述三种混合模式的数据优先发送。
具体为将上述发送次数优先、接收次数调整优先、数据级别优先三种不同的优先模式，按照一定的规则进行排列组合，计算出一个综合性的数据发送优先级来进行数据的发送。
具体方法是定义个0000～9999的4位数的优先级数字，根据灵活配置，将发送次数优先、接收次数调整、传输延迟优先、传输可靠优先按照个、十、百、千进行排列组合确定一个排列组合规则，每个通信数据块根据数据发送次数、数据接收次数、传输延迟优先级、传输可靠优先级来计算出一个综合性的数据发送优先级，来确定数据的发送先后顺序。
采用本公开的三种方式组合应用，可以通过混合运算，具有更加灵活的数据发送处理优先级，以适应各种不同的数据发送和传输应用场景，让网络传输根据的灵活和遍历，更加适应物联网组网的异构化需求。
进一步的，为了降低低速通信端口对通信网络效率的影响，可以通过增加低速通信接口的数量来提升通信吞吐率，如图1个RF无线通信收发器通过SPI总线可以达到10Mbps的通信速率，而RS485通信收发器仅能够达到2.5Mbps的通信速率，通过接口聚合适配驱动，将4个RS485通信收发器进行聚合通信，分别传输不同的发送数据，可以达到10Mbps的通信速率，使得发送通信端口和接收通信端口的速率能够保持在10Mbps。
本公开的第二方面提供了一种无应答简易通信装置，
在一些实施例中，所述无应答简易通信装置应用于第一方面中通信节点获取数据块的无应答简易通信方法，至少包括：通信节点，接收通信端口和发送通信端口，其中每一个所述通信节点均对应于一个所述接收通信端口和一个所述发送通信端口；其中所述接收通信端口和所述发送通信端口均为任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口。
在一些实施例中，所述无应答简易通信装置应用于第一方面中业务组网节点获取业务数据块的无应答简易通信方法，至少包括：业务组网节点，业务插入接口和业务提取接口，其中每一个所述业务组网节点均对应于一个所述业务插入接口和一个所述业务提取接口；其中所述业务插入接口和所述业务提取接口均为任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口。
本公开的发送通信端口和接收通信端口泛指任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口，本公开将这些可以进行信息和数据传递的介质、线路和接口统称为数据接口。
本实施例中的发送通信端口和接收通信端口由至少一个数据接口的集合组成，这个接口集合可以是不同介质、不同线路、不同接口的组合。
本公开在实施过程中，物理的介质、线路、接口可以是WiFi通信收发器、蓝牙通信收发器、LoRa无线收发器、zigbee无线收发器、其它无线电通信收发器、红外通信收发器、声波通信收发器、卫星链路收发器、GSM、4G、5G等各种频段的无线电通信收发器，还可以是以太网通信接口、光纤通信接口、RS232通信收发器、RS485通信收发器、PLC通信收发器等各种有线通信模块和数据通信收发器。
本公开的逻辑的介质、线路和接口可以是上述各种有线无线通信模块和数据通信收发器的任意数量和任意种类的逻辑组合，如图2所示，本公开可以将2个WiFi通信收发器、1个蓝牙通信收发器、1个PLC通信收发器、1个以太网通信收发器组合成一个逻辑的发送通信端口和接收通信端口。
本公开的发送通信端口和接收通信端口通过通信端口适配驱动层将任意数量和任意种类的通信收发器的逻辑组合看做一个通信端口进行本公开的数据发送(Send)和数据接收(Recv)。
在本公开第二方面的一些实施例中，如图11所示的装置示意图，所述无应答简易通信装置应用于上述第一方面任意可能实现的方法，包括：接收单元，用于通过通信节点接收数据块；存储单元，用于将所述数据块暂存于存储队列中；处理单元，用于获取所述数据块的接收次数和发送次数；发送单元，用于当所述接收次数和所述发送次数达到预设条件后，所述通信节点停止对所述数据块的发送处理。
本公开的第三方面提供了一种通信设备，包括：用于存储处理器可执行指令的存储器；处理器，与所述存储器连接；其中，所述处理器被配置为执行第一方面任意可能实现的方法。进一步的，该方法的应用不限于本公开所指的处理器，也可以在相应的逻辑芯片中执行。
本公开的第四方面提供了一种通信设备，当所述存储介质中的指令由计算机的处理器执行时，使得计算机能够执行如第一方面任意可能实现的方法。
图12是根据一示例性实施例示出的一种通信设备600的框图。根据本公开实施例的方法或装置也可以借助于计算设备的架构来实现。12示出了根据本公开实施例的示例性计算设备的架构的示意图。如12所示，计算设备600可以包括总线601、一个或多个CPU 602、只读存储器(ROM)603、随机存取存储器(RAM)604、连接到网络的通信端口605、输入/输出组件606、硬盘607等。计算设备600中的存储设备，例如ROM603或硬盘607可以存储本公开提供的基于节点间数据共享的数据处理方法的处理和/或通信使用的各种数据或文件以及CPU所执行的程序指令。计算设备600还可以包括用户界面608。当然，图12所示的架构只是示例性的，在实现不同的设备时，根据实际需要，可以省略图12示出的计算设备中的一个或多个组件。
根据本公开的又一方面，还提供了一种计算机可读存储介质，所述计算机存储介质上存储有计算机可读指令。当所述计算机可读指令601由处理器运行时，可以执行参照以上附图描述的根据本公开实施例的基于节点间数据共享的数据处理方法。所述计算机可读存储介质包括但不限于例如易失性存储器和/或非易失性存储器。所述易失性存储器例如可以包括随机存取存储器(RAM)和/或高速缓冲存储器(cache)等。所述非易失性存储器例如可以包括只读存储器(ROM)、硬盘、闪存等。
根据本公开的又一方面，还提供了一种计算机程序产品，包括计算机程序，其中，所述计算机程序被处理器执行时实现上述实施例中任一项所述的无应答简易通信方法。
本领域技术人员能够理解，本公开所披露的内容可以出现多种变型和改进。例如，以上所描述的各种设备或组件可以通过硬件实现，也可以通过软件、固件、或者三者中的一些或全部的组合实现。
此外，虽然本公开对根据本公开的实施例的系统中的某些单元做出了各种引用，然而，任何数量的不同单元可以被使用并运行在客户端和/或服务器上。所述单元仅是说明性的，并且所述系统和方法的不同方面可以使用不同单元。
本领域普通技术人员可以理解上述方法中的全部或部分的步骤可通过程序来指令相关硬件完成，所述程序可以存储于计算机可读存储介质中，如只读存储器、磁盘或光盘等。可选地，上述实施例的全部或部分步骤也可以使用一个或多个集成电路来实现。相应地，上述实施例中的各模块/单元可以采用硬件的形式实现，也可以采用软件功能模块的形式实现。本公开并不限制于任何特定形式的硬件和软件的结合。
除非另有定义，这里使用的所有术语(包括技术和科学术语)具有与本公开所属领域的普通技术人员共同理解的相同含义。还应当理解，诸如在通常字典里定义的那些术语应当被解释为具有与它们在相关技术的上下文中的含义相一致的含义，而不应用理想化或极度形式化的意义来解释，除非这里明确地这样定义。
以上是对本公开的说明，而不应被认为是对其的限制。尽管描述了本公开的若干示例性实施例，但本领域技术人员将容易地理解，在不背离本公开的新颖教学和优点的前提下可以对示例性实施例进行许多修改。因此，所有这些修改都意图包含在权利要求书所限定的本公开范围内。应当理解，上面是对本公开的说明，而不应被认为是限于所公开的特定实施例，并且对所公开的实施例以及其他实施例的修改意图包含在所附权利要求书的范围内。本公开由权利要求书及其等效物限定。

Claims (29)

  1. 一种无应答简易通信方法，包括：
    通过通信节点获取数据块；
    将所述数据块暂存于存储队列中；
    获取所述数据块的接收次数和/或发送次数；响应于所述接收次数和/或所述发送次数达到预设条件，所述通信节点停止对所述数据块的发送处理。
  2. 根据权利要求1所述的无应答简易通信方法，还包括：
    将所述数据块暂存于存储队列后；
    所述通信节点对所述数据块进行有效发送处理，其中每次所述有效发送处理包括至少一次发送操作；
    对所述发送操作的次数进行计数。
  3. 根据权利要求1所述的无应答简易通信方法，其中，响应于所述接收次数和/或所述发送次数达到预设条件，所述通信节点停止对所述数据块的发送处理，包括：
    设置所述通信节点的最大发送阈值和最大接收阈值；
    响应于所述发送次数到达到所述最大发送阈值，停止发送所述数据块。
  4. 根据权利要求3所述的无应答简易通信方法，还包括：
    响应于所述接收次数达到所述最大接收阈值，按照预设设置降低所述最大发送阈值，或增大所述发送次数；
    响应于所述发送次数未达到所述最大发送阈值且所述接收次数达到所最大接收阈值，按照预设设置降低所述最大发送阈值。
  5. 根据权利要求1所述的无应答简易通信方法，还包括：
    将至少两个所述通信节点进行组网，其中，所述通信节点之间可互相进行数据传输；
    响应于所述组网内的任意所述通信节点内的所述数据块的接收次数或发送次数达到所述预设条件，停止对所述数据块的发送处理。
  6. 根据权利要求1所述的无应答简易通信方法，还包括：
    增加业务组网节点；
    获取业务数据，形成业务数据块，将所述业务数据块暂存于存储队列中；
    获取所述业务数据块的插入次数和提取次数；
    根据所述业务数据块的插入次数和提取次数确定所述业务组节点对所述业务数据块的处理。
  7. 根据权利要求1或6的所述的无应答简易通信方法，其中，所述通信节点至少包括一个对应的所述存储队列；
    所述方法还包括：
    将待处理的所述数据块暂存于所述存储队列；其中，所述数据块可以对应为所述通信数据块或所述业务通信数据块；
    一个所述存储队列包含至少一个数据存储单元；
    一个所述数据存储单元包含一个所述数据块和一个收发控制块，其中，所述数据块至少包含有数据源ID，数据生成时间和数据内容，所述收发控制块至少包含有数据块发送计数，数据接收计数，数据提取标志。
  8. 根据权利要求7的所述的无应答简易通信方法，其中，
    每一个所述通信节点均具有一个相同的系统时间；
    在形成所述业务数据块的情况下，所述业务数据块的数据生成时间是在所述数据内容进入所述通信节点时根据所述系统时间添加的。
  9. 根据权利要求7所述的无应答简易通信方法，还包括：
    将待处理的所述数据块暂存于所述存储队列后，所述存储队列对所述数据块遵循时间优先原则进行处理，包括：
    确实所述数据块的生成时间；
    根据所述数据块生成时间在前的顺序对所述数据块进行存储处理，包括：
    将所述数据块存储于存储队列的预设存储空间内，或将所述数据块覆盖所述条件符合的数据块中生成时间在前的数据块。
  10. 根据权利要求9所述的无应答简易通信方法，还包括：
    响应于所述预设存储空间未达到最大预设空间，将所述数据块存储于所述存储队列中；
    响应于所述预设存储空间内达到最大预设空间，确定与所述数据块条件符合的数据块；
    响应于所述数据块与所述存储队列中的数据块条件不相符合，将所述数据块存储在所述存储队 列中；
    响应于所述数据块与所述存储队列中的数据块条件符合，将所述数据块直接覆盖所述生成时间在前的数据块，且将所述数据块的计数标志加1，或响应于所述数据块与所述存储队列中的数据块条件符合，获取所述生成时间在前的数据块的发送次数，响应于所述生成时间在前的数据块的发送次数达到所述最大发送阈值，将所述数据块直接覆盖所述生成时间在前的数据块。
  11. 根据权利要求1或6所述的无应答简易通信方法，还包括：
    在获取所述数据块的情况下，遍历所述存储队列，确认对所述数据块的接收操作；在所述数据块已存储于所述存储队列中的情况下，则退出接收暂存操作，并对所述数据块的接收次数进行计数加1处理；在所述数据块未存储于所述存储队列中的情况下，将所述数据块存储进所述存储队列中，并将所述数据块的接收次数进行初始值赋值；或
    在获取所述业务数据块的情况下，遍历所述存储队列，确认对所述业务数据块的插入操作；确认获取所述业务数据块的时间，确定为所述业务数据的数据生成时间，并对所述业务数据块的插入次数进行初始值赋值。
  12. 根据权利要求1所述的无应答简易通信方法，还包括：
    在发送所述数据块的情况下，遍历所述存储队列，根据时间优先原则确认对所述数据块的发送操作，包括：
    确认与所述数据块条件符合的数据块；
    将生成时间最前的且未被处理的所述条件符合的数据块进行发送，且将所述条件符合的数据块的发送计数标志加1。
  13. 根据权利要求6所述的无应答简易通信方法，还包括：
    在提取所述业务数据块的情况下，遍历所述存储队列，根据时间优先原则确认对所述业务数据块的提取操作，包括：
    确认与所述业务数据块条件符合的数据块；
    将生成时间最前的且未被处理的所述条件符合的数据块进行提取，且将所述条件符合的数据块的提取计数标志加1。
  14. 根据权利要求12所述的无应答简易通信方法，还包括：
    基于所述发送次数的数据优先发送的方式对发送时的所述时间优先原则进行演化，基于所述接收次数的数据优先发送的方式对发送时的所述时间优先原则进行演化，和/或基于数据级别的数据优先发送的方式对发送时的所述时间优先原则进行演化。
  15. 根据权利要求7所述的无应答简易通信方法，还包括：
    在任意的所述通信节点对应的收发控制块中，均可自定义所述存储队列中的数据块的初始值、最大发送阈值和/或最大接收阈值，以调节通信网络的可靠性。
  16. 一种无应答简易通信装置，应用于权利要求1所述的一种无应答简易通信方法，至少包括：通信节点，接收通信端口和发送通信端口，其中每一个所述通信节点均对应于一个所述接收通信端口和一个所述发送通信端口；
    其中所述接收通信端口和所述发送通信端口均为任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口。
  17. 一种无应答简易通信装置，应用于权利要求6所述的一种无应答简易通信方法，至少包括：
    业务组网节点，业务插入接口和业务提取接口，其中每一个所述业务组网节点均对应于一个所述业务插入接口和一个所述业务提取接口；
    其中所述业务插入接口和所述业务提取接口均为任何可以进行信息和数据传递的物理的、逻辑的、硬件的、软件的介质、线路和接口。
  18. 一种无应答简易通信装置，应用于所述权利要求1至15所述的一种无应答简易通信方法，包括：
    接收单元，用于通过通信节点接收数据块；
    存储单元，用于将所述数据块暂存于存储队列中；
    处理单元，用于获取所述数据块的接收次数和/或发送次数；
    发送单元，用于当所述接收次数和所述发送次数达到预设条件后，所述通信节点停止对所述数据块的发送处理。
  19. 根据权利要求18所述的无应答简易通信装置，其中，所述发送单元还包括：设置所述通信节点的最大发送阈值和最大接收阈值；
    响应于所述发送次数到达到所述最大发送阈值，停止发送所述数据块。
  20. 根据权利要求19所述的无应答简易通信装置，其中，所述发送单元还包括：
    响应于所述接收次数达到所述最大接收阈值，按照预设设置降低所述最大发送阈值，或增大所述发送次数；
    响应于所述发送次数未达到所述最大发送阈值且所述接收次数达到所最大接收阈值，按照预设设置降低所述最大发送阈值。
  21. 根据权利要求18所述的无应答简易通信装置，还包括：
    组网单元，用于将至少两个所述通信节点进行组网，其中，所述通信节点之间可互相进行数据传输；响应于所述组网内的任意所述通信节点内的所述数据块的接收次数或发送次数达到所述预设条件后，停止对所述数据块的发送处理。
  22. 根据权利要求18所述的无应答简易通信装置，还包括：业务组网单元，用于：
    增加业务组网节点；
    获取业务数据，形成业务数据块，将所述业务数据块暂存于存储队列中；
    获取所述业务数据块的插入次数和提取次数；
    根据所述业务数据块的插入次数和提取次数确定所述业务组节点对所述业务数据块的处理。
  23. 根据权利要求18所述的无应答简易通信装置，其中，所述通信节点至少包括一个对应的所述存储队列，用于暂存待处理的所述数据块；其中，所述数据块可以对应为所述通信数据块或所述业务通信数据块；
    一个所述存储队列包含至少一个数据存储单元；
    一个所述数据存储单元包含一个所述数据块和一个收发控制块，其中，所述数据块至少包含有数据源ID，数据生成时间和数据内容，所述收发控制块至少包含有数据块发送计数，数据接收计数，数据提取标志。
  24. 根据权利要求23所述的无应答简易通信装置，还包括：存储处理单元，用于将待处理的所述数据块暂存于所述存储队列后，所述存储队列对所述数据块遵循时间优先原则进行处理，包括：
    确实所述数据块的生成时间；
    根据所述数据块生成时间在前的顺序对所述数据块进行存储处理，包括：
    确定与所述数据块条件符合的数据块；
    将所述数据块存储于存储队列的预设存储空间内，或将所述数据块覆盖所述条件符合的数据块中生成时间在前的数据块。
  25. 根据权利要求18或22所述的无应答简易通信装置，还包括：
    接收单元或插入单元，用于在获取所述数据块的情况下，遍历所述存储队列，确认对所述数据块的接收或插入操作；
    确定所述数据块与所述存储队列中的数据块条件是否符合；
    响应于所述数据块与所述存储队列中的数据块条件符合，退出接收暂存操作，并对所述数据块的接收次数进行计数加1处理；
    响应于所述数据块与所述存储队列中的数据块条件不相符合，将所述数据块存储进所述存储队列中，并将所述数据块的计数标志赋值为初始值。
  26. 根据权利要求18所述的无应答简易通信装置，还包括：
    发送处理单元，用于在发送所述数据块的情况下，遍历所述存储队列，根据时间优先原则确认对所述数据块的发送操作，包括：
    确认与所述数据块条件符合的数据块；
    将生成时间最前的且未被处理的所述条件符合的数据块进行发送，且将所述条件符合的数据块的发送计数标志加1。
  27. 一种通信设备，包括：用于存储处理器可执行指令的存储器；处理器，与所述存储器连接；其中，所述处理器被配置为执行如权利要求1至15中任一项所述的方法。
  28. 一种非临时性计算机可读存储介质，当所述存储介质中的指令由计算机的处理器执行时，使得计算机能够执行如权利要求1至15中任一项所述的方法。
  29. 一种计算机程序产品，包括计算机程序，其中，所述计算机程序被处理器执行时实现权利要求1至15中任一项所述的方法。
PCT/CN2023/071441 2022-01-25 2023-01-09 无应答简易通信方法及装置 WO2023143030A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210090529.1A CN116506328A (zh) 2022-01-25 2022-01-25 一种无应答简易通信方法及装置
CN202210090529.1 2022-01-25

Publications (1)

Publication Number Publication Date
WO2023143030A1 true WO2023143030A1 (zh) 2023-08-03

Family

ID=87320731

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/071441 WO2023143030A1 (zh) 2022-01-25 2023-01-09 无应答简易通信方法及装置

Country Status (2)

Country Link
CN (1) CN116506328A (zh)
WO (1) WO2023143030A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011030210A (ja) * 2009-06-26 2011-02-10 Tokai Univ 無線通信装置、無線ネットワークシステム及び通信処理方法
CN110636128A (zh) * 2019-09-20 2019-12-31 苏州浪潮智能科技有限公司 一种数据同步方法、系统、电子设备及存储介质
CN110971387A (zh) * 2019-12-10 2020-04-07 上海邦邦机器人有限公司 一种数据传输处理方法、发送设备和接收设备
CN111078430A (zh) * 2019-12-09 2020-04-28 苏州浪潮智能科技有限公司 一种消息通知处理方法、设备以及存储介质
CN113098763A (zh) * 2021-06-10 2021-07-09 天聚地合(苏州)数据股份有限公司 即时通讯消息发送方法、装置、存储介质及设备

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2011030210A (ja) * 2009-06-26 2011-02-10 Tokai Univ 無線通信装置、無線ネットワークシステム及び通信処理方法
CN110636128A (zh) * 2019-09-20 2019-12-31 苏州浪潮智能科技有限公司 一种数据同步方法、系统、电子设备及存储介质
CN111078430A (zh) * 2019-12-09 2020-04-28 苏州浪潮智能科技有限公司 一种消息通知处理方法、设备以及存储介质
CN110971387A (zh) * 2019-12-10 2020-04-07 上海邦邦机器人有限公司 一种数据传输处理方法、发送设备和接收设备
CN113098763A (zh) * 2021-06-10 2021-07-09 天聚地合(苏州)数据股份有限公司 即时通讯消息发送方法、装置、存储介质及设备

Also Published As

Publication number Publication date
CN116506328A (zh) 2023-07-28

Similar Documents

Publication Publication Date Title
US20110142052A1 (en) Method for transferring data packets in a communication network and switching device
US5919250A (en) Data transmission system used for plant control and based on local area network
US10033619B2 (en) Data processing method and apparatus for OpenFlow network
US9866639B2 (en) Communication apparatus, information processor, communication method, and computer-readable storage medium
CN113259391B (zh) 应用于多级节点网络的数据传输方法和装置
CN114978433B (zh) 数据传输方法、装置、设备、存储介质及计算机程序产品
CN112242956B (zh) 流速控制方法和装置
WO2023093727A1 (zh) 时间敏感网络数据传输方法及系统
US20170134299A1 (en) Method and apparatus for controlling message over heterogeneous network
WO2023030336A1 (zh) 数据传输方法、tsn节点和计算机可读存储介质
US20230261795A1 (en) Method for Retransmitting Data and Apparatus
US11177969B2 (en) Interface device and data communication method
CN113542148B (zh) 一种报文聚合方法、装置、网络网卡及可读存储介质
CN112838992A (zh) 报文调度方法及网络设备
US7827324B2 (en) Method of handling flow control in daisy-chain protocols
WO2023143030A1 (zh) 无应答简易通信方法及装置
CN111740922B (zh) 数据传输方法、装置、电子设备及介质
EP2916234B1 (en) Method and universal interface chip for achieving high-speed data transmission
US11784929B2 (en) Heterogeneous link data translation and distribution method, system and device, and storage medium
CN102449958B (zh) 半导体集成电路装置
WO2022111326A1 (zh) 一种数据传输方法、装置、电子设备和存储介质
CN117014967A (zh) 移动通信系统、方法和用户面节点
KR102691014B1 (ko) 캔 통신과 이더넷 통신을 이용한 가변 데이터 수집 방법
US20220050440A1 (en) Communication Device and Method for Data Transmission within an Industrial Communication Network
US8812741B2 (en) Management data input/output protocol with page write extension

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23745913

Country of ref document: EP

Kind code of ref document: A1