CN112995167B - Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal - Google Patents

Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal Download PDF

Info

Publication number
CN112995167B
CN112995167B CN202110195891.0A CN202110195891A CN112995167B CN 112995167 B CN112995167 B CN 112995167B CN 202110195891 A CN202110195891 A CN 202110195891A CN 112995167 B CN112995167 B CN 112995167B
Authority
CN
China
Prior art keywords
node
success rate
transaction
communication success
communication
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202110195891.0A
Other languages
Chinese (zh)
Other versions
CN112995167A (en
Inventor
巨汉基
易忠林
丁恒春
袁瑞铭
谭志强
祝恩国
翟峰
郭皎
姜振宇
刘译聪
燕凯
杜跃
杨东升
姚佳维
葛扬
韩迪
崔文武
汪洋
王晨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Linyang Power Tech Co ltd
State Grid Corp of China SGCC
State Grid Jibei Electric Power Co Ltd
Original Assignee
Nanjing Linyang Power Tech Co ltd
State Grid Corp of China SGCC
State Grid Jibei Electric Power Co Ltd
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 Nanjing Linyang Power Tech Co ltd, State Grid Corp of China SGCC, State Grid Jibei Electric Power Co Ltd filed Critical Nanjing Linyang Power Tech Co ltd
Priority to CN202110195891.0A priority Critical patent/CN112995167B/en
Publication of CN112995167A publication Critical patent/CN112995167A/en
Application granted granted Critical
Publication of CN112995167B publication Critical patent/CN112995167B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L63/00—Network architectures or network communication protocols for network security
    • H04L63/08—Network architectures or network communication protocols for network security for authentication of entities
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q20/00—Payment architectures, schemes or protocols
    • G06Q20/38—Payment protocols; Details thereof
    • G06Q20/382—Payment protocols; Details thereof insuring higher security of transaction
    • G06Q20/3827—Use of message hashing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/06—Energy or water supply
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00—Network arrangements or protocols for supporting network services or applications
    • H04L67/01—Protocols
    • H04L67/10—Protocols in which an application is distributed across nodes in the network
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3247—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials involving digital signatures
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • 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
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Computer Security & Cryptography (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Physics & Mathematics (AREA)
  • Signal Processing (AREA)
  • General Physics & Mathematics (AREA)
  • Strategic Management (AREA)
  • Health & Medical Sciences (AREA)
  • Economics (AREA)
  • Databases & Information Systems (AREA)
  • Accounting & Taxation (AREA)
  • General Engineering & Computer Science (AREA)
  • Computing Systems (AREA)
  • General Business, Economics & Management (AREA)
  • Finance (AREA)
  • Data Mining & Analysis (AREA)
  • Public Health (AREA)
  • Water Supply & Treatment (AREA)
  • General Health & Medical Sciences (AREA)
  • Human Resources & Organizations (AREA)
  • Marketing (AREA)
  • Primary Health Care (AREA)
  • Tourism & Hospitality (AREA)
  • Computer Hardware Design (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The embodiment of the application provides an electricity consumption information acquisition method based on a Kafka mechanism, which comprises the following steps: the user node submits a transaction proposal to the endorsement node; the endorsement node receives the transaction proposal, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to the user node; after receiving the endorsement information, the user node sends the endorsement information and the transaction proposal one to the ordering node; the ordering node orders and packages the transaction information into blocks according to the communication success rate and sends the blocks to the accounting node; the billing node bills the generated new block. The updated communication success rate is used for sorting on the sorting nodes of the Kafka mechanism, so that transactions submitted by the nodes with high communication success rate and high collection speed are preferentially successful, resources are preferentially vacated for next round of data collection, collection efficiency is integrally improved, new block generation speed is accelerated, and orderly and healthy work of the electricity consumption information collection block chain is promoted.

Description

Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal
Technical Field
The invention belongs to the field of application of a blockchain technology, and particularly relates to a power consumption information acquisition method based on a Kafka mechanism, a blockchain network and a user terminal.
Background
Conventional electricity consumption information collection systems use highly centralized modes for business operations, centralized servers and centralized databases. In order to ensure data security, a centralized database is generally placed in an internal network and protected by using complex accounts, firewalls, antivirus software and the like; in order to share the service, the database generally adopts double centers or even multiple centers; in order to prevent data loss, the database needs to be configured with a backup mechanism, such as urban disaster recovery backup or remote disaster recovery backup. In order to ensure normal operation of the service, a service server commonly adopts a cluster or dual hot standby.
This mode has the advantage of being highly centralized and convenient to manage. Correspondingly, the defects are obvious, and due to the high centralization, the protection is needed by using technologies such as a firewall, the defending performance is extremely low, and once a destructor bypasses or breaks through the firewall, the service and the data are mastered in the hand of the destructor; even if the corruption is prevented in time, the corrupted data is difficult to retrieve.
The blockchain, as a data structure that stores data in chronological order, may support different consensus mechanisms. The consensus mechanism is an important component of blockchain technology. The goal of the blockchain consensus mechanism is to have all honest nodes save a consistent blockchain view while satisfying two properties:
1) Consistency. The prefix portion of the blockchain maintained by all honest nodes is identical.
2) Effectiveness. Information published by a honest node will eventually be recorded in its own blockchain by all other honest nodes.
The self-trust of the blockchain is mainly embodied in that users distributed in the blockchain do not need to trust the other party of the transaction, do not need to trust any centralized mechanism, and can realize the transaction only by trust of a software system under the blockchain protocol. The precondition of the self-trust is a consensus mechanism (consensus) of the blockchain, namely, in a market which is mutually not trusted, a sufficient requirement for enabling all nodes to agree is that each node spontaneously and honest obeys the preset rules in the protocol for the consideration of maximizing the benefit of the node, judges the authenticity of each record, and finally records judged to be true are recorded in the blockchain. In other words, if the nodes have independent interests and compete with each other, the nodes are less likely to collude into deception, which is particularly apparent when the nodes have a common reputation in the network. The blockchain technology is to use a set of mathematical algorithm based on consensus to build a trust network between machines, so that brand new credit creation is performed through technical endorsements rather than centralized credit institutions.
Therefore, the consensus mechanism is the core of the blockchain technology, which restricts the transaction capability and extensibility of the blockchain. To date, the development of blockchain has extended four broad classes of tens of consensus mechanisms, which are applicable to different scenes, including POW consensus mechanisms with mainly decentralised security but extremely low efficiency, and Pool consensus mechanisms with improved efficiency and security but sacrificing part of decentralised characteristics. It is difficult to evaluate the consensus mechanism with simple "good" and "bad" and the applicability of the consensus mechanism should be measured more in connection with the scenario application.
Therefore, the power industry turns the light to the blockchain, and is exploring to apply the blockchain to the industry, and the safety of the power consumption information acquisition system is improved by utilizing the characteristics of tamper resistance, decentralization, traceability and the like of the blockchain.
Disclosure of Invention
The invention provides a power consumption information acquisition method based on a Kafka consensus mechanism, a blockchain network and a user side, which are used for improving the sequencing confirmation of the consensus mechanism so as to promote the orderly and healthy work of a power consumption information acquisition blockchain.
In order to achieve the above objective, an embodiment of the present application provides a power consumption information collection method based on Kafka mechanism, including: a user node submits a transaction proposal to an endorsement node, wherein the transaction proposal comprises transaction information collected by the user node and communication success rates of a plurality of meters under the user node; the endorsement node receives the transaction proposal, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to the user node; after receiving the endorsement information, the user node sends the endorsement information and the transaction proposal to a sequencing node; the ordering node orders and packages the transaction information into blocks according to the communication success rate and sends the blocks to an accounting node; the accounting node accounts for the generated new zone blocks.
Further, in some embodiments, when the user node submits a transaction proposal to the endorsement node, the communication success rate is calculated at each meter reading turn, and the steps are as follows: counting the number of tables connected under the user node; setting an initial value of a communication success rate, a weighting value of communication success rate, a weight reduction value of communication failure and a communication duration weight of each meter in one meter reading round; in one meter reading round, the meter is successfully communicated once, the duration used for communication is obtained, and the initial value of the communication success rate, the weighting value of the communication success rate and the communication duration weight are used for adjusting the communication success rate of the meter; if the user node still cannot successfully communicate with the meter at the end of a meter reading period, adjusting the communication success rate of the meter by using the initial value of the communication success rate and the weight reduction value of the communication failure; and when the meter reading turn is finished, counting the average communication success rate of the meter under the user node.
Further, in some embodiments, the endorsement node is bound with a specific intelligent contract, receives a transaction proposal submitted by the user node, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to the user node, and after the user node passes the verification of the transaction proposal, broadcasts the transaction proposal to the ordering node.
Further, in some embodiments, the sorting node sorts and packages the transaction information into blocks according to the communication success rate, including:
and the sorting node sorts the transactions according to the communication success rate and the order from large to small by the original queue except the first transaction to obtain a new sorting queue.
Further, in some embodiments, the sorting node sorts and packages the transaction information into blocks according to the communication success rate, including:
when the transaction reaches a certain transaction number or reaches a set maximum waiting time, the sorting node packages the previous transactions into a new block according to the set transaction number and forwards the new block to the accounting node;
if the transaction does not meet the set number of transactions, but the set maximum waiting time has been reached, all transactions are packed into a new block and forwarded to the accounting node.
Further, in some embodiments, the ordering node does not order the first transaction to prevent nodes with too low a communication success rate from ever being able to submit transactions.
Further, in some embodiments, the billing node bills the new block, which validates the transaction upon receipt of the block submitted by the user node, and validates the new block upon validation.
In order to achieve the above objective, an embodiment of the present application further provides a blockchain network, including an endorsement node, a user node, and a sorting node; the endorsement node is used for endorsing a transaction proposal submitted by the user node, generating endorsement information and sending the endorsement information to the user node, wherein the transaction proposal comprises transaction information acquired by the user node and communication success rates of a plurality of meters under the user node; the user node is used for sending the endorsement information and the transaction proposal one to the ordering node after the transaction proposal passes the verification; and the ordering node is used for ordering the transaction information according to the communication success rate, packaging the transaction information into blocks and sending the blocks to the accounting node for accounting.
In order to achieve the above objective, an embodiment of the present invention further provides a client, which is applied to the blockchain described in the embodiment of the present invention, where the client includes: the statistics module is used for counting the number of the tables connected under the user node; the initial value setting module is used for setting an initial value of the communication success rate of each meter, a weighting value of the communication success rate, a weight reduction value of the communication failure and a communication duration weight value in one meter reading round; the communication success rate adjusting module is used for adjusting the communication success rate of each meter according to the initial value of the communication success rate, the weighting value of the communication success rate, the weight reduction value of the communication failure and the communication duration weight in one meter reading round; and the average statistics module is used for counting the average communication success rate of the meter under the user node when the meter reading round is finished.
Further, in some embodiments, the communication success rate adjustment module is configured to adjust, in one meter reading round, a communication success rate of each meter according to the initial value of the communication success rate, a weighted value of a decrease of the communication failure, and a weighted value of a communication duration, including: if the meter is successfully communicated once in one meter reading round, acquiring the duration used by the communication, and adjusting the communication success rate of the meter by using the initial value of the communication success rate, the weighting value of the communication success rate and the communication duration weight; if the user node still cannot successfully communicate with the meter at the end of a meter reading period, the communication success rate of the meter is adjusted by using the initial value of the communication success rate and the weight reduction value of the communication failure.
According to the power consumption information acquisition method based on the improved Kafka mechanism, disclosed by the embodiment of the application, the blockchain network and the user side are arranged on the arrangement nodes of the Kafka mechanism by using the communication success rate updated by the user nodes, so that the transactions submitted by the nodes with high communication success rate and high acquisition speed are prioritized and successful, resources are vacated preferentially for next round of data acquisition, and the acquisition efficiency is improved as a whole; meanwhile, nodes with low communication success rate are properly staggered, when the nodes with low communication success rate complete transactions and carry out the next round of collection again, the nodes with high communication success rate can already complete collection, channel resources can be released to be used for the nodes with incomplete collection, the generation speed of new blocks is also increased, and orderly and healthy work of power consumption information collection block chains is promoted.
Drawings
FIG. 1 is a process flow diagram of a power consumption information collection method based on a Kafka mechanism according to an embodiment of the present application;
fig. 2 is a flowchart of a method for calculating a communication success rate according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a user terminal according to an embodiment of the present application;
fig. 4 is a schematic diagram of a block chain network according to an embodiment of the present application.
Detailed Description
The following description of the technical solutions in the embodiments of the present application will be made clearly and completely with reference to the drawings in the embodiments of the present application, and it is apparent that the described embodiments are only some embodiments of the present application, not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the present disclosure.
Before further describing embodiments of the present application in detail, the terms and expressions that are referred to in the embodiments of the present application are described, and are suitable for the following explanation.
1) A transaction Proposal (Proposal), which is a request for executing an intelligent contract call included in a transaction (hereinafter simply referred to as executing the transaction), includes an identification of a channel for receiving the transaction, an identification of an intelligent contract that needs to be called in the channel, and parameter information that needs to be transferred to the called intelligent contract.
2) A Transaction, also called a Transaction request, is equivalent to a computer term Transaction (Transaction) that includes an operation that needs to be submitted to a blockchain network for execution, and the corresponding Transaction results, and does not refer solely to a Transaction in a business context. Embodiments of the present invention follow this convention in view of the term "transaction" colloquially used in blockchain technology. For example, the transactions may include a deployment (reply) transaction and a call (Invoke) transaction, the deployment transaction for contracting the intelligence into nodes of the blockchain network and ready to be invoked; call (Invoke) transactions are used to query the state database in the ledger (i.e., read operations) or update operations (i.e., write operations, including add, delete, and modify).
3) Blockchain (Blockchain) is a storage structure of encrypted, chained transactions formed by blocks (blocks). The header of each block can include the hash value of all transactions in the block and also the hash value of all transactions in the previous block, so that the tamper resistance and the anti-counterfeiting of the transactions in the block are realized based on the hash value; the newly generated transactions, after being filled into the block and passing through the consensus of the nodes in the blockchain network, are appended to the tail of the blockchain to form a chain growth.
4) A blockchain network (Blockchain Network) incorporates new blocks into a set of nodes of the blockchain by way of consensus.
5) Ledger (Ledger), a generic term for blockchains (also known as Ledger data), and state databases that are synchronized with blockchains. Wherein the blockchain records transactions in the form of files in a file system; the state database records transactions in the blockchain in the form of different types of Key (Key) Value pairs for supporting quick queries for transactions in the blockchain.
6) Smart contacts (Smart contacts), also known as chain code (Chaincode) or application code, is a computer protocol intended to propagate, verify, or execute Contracts in an informative manner, programs deployed in nodes of a blockchain network, carrying business logic to execute transactions, running in an isolated operating environment (e.g., container or virtual machine). Each node in the blockchain system can operate the data stored on the chain according to the contract program automatically executed by the specific condition, so that a user interacts with the blockchain and an important path for realizing business logic by using the blockchain is realized.
7) Consensus (Consensus) is a process in a blockchain network to agree on transactions in blocks among the nodes involved, the agreed blocks being appended to the tail of the blockchain. Mechanisms for implementing consensus include Proof of Work (PoW), proof of equity (PoS, proof of Start), proof of stock authorization (DPoS, delayed Proof of-Start), proof of elapsed time (PoET, proof of Elapsed Time), and the like.
8) The Kafka consensus mechanism is a Hyperledger Fabric specific consensus mechanism. The purpose of the federation chain first-choice open-source technology megahead, hyperledger Fabric, is to help enterprises more easily build enterprise-level blockchain solutions. Currently, more than 250 enterprises and organizations are added. Therefore, the application of the Kafka consensus mechanism is very wide, wherein the application includes not only the IT giant such as IBM, intel, ***, huacheng, and the like, but also the financial institutions such as Holland banks, etson philosophy, australian new banks, and the like.
Kafka is a distributed, message publish/subscribe based message handling model for solving the problems of message consistency and fast handling in a distributed system. The Kafka cluster contains one or more servers called broaders, each message issued to the Kafka cluster has a Topic called Topic, each Topic contains one or more partitions called Partition, the messages inside the same Topic are stored on different broaders in partitions according to certain keys and algorithms, and the message Producer and Consumer can produce or consume Topic on multiple broaders as clients.
Broker: message middleware processing node, a Kafka node is a Broker, and multiple brokers may form a Kafka cluster.
Topic: a class of messages, the Kafka cluster can be responsible for the distribution of multiple topics at the same time.
Partition: a topic may be divided into a plurality of parts, each part being an ordered queue.
Segment: a part is physically composed of multiple segments.
Offset: each part consists of an ordered series of immutable messages that are appended consecutively to the part. Each message in a part has a continuous sequence number called offset that uniquely identifies a message.
Producer: responsible for publishing messages to the Kafka brooker.
Consumer: the message consumer reads the client of the message to Kafka brooker.
Consumer Group: each Consumer belongs to a particular Consumer Group.
The Kafka consensus mechanism is divided into two steps:
push process: the Producer client initiates a write request, and the Broker writes the message into a Partition in a Topic according to the message classification.
Pull procedure: the Consumer client initiates an access request, and the Broker finds out the corresponding access message to read according to Topic, partition and Offset of the access message.
The Kafka consensus mechanism is a more extensive consensus mechanism, which mainly comprises three steps: endorsing, ordering and verifying, wherein the endorsing and verifying are performed by an endorsing node (endoser), ensuring the legitimacy of the transaction; ordering is performed by an ordering node (Orderer) to ensure consistency of the order of transactions in the block. Wherein the ordering is determined based on the sequence of messages sent by different message producers in a partition, and the simple consensus is simple and easy to manage in application, has strong expandability and is popular with service application users.
However, the simple consensus mechanism of Kafka, incorporated into the electricity usage information collection system, may be an efficiency problem in certain scenarios. The reason is that the electricity consumption information collection device is connected with a plurality of meters, the meter data are mostly read in sequence, if the communication condition of the meters is poor, the communication duration of the previous meter is long, the meter reading of the subsequent meter can be blocked, the time for submitting the transaction is very near, and under extreme conditions, the consensus mechanism can generate empty blocks. These few nodes with poor communication conditions share equal system resources as the nodes with good communication conditions, i.e., the priority of the nodes processed by the blockchain system after initiating a transaction.
The embodiment of the application provides an electricity information acquisition method based on a Kafka mechanism and a blockchain network, wherein a user node submits a transaction proposal to an endorsement node, and after the endorsement node passes the inspection, the user node broadcasts the transaction to a sorting node, and the sorting node sorts the transaction to generate a block. That is, the embodiment of the application is based on the dynamic meter reading communication success rate, improves the ordering confirmation of the Kafka consensus mechanism, and preferentially confirms the data of the nodes with high communication success rate, so that the user node resources are released as soon as possible, the new block generation speed is accelerated in the next round of reading, and the orderly and healthy work of the electricity consumption information acquisition block chain is promoted.
Fig. 1 is a process flow diagram of an electricity consumption information collection method based on the Kafka mechanism according to an embodiment of the present application. As shown, includes:
step S101, a user node submits a transaction proposal to an endorsement node, wherein the transaction proposal comprises transaction information collected by the user node and communication success rates of a plurality of meters under the user node;
step S102, the endorsement node receives the transaction proposal, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to the user node;
step S103, after receiving the endorsement information, the user node sends the endorsement information and the transaction proposal to a sequencing node;
step S104, the sorting node sorts and packages the transaction information into blocks according to the communication success rate, and sends the blocks to an accounting node;
step S105, the accounting node accounts the generated new block.
Generally, a blockchain network includes a plurality of blockchain nodes, and each node may be a client in the blockchain network, and may be an electronic device such as a mobile phone, a personal computer, a tablet computer, a vehicle-mounted unit, a server, or an application program. Each node may receive input information while operating normally and maintain shared data within the data sharing system based on the received input information. In order to ensure the information intercommunication in the data sharing system, information connection can exist between each node in the data sharing system, and the nodes can transmit information through the information connection. For example, when any node in the data sharing system receives input information, other nodes in the data sharing system acquire the input information according to a consensus algorithm, and store the input information as data in the shared data, so that the data stored on all nodes in the data sharing system are consistent.
In this embodiment, the user node is an electricity consumption information collection device, which is used to collect electricity consumption information of the user end meter, and must be connected to a certain billing node or ordering node to communicate with the blockchain network. In some embodiments, a user node initiates a transaction proposal to an endorsement node, the transaction proposal including transaction information collected by the user node and communication success rates of a plurality of meters under the user node.
According to the electricity consumption information acquisition method, the dynamically adjusted communication success rate is introduced into the sequencing nodes of the Kafka consensus mechanism, and the sequencing confirmation of the Kafka consensus mechanism is improved, so that the transaction submitted by the nodes with high communication success rate and high acquisition speed is preferentially successful, resources are preferentially vacated for next round of data acquisition, and the acquisition efficiency is integrally improved. In the specific implementation, the user node calculates the communication success rate in each meter reading round. As shown in fig. 2, the communication success rate calculation method in the embodiment of the present application is as follows:
step S201, starting, counting the number of connected tables under a certain user node, and assuming K tables;
step S202, initializing the communication success rate of the meter under the user node; i.e. in one meter reading wheel Setting the initial value of the communication success rate of each meter as C int The weight value of successful communication is C success The weight of the communication failure is C fail Communication duration weight C com ；
Step S203, judging whether the communication between the node and the meter is successful;
step S204, in one meter reading round, when the node and a meter M i The communication is successful once, the communication duration is t, and the communication success rate of the meter is adjusted to be C int ＝C int +C success -C com *t；
Step S205, if at the end of a meter reading period, the node still cannot and the meter M i If the communication is successful, the communication success rate of the meter is adjusted to C int ＝C int -C fail ；
Step S206, when the meter reading round is finished, the average communication success rate of the node is counted as follows
Figure BDA0002945322380000091
Figure BDA0002945322380000092
After the communication success rate W of the node is obtained, the transaction information and the communication success rate are transmitted to the endorsement node together as a transaction proposal. In this embodiment, it may be known by those skilled in the art that, in addition to the transaction information and the communication success rate information, the transaction proposal further includes a transaction number, a timestamp (time when the transaction proposal is initiated), an identifier (e.g. a serial number or a name) of a channel for executing the transaction (i.e. a channel where the smart contract called in the transaction is located), and a smart contract call that needs to be executed in the channel, including an identifier of the smart contract that needs to be called, such as a name or a serial number, a version of the smart contract, and parameter information that needs to be transferred to the smart contract. Wherein the smart contracts and parameters are related to operations that the client needs to perform, for example, the smart contracts may be used to add, delete, query or modify operations, and the parameter information may be data of the add, delete, query or modify operations. In addition, the transaction proposal can also carry a digital certificate issued by the authentication center to the user node and a digital signature of the user node for the transaction proposal, wherein the digital certificate is used for declaring the identity information of the member to which the user node belongs, and the digital signature is used for proving that the transaction proposal is not tampered.
In step S102 of the present application, the endorsement node is bound with a specific intelligent contract, receives data and a communication success rate submitted by a user node, executes the intelligent contract to obtain an expected result, endorses the transaction, and then sends the endorsement information to the user node.
In some embodiments, the endorsement node, upon receipt of the transaction proposal, performs some verification according to an endorsement policy, including: whether the digital certificate carried by the transaction proposal is issued by a trusted authentication center; whether the digital signature of the transaction proposal is valid; whether the format of the transaction proposal is correct; whether the transaction proposal is repeatedly submitted; whether the user node has been authorized with write rights in the channel requesting execution of the smart contract call. And when the endorsement node verifies that the transaction proposal is successful, the endorsement node can simulate the execution of the transaction in the state database of the account book maintained by the endorsement node, namely, execute the intelligent contract call included in the transaction proposal to obtain the transaction result. The endorsement node signs (i.e., endorses) the transaction result, and constructs the digital signature in combination with the endorsement node's digital certificate, and other related information, into a proposal response (Proposal Response), i.e., endorsement information as referred to in this application.
And after the endorsement node carries out endorsement on the transaction, the endorsement information is sent to the user node so that the user node can check the transaction proposal.
Step S103, after receiving the endorsement information, the user node checks the transaction proposal, and sends the endorsement information and the transaction proposal to the ordering node. Specifically, after the user node passes the verification of the transaction proposal, the transaction is broadcast to the ordering node.
In step S104 of the present application, the sorting node is configured to sort and package the received transactions into blocks according to the success rate of communication.
In the existing Kafka consensus mechanism, a sequencing node in a blockchain network is used for providing sequencing service, and in the transaction processing process, the sequencing node receives transactions sent by other nodes, sequences the transactions according to time, and adds new service data on the blockchain. In some embodiments, to determine the time of each transaction received, the ordering node invokes a timestamp service, e.g., invoking a third party timestamp service, that generates a transaction timestamp that corresponds one-to-one to each transaction using a national time service center or other trusted time source.
In the embodiment of the application, the ordering nodes do not order the transactions according to the time stamps, but order according to the received communication success rate sent by the user nodes. In particular, after receiving a transaction, the sorting node divides the first transaction P 0 In addition, the original queue p=p 0 ,P 1 ,P 2 …P n According to the success rate of dynamic meter reading communication, the transactions are arranged in the order from large to small to obtain a new queue with the ordering of Q=P 0 ,Q 1 ,Q 2 ,Q 3 …Q n 。
The ordering node constructs the ordered plurality of transactions into new blocks and broadcasts the new blocks to billing nodes in the blockchain network. For example, the sorting node performs block filling according to the sorted transactions until the capacity of the block reaches a set capacity or the time reaches a set waiting time, and determines the obtained block as a new block. In some embodiments, when the transaction reaches 1.5 x N (N is the maximum number of transactions for the block) or when the set maximum latency is reached, the ordering node packages the first N transactions into a new block and forwards to the billing node, and if the transaction is less than N but the set maximum latency has been reached, packages all transactions into a new block and forwards to the billing node.
In particular, the ordering node does not order the first transaction, which is to prevent nodes with too low communication success rate from ever being unable to submit transactions.
In step S105 of the present application, the accounting node is configured to account for the new block, and after receiving the block submitted by the ordering node, verify the transaction, and after the verification passes, the new block is confirmed. And the accounting node verifies the new block, and when the verification is successful, the new block is added to the tail part of the blockchain of the accounting node, so that the uplink operation of the transaction is completed.
In some embodiments, the validation of transactions in the block by the billing node includes: whether or not it is a legitimate transaction: whether the transaction format is correct, whether a legal signature exists, and whether the transaction content is tampered; whether the accounting node joins the channel indicated in the transaction to receive the transaction; whether the transaction complies with an endorsement policy. An endorsement policy is a rule that endorses a transaction, specifying the organization from which the endorsement was required for a transaction prior to submission, the type of nodes within the corresponding organization, and the number of valid endorsements.
Compared with the prior art, the electricity consumption information acquisition method based on the improved Kafka mechanism disclosed by the embodiment has the following beneficial effects:
The current kafka consensus mechanism is a simpler and direct consensus mechanism, and the transaction is submitted by the ordering nodes according to the natural sequence, so that the current situation of high randomness exists. According to the method and the device, the communication success rate updated by the user nodes is used for sorting on the sorting nodes of the Kafka mechanism, so that the transactions submitted by the nodes with high communication success rate and high collection speed are preferentially successful, resources are preferentially vacated for next round of data collection, and the collection efficiency is integrally improved; meanwhile, nodes with low communication success rate are properly staggered, when the nodes with low communication success rate complete transactions and carry out the next round of collection again, the nodes with high communication success rate can already complete collection, channel resources can be released to be used for the nodes which do not complete collection, the generation speed of new blocks is also increased, and orderly and healthy work of power consumption information collection block chains is promoted.
Based on the same technical concept, fig. 3 illustrates an exemplary structure of a client provided by the embodiment of the present invention, where the client may be an electricity consumption information collection device, and may collect electricity consumption information of a user, and may execute a block chain consensus procedure of the embodiment of the present application.
As shown in fig. 3, the user side includes a device for calculating and updating the dynamic meter reading communication success rate of the meter, which includes:
a statistics module 301, configured to count the number of tables connected under the user node, for example, K;
the initial value setting module 302 is configured to set an initial value of a communication success rate, a weighted value of communication success, a weight reduction value of communication failure and a weight of communication duration of each meter in one meter reading round;
the communication success rate adjusting module 303 is configured to adjust the communication success rate of each meter according to the initial value of the communication success rate, the weighted value of the communication success rate, the weight reduction value of the communication failure and the weight of the communication duration in one meter reading round;
and the average statistics module 304 is configured to, at the end of the meter reading round, count an average communication success rate of the meter under the user node.
In specific implementation, the initial value setting module 302 initializes the communication success rate of the meter under the user node; that is, the initial value of the communication success rate of each meter is set to be C in one meter reading round int The weight value of successful communication is C success The weight of the communication failure is C fail Communication duration weight C com 。
The communication success rate adjustment module 303 is configured to adjust, in one meter reading round, the communication success rate of each meter according to the initial value of the communication success rate, the weighted value of the communication success rate, the weight of the communication failure, and the weight of the communication duration, where the adjustment module includes:
1. If the meter is successfully communicated once in one meter reading round, the duration used by the communication is obtained, and the initial value of the success rate of the communication, the weighted value of the success rate of the communication and the weight of the duration of the communication are used for adjusting the success rate of the communication of the meter, namely: in one meter reading round, when a node and a meter M i The communication is successful once, the communication duration is t, and the communication success rate of the meter is adjusted to be C int ＝C int +C success -C com *t；
2. If at the end of a meter reading period, the node still cannot and the meter M i If the communication is successful, the communication success rate of the meter is adjusted to C int ＝C int -C fail ；
An average statistics module 304 for counting the average communication success rate of the meter under the user node as
Figure BDA0002945322380000121
And the user terminal sends the collected user electricity consumption information to an endorsement node of the blockchain network as transaction and communication success rate information.
Based on the same technical concept, fig. 4 illustrates an exemplary blockchain network provided by an embodiment of the present invention. The blockchain network includes an endorsement node 41, a user node 42, and an ordering node 43. The endorsement node 41 is configured to endorse a transaction proposal submitted by the user node 42, generate endorsement information, and send the endorsement information to the user node 42, where the transaction proposal includes transaction information collected by the user node 42 and communication success rates of a plurality of meters under the user node 42; the user node 42 is configured to send the endorsement information and the first transaction proposal to the ordering node 43 after the verification of the transaction proposal is passed; the sorting node 43 is configured to sort and package the transaction information into blocks according to the communication success rate, and send the blocks to an accounting node for accounting.
As shown in fig. 4, the endorsement node 41 specifically includes:
an obtaining unit 411, configured to obtain a transaction proposal sent by a user node, where the transaction proposal includes transaction information collected by the user node and communication success rates of a plurality of meters under the user node;
and the processing unit 412 is configured to endorse the transaction proposal and generate endorsement information. The processing unit 412, upon receipt of the transaction proposal, performs some verification according to an endorsement policy, including: whether the digital certificate carried by the transaction proposal is issued by a trusted authentication center; whether the digital signature of the transaction proposal is valid; whether the format of the transaction proposal is correct; whether the transaction proposal is repeatedly submitted; whether the user node has been authorized with write rights in the channel requesting execution of the smart contract call. And, when the processing unit 412 verifies that the transaction proposal is successful, it will simulate executing the transaction in the state database of the account book maintained by itself, that is, execute the intelligent contract call included in the transaction proposal to obtain the transaction result. The processing unit 412 signs (i.e., endorses) the transaction result, constructs the digital signature in combination with the digital certificate of the endorsement node, and other relevant information into a proposal response (Proposal Response), i.e., endorsement information as referred to in this application.
A transmitting unit 413, configured to transmit the endorsement information to the user node 42, so that the user node 42 checks the transaction proposal.
As shown in fig. 4, the user node 42 specifically includes:
a transmitting unit 421, configured to transmit the transaction proposal to the endorsement node 41, and transmit the endorsement information and the transaction proposal to the ordering node 43 after receiving the endorsement information;
a receiving unit 422, configured to receive endorsement information sent back by the endorsement node 41.
As shown in fig. 4, the sorting node 43 specifically includes:
an obtaining unit 431, configured to obtain a transaction proposal sent by the user node 42;
the processing unit 432 is configured to sort and package the transaction information into blocks according to the communication success rate. In this embodiment, the processing unit 432 does not perform the transaction ordering according to the time stamp, but performs the ordering according to the received communication success rate sent by the user node. In particular, processing unit 432, after receiving the transaction, divides the first transaction P 0 In addition, the original queue p=p 0 ,P 1 ,P 2 …P n According to the success rate of dynamic meter reading communication, the transactions are arranged according to the sequence from large to small, and a new ordering queue Q=is obtainedP 0 ,Q 1 ,Q 2 ,Q 3 …Q n . Processing unit 432 constructs the ordered plurality of transactions as a new block and broadcasts the new block to billing nodes in the blockchain network. For example, the processing unit 432 performs block filling according to the ordered transactions until the capacity of the block reaches the set capacity or the time reaches the set waiting time, and determines the obtained block as a new block. In some embodiments, when the transaction reaches 1.5 x N (N is the maximum number of transactions for the block) or when the set maximum latency is reached, then processing unit 432 packages the first N transactions into a new block and forwards to the billing node, and if the transaction is less than N but the set maximum latency has been reached, packages all transactions into a new block and forwards to the billing node.
In particular, processing unit 432 does not order the first transaction in order to prevent nodes with too low a success rate from ever being able to submit transactions.
And the sending unit 433 is configured to send the new block to the accounting node for accounting. And the accounting node verifies the transaction after receiving the block submitted by the ordering node, and when the verification is successful, the new block is added to the tail part of the blockchain of the accounting node to finish the uplink operation of the transaction.
According to the power consumption information acquisition method based on the improved Kafka mechanism, disclosed by the embodiment of the application, the blockchain network and the user side are arranged on the arrangement nodes of the Kafka mechanism by using the communication success rate updated by the user nodes, so that the transactions submitted by the nodes with high communication success rate and high acquisition speed are prioritized and successful, resources are vacated preferentially for next round of data acquisition, and the acquisition efficiency is improved as a whole; meanwhile, nodes with low communication success rate are properly staggered, when the nodes with low communication success rate complete transactions and carry out the next round of collection again, the nodes with high communication success rate can already complete collection, channel resources can be released to be used for the nodes with incomplete collection, the generation speed of new blocks is also increased, and orderly and healthy work of power consumption information collection block chains is promoted.
It will be apparent to those skilled in the art that embodiments of the present invention may be provided as a method, apparatus, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (devices), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
The principles and embodiments of the present invention have been described in detail with reference to specific examples, which are provided to facilitate understanding of the method and core ideas of the present invention; meanwhile, as those skilled in the art will have variations in the specific embodiments and application scope in accordance with the ideas of the present invention, the present description should not be construed as limiting the present invention in view of the above.

