CN112995167A - Kafka mechanism-based power utilization information acquisition method, block chain network and user side - Google Patents

Kafka mechanism-based power utilization information acquisition method, block chain network and user side Download PDF

Info

Publication number
CN112995167A
CN112995167A CN202110195891.0A CN202110195891A CN112995167A CN 112995167 A CN112995167 A CN 112995167A CN 202110195891 A CN202110195891 A CN 202110195891A CN 112995167 A CN112995167 A CN 112995167A
Authority
CN
China
Prior art keywords
node
transaction
success rate
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.)
Granted
Application number
CN202110195891.0A
Other languages
Chinese (zh)
Other versions
CN112995167B (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
Metering Center of State Grid Jibei Electric Power Co Ltd
State Grid Corp of China SGCC
Original Assignee
Nanjing Linyang Power Tech Co ltd
Metering Center of State Grid Jibei Electric Power Co Ltd
State Grid Corp of China SGCC
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, Metering Center of State Grid Jibei Electric Power Co Ltd, State Grid Corp of China SGCC 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 OR CALCULATING; 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 OR CALCULATING; 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 OR CALCULATING; 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

本申请实施例提供一种基于Kafka机制的用电信息采集方法，包括：用户节点向背书节点提交交易提案；背书节点接收交易提案，对交易提案进行背书，生成背书信息，并将背书信息发送给用户节点；用户节点在收到背书信息后，将背书信息和交易提案一并发送给排序节点；排序节点根据通信成功率对交易信息进行排序并打包成区块，发送给记账节点；记账节点将生成的新区块进行记账。本申请在Kafka机制的排序节点上使用更新的通信成功率进行排序，可以使通信成功率高、采集速度快的节点所提交的交易优先成功，以便于优先腾出资源进行下一轮数据采集，整体提高采集效率，也加快了新区块生成速度，促进了用电信息采集区块链有序健康地工作。

Figure 202110195891

An embodiment of the present application provides a method for collecting electricity consumption information based on the Kafka mechanism, including: a user node submits a transaction proposal to an endorsement node; the endorsement node receives the transaction proposal, endorses the transaction proposal, generates endorsement information, and sends the endorsement information to User node; after receiving the endorsement information, the user node sends the endorsement information and transaction proposal to the ordering node; the ordering node sorts the transaction information according to the communication success rate, packs it into blocks, and sends it to the accounting node; accounting Nodes will generate new blocks for accounting. This application uses the updated communication success rate for sorting on the sorting nodes of the Kafka mechanism, which can make the transactions submitted by the nodes with high communication success rate and fast collection speed to succeed first, so that resources can be preferentially freed up for the next round of data collection. The overall improvement of collection efficiency also speeds up the generation of new blocks, and promotes the orderly and healthy work of the electricity information collection blockchain.

Figure 202110195891

Description

Kafka mechanism-based power utilization information acquisition method, block chain network and user side
Technical Field
The invention belongs to the field of block chain technology application, and particularly relates to a Kafka mechanism-based power utilization information acquisition method, a block chain network and a user side.
Background
Traditional electricity consumption information collection systems use a highly centralized model for business operations, a centralized server, and a centralized database. In order to ensure data security, a centralized database is generally placed in an internal network and protected by using a complex account, a firewall, antivirus software and other modes; in order to share services, 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 a city disaster recovery backup or a remote disaster recovery backup. In order to ensure normal operation of a service, a service server usually adopts cluster or dual-server hot standby.
The advantage of this mode is the ease of management due to the high degree of centralization. Correspondingly, the defects are obvious, because of high centralization, the technology such as a firewall is needed for protection, the self defense performance is extremely low, once a destroyer bypasses or breaks through the firewall, the business and data are mastered in the hands of the destroyer; even if the act of corruption is prevented in time, corrupted data is difficult to recover.
A blockchain, which is a data structure that stores data in time sequence, may support different consensus mechanisms. The consensus mechanism is an important component of the blockchain technique. The goal of the blockchain consensus mechanism is to have all honest nodes maintain a consistent blockchain view while satisfying two properties:
1) and (5) consistency. The prefix portions of the blockchains stored by all honest nodes are identical.
2) Effectiveness. The information released by a honest node will eventually be recorded in its blockchain by all other honest nodes.
The trust of the block chain is mainly embodied in that users distributed in the block chain do not need to trust another party of the transaction or trust a centralized mechanism, and the transaction can be realized only by trusting a software system under a block chain protocol. The premise of this trust is the consensus mechanism (consensus) of the blockchain, that is, in a mutually untrusted market, a sufficient requirement for each node to agree is that each node, considering the maximization of its own interest, will spontaneously and honestly obey the rules preset in the protocol, determine the authenticity of each record, and finally record the record determined to be authentic into the blockchain. In other words, if the nodes have independent interests and compete with each other, the nodes are almost impossible to collude to cheat you, which is especially evident when the nodes have a common reputation in the network. The blockchain technology just applies a set of consensus-based mathematical algorithm to establish a 'trust' network between machines, so that brand-new credit creation is performed through technical endorsements rather than centralized credit organizations.
Therefore, the consensus mechanism is the core of the blockchain technology, which restricts the transaction ability and extensibility of the blockchain. As block chains have been developed so far, there are dozens of kinds of common recognition mechanisms, which are suitable for different scenes, including POW common recognition mechanisms which mainly remove centralization security but have very low efficiency, Pool common recognition mechanisms which improve efficiency and give consideration to security but sacrifice partial decentration characteristics, and the like. But it is difficult to judge the consensus mechanism with simple "good" and "bad", and the applicability of the consensus mechanism should be measured more in conjunction with the scene application.
Therefore, the power industry turns the eye to the blockchain, and is exploring to apply the blockchain to the industry, and improving the safety of the power utilization information acquisition system by utilizing the characteristics of tamper resistance, decentralization, traceability and the like of the blockchain.
Disclosure of Invention
The invention provides a power utilization information acquisition method based on a Kafka consensus mechanism, a block chain network and a user side, and the ordered and healthy work of a power utilization information acquisition block chain is promoted by improving the sequencing confirmation of the consensus mechanism.
In order to achieve the above object, an embodiment of the present application provides a power consumption information collecting method based on a 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 to generate 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 sequencing node sequences the transaction information according to the communication success rate, packs the transaction information into blocks and sends the blocks to an accounting node; and the accounting node accounts the generated new block.
Further, in some embodiments, when the user node submits a proposal for a transaction to the endorsement node, the communication success rate is calculated in each meter reading turn, and the steps are as follows: counting the number of meters connected under the user node; setting an initial value of the communication success rate, a weighted value of the communication success, a weighted value of the communication failure and a weighted value of the communication duration of each meter in a meter reading turn; if the meter is successfully communicated once in one meter reading turn, acquiring the communication time length, and adjusting the communication success rate of the meter by using the initial value of the communication success rate, the weighted value of the communication success rate and the weight of the communication time length; if the user node still can not successfully communicate with the meter when a meter reading period is finished, 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 round is finished, counting the average communication success rate of the meter under the user node.
Further, in some embodiments, the endorsement node is bound to 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 the user node broadcasts the transaction proposal to the sorting node after passing the check of the transaction proposal by the user node.
Further, in some embodiments, the sorting node sorts and packs the transaction information into blocks according to the communication success rate, including:
and the sequencing node arranges the transactions according to the sequence from big to small according to the communication success rate of the original queue except the first transaction to obtain a sequencing new queue.
Further, in some embodiments, the sorting node sorts and packs the transaction information into blocks according to the communication success rate, including:
when the transactions reach a certain transaction number or reach a set maximum waiting time, the sequencing node packs a plurality of previous transactions into a new block according to the set transaction number and forwards the new block to the accounting node;
if the transactions are less than the set transaction number but have reached the set maximum wait time, then all transactions are packaged into a new block and forwarded to the accounting node.
Further, in some embodiments, the sorting node does not sort the first transaction to prevent nodes with too low a communication success rate from ever failing to submit transactions.
Further, in some embodiments, the accounting node accounts the new block, verifies the transaction after receiving the block submitted by the user node, and confirms the new block after the verification is passed.
In order to achieve the above object, 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 endorsement of 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 collected 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 to the sequencing node after the transaction proposal passes the inspection; and the sequencing node is used for sequencing 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 object, an embodiment of the present invention further provides a ue, which is applied to the block chain according to the embodiment of the present invention, and the ue includes: the counting module is used for counting the number of meters connected under the user node; the initial value setting module is used for setting an initial value of the communication success rate, a weighted value of the communication success, a weighted value of the communication failure and a weighted value of the communication duration of each meter in one meter reading turn; 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 weighted value of the communication success, the weighted value of the communication failure and the weighted value of the communication duration in one meter reading turn; and the average counting 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 adjusting module of communication success rate is configured to adjust the communication success rate of each meter according to the initial value of communication success rate, the weighted value of communication success, the weighted value of communication failure, and the weighted value of communication duration in one meter reading turn, and includes: if the meter is successfully communicated once in one meter reading turn, acquiring the communication time length, and adjusting the communication success rate of the meter by using the initial value of the communication success rate, the weighted value of the communication success rate and the weight of the communication time length; and if the user node still cannot successfully communicate with the meter after the meter reading period is finished, 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.
According to the power utilization information acquisition method based on the improved Kafka mechanism, the block chain network and the user side are sorted by using the communication success rate updated by the user nodes on the sorting nodes of the Kafka mechanism, so that transactions submitted by the nodes with high communication success rate and high acquisition speed are preferentially successful, resources are preferentially vacated for next round of data acquisition, and the acquisition efficiency is integrally improved; meanwhile, nodes with low communication success rate are properly staggered, when the nodes with low communication success rate complete transaction and carry out the next round of acquisition again, the nodes with high communication success rate may complete acquisition, channel resources can be released for the nodes which do not complete acquisition to use, the generation speed of new blocks is accelerated, and the orderly and healthy work of the power utilization information acquisition block chain is promoted.
Drawings
Fig. 1 is a processing flow chart of a Kafka mechanism-based electricity consumption information acquisition method 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 side according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of a block chain network according to an embodiment of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Before further detailed description of the embodiments of the present application, terms and expressions referred to in the embodiments of the present application will be described, and the terms and expressions referred to in the embodiments of the present application will be used for the following explanation.
1) A transaction Proposal (promusal) is a request for executing a smart contract invocation (hereinafter simply referred to as executing a transaction) included in a transaction, including an identification of a channel that receives the transaction, an identification of a smart contract that needs to be invoked in the channel, and parameter information that needs to be passed to the invoked smart contract.
2) A Transaction, also referred to as a Transaction request, is equivalent to the computer term Transaction (Transaction), which includes the operations that need to be committed to a blockchain network for execution, and the corresponding Transaction results, and does not refer to transactions in the business context alone. Embodiments of the present invention follow this convention in view of the convention colloquially used in blockchain technology for the term "transaction". For example, the transactions may include a Deploy (Deploy) transaction for deploying smart contracts into nodes of the blockchain network and ready to be invoked and a call (Invoke) transaction; the Invoke (Invoke) transaction is used to perform a query operation (i.e., a read operation) or an update operation (i.e., a write operation, including additions, deletions, and modifications) on the state database in the ledger.
3) A Block chain (Blockchain) is a storage structure for encrypted, chained transactions formed from blocks (blocks). The header of each block can comprise the hash values of all transactions in the block and also comprises the hash values of all transactions in the previous block, so that the falsification and forgery prevention of the transactions in the block are realized on the basis of the hash values; newly generated transactions, after being filled into the tiles and passing through the consensus of nodes in the blockchain network, are appended to the end of the blockchain to form a chain growth.
4) A Blockchain Network (Blockchain Network) incorporates new blocks into a set of nodes of a Blockchain in a consensus manner.
5) Ledger (legger) is a general term for a block chain (also called Ledger data) and a state database synchronized with the block chain. Wherein, the blockchain records the transaction in the form of a file in a file system; the state database records the transactions in the blockchain in the form of different types of Key (Key) Value pairs for supporting fast query of the transactions in the blockchain.
6) Smart Contracts (Smart Contracts), also known as chain codes (chainodes) or application codes, are a computer protocol intended to propagate, verify or execute Contracts in an informative way, programs deployed in nodes of a blockchain network, carrying business logic to perform transactions, running in an isolated execution environment (e.g. container or virtual machine). Each node in the block chain system can automatically execute a contract program according to a specific condition, and can operate data stored in the chain, so that a user can interact with the block chain, and an important way of realizing business logic by using the block chain is realized.
7) Consensus (Consensus), a process in a blockchain network, is used to agree on a transaction in a block between the nodes involved, the agreed block to be appended to the end of the blockchain. Mechanisms to achieve consensus include Proof of workload (PoW, Proof of Work), Proof of rights of interest (PoS, Proof of stamp), Proof of equity authority (DPoS, freed Proof of stamp), Proof of Elapsed Time (PoET, Proof of Elapsed Time), and the like.
8) The Kafka consensus mechanism is a consensus mechanism specific to Hyperledger Fabric. As the first federating chain to choose a source technology macro, the goal of hyperridge Fabric is to help enterprises build enterprise-level blockchain solutions more easily. At present, more than 250 enterprises and organizations are added. Therefore, the application scenarios of the Kafka consensus mechanism are very wide, including IBM, Intel, hundredth, hua-shi and other IT great leaders, and including dutch banks, egypen philosophy, and australian banks and other financial institutions.
Kafka is a distributed, message publish/subscribe based message processing model that addresses the issue of message consistency and fast processing in distributed systems. The Kafka cluster comprises one or more servers, called brokers, each message issued to the Kafka cluster has a Topic, called Topic, each Topic comprises one or more partitions, called partitions, messages within the same Topic are stored in partitions on different brokers according to certain keys and algorithms, and message producers Producer and Consumer consumers as clients can produce or consume topics on multiple brokers.
Broker: one Kafka node is a Broker, and a plurality of Brokers can form a Kafka cluster.
Topic: one type of message, the Kafka cluster, can be responsible for the distribution of multiple topics simultaneously.
Part: a topic is physically grouped, a topic may be divided into multiple partitions, each partition being an ordered queue.
Segment: the partition physically consists of a plurality of segments.
Offset: each partition consists of an ordered series of immutable messages that are appended to the partition in succession. Each message in the partition has a consecutive sequence number called offset, which uniquely identifies a message.
Producer: responsible for issuing messages to Kafka broker.
Consumer: and the message consumer reads the client of the message to the Kafka browser.
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 one Partition in one Topic according to the message classification.
Pull Process: and the Consumer client initiates an access request, and the Broker finds out corresponding access message reading according to Topic, Partition and Offset of the access message.
The Kafka consensus mechanism is a relatively extensive consensus mechanism and mainly comprises three steps: endorsement, ordering and verification, wherein endorsement and verification are performed by an endorsement node (Endorser) to ensure the validity of the transaction; the sorting is performed by a sorting node (Orderer) ensuring consistency in the order of transactions in the block. The ordering is determined based on the sequence of sending messages by different message producers in a partition, and the simple consensus is simple and easy to manage in application, strong in expandability and popular with service applications.
However, when incorporated into a power consumption information collection system, the simple consensus mechanism of Kafka may have efficiency problems in certain scenarios. The electricity consumption information acquisition equipment is connected with a plurality of meters, data of the meters are read in sequence mostly, if the communication condition of the meters is poor, the communication time of the front meter is long, reading of the rear meter is blocked on one hand, and the time for submitting the transaction is very late on the other hand, and in an extreme case, the common identification mechanism may generate an empty block. These few nodes with poor communication share the same equal system resources as the nodes with good communication, i.e., the priority of the processing by the blockchain system after the node initiates the transaction.
The embodiment of the application provides a Kafka mechanism-based power utilization information acquisition method and a block chain network, wherein a user node submits a transaction proposal to an endorsement node, and after the endorsement node passes the check, the user node broadcasts transactions to a sequencing node, and the sequencing node sequences the transactions to generate a block. That is to say, in the embodiment of the application, the dynamic meter reading communication success rate is taken as a basis, the sequencing confirmation of the Kafka consensus mechanism is improved, and the data of the node with the high communication success rate is preferentially confirmed, so that the user node resource is released as early as possible, the new block generation speed is accelerated when the node is put into the next reading round, and the electricity consumption information acquisition block chain is promoted to work orderly and healthily.
Fig. 1 is a processing flow chart of a Kafka mechanism-based electricity consumption information collection method according to an embodiment of the present application. As shown, it 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 to generate 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 sequencing node sequences the transaction information according to the communication success rate, packs the transaction information into blocks and sends the blocks to an accounting node;
and 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 each client in the blockchain network, may be an electronic device such as a mobile phone, a personal computer, a tablet computer, a vehicle-mounted unit, a server, and may also be 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 information intercommunication in the data sharing system, information connection can exist between each node in the data sharing system, and information transmission can be carried out between the nodes through the information connection. For example, when an arbitrary 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 shared data, so that the data stored on all the nodes in the data sharing system are consistent.
In the embodiment of the application, the user node is a power consumption information acquisition device, is used for acquiring power consumption information counted by a user terminal meter, and must be connected to a certain accounting node or a sequencing node to communicate with the block chain network. In some embodiments, a user node initiates a transaction proposal to an endorsement node, the transaction proposal comprising transaction information collected by the user node and communication success rates of a plurality of meters under the user node.
According to the power utilization information acquisition method, the communication success rate of dynamic adjustment is introduced into the sequencing node of the Kafka consensus mechanism, and sequencing confirmation of the Kafka consensus mechanism is improved, so that transactions submitted by the nodes with high communication success rate and high acquisition speed are preferentially successful, resources are preferentially vacated for next round of data acquisition, and the acquisition efficiency is integrally improved. In specific implementation, the user node calculates the communication success rate in each meter reading turn. As shown in fig. 2, the communication success rate in the embodiment of the present application is calculated as follows:
step S201, starting to count the number of meters connected under a certain user node, and assuming that the number is K;
step S202, initializing the communication success rate of the meter under the user node; that is, in one meter reading round, the initial value of the communication success rate of each meter is set to CintThe weight value of successful communication is CsuccessThe weight reduction value of communication failure is CfailTime length of communication weight Ccom；
Step S203, judging whether the communication between the node and the meter is successful;
step S204, in a meter reading turn, when the node and a meter M are countediThe communication is successful once, the communication time is t, and the communication success rate of the meter is adjusted to Cint＝Cint+Csuccess-Ccom*t；
Step S205, if at the end of a meter reading period, the node still can not be measured by the meter MiIf the communication is successful, the communication success rate of the meter is adjusted to Cint＝Cint-Cfail；
Step S206, when the meter reading round is finished, the average communication success rate of the node is counted to be
Figure BDA0002945322380000091
Figure BDA0002945322380000092
And after the communication success rate W of the node is obtained, the transaction information and the communication success rate are sent to the endorsement node as a transaction proposal. In the embodiment of the present application, as can be known by those skilled in the art, the transaction proposal further includes, in addition to the transaction information and the communication success rate information, a transaction number, a timestamp (time for initiating the transaction proposal), an identifier (for example, a serial number or a name) of a channel for executing the transaction (i.e., a channel where the intelligent contract called in the transaction is located), and an intelligent contract call that needs to be executed in the channel, including an identifier of the intelligent contract that needs to be called, for example, a name or a serial number, a version of the intelligent contract, and parameter information that needs to be transferred to the intelligent contract. The intelligent contract and the parameter are related to the operation that the client needs to execute, for example, the intelligent contract can be used for adding, deleting, inquiring or modifying operation, and the parameter information can be data of the adding, deleting, inquiring or modifying operation. In addition, the transaction proposal can also carry a digital certificate which is issued to the user node by the authentication center and a digital signature aiming at the transaction proposal by the user node, 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 to a specific intelligent contract, receives data and a communication success rate submitted by a user node, executes an 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 performs some verification according to the endorsement policy after receiving the transaction proposal, including: whether the digital certificate carried by the transaction proposal is issued by a trusted certificate authority; 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; and whether the user node is authorized to have write permission in the channel for requesting to execute the intelligent contract calling. And when the endorsement node verifies that the transaction proposal is successful, the endorsement node simulates the execution of the transaction in the state database of the ledger maintained by the endorsement node, namely executes the intelligent contract call included in the transaction proposal to obtain a transaction result. The endorsement node signs the transaction result (i.e. endorsement), and the digital signature is combined with the digital certificate of the endorsement node and other related information to form a Proposal Response (endorsement information), which is referred to in the application.
And after the endorsement node carries out endorsement on the transaction, sending the endorsement information to the user node so that the user node can check the transaction proposal.
And step S103, after receiving the endorsement information, the user node checks the transaction proposal and sends the endorsement information and the transaction proposal to a sequencing node. Specifically, the user node broadcasts the transaction to the ranking node after the user node verifies the transaction proposal.
In step S104 of the present application, the sorting node is configured to sort the received transactions according to the communication success rate and pack the transactions into blocks.
In the existing Kafka consensus mechanism, a sequencing node in a block chain network is used for providing sequencing service, and in the process of transaction processing, the sequencing node receives transactions sent by other nodes, sequences the transactions according to time, and adds new service data to the block chain. In some embodiments, to determine the time of each received transaction, the sequencing node invokes a timestamp service, such as a third party timestamp service, that generates a transaction timestamp corresponding to each transaction using a national time service or other trusted time source.
In the embodiment of the application, the sequencing node does not sequence the transactions according to the timestamp, but sequences the transactions according to the received communication success rate sent by the user node. In specific implementation, the sequencing node receives the transaction and then removes the first transaction P0Besides, the original queue P is equal to P0,P1,P2…PnAccording to the success rate of the dynamic meter reading communication, the transactions are arranged in a descending order, and a new sequencing queue Q-P is obtained0,Q1,Q2,Q3…Qn。
And the sequencing node constructs the sequenced transactions into a new block and broadcasts the new block to a billing node in the block chain 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 a transaction reaches 1.5 × N (N is the maximum number of transactions per block) or a set maximum wait time is reached, the sequencing node packs the first N transactions into a new block and forwards the block to the accounting node, and if the transactions are less than N but have reached the set maximum wait time, packs all transactions into a new block and forwards the block to the accounting node.
In specific implementation, the sorting node does not sort the first transaction, which is to prevent the node with too low communication success rate from never submitting the transaction.
In step S105 of the present application, the accounting node is configured to account the new block, and after receiving the block submitted by the sorting node, the accounting node verifies 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 block chain of the accounting node to complete the uplink operation of the transaction.
In some embodiments, the verification of the transaction in the block by the accounting node comprises: whether it is a legitimate transaction: whether the transaction format is correct or not, whether a legal signature exists or not and whether the transaction content is tampered or not are judged; whether the accounting node joins a channel for receiving the transaction indicated in the transaction; whether the transaction complies with the endorsement policy. The endorsement policy is a rule for endorsement of a transaction, and specifies an organization from which an endorsement is required before submission of the transaction, the type of nodes in the corresponding organization, and the number of valid endorsements.
Compared with the prior art, the electricity utilization information acquisition method based on the improved Kafka mechanism disclosed by the embodiment has the beneficial effects that:
at present, the kafka consensus mechanism is a simpler and direct consensus mechanism, the submission of the transaction is submitted by the sequencing node according to a natural sequence, and 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 sequencing on the sequencing nodes of the Kafka mechanism, so that the transaction submitted by the nodes with high communication success rate and high acquisition speed is firstly successful, resources are preferentially vacated for next round of data acquisition, and the acquisition efficiency is integrally improved; meanwhile, nodes with low communication success rate are properly staggered, when the nodes with low communication success rate complete transaction and carry out the next round of acquisition again, the nodes with high communication success rate may complete acquisition, channel resources can be released for the nodes which do not complete acquisition to use, the generation speed of new blocks is accelerated, and the ordered and healthy work of a power utilization information acquisition block chain is promoted.
Based on the same technical concept, fig. 3 exemplarily shows a structure of a user end provided in the embodiment of the present invention, where the user end may be a power consumption information collecting device, except that the power consumption information of the user can be collected, and the block chain consensus process of the embodiment of the present application can be performed.
As shown in fig. 3, the user end includes a device for calculating and updating the dynamic meter reading communication success rate of the meter, which includes:
a counting module 301, configured to count the number of meters connected to the user node, where the number is K, for example;
an initial value setting module 302, configured to set an initial value of a communication success rate, a communication success weighted value, a communication failure weighted value, and a communication duration weighted value for each meter in a meter reading turn;
a communication success rate adjusting module 303, 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, the weighted value of the communication failure, and the communication duration weighted value in one meter reading turn;
and an average counting module 304, configured to count an average communication success rate of the meter under the user node when the meter reading round is finished.
In specific implementation, the initial value setting module 302 initializes the communication success rate of the meter under the user node; that is, in one meter reading round, the initial value of the communication success rate of each meter is set to CintThe weight value of successful communication is CsuccessThe weight reduction value of communication failure is CfailTime length of communication weight Ccom。
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, the weighted value of the communication failure, and the weighted value of the communication duration in one meter reading turn, and includes:
1. if the meter is successfully communicated once in one meter reading turn, the communication time length is obtained, and the initial value of the communication success rate, the weighted value of the communication success rate and the communication time length weight are used for adjusting the communication success rate of the meter, namely: in a meter reading turn, when a node is in contact with a meter MiThe communication is successful once, the communication time is t, and the communication success rate of the meter is adjusted to Cint＝Cint+Csuccess-Ccom*t；
2. If at the end of a meter reading period, the node still cannot be in contact with the meter MiIf the communication is successful, the communication success rate of the meter is adjusted to Cint＝Cint-Cfail；
An average counting module 304, configured to count an average communication success rate of the meter under the user node as
Figure BDA0002945322380000121
And the user side sends the collected user electricity utilization information as transaction and communication success rate information to the endorsement node of the block chain network.
Based on the same technical concept, fig. 4 exemplarily shows a block chain network provided by the embodiment of the present invention. The blockchain network includes an endorsement node 41, a user node 42 and a sorting 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 multiple meters under the user node 42; the user node 42 is configured to send the endorsement information and the transaction proposal to the sorting node 43 after the transaction proposal passes the verification; and the sequencing node 43 is configured to sequence the transaction information according to the communication success rate, package the transaction information into blocks, and send the blocks to the 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 multiple meters under the user node;
the processing unit 412 is configured to endorse the transaction proposal to generate endorsement information. The processing unit 412, upon receiving the transaction proposal, performs some verification according to the endorsement policy, including: whether the digital certificate carried by the transaction proposal is issued by a trusted certificate authority; 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; and whether the user node is authorized to have write permission in the channel for requesting to execute the intelligent contract calling. Moreover, when the processing unit 412 verifies that the transaction proposal is successful, it simulates the execution of the transaction in the state database of the ledger maintained by itself, that is, executes 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, and constructs a digital signature in combination with the digital certificate of the endorsement node and other related information as a Proposal Response (endorsement information), which is referred to in this application.
A sending unit 413, configured to send 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 sending unit 421, configured to send a transaction proposal to the endorsement node 41, and send the endorsement information and the transaction proposal to the sorting node 43 after receiving the endorsement information;
a receiving unit 422, configured to receive the 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;
and the processing unit 432 is configured to sort and pack the transaction information into blocks according to the communication success rate. In this embodiment of the application, the processing unit 432 does not perform transaction sorting according to the timestamp any longer, but performs sorting according to the received communication success rate sent by the user node. In particular, the processing unit 432, upon receiving a transaction, removes the first transaction P0Besides, the original queue P is equal to P0,P1,P2…PnAccording to the success rate of the dynamic meter reading communication, the transactions are arranged in a descending order, and a new sequencing queue Q-P is obtained0,Q1,Q2,Q3…Qn. The processing unit 432 constructs the ordered plurality of transactions as a new block and broadcasts the new block to a billing node in the blockchain network. For example, the processing unit 432 performs block filling according to the sorted 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 transactions reach 1.5 × N (N is the block maximum transaction count) or the set maximum wait time is reached, processing unit 432 packs the first N transactions into a new block and forwards to the accounting node, and if the transactions are less than N but have reached the set maximum wait time, packs all transactions into a new block and forwards to the accounting node.
In this embodiment, the processing unit 432 does not order the first transaction, which is to prevent the node with too low communication success rate from never submitting the transaction.
A sending unit 433, configured to send the new block to an accounting node for accounting. And after receiving the blocks submitted by the sequencing node, the accounting node verifies the transaction, and when the verification is successful, the new block is added to the tail part of the block chain of the accounting node to complete the uplink operation of the transaction.
According to the power utilization information acquisition method based on the improved Kafka mechanism, the block chain network and the user side are sorted by using the communication success rate updated by the user nodes on the sorting nodes of the Kafka mechanism, so that transactions submitted by the nodes with high communication success rate and high acquisition speed are preferentially successful, resources are preferentially vacated for next round of data acquisition, and the acquisition efficiency is integrally improved; meanwhile, nodes with low communication success rate are properly staggered, when the nodes with low communication success rate complete transaction and carry out the next round of acquisition again, the nodes with high communication success rate may complete acquisition, channel resources can be released for the nodes which do not complete acquisition to use, the generation speed of new blocks is accelerated, and the orderly and healthy work of the power utilization information acquisition block chain is promoted.
As will be appreciated by one skilled in the art, 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 flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams 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 principle and the implementation mode of the invention are explained by applying specific embodiments in the invention, and the description of the embodiments is only used for helping to understand the method and the core idea of the invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, there may be variations in the specific embodiments and the application scope, and in summary, the content of the present specification should not be construed as a limitation to the present invention.

Claims (10)

1. A Kafka mechanism-based power utilization information acquisition method is characterized by comprising the following steps:
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 to generate 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 sequencing node sequences the transaction information according to the communication success rate, packs the transaction information into blocks and sends the blocks to an accounting node;
and the accounting node accounts the generated new block.
2. The Kafka mechanism-based power utilization information acquisition method according to claim 1, wherein when the user node submits a transaction proposal to the endorsement node, the communication success rate is calculated in each meter reading turn, and the steps are as follows:
counting the number of meters connected under the user node;
setting an initial value of the communication success rate, a weighted value of the communication success, a weighted value of the communication failure and a weighted value of the communication duration of each meter in a meter reading turn;
if the meter is successfully communicated once in one meter reading turn, acquiring the communication time length, and adjusting the communication success rate of the meter by using the initial value of the communication success rate, the weighted value of the communication success rate and the weight of the communication time length;
if the user node still can not successfully communicate with the meter when a meter reading period is finished, 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 round is finished, counting the average communication success rate of the meter under the user node.
3. The Kafka mechanism-based power consumption information acquisition method as claimed in claim 1, wherein the endorsement node is bound to 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 check of the transaction proposal, broadcasts the transaction proposal to the sequencing node.
4. The Kafka mechanism-based power utilization information acquisition method according to claim 1, wherein the sorting node sorts and packs the transaction information into blocks according to the communication success rate, and comprises:
and the sequencing node arranges the transactions according to the sequence from big to small according to the communication success rate of the original queue except the first transaction to obtain a sequencing new queue.
5. The Kafka mechanism-based power utilization information acquisition method according to claim 4, wherein the sorting node sorts and packs the transaction information into blocks according to the communication success rate, and comprises:
when the transactions reach a certain transaction number or reach a set maximum waiting time, the sequencing node packs a plurality of previous transactions into a new block according to the set transaction number and forwards the new block to the accounting node;
if the transactions are less than the set transaction number but have reached the set maximum wait time, then all transactions are packaged into a new block and forwarded to the accounting node.
6. The Kafka mechanism-based power utilization information collection method according to claim 4 or 5, wherein the sorting node does not sort the first transaction, so as to prevent the node with the too low communication success rate from never submitting a transaction.
7. The Kafka mechanism-based power utilization information collection method according to claim 1, wherein the billing node bills the new block, verifies the transaction after receiving the block submitted by the user node, and confirms the new block after the verification is passed.
8. A blockchain network comprising an endorsement node, a user node, and a sequencing node;
the endorsement node is used for endorsement of 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 collected 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 to the sequencing node after the transaction proposal passes the inspection;
and the sequencing node is used for sequencing 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.
9. A ue, applied in the blockchain network according to claim 8, the ue comprising:
the counting module is used for counting the number of meters connected under the user node;
the initial value setting module is used for setting an initial value of the communication success rate, a weighted value of the communication success, a weighted value of the communication failure and a weighted value of the communication duration of each meter in one meter reading turn;
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 weighted value of the communication success, the weighted value of the communication failure and the weighted value of the communication duration in one meter reading turn;
and the average counting module is used for counting the average communication success rate of the meter under the user node when the meter reading round is finished.
10. The user end according to claim 9, wherein the communication success rate adjusting module 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, the weighted value of the communication failure, and the weighted value of the communication duration in one meter reading turn, and includes:
if the meter is successfully communicated once in one meter reading turn, acquiring the communication time length, and adjusting the communication success rate of the meter by using the initial value of the communication success rate, the weighted value of the communication success rate and the weight of the communication time length;
and if the user node still cannot successfully communicate with the meter after the meter reading period is finished, 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.
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 true CN112995167A (en) 2021-06-18
CN112995167B 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)

Cited By (5)

* 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
CN114493868A (en) * 2022-01-18 2022-05-13 上海祺鲲信息科技有限公司 Carbon transaction data processing method and system based on block chain
CN114511253A (en) * 2021-08-31 2022-05-17 杭州协能科技股份有限公司 Data state control method and system and echelon battery data state control method
CN115495525A (en) * 2022-10-10 2022-12-20 湖南天河国云科技有限公司 Method for realizing personal information portability based on block chain and private data set
CN119809716A (en) * 2024-12-19 2025-04-11 北京惠民数字科技有限公司 Uniform rights card manufacturing method and system

Citations (8)

* 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
US20200073962A1 (en) * 2018-08-29 2020-03-05 International Business Machines Corporation Checkpointing for increasing efficiency of a blockchain
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

Patent Citations (8)

* 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
US20200073962A1 (en) * 2018-08-29 2020-03-05 International Business Machines Corporation Checkpointing for increasing efficiency of a blockchain
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

Cited By (5)

* 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
CN114511253A (en) * 2021-08-31 2022-05-17 杭州协能科技股份有限公司 Data state control method and system and echelon battery data state control method
CN114493868A (en) * 2022-01-18 2022-05-13 上海祺鲲信息科技有限公司 Carbon transaction data processing method and system based on block chain
CN115495525A (en) * 2022-10-10 2022-12-20 湖南天河国云科技有限公司 Method for realizing personal information portability based on block chain and private data set
CN119809716A (en) * 2024-12-19 2025-04-11 北京惠民数字科技有限公司 Uniform rights card manufacturing method and system

Also Published As

Publication number Publication date
CN112995167B (en) 2023-05-26

Similar Documents

Publication Publication Date Title
Kaur et al. Scalability in blockchain: Challenges and solutions
CN108717630B (en) Block output method and implementation system thereof
CN108667632B (en) Blockchain-based credit record sharing method and device, and electronic equipment
CN112995167A (en) Kafka mechanism-based power utilization information acquisition method, block chain network and user side
Wang et al. Enhancing power grid resilience with blockchain-enabled vehicle-to-vehicle energy trading in renewable energy integration
US20200026699A1 (en) Highly Performant Decentralized Public Ledger with Hybrid Consensus
Wang et al. Beh-raft-chain: A behavior-based fast blockchain protocol for complex networks
CN108881163A (en) A kind of multicenter block catenary system with block issue mechanism
CN109508982A (en) REPB common recognition based on the more subchains of block chain main chain adduction row
WO2023020233A1 (en) Blockchain-based data processing method, apparatus and device, and storage medium
CN112163950B (en) Block chain network construction method, system and terminal equipment convenient for expansion and node resource multiplexing
CN111476572B (en) Block chain-based data processing method, device, storage medium and equipment
CN113256424B (en) Transaction data processing method, device, equipment and storage medium
Sun et al. Rtchain: A reputation system with transaction and consensus incentives for e-commerce blockchain
Li et al. Scalable blockchain storage mechanism based on two-layer structure and improved distributed consensus
CN113902440B (en) A distributed key-based alliance chain cross-chain transaction method and device
CN116595094A (en) Blockchain-based federated learning incentive method, device, equipment and storage medium
CN113518005B (en) A block consensus method, device, equipment and storage medium
CN112308700A (en) Method, device, computer equipment and storage medium for processing enterprise credit information data
Zhang et al. Cross-chain interoperability and collaboration for keyword-based embedded smart contracts in internet of things
CN108768672A (en) Data processing method, device and storage medium
CN111222885B (en) Data processing request endorsement method and device, computer equipment and storage medium
Chen et al. LBDT: A lightweight blockchain-based data trading scheme in Internet of Vehicles using proof-of-reputation
Saad et al. Decentralized directed acyclic graph based dlt network
CN115473643A (en) Credible efficiency consensus system and method suitable for alliance chain

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