A method, storage device, and mobile terminal for distributed processing of energy data based on quantum networks,

Abstract

This invention discloses a method, storage device, and mobile terminal for rate limiting of energy data in distributed processing based on a quantum network. The method includes a quantum communication network and multiple QNCPs (Quantum Communication Providers). Each QNCP includes a network communication module and a key pool module. The source node QNCP determines the transmission path based on routing table information and sends message information. Upon receiving the message information, the next-hop QNCP node stores the message messages sequentially in a message queue and sends a response message to the sending QNCP. The sending QNCP selects an encryption method based on the security level of the message information to be sent, performs encryption processing, and sends it to the next-hop QNCP node on the transmission path. Upon receiving the response message, the next-hop QNCP node parses the response message; if the message is a complete response message, the transmission is complete. This invention achieves rate limiting control of energy data transmission by establishing a message queue, thus improving the efficiency of key application.

Description

Technical Field

[0001] This invention relates to the field of quantum information and energy data processing technology, specifically to a method for rate limiting of distributed energy data processing based on quantum networks. Background Technology

[0002] With the popularization of the internet and the continuous iteration of information, people are becoming increasingly reliant on information networks. As science and technology advance and global computing power continues to improve, encryption systems are constantly being challenged. The security barriers of classical communication networks are extremely weak, leading to the rise and commercialization of quantum secure communication.

[0003] Therefore, key technologies for handling the rate limiting problem of energy data are extremely important in quantum secure communication networks. Currently, methods for rate limiting of energy data transmission are only implemented in classical communication networks, that is, limiting the rate of user energy data through data management and control within the classical network. However, in the field of quantum communication, current methods do not address the rate limiting of user energy data. This inevitably leads to a reduction in the control over energy data in quantum communication keys, resulting in low communication efficiency; and messages exceeding processing capacity are not effectively processed, thus significantly reducing the security ensured by quantum communication.

[0004] Existing solutions use the number of tokens a device has to determine whether to process a message, thus limiting the rate of energy data transmission. However, this method has a drawback: if there are insufficient tokens, the message will be discarded, resulting in low communication reliability. After the power equipment and data transmission equipment forward the message, if there are insufficient tokens remaining, a complete token exchange will be triggered. This significantly increases the risk of token leakage and reduces security.

[0005] Another approach is to establish a central control system to manage the various node devices in the quantum communication network, create a corresponding topology map, and provide paths for data transmission. However, a centralized network structure leads to excessive dependence of nodes on the center, and problems with the central control system can cause network collapse, resulting in poor network stability, which poses a significant security risk, especially in the power and energy sectors.

[0006] Therefore, it is necessary to improve existing technologies and propose a data rate limiting method for distributed energy in quantum secure communication networks that is highly secure, stable, and efficient. Summary of the Invention

[0007] To address the aforementioned technical problems, a high-security, stable, and efficient distributed energy data rate limiting method based on quantum secure communication networks is proposed. This method, along with its storage device and mobile terminal, is based on a distributed processing method for energy data rate limiting using a quantum network. The technical solution adopted by this invention to achieve the above objectives is as follows: The method for distributed processing of energy data rate limiting using a quantum network includes a quantum communication network and multiple QNCPs. All QNCPs are connected to the quantum communication network. Any QNCP is used to generate, send, transmit, or receive quantum keys. Each QNCP includes a network communication module and a key pool module. The network communication module has a pre-set routing table based on the RIP protocol, and the key pool module has pre-set key pool parameters, a quantum key limit, and a classical key limit.

[0008] The steps of this method are as follows:

[0009] Step S1: Initialize the communication timer in the source node QNCP network communication module, and send the node's message information to all QNCP nodes in the quantum communication network in the form of broadcast. Other QNCPs in the network update their routing tables and send back response messages based on the received message information. The source node QNCP updates its routing table information after receiving all the response message information.

[0010] Step S2: The source node QNCP determines the sending path based on the updated routing table information, and determines whether the next-hop node QNCP of the sending path is reachable. If it is reachable, then proceed to step S3.

[0011] If unreachable, send message information to other reachable adjacent QNCP nodes to update the routing table;

[0012] Step S3: The source node QNCP sends its own message information to the reachable next-hop node QNCP. After receiving the message information, the next-hop QNCP node stores the message information in the pending message queue in sequence and sends a response message information to the sending end QNCP.

[0013] Step S4: After receiving the transmission message information, the next-hop QNCP node determines whether the destination node is currently reachable;

[0014] If it is unreachable, continue to check if it is reachable. When the cumulative number of checks exceeds N1, discard the transmitted message information and jump to step S3 to start again.

[0015] If reachable, forward the message and send a response to the next-hop QNCP node, then wait for the response from the next-hop QNCP node.

[0016] Step S5: The sending end QNCP selects an encryption method according to the security level of the message information to be sent, performs encryption processing, and sends it to the next hop QNCP node in the sending path;

[0017] Step S6: If the next-hop QNCP node receives the encrypted message, proceed to step S7;

[0018] If the next-hop QNCP node does not receive the encrypted message, it jumps to step S5 to resend. If the number of resends is N2, the message transmission fails, the message is discarded, and a response is sent back to the previous-hop QNCP node.

[0019] Step S7: After receiving the response message, the next-hop QNCP node parses the response message. If the message is a completion response message, the transmission is completed, and a completion response message is sent to the next-hop node.

[0020] If the message is a forwarding failure response message, determine whether the destination node is currently reachable. If it is not reachable, send the forwarding failure response message to the previous hop node and discard the message.

[0021] If this node is the source node of the message, a processing failure message is sent to the user and the message is discarded. If the message is reachable, the retransmission count is incremented by 1 and step S5 is executed.

[0022] Preferably, the communication timer is used to record the time taken for this node to complete one communication with other nodes in the routing table. .

[0023] Preferably, the cumulative number of detections exceeding N1 is in the range of 7-10; the number of resends N2 is in the range of 2-5.

[0024] Preferably, the step of determining whether the next-hop QNCP node is reachable in step S2 is as follows:

[0025] Step S2-1: The source node QNCP sends a probe message to a neighboring QNCP node every time interval T1;

[0026] Step S2-2: If a response message from an adjacent QNCP node is received within time T2, then it is determined that the adjacent QNCP node is reachable.

[0027] If no response is received from the adjacent QNCP node within time T2, proceed to step S2-1 for retransmission. If the retransmission exceeds N3 times, the adjacent QNCP node is determined to be unreachable.

[0028] Preferably, the value range of T1 is 4-6 seconds; the value range of T2 is 1-3 seconds; and the value range of N3 is 3-5 seconds.

[0029] Preferably, after any QNCP receives a message, it parses the data frame header message of the message to obtain the source node, sending node, destination node, message length, encryption method and encryption key number information of the message, stores the message in the message queue to be processed in sequence and sends the message to the next hop node to receive the message.

[0030] Preferably, the network communication module continuously acquires messages from the message queue to be processed. When acquiring messages, it selects the message with the smallest weight according to the optimal service message algorithm. The optimal service message algorithm is as follows: ,

[0031] in For weights, variables The number of hops on the reachable path from the current node to the target node is a variable. The time taken for this node to complete one communication with other nodes in the routing table, variable For message length, variable The number of times the message is monitored. As the base for the security level of the message, The number of times the message can be retransmitted;

[0032] When the minimum weight is not unique, the messages are retrieved in order from the messages with the minimum weight.

[0033] Preferably, when the security level is critical, the security level base number is... The value is 0.698;

[0034] When the security level is normal, the security level base number The value is 0.263.

[0035] Preferably, in the encryption operation of step S5:

[0036] If the security level of the message information is ordinary, then the Golden Key is used for encryption;

[0037] If the security level of the message information is important, then quantum key encryption is used.

[0038] Preferably, the encryption operation in step S5 is as follows:

[0039] If the number of available keys for the corresponding key type is insufficient, then encryption will not be performed, and the monitoring count for the message will be incremented by 1.

[0040] If there are enough keys, the keys are retrieved, the message is encrypted and encapsulated, and the message type value in the data frame header of the message is modified accordingly to indicate the encryption method used for the message.

[0041] A storage device storing a plurality of instructions adapted for loading by a processor and executing the steps of the method for rate limiting of energy data in a distributed processing manner based on a quantum network as described above.

[0042] A smart terminal includes a processor for executing instructions and a storage device for storing multiple instructions, the instructions being adapted to be loaded by the processor and executed as described above in the method steps for rate limiting of energy data in a distributed processing manner based on a quantum network.

[0043] The beneficial technical effects of this invention are as follows: This invention achieves rate limiting control over energy data transmission by establishing a message queue for processing. Different encryption methods and key types are assigned based on different security levels of the messages, thereby significantly improving key application efficiency while ensuring data security requirements. This method employs a distributed network structure, independent of any central control, reducing inter-node dependencies and improving communication stability. Simultaneously, the improved message processing flow ensures reliable communication. Attached Figure Description

[0044] Figure 1 This is a schematic diagram of the connection structure between QNCP and the quantum communication network in this invention;

[0045] Figure 2 This is a flowchart of the steps in the method for determining whether a QNCP node is reachable in the distributed processing of energy data based on quantum networks according to the present invention.

[0046] Figure 3 This is a flowchart illustrating the overall steps of the method for rate limiting of energy data based on distributed processing using quantum networks, as described in this invention. Detailed Implementation

[0047] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the embodiments. However, the scope of protection of this invention is not limited to the specific embodiments described below.

[0048] like Figure 1-3 As shown, a method for rate limiting of energy data distributed processing based on quantum networks includes a quantum communication network. The quantum communication network has multiple QNCP (Quantum Network Communication Node Device) nodes, all of which are connected to the quantum communication network. Any QNCP can be used to generate, send, transmit, or receive quantum keys while simultaneously receiving classical keys. Each QNCP includes a network communication module, a key pool module, and a communication timer. The network communication module has a pre-set routing table based on the RIP protocol. The key pool module has pre-set key pool parameters, a quantum key limit, and a classical key limit. The receiving rates of quantum keys and classical keys are determined by the key pool parameters.

[0049] The steps of this method are as follows:

[0050] Step S1: All QNCP nodes connect to the quantum communication network, and then initialize the communication timer in the QNCP network communication module of the source node. Here, the communication timer is used to record the time taken for this node to complete one communication with other nodes in the routing table. After initializing the communication timer, the transmission of energy data information begins.

[0051] The source node QNCP broadcasts its message information to all QNCP nodes in the quantum communication network. Other QNCPs in the network update their routing tables and send back response messages based on the received message information. The source node QNCP then updates its routing table information based on all the received response messages.

[0052] Step S2: The source node QNCP determines the sending path based on the updated routing table information (the confirmation of the sending path is implemented using the existing path selection algorithm), and determines whether the next-hop node QNCP of the sending path is reachable. If it is reachable, then proceed to step S3.

[0053] If the route is unreachable, send a message to other reachable adjacent QNCP nodes to update the routing table and change the path.

[0054] Step S3: The source node QNCP sends its local message information to the reachable next-hop node QNCP. After receiving the message information, the next-hop QNCP node stores the message information in the pending message queue in sequence and sends a response message information to the sending QNCP. The data is stored in the form of a queue to realize the rate limiting control of energy data.

[0055] Step S4: After receiving the transmission message information, the next-hop QNCP node determines whether the destination node is reachable;

[0056] If the target is unreachable, continue to check if it is reachable. When the cumulative number of checks exceeds N1, discard the transmitted message information and jump to step S3 to start again. Specifically, the value of N1 for the number of checks exceeds the range of 7-10. In this embodiment, the value of N1 is 8.

[0057] If reachable, forward the message and send a response to the next-hop QNCP node, then wait for the response from the next-hop QNCP node.

[0058] Specifically, step S2, which determines whether the next-hop QNCP node and the destination QNCP node are reachable, is as follows:

[0059] Step S2-1: The source node QNCP sends a probe message to a neighboring QNCP node every time interval T1;

[0060] Step S2-: If a response from an adjacent QNCP node is received within time T2, then it is determined that the adjacent QNCP node is reachable;

[0061] If no response is received from the adjacent QNCP node within time T2, proceed to step S2-1 for retransmission. If the retransmission exceeds N3 times, the adjacent QNCP node is determined to be unreachable.

[0062] Specifically, the value of T1 ranges from 4 to 6 seconds, and in this embodiment it is 5; the value of T2 ranges from 1 to 3 seconds, and in this embodiment it is 2; the value of N3 ranges from 3 to 5, and in this embodiment it is 4.

[0063] The method for determining whether the destination QNCP node is reachable in step S4 is the same as the method described above.

[0064] Step S5: The sending end QNCP selects an encryption method based on the security level of the message information to be sent (the message information here is the transmitted data, and in this embodiment, the data refers to energy data), performs encryption processing, and sends it to the next-hop QNCP node in the transmission path;

[0065] Specifically, the security level of the message information is based on the security level base. To confirm, when the security level base number A value of 0.698 is considered an important level; when the security level base value... A value of 0.263 is considered a normal security level. If the security level of the message is normal, the Classic Key is used for encryption; if the security level of the message is important, the Quantum Key is used for encryption.

[0066] The specific encryption operation in step S5 is as follows:

[0067] If the number of available keys for the corresponding key type is insufficient, then encryption will not be performed, and the monitoring count for the message will be incremented by 1.

[0068] If there are enough keys, the keys are extracted, the message is encrypted and encapsulated, and the message type value in the data frame header of the message is modified accordingly to indicate the encryption method used for the message. When the message is of the importance level, the corresponding message type value is 1, and when the message is of the normal level, the corresponding message type value is 0.

[0069] Step S6: If the next-hop QNCP node receives the encrypted message, proceed to step S7;

[0070] If the next-hop QNCP node does not receive the encrypted message, it jumps to step S5 to resend. If the number of resends is N2, the message transmission fails, the message is discarded, and a response is sent back to the previous-hop QNCP node. The value of the number of resends N2 is in the range of 2-5, and in this embodiment, N2 is 3.

[0071] Step S7: After receiving the response message, the next-hop QNCP node parses the response message. If the message is a completion response message, the transmission is completed and a completion response message is sent to the next-hop node.

[0072] If the message is a forwarding failure response message, determine whether the destination node is currently reachable. If it is not reachable, send the forwarding failure response message to the previous hop node and discard the message.

[0073] If this node is the source node of the message, a processing failure message is sent to the user and the message is discarded. If the message is reachable, the retransmission count is incremented by 1 and step S5 is executed.

[0074] Specifically, the network communication module continuously acquires messages from the message queue to be processed. When acquiring messages, it selects the message with the smallest weight according to the optimal service message algorithm. The optimal service message algorithm is as follows: ,

[0075] in For weights, variables The number of hops on the reachable path from the current node to the target node is a variable. The time taken for this node to complete one communication with other nodes in the routing table, variable For message length, variable The number of times the message is monitored. As the base for the security level of the message, This represents the number of times the message will be retransmitted.

[0076] If there are enough keys, the keys are retrieved, the message is encrypted and encapsulated, and the message type value in the data frame header of the message is modified accordingly to indicate the encryption method used for the message.

[0077] This invention addresses energy data transmission by establishing a message queue to control the transmission rate of energy data. Different encryption methods and key types are assigned based on the different security levels of the messages, thereby significantly improving key application efficiency while ensuring data security. This method employs a distributed network structure, independent of any central control, reducing inter-node dependencies and improving communication stability. Furthermore, the streamlined message processing ensures reliable communication.

[0078] Based on the disclosure and teachings of the foregoing specification, those skilled in the art can make changes and modifications to the above embodiments. Therefore, the present invention is not limited to the specific embodiments disclosed and described above, and some modifications and changes to the invention should also fall within the protection scope of the claims of the present invention. Furthermore, although some specific terms are used in this specification, these terms are only for convenience of explanation and do not constitute any limitation on the invention.

Claims

1. A method for rate limiting of energy data based on distributed processing using quantum networks, characterized in that, It includes a quantum communication network and multiple QNCPs, all of which are connected to the quantum communication network. Any QNCP is used to generate, send, transmit, or receive quantum keys. Each QNCP includes a network communication module and a key pool module. The network communication module has a routing table based on the RIP protocol pre-set, and the key pool module has key pool parameters, upper limit of quantum key quantity, and upper limit of classical key quantity pre-set. The steps of this method are as follows: Step S1: Initialize the communication timer in the source node QNCP network communication module, and send the node's message information to all QNCP nodes in the quantum communication network in the form of broadcast. Other QNCPs in the network update their routing tables and send back response messages based on the received message information. The source node QNCP updates its routing table information after receiving all the response message information. Step S2: The source node QNCP determines the sending path based on the updated routing table information, and determines whether the next-hop node QNCP of the sending path is reachable. If it is reachable, then proceed to step S3. If unreachable, send message information to other reachable adjacent QNCP nodes to update the routing table; The steps to determine whether the next-hop QNCP node is reachable in step S2 are as follows: Step S2-1: The source node QNCP sends a probe message to a neighboring QNCP node every time interval T1; Step S2-2: If a response message from an adjacent QNCP node is received within time T2, then it is determined that the adjacent QNCP node is reachable. If no response information is received from the adjacent QNCP node within time T2, the process jumps to step S2-1 to retransmit. If the retransmission exceeds N3 times, the adjacent QNCP node is determined to be unreachable. Step S3: The source node QNCP sends its own message information to the reachable next-hop node QNCP. After receiving the message information, the next-hop QNCP node stores the message information in the pending message queue in sequence and sends a response message information to the sending end QNCP. Step S4: After receiving the transmission message information, the next-hop QNCP node determines whether the destination node is currently reachable; If it is unreachable, continue to check if it is reachable. When the cumulative number of checks exceeds N1, discard the transmitted message information and jump to step S3 to start again. If reachable, forward the message and send a response to the next-hop QNCP node, then wait for the response from the next-hop QNCP node. Step S5: The sending end QNCP selects an encryption method according to the security level of the message information to be sent, performs encryption processing, and sends it to the next hop QNCP node in the sending path; If the number of available keys for the corresponding key type is insufficient, then encryption will not be performed, and the monitoring count for the message will be incremented by 1. If there are enough keys, the keys are extracted, the message is encrypted and encapsulated, and the message type value in the data frame header of the message is modified accordingly to indicate the encryption method used in the message. When the message is of importance level, the corresponding message type value is 1, and when the message is of normal level, the corresponding message type value is 0. Step S6: If the next-hop QNCP node receives the encrypted message, proceed to step S7; If the next-hop QNCP node does not receive the encrypted message, it jumps to step S5 to resend. If the number of resends is N2, the message transmission fails, the message is discarded, and a response is sent back to the previous-hop QNCP node. Step S7: After receiving the response message, the next-hop QNCP node parses the response message. If the message is a completion response message, the transmission is completed and a completion response message is sent to the next-hop node. If the message is a forwarding failure response message, determine whether the destination node is currently reachable. If it is not reachable, send the forwarding failure response message to the previous hop node and discard the message. If this node is the source node of the message, a processing failure message is sent to the user and the message is discarded. If the message is reachable, the retransmission count is incremented by 1 and step S5 is executed.

2. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 1, characterized in that, The communication timer is used to record the time t taken for this node to complete one communication with other nodes in the routing table.

3. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 1, characterized in that, The range of the cumulative number of detections exceeding N1 is 7-10; The value of the number of resends N2 is in the range of 2-5.

4. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 3, characterized in that, The value of T1 is in the range of 4-6 seconds; The value of T2 is in the range of 1-3 seconds; The value of N3 is in the range of 3-5.

5. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 1, characterized in that, After receiving any message from a QNCP node, the data frame header message of the message is parsed to obtain the source node, sending node, destination node, message length, encryption method, and encryption key number information of the message. The message is then stored in the message queue to be processed in sequence and the message is sent to the next hop node to receive the message.

6. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 1, characterized in that, The network communication module continuously acquires messages from the message queue to be processed. When acquiring messages, it selects the message with the smallest weight according to the optimal service message algorithm. The optimal service message algorithm is as follows: W=0.361s+0.289t+0.318l-0.395c-0.332g-0.528r, Where W is the weight, s is the number of hops in the reachable path from the current node to the target node, t is the time taken for the current node to complete one communication with other nodes in the routing table, l is the message length, c is the number of times the message is monitored, g is the security level base of the message, and r is the number of times the message is retransmitted. When the minimum weight is not unique, the messages are retrieved in order from the messages with the minimum weight.

7. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 6, characterized in that, When the security level is critical, the base value g of the security level is 0.698; When the security level is normal, the base value g of the security level is 0.

263.

8. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 7, characterized in that, In the encryption operation of step S5: If the security level of the message information is normal, then the classic key is used for encryption; If the security level of the message information is important, then quantum key encryption is used.

9. The method for rate limiting of energy data based on distributed processing of quantum networks as described in claim 8, characterized in that, The encryption operation in step S5 is as follows: If the number of available keys for the corresponding key type is insufficient, then encryption will not be performed, and the monitoring count for the message will be incremented by 1. If there are enough keys, the keys are retrieved, the message is encrypted and encapsulated, and the message type value in the data frame header of the message is modified accordingly to indicate the encryption method used for the message.

10. A storage device storing a plurality of instructions, characterized in that, The instructions are applicable to the method steps of the distributed processing of energy data based on quantum networks as described in any one of claims 1-9, which are loaded by a processor and executed.

11. A smart terminal, comprising a processor for executing various instructions and a storage device for storing multiple instructions, characterized in that, The instructions are applicable to the processor loading and executing the method steps of the distributed processing of energy data based on quantum networks as described in any one of claims 1-9.

Images