Claims (9)

1. The electricity consumption information acquisition method based on the Kafka mechanism is characterized by comprising the following steps of:
a user node submits a transaction proposal to an endorsement node, wherein the transaction proposal comprises transaction information collected by the user node and communication success rates of a plurality of meters under the user node;
the endorsement node receives the transaction proposal, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to the user node;
after receiving the endorsement information, the user node sends the endorsement information and the transaction proposal to a sequencing node;
the ordering node orders and packages the transaction information into blocks according to the communication success rate and sends the blocks to an accounting node;
the billing node performs billing on the generated new zone block;
the sorting node sorts and packages the transaction information into blocks according to the communication success rate, and the sorting node comprises the following steps:
and the sorting node sorts the transactions according to the communication success rate and the order from large to small by the original queue except the first transaction to obtain a new sorting queue.
2. The electricity information collection method based on the Kafka mechanism according to claim 1, wherein when the user node submits a transaction proposal to an endorsement node, the communication success rate is calculated at each meter reading turn, and the steps are as follows:
Counting the number of tables connected under the user node;
setting an initial value of a communication success rate, a weighting value of communication success rate, a weight reduction value of communication failure and a communication duration weight of each meter in one meter reading round;
in one meter reading round, the meter is successfully communicated once, the duration used for communication is obtained, and the initial value of the communication success rate, the weighting value of the communication success rate and the communication duration weight are used for adjusting the communication success rate of the meter;
if the user node still cannot successfully communicate with the meter at the end of a meter reading period, adjusting the communication success rate of the meter by using the initial value of the communication success rate and the weight reduction value of the communication failure;
and when the meter reading turn is finished, counting the average communication success rate of the meter under the user node.
3. The method for collecting electricity information based on Kafka mechanism according to claim 1, wherein the endorsement node is bound with a specific intelligent contract, receives a transaction proposal submitted by the user node, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to the user node, and after the user node passes the verification of the transaction proposal, broadcasts the transaction proposal to the ordering node.
4. The method for collecting electricity information based on Kafka mechanism according to claim 1, wherein the sorting node sorts and packages the transaction information into blocks according to the communication success rate, and comprises:
when the transaction reaches a certain transaction number or reaches a set maximum waiting time, the sorting node packages the previous transactions into a new block according to the set transaction number and forwards the new block to the accounting node;
if the transaction does not meet the set number of transactions, but the set maximum waiting time has been reached, all transactions are packed into a new block and forwarded to the accounting node.
5. The method for collecting electricity consumption based on Kafka mechanism according to claim 1 or 4, wherein the sorting node does not sort the first transaction, so as to prevent that the node with too low communication success rate can never submit the transaction.
6. The method for collecting electricity information based on the Kafka mechanism according to claim 1, wherein the accounting node accounts for the new block, verifies the transaction after receiving the block submitted by the user node, and confirms the new block after the verification passes.
7. A blockchain network, comprising an endorsement node, a user node and a ranking node;
the endorsement node is used for endorsing a transaction proposal submitted by the user node, generating endorsement information and sending the endorsement information to the user node, wherein the transaction proposal comprises transaction information acquired by the user node and communication success rates of a plurality of meters under the user node;
the user node is used for sending the endorsement information and the transaction proposal one to the ordering node after the transaction proposal passes the verification;
the ordering node is used for ordering the transaction information according to the communication success rate and packaging the transaction information into blocks, and sending the blocks to the accounting node for accounting;
the sorting node sorts and packages the transaction information into blocks according to the communication success rate, and the sorting node comprises the following steps:
and the sorting node sorts the transactions according to the communication success rate and the order from large to small by the original queue except the first transaction to obtain a new sorting queue.
8. A client for use in the blockchain network of claim 7, the client comprising:
The statistics module is used for counting the number of the tables connected under the user node;
the initial value setting module is used for setting an initial value of the communication success rate of each meter, a weighting value of the communication success rate, a weight reduction value of the communication failure and a communication duration weight value in one meter reading round;
the communication success rate adjusting module is used for adjusting the communication success rate of each meter according to the initial value of the communication success rate, the weighting value of the communication success rate, the weight reduction value of the communication failure and the communication duration weight in one meter reading round;
and the average statistics module is used for counting the average communication success rate of the meter under the user node when the meter reading round is finished.
9. The ue of claim 8, wherein the communication success rate adjustment module is configured to adjust, in one meter reading round, a communication success rate of each meter according to an initial value of the communication success rate, a weighted value of the communication success rate, a weight-down value of the communication failure, and a weight of a communication duration, and the method comprises:
if the meter is successfully communicated once in one meter reading round, acquiring the duration used by the communication, and adjusting the communication success rate of the meter by using the initial value of the communication success rate, the weighting value of the communication success rate and the communication duration weight;
If the user node still cannot successfully communicate with the meter at the end of a meter reading period, the communication success rate of the meter is adjusted by using the initial value of the communication success rate and the weight reduction value of the communication failure.
CN202110195891.0A 2021-02-20 2021-02-20 Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal Active CN112995167B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110195891.0A CN112995167B (en) 2021-02-20 2021-02-20 Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110195891.0A CN112995167B (en) 2021-02-20 2021-02-20 Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal

Publications (2)

Publication Number Publication Date
CN112995167A CN112995167A (en) 2021-06-18
CN112995167B true CN112995167B (en) 2023-05-26

Family

ID=76394243

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110195891.0A Active CN112995167B (en) 2021-02-20 2021-02-20 Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal

Country Status (1)

Country Link
CN (1) CN112995167B (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113504978A (en) * 2021-07-14 2021-10-15 上海点融信息科技有限责任公司 Method, apparatus and readable storage medium for determining out-of-block time of block chain
CN113780779A (en) * 2021-08-31 2021-12-10 杭州协能科技股份有限公司 Data state control method and system and echelon battery data state control method

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105139609A (en) * 2015-08-18 2015-12-09 江苏林洋电子股份有限公司 Dynamic time-sharing meter copying-reading method
CN111461917A (en) * 2020-02-11 2020-07-28 江苏荣泽信息科技股份有限公司 Power system material contract management system based on block chain
CN111583039A (en) * 2020-05-09 2020-08-25 江苏大学 Safe interaction method, incentive method and transaction system for manager-free blockchain transaction
CN111629039A (en) * 2020-05-20 2020-09-04 ***股份有限公司 Block chain consensus method, client, endorsement node and sequencing node
CN111988188A (en) * 2020-09-03 2020-11-24 深圳壹账通智能科技有限公司 Transaction endorsement method, device and storage medium
CN112132682A (en) * 2020-08-10 2020-12-25 国网浙江省电力有限公司嘉兴供电公司 Electric power transaction method, device and system based on block chain technology
WO2021018088A1 (en) * 2019-07-30 2021-02-04 华为技术有限公司 Trusted authentication method, network device, system and storage medium

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10901957B2 (en) * 2018-08-29 2021-01-26 International Business Machines Corporation Checkpointing for increasing efficiency of a blockchain

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105139609A (en) * 2015-08-18 2015-12-09 江苏林洋电子股份有限公司 Dynamic time-sharing meter copying-reading method
WO2021018088A1 (en) * 2019-07-30 2021-02-04 华为技术有限公司 Trusted authentication method, network device, system and storage medium
CN111461917A (en) * 2020-02-11 2020-07-28 江苏荣泽信息科技股份有限公司 Power system material contract management system based on block chain
CN111583039A (en) * 2020-05-09 2020-08-25 江苏大学 Safe interaction method, incentive method and transaction system for manager-free blockchain transaction
CN111629039A (en) * 2020-05-20 2020-09-04 ***股份有限公司 Block chain consensus method, client, endorsement node and sequencing node
CN112132682A (en) * 2020-08-10 2020-12-25 国网浙江省电力有限公司嘉兴供电公司 Electric power transaction method, device and system based on block chain technology
CN111988188A (en) * 2020-09-03 2020-11-24 深圳壹账通智能科技有限公司 Transaction endorsement method, device and storage medium

Also Published As

Publication number Publication date
CN112995167A (en) 2021-06-18

Similar Documents

Publication Publication Date Title
US10986177B2 (en) Systems and methods of self-forking blockchain protocol
US20230254168A1 (en) System and method for controlling asset-related actions via a block chain
US11165589B2 (en) Trusted agent blockchain oracle
US10579424B2 (en) Prioritization in a permissioned blockchain
Kaur et al. Scalability in blockchain: Challenges and solutions
CN112541758A (en) Multi-round voting type fault-tolerant sequencing consensus mechanism and method based on block chain
WO2023020233A1 (en) Blockchain-based data processing method, apparatus and device, and storage medium
US11940958B2 (en) Artificial intelligence software marketplace
CN111104460B (en) Block chain consensus method, system, electronic equipment and storage medium
CN112995167B (en) Kafka mechanism-based electricity consumption information acquisition method, blockchain network and user terminal
CN111062811B (en) Block chain consensus method, system and storage medium
CN110995701A (en) Block chain consensus method, system, electronic equipment and storage medium
CN108768672B (en) Data processing method, device and storage medium
JPWO2019038839A1 (en) Blockchain management device, blockchain management method and program
CN110660466A (en) Personal health data chaining method and system of Internet of things by combining block chains
WO2023035065A1 (en) Methods and systems for fast consensus within distributed ledgers
CN111222885B (en) Data processing request endorsement method and device, computer equipment and storage medium
Kang et al. Stochastic modeling approaches for analyzing blockchain: A survey
Ivanov et al. Blockumulus: a scalable framework for smart contracts on the cloud
Zhang et al. Cross-Chain Interoperability and Collaboration for Keyword-Based Embedded Smart Contracts in the Internet of Things
US20240070735A1 (en) Managing cloud resource consumption using distributed ledgers
Wu et al. A New Blockchain Consensus Algorithm for Virtual Power Plants
Christidis Blockchain-Based Local Energy Markets
CN112163034B (en) Model sharing method, node and blockchain system
CN117391854A (en) Data processing method and device based on block chain and related equipment

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant