CN111741061B - Electronic equipment wide area management system based on block chain technology - Google Patents

Electronic equipment wide area management system based on block chain technology Download PDF

Info

Publication number
CN111741061B
CN111741061B CN202010398269.5A CN202010398269A CN111741061B CN 111741061 B CN111741061 B CN 111741061B CN 202010398269 A CN202010398269 A CN 202010398269A CN 111741061 B CN111741061 B CN 111741061B
Authority
CN
China
Prior art keywords
management
node
transaction
management node
nodes
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
CN202010398269.5A
Other languages
Chinese (zh)
Other versions
CN111741061A (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.)
Shenzhen Zhengneng Information Technology Co ltd
Original Assignee
Shenzhen Zhengneng Information Technology 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 Shenzhen Zhengneng Information Technology Co ltd filed Critical Shenzhen Zhengneng Information Technology Co ltd
Priority to CN202010398269.5A priority Critical patent/CN111741061B/en
Publication of CN111741061A publication Critical patent/CN111741061A/en
Application granted granted Critical
Publication of CN111741061B publication Critical patent/CN111741061B/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
    • 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
    • H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
    • 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
    • G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
    • 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

Abstract

The invention relates to an electronic equipment wide area management system based on a block chain technology. The management of the nodes is realized by adopting a classified management mode; determining a management node in each class of nodes, wherein the management node is used for managing the transactions in the class; the management nodes are dynamically changing. The invention provides a safe and reliable electronic equipment management system which can save time and reduce resource consumption.

Description

Electronic equipment wide area management system based on block chain technology
Technical Field
The invention relates to an electronic equipment management technology, in particular to an electronic equipment wide area management system based on a block chain technology.
Background
With the rapid development of scientific and technological technologies in recent years, the scale of use of various electronic devices such as smart phones, smart watches, wearable medical devices and the like has been increased explosively, however, the widespread use of electronic devices brings convenience, and meanwhile, hidden dangers such as security and anonymity are also inevitably introduced.
The blockchain is a point-to-point distributed ledger technology based on a cryptographic algorithm, and is essentially an internet shared database. The block chain technology is applied to the management of the electronic equipment, and the advantages of decentralized trust, safety, non-tampering, traceability and the like of the electronic equipment can be fully utilized. But the competition of consensus algorithms and accounting rights in the blockchain will cause huge storage and calculation pressure on the electronic devices.
Disclosure of Invention
The invention aims to provide a safe and reliable electronic equipment management system which can save time and reduce resource consumption, and therefore, the invention provides the following technical scheme:
the system comprises an interaction chain, wherein nodes of the interaction chain are composed of management equipment of each equipment management chain, cloud storage equipment of electronic equipment and equipment for providing various services.
The management of the nodes is realized by adopting a classified management mode; determining a management node in each class of nodes, the management node being for managing transactions occurring in the class; the management nodes are dynamically changing.
Within the management period, the management node will end the management period in advance when: the management node is failed and cannot continuously perform management responsibilities; and judging the management process as dishonest, and entering a new round of election process of the management node when the management period is ended in advance.
The management node may be generated using one of three methods, (1) generating the management node based on the credit score; (2) generating a management node according to the amount of the pre-paid honest money; (3) And comprehensively judging and generating the management node according to the credit score and the pre-loyalty points.
The invention adopts a two-stage consensus mode to finish consensus, and the two-stage consensus comprises a first-stage consensus and a second-stage consensus; in the first-level consensus, each class processes the transaction in the class and forms a new block; each class sends the new block formed to the chain through the management node to facilitate secondary consensus.
Each node is provided with an authority management list which is used for recording node details capable of initiating transactions to the node; a permission management list set is arranged in each class, and the list set is a set of all permission management lists in the class; each node can add, delete and modify the content related to the self transaction authority part in the authority management list set; when a management node receives a transaction, firstly, whether a transaction receiver of the transaction is in the managed node is confirmed, and if not, the transaction is sent to other management nodes in other classes on the chain; when a management node receives a transaction, firstly, whether a transaction receiver of the transaction is in a node managed by the management node is confirmed, if so, whether an initiator of the transaction is in a right management list set of the node is checked, if so, the transaction is sent to the transaction receiver and the management node of other classes on the chain is informed that the transaction is accepted, if not, the transaction is processed, and the processing result is rejection and the management node of other classes on the chain is informed that the transaction is processed; all received transactions will be stored by the management node, which integrates all transactions within one management period and organizes the creation of new tiles.
The following transaction types are included in the interaction chain: archiving transactions, parameter request transactions.
The archiving transaction is used for storing relevant data in the electronic equipment at a specified storage position, and the workflow of the archiving transaction is as follows: the method comprises the following steps that an archiving request device initiates an archiving request transaction and sends the archiving request transaction to a management device of the archiving request device, and after the management device confirms and converts the format of the archiving request transaction, the management device sends the archiving request transaction to a management node of the management device; after receiving the transaction of the archiving request, the management node of the node where the archiving request equipment is located broadcasts the transaction; after receiving the archiving request transaction, the management node on the chain firstly confirms whether a transaction receiver of the archiving request transaction is in the node managed by the management node, and if not, the archiving request transaction is sent to other management nodes on the chain; if the transaction is in the authority management list, checking whether the archiving request device of the transaction is in the authority management list, if so, sending the transaction to the management device of the storage device, signing the archiving request transaction by the management device of the storage device, and sending the signed transaction to the management node of the management device so as to store the transaction in an interaction chain; at this time, the management device of the filing request device stores the parameters to be stored in the specified storage device through a data transmission protocol;
the parameter request transaction is used for acquiring parameters acquired by the electronic equipment, and the workflow of the parameter request transaction is as follows: the parameter request equipment initiates a parameter request transaction and sends the parameter request transaction to the management equipment of the request equipment, and after the management equipment of the parameter request equipment confirms and converts the format of the transaction, the transaction is sent to the management node of the parameter request equipment; after receiving the transaction, the management node of the node where the parameter request equipment is located broadcasts the transaction; after receiving the parameter request transaction, the management node on the chain firstly confirms whether the requested equipment of the transaction of the parameter request transaction is in the nodes managed by the management node, and if not, the management node sends the parameter request transaction to other management nodes on the chain; if the transaction is in the authority management list, whether the parameter request equipment of the transaction is in the authority management list is checked, if the transaction is in the authority management list, the transaction is sent to the management equipment of the node, the requested node management equipment signs the parameter request transaction, and sends the signed transaction to the management node of the requested node management equipment so as to store the transaction in an interaction chain, at the moment, the management equipment of the requested electronic equipment acquires the parameters from the requested electronic equipment and then sends the acquired parameters to the parameter request equipment through a data transmission protocol.
Compared with the prior art, the invention has the beneficial effects that:
(1) The classification management system provided by the invention effectively reduces the scale of the nodes on the interactive chain, reduces the requirements on the storage space and the computing capacity of the electronic equipment participating in the block chain, and obviously improves the efficiency because the transaction on the interactive chain is managed by the management nodes in each class.
(2) In the interaction chain, the parameters requesting transmission are not transmitted on the chain as a part of the transaction any more, so that the advantages of the block chain in aspects of decentralized certificate storage and verification are fully exerted on one hand, and the transaction data is prevented from being tampered; on the other hand, the scale of data on the chain is greatly reduced, and the requirements on the storage capacity and the computing capacity of equipment on the chain are reduced. Therefore, the interaction chain proposed in the present invention is a significant improvement over the prior art.
(3) In the prior art, all nodes can require consensus and form a new block by means of a workload certification algorithm and the like, and the large number of nodes directly causes efficiency reduction and results in the consumption of a large amount of computing power to solve a hash function to obtain the right of accounting. All transactions of one class in one consensus period can be verified by single consensus, and the efficiency of single consensus is effectively improved. In addition, one level of consensus among the classes can be performed simultaneously, significantly improving efficiency. In conclusion, compared with the prior art, the technical scheme provided by the invention improves the efficiency and reduces the resource waste.
It should be noted that, according to the needs of the brief text, the above point 3 is only an outline of the beneficial effects of the present invention, and does not encompass all the beneficial effects, and the detailed description refers to the specific description in the embodiments.
Description of the drawings:
fig. 1 is a schematic structural diagram of an electronic device management system based on a block chain technology;
FIG. 2 is a schematic diagram of a transaction completed by a device management chain;
FIG. 3 is a schematic view of a process flow after a transaction is received by a management node;
fig. 4 is a schematic diagram illustrating the determination of election authority of each node according to the score in embodiment 6;
FIG. 5 is a schematic flowchart of the first-stage consensus in example 6;
FIG. 6 is a schematic flow chart showing the operation of the first-order consensus in example 7;
FIG. 7 is a flowchart illustrating the generation of a management node according to embodiment 8;
fig. 8 is a schematic diagram illustrating a flow of generation of a management node in embodiment 9.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be described clearly and completely with reference to the accompanying drawings. It is to be understood that the embodiments described are only a few embodiments of the present invention, and not all embodiments.
Thus, the following detailed description of the embodiments of the invention is not intended to limit the scope of the invention as claimed, but is merely representative of some embodiments of the invention. 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 invention.
It should be noted that the embodiments of the present invention and the features and technical solutions thereof may be combined with each other without conflict.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures.
In the description of the present invention, it should be noted that the terms "upper", "lower", and the like refer to orientations or positional relationships based on orientations or positional relationships shown in the drawings, orientations or positional relationships that are usually used for placing the products of the present invention, or orientations or positional relationships that are usually understood by those skilled in the art, and these terms are only used for convenience of description and simplification of the description, and do not indicate or imply that the devices or elements referred to must have specific orientations, be constructed and operated in specific orientations, and thus, should not be construed as limiting the present invention. Furthermore, the terms "first," "second," and the like are used merely to distinguish one description from another, and are not to be construed as indicating or implying relative importance.
Example 1:
an electronic device management system based on a block chain technology comprises a local area management system and a wide area management system. The local area management system comprises a device management chain, and the wide area management system comprises an interaction chain.
Example 2:
preferably, the device management chain comprises at least one management device, and the management device is used for managing the transaction of the device management chain; a number of electronic devices, each electronic device associated with a tile; the connection of all blocks constitutes a device management chain.
Preferably, the management device is determined by a device management chain master.
Preferably, the management content of the management device includes block creation, key management, archive request transaction, parameter request transaction, and inter-link transaction conversion. After the transaction is completed, the management device places the transaction related to the electronic device in the block corresponding to the electronic device and updates the transaction to the device management chain.
Preferably, the process of creating the block is as follows: when a new electronic device obtains the consent of the device management chain owner to enter the device management chain, a block is created for the new electronic device, and the block is uniquely corresponding to the electronic device.
Preferably, the key management process is as follows: when a new electronic device obtains the agreement of a device management chain owner to enter the device management chain, the management device issues a secret key for the electronic device, wherein the secret key is used for encrypting the transaction between the electronic device and the management device; when an electronic device is determined as a dishonest device or an authorization period expires, the management device logs out a previously issued key. Through the issuance and the cancellation of the key, the effective management of the electronic product is realized.
Preferably, data interaction between the electronic devices is required to complete the functions of the electronic devices, for example, the health monitoring related devices need to count data such as heart rate and blood pressure to determine the health condition. At this time, the electronic device required for obtaining the parameters sends a parameter request transaction to the management device, the management device sends a key to the electronic device initiating the request after receiving the transaction, and the electronic device initiating the request completes access through the key. According to the data request frequency, the method can be divided into single access and repeated access, so that the management of the key can be divided into single access and long-term access. For a single access, a single key is issued, which is only to complete a single data acquisition. For long-term access, a long-term key is issued whereby the key can be repeatedly retrieved for a certain period of time. The above arrangement can avoid resource waste caused by repeatedly initiating transactions for the same parameter request within a period of time.
Preferably, the archiving process is: the electronic device requiring archiving sends a transaction requesting archiving to the management device, after receiving the transaction, the management device sends a key to the electronic device initiating the request, and the electronic device completes the storage action in the storage unit through the key.
Preferably, when the electronic device initiating the parameter request is from the interaction chain, because the device management chain and the interaction chain transaction structure are different, the block of the device management chain cannot directly account for the transaction of the interaction chain, and at this time, the management device needs to perform structure conversion on the transaction of the interaction chain, so that the transaction of the interaction chain conforms to the structure standard of the device management chain. The communication problem caused by the difference of the transaction structures of the equipment management chain and the interaction chain is effectively solved.
Preferably, the transaction in the device management chain can occur after being confirmed by the management device, so that the security is high, and signature confirmation of an initiator and an initiated party of the transaction is not needed. Therefore, compared to the prior art blockchain data transaction structure, the present invention provides a simplified structure. The device management chain transaction at least comprises the following data: (1) a transaction number; (2) transaction type, such as access transaction, archive transaction; (3) The address of the target electronic device, namely the address of the electronic device requesting access; and (4) whether the transaction is an interaction chain transaction.
Preferably, each block comprises a first portion, a second portion and a transaction portion. The first two parts of the block are a first part, a second part, and a transaction part. The first part stores the hash value of the previous block, and the second part is used for authorizing the newly added electronic device and recording the authority management method of the device owner for the electronic device, as shown in table 1. In a second behavior example, he cannot access the device numbered B2 on his behalf on the device numbered A1. The transaction part is used for storing all transactions of the electronic equipment corresponding to the block.
TABLE 1
Numbering Requesting device Type of transaction Requested device Authority control
1 A1 Archiving C1 Y
2 A2 Access B2 N
In the device management chain provided by the invention, the owner of the electronic device can add the electronic device in a mode of creating blocks by the management device, and each block in the device management chain is provided with a second part for authority management, so that the owner of the electronic device is allowed to control the authority of all the electronic devices in the device management chain. In addition, the data on the chain is guaranteed not to be tampered by the hash value of the first part, and the method is safer compared with a common electronic device management system. Compared with the existing block chain network, the device management chain is managed by the specified management device, so that extra computing capacity expense caused by contention for accounting does not exist, when the electronic device is newly added, other nodes do not need to confirm through a consensus algorithm, time can be saved, and efficiency can be improved.
Example 3:
preferably, the nodes of the interaction chain are composed of management devices of respective device management chains.
Preferably, the nodes of the interaction chain are composed of management devices of each device management chain, cloud storage devices of the electronic devices, and related devices providing various services.
Preferably, in order to realize efficient management, the invention adopts a classification management mode to realize the management of the nodes.
Preferably, the classification management specifically includes classifying the nodes, and determining a management node in each class of nodes, where the management node is used to manage the transactions occurring in the class.
Preferably, in order to reduce the loss caused by the dishonest of the management node, the management node in the invention is dynamically changed.
Preferably, the time of one management period is set to be the same as one consensus period.
The classification management system provided by the invention effectively reduces the scale of the nodes on the interactive chain, reduces the requirements on the storage space and the computing capacity of the electronic equipment participating in the block chain, manages the transaction on the interactive chain by the management nodes in various classes, and obviously improves the efficiency.
Preferably, the following data structure is adopted for the transaction in the interaction chain: the trade mark number, the former trade mark number, the trade initiator's key and signature, the trade acceptor's key and signature, the trade processing result, the trade content.
Preferably, the first part is a label of the current transaction, the second part is a label of the previous transaction, and the label is used for pointing to the last transaction of the transaction initiator.
Preferably, the third part and the fourth part are a key and a signature of the transaction initiator and a key and a signature of the transaction receiver respectively.
Preferably, the fifth field is the result of the transaction, and includes the following parameters: receiving the transaction or rejecting the transaction.
Preferably, the sixth field is transaction content, which contains the operations that the transaction initiator wishes the transaction recipient to complete.
Preferably, each node is provided with a rights management list which carries node details which enable a transaction to be initiated to that node.
Preferably, each class is provided with a set of rights management lists, which is a set of all rights management lists in the class.
Preferably, each node can add, delete and modify the content related to the self-transaction right part in the right management list set.
Preferably, when the management node receives a transaction, it first determines whether the transaction recipient of the transaction is in the node it manages, and if not, sends the transaction to the management nodes of other classes in the chain.
Preferably, when the management node receives a transaction, it first confirms whether the recipient of the transaction is in the node it manages, and if so, checks whether the originator of the transaction is in the rights management list of the node. If so, sending the transaction to a transaction recipient and informing other classes of management nodes in the chain that the transaction has been accepted; if not, the transaction is processed with a rejection informing other classes of management nodes in the chain that the transaction has been processed.
Preferably, all received transactions will be stored by the management node, which integrates all transactions within one management period and organizes the creation of new tiles.
Preferably, at least the following transaction types are included in the interaction chain: archiving transactions, parameter requesting transactions.
Preferably, the archive transaction is used to store the relevant data in the electronic device at a designated storage location, for example, the health check electronic device stores the detected data on a designated data health platform, so that the doctor can know the patient's monitoring data in time.
Preferably, the workflow of the archiving transaction is as follows: the method comprises the following steps that an archiving request device initiates an archiving request transaction and sends the archiving request transaction to a management device of the archiving request device, and after the management device confirms and converts the format of the archiving request transaction, the management device sends the archiving request transaction to a management node of the management device; after receiving the transaction of the archiving request, the management node of the node where the archiving request equipment is located broadcasts the transaction; after receiving the archiving request transaction, the management node on the chain firstly confirms whether the transaction receiver of the archiving request transaction is in the managed node, and if not, the management node sends the archiving request transaction to other management nodes on the chain; if the transaction is in the authority management list, checking whether the archiving request device of the transaction is in the authority management list, if so, sending the transaction to the management device of the storage device, signing the archiving request transaction by the management device of the storage device, and sending the signed transaction to the management node of the management device so as to store the transaction in an interaction chain; at this time, the management device of the archive request device stores the parameters to be stored in the specified storage device by the data transfer protocol.
Preferably, the parameter request transaction is used for acquiring the parameters collected by the electronic device. Such as: a patient's doctor wishes to obtain blood pressure parameters of a patient's blood pressure monitor.
Preferably, the workflow of the parameter request transaction is as follows: the parameter request transaction is used for acquiring parameters acquired by the electronic equipment, and the workflow of the parameter request transaction is as follows: the parameter request equipment initiates a parameter request transaction and sends the parameter request transaction to the management equipment of the request equipment, and after the management equipment of the parameter request equipment confirms and converts the format of the transaction, the transaction is sent to the management node of the parameter request equipment; after receiving the transaction, the management node of the node where the parameter request equipment is located broadcasts the transaction; after receiving the parameter request transaction, the management node on the chain firstly confirms whether the requested equipment of the transaction of the parameter request transaction is in the nodes managed by the management node, and if not, the management node sends the parameter request transaction to other management nodes on the chain; if the transaction is in the authority management list, whether the parameter request equipment of the transaction is in the authority management list is checked, if the transaction is in the authority management list, the transaction is sent to the management equipment of the node, the requested node management equipment signs the parameter request transaction, the signed transaction is sent to the management node of the requested node management equipment so as to be stored in an interaction chain, and at the moment, the management equipment of the requested electronic equipment obtains the parameters from the requested electronic equipment and then sends the acquired parameters to the parameter request equipment through a data transmission protocol.
In the interaction chain, the parameters requesting transmission are not transmitted on the chain as a part of the transaction any more, so that the advantages of the block chain in aspects of decentralized certificate storage and verification are fully exerted on one hand, and the transaction data is prevented from being tampered; on the other hand, the scale of data on the chain is greatly reduced, and the requirements on the storage capacity and the computing capacity of equipment on the chain are reduced. Therefore, the interaction chain proposed in the present invention is a significant improvement over the prior art.
Example 5:
preferably, the consensus is completed by adopting a two-stage consensus mode, wherein the two-stage consensus comprises first-stage consensus and second-stage consensus.
Preferably, in the first level consensus, each class processes transactions within the class and forms new blocks. Each class sends the new block formed to the chain through the management node to facilitate secondary consensus.
Preferably, after the management period expires, a new round of election process of the management node is entered.
Preferably, in the management period, the management node ends the management period in advance when: the management node fails, cannot continue to fulfill management responsibilities, and is judged to be dishonest in the management process. And when the management period is ended in advance, entering a new round of election process of the management node.
Preferably, the management node may be generated by one of three methods: generating a management node according to the credit score; generating a management node according to the amount of the pre-paid honest money; and comprehensively judging and generating the management node according to the credit score and the pre-paid honesty.
In the prior art, all nodes can require consensus and form a new block by means of a workload certification algorithm and the like, and the large number of nodes directly causes efficiency reduction and results in the consumption of a large amount of computing power to solve a hash function to obtain the right of accounting. All transactions of one class in one consensus period can be verified by single consensus, and the efficiency of single consensus is effectively improved. In addition, primary consensus of each class can be performed simultaneously, and the consensus efficiency is remarkably improved. In conclusion, compared with the prior art, the technical scheme provided by the invention improves the efficiency and reduces the resource waste.
Example 6:
preferably, the workflow for generating the primary consensus of the management node based on the credit score is that (1) the management node connects the transactions of all the nodes in the class managed by the management node to form a block to be subjected to consensus; (2) The management node sends a block to be identified to the managed node; (3) And other nodes in the same class check whether the block to be subjected to consensus is correct or not, wherein the checked contents comprise whether the contents of each transaction are correct or not and whether the hash value of each transaction is correct or not. (4) If the management node is confirmed to be correct, sending a confirmation message to the management node; if the confirmation is wrong, the punishment of the dishonest node is entered. (5) And (2) when the confirmation information received by the management node reaches a set value, the management node submits the block in the step (1) to an interaction chain.
Preferably, in a punishment of the dishonest node in the step (4) of the primary consensus working process, if a problem is considered and the problem is caused by dishonest of a managed node, a negative information is sent to the management node and indicates the managed node as a dishonest node, and when the received instruction for the certain node reaches a set value, the managed node is determined to be dishonest. At this point, the program score is deducted, and the management node is required to submit the corrected transaction, and the management node replans the consensus block and restarts the primary consensus. And correspondingly increasing credit scoring operation for all nodes which send negative information to the management node and indicate the dishonest nodes. And when the denial information is sent to the management node and the node of the dishonest node is not up to the set value, namely the instruction control is proved to be wrong, deducting the node credit score which sends the denial information and requires to replace the management node.
On one hand, the mechanism can encourage more nodes to monitor due to full-time responsibility, and prevent loss caused by dishonest nodes; on the other hand, it is possible to prevent some nodes from making an unrealistic command for obtaining a credit score reward.
Preferably, the set value in the previous paragraph may be set to 60%, 65% or 70%.
Preferably, in a punishment of the dishonest node in the step (4) of the primary consensus working process, if a problem is considered and the problem is caused by dishonest of the management node, sending denial information to other nodes in the class and requiring replacement of the management node, and when the information requiring replacement of the management node reaches a set value, determining that the management node is dishonest. At this time, deducting the credit score corresponding to the dishonest management node, executing a management node replacement process, and after the management node is replaced, drawing up a consensus block by a new management node and restarting primary consensus again. And performing corresponding credit score increasing operation on all nodes which send the negative acknowledgement information and require to replace the management node. And when the information of the management node required to be replaced does not reach the set value, namely the instruction control is proved to be wrong, deducting the node credit score which sends the denial information and requires to replace the management node.
On one hand, the mechanism can effectively supervise the management nodes, can encourage more nodes to supervise due to full-time responsibility, and prevent huge loss caused by dishonest management nodes; on the other hand, it can prevent some nodes from issuing dishonest instructions for obtaining credit score rewards.
Preferably, the set value in the previous paragraph may be set to 60%, 65% or 70%.
Preferably, the second-level consensus workflow is that, after the interaction chain receives the new blocks formed by each class, the management node on the interaction chain checks whether the blocks submitted by each block are correct, sends a confirmation message if the blocks submitted by each block are correct, and sends a negative confirmation message if errors are found. If the management node sending the confirmation message reaches the designated value, the interaction chain links the blocks of all classes together at one time to form a new block of the interaction chain, broadcasts the finally formed block, and starts the next consensus period.
Preferably, if the management node that sent the confirmation message does not reach the specified value, the processing is performed in one of the following two ways: (1) When a block submitted by a class contains error transactions and the number of the nodes participating in confirmation in the class exceeds a set value, punishment is carried out on the class, specifically, credit scores of the nodes participating in confirmation in the class are deducted, and a management node is informed to submit the corrected block. (2) When a block submitted by a class contains wrong transactions and the number of nodes participating in confirmation in the class does not exceed a set value, judging that a management node is not honest, punishing the management node of the class, specifically, deducting credit scores of the management nodes in the class, executing a management node replacement process, and after the management node is replaced, drawing up a consensus block again by a new management node.
Preferably, the set value in the previous paragraph may be set to 60%, 65% or 70%.
Preferably, the method for generating management nodes according to credit scores comprises the following steps: (1) determining the election authority of each node according to the scores; (2) electing to generate a new management node; (3) And adjusting the credit scores of the nodes according to the situation during management.
Preferably, the step (1) of the process of generating the management node according to the credit score includes the steps of sorting the credit scores of all the nodes in the class to form a sorting table, and ranking the top 0% -a 1 The node is identified as a high credit node, can participate in election as a preparation management node, and has the right of election and elected at the same time; rank a 1 -a 2 The node of (1) is identified as a common node, has the option, and is not selected; rank a 2 -100% of the nodes are considered low credit nodes, have no election right, i.e. cannot participate in the election; wherein the content is 0 percent<a1<a2<100％。
Preferably, in the step (2) of the process of generating the management node according to the credit score, the first 0% -a is voted 1 And selecting a new management node from the nodes, and obtaining the node with the most approval tickets to select the management node. Nodes with authority to vote can vote in favor of a ticket, vote against the ticket and vote in abstain of the authority.
Preferably, in the step (3) of the process of generating the management node according to the credit score, the credit score of the node is adjusted according to the following method: (1) And (3) keeping the selected management node integrity in the management period, after the management period is finished, adding 1 minute of credit score to the node which approves the ticket by the management node, deducting 0.5 minute of credit score from the node which approves the ticket by the management node, and not deducting and not adding the points of the abandoning right. (2) And when the elected management node is not honest in the management period, after the management period is finished, deducting the credit score of 0.5 for the node which submits the vote to the management node, adding the credit score of 1 for the node which submits the vote to the management node, and not deducting and not adding the credit score of the abandoning right. (3) And if the elected management node is not good faith in the management period, deducting a credit score of 5 points from the management node after the management period is finished. And adding 1 point to all nodes which send negative information in the primary consensus and require to replace the management node. (4) And after the dishonest behavior of the managed node is confirmed, deducting 2 points of credit score from the managed node, and sending negative information to the management node and adding 0.5 point to the node indicating the dishonest node. (5) In the first-level consensus, when the denial information is sent to the management node and the node indicating the dishonest node does not reach the set value, the denial information is sent to the management node and the node indicating the dishonest node deducts 0.5 minutes. (6) In the first-level consensus, when the information of the management node required to be replaced does not reach the set value, 1 point is deducted from the node required to be replaced. (7) And when punishment is carried out on the class in the second-level consensus, the credit score of the node participating in the confirmation in the class is deducted by 1.
The specific analysis of the maliciousness degree of the node mainly considered by the limitation of increasing and deducting the score is as follows, as for the dishonest of the management node in the management period, the dishonest of the management node obviously has subjective intention and the dishonest of the management node causes great harm, so that the node is deducted by 5 points. For the dishonest of the managed node, the dishonest is also subjective and intentional, but the dishonest of the managed node causes less harm, so that the process of deducting 2 points is adopted for the dishonest of the managed node. For a management node to be dishonest within its management period, a node which votes on for the dishonest management node may be a loser, and therefore, a process of deducting 0.5 points is taken for it. When negative information is sent to a management node and the node which initiates the instruction control does not reach a set value, namely the instruction control is not established, the node which initiates the instruction control is discussed in two situations, wherein the first situation is that the node which initiates the instruction control is a dishonest node and hopes to obtain credit score in a dishonest instruction control mode, and the second situation is that the node which initiates the instruction control is a good node, but the misinstruction control is caused by negligence. Severe punishment should be carried out on the first type of nodes, but the supervision enthusiasm of the second type of nodes can be frustrated by the excessive punishment. Therefore, the penalty of the node without instruction control is set to be 0.5, the value which can be obtained when the instruction control is established is not exceeded, at the moment, the monitoring enthusiasm that the dishonest node is punished and the benevolent node is contorted due to the over-punishment can be avoided.
According to the analysis, the credit score adjusting method with strong operability is provided by reasonably setting the plus-minus score, so that all nodes can be encouraged to adhere to honesty, and malicious instruction can be effectively prevented.
Preferably, a default score is given to the newly added node, which may be set to 50, 60, or 70.
Example 7:
in the foregoing embodiment, a method for generating a management node according to a credit score is provided, but in actual operation, a better effect is often achieved by giving a material reward to an honest node and giving a material penalty to a dishonest node.
Preferably, the node is able to participate in the first level of consensus after having been pre-paid for a certain amount of integrity.
Preferably, the loss due to the managed node's dishonest is small, while the loss due to the managed node's dishonest is large. Thus, the node with the most pre-honest is acting as the managing node.
Preferably, the specific workflow for generating the management node according to the amount of the pre-loyalty money is as follows: after the management period expires, the node with the highest pre-honesty becomes the management node of the next management period. During the management period, the management node will end the management period in advance when: the management node is failed and cannot continuously perform management responsibilities; is judged to be dishonest during management. The managed node does not receive the information sent by the management node within the appointed time, namely the management node is considered to have a fault, and then a new round of the election process of the management node is started. At this time, the generation process of the management node is as follows: and comparing the integrity of the pre-deals of all the nodes except the current management node, wherein the node with the most pre-deals becomes the management node.
Preferably, the above set value may be set to 60%, 65%, or 70%.
The management node is selected according to the integrity money amount, so that the integrity money amount pre-paid by the management node is the largest, and the bad integrity money amount is the largest once the dishonest behavior occurs, so that the dishonest behavior of the management node can be effectively deterred, and huge loss caused by dishonest of the management node is prevented. In addition, for the promotion efficiency, the node voting link is omitted by directly comparing the amounts of the honest money, the election program is further simplified, and the quick generation of the management nodes is facilitated.
Preferably, the workflow of generating a level of consensus of the management nodes based on the amount of pre-paid honesty is the same as in example 6.
Preferably, in punishment of the dishonest node in the step (4) of the first-stage consensus working process, if a problem is considered and the problem is caused by dishonest of a certain managed node, a negative confirmation message is sent to the management node and indicates the dishonest node, and when the received instruction for the certain node reaches a set value, the dishonest node of the managed node is determined. At this time, the dishonest managed node is not paid with the integrity, and is required to renewedly reconcile the integrity and submit the corrected transaction, and the management node replans the consensus block and restarts a level of consensus. For the non-acceptable pre-loyalty money, all the nodes which send the repudiation information to the management node and indicate the malicious node are distributed according to the proportion of paying the loyalty money.
The working method can effectively supervise the managed nodes, guide all the nodes to do honest behaviors, and actively check errors and report the errors.
Preferably, the step of allocating the pre-paid honesty fund according to the proportion of the honesty fund payment specifically comprises the following steps: assuming that the amount of the non-receivable honesty is M, the number of the nodes which send the denial information and require to replace the management node is N, and the honesty of each node in the N nodes is N 1 、N 2 …N n Then the pre-loyalty point that can be obtained by the kth node is M k ＝M*N k /(N 1 +N 2 …+N n )。
By adopting the proportional distribution mode, all the nodes can be encouraged to pay more integrity, and the paying of more integrity helps to keep the nodes integrity, so the distribution mode is favorable for promoting the nodes to keep integrity.
Preferably, the above set value may be set to 60%, 65%, or 70%.
Preferably, in a punishment of the dishonest node in the step (4) of the first-stage consensus working process, if a problem is considered and the problem is caused by dishonest of the management node, sending denial information to other nodes in the class and requiring replacement of the management node, and when the information requiring replacement of the management node reaches a set value, determining that the management node is dishonest. At the moment, the pre-integrity of the dishonest management node is not collected, the dishonest management node is required to pay the integrity again, the management node replacement process is executed, and after the management node is replaced, the new management node plans the consensus block again and starts the first-level consensus again. For a non-acceptable pre-loyalty, all nodes that send a denial message and request a replacement management node are assigned the percentage of the loyalty. On one hand, the mechanism can effectively supervise the management node and prevent huge loss caused by the dishonest management node; on the other hand, more nodes can be encouraged to monitor due to full time.
Preferably, the above set value may be set to 60%, 65%, or 70%.
Preferably, the amount of loyalty money has a minimum requirement, but no upper limit. The integrity of all nodes is not guaranteed due to too low integrity cost, and the lowest cost of the integrity nodes can be guaranteed due to the minimum requirement.
Preferably, the second-level consensus workflow is that after the interaction chain receives the new blocks formed by each class, the management node on the interaction chain checks whether the blocks submitted by each block are correct, sends a confirmation message if the blocks are correct, and sends a denial message if errors are found. If the management node sending the confirmation message reaches the designated value, the interaction chain links the blocks of all classes together at one time to form a new block of the interaction chain, broadcasts the finally formed block and starts the next consensus period.
Preferably, if the management node that sent the confirmation message does not reach the specified value, the processing is performed in one of the following two ways: (1) When a block submitted by a class contains error transactions and the number of nodes participating in confirmation in the class exceeds a set value, punishment is carried out on the class, specifically, the integrity of the nodes participating in confirmation in the class is not received, the nodes participating in confirmation are required to pre-commit the integrity again, and a management node is informed to submit the corrected block. For a non-acceptable pre-loyalty, it is assigned by the management node that found the error on the interaction chain. (2) When a block submitted by one class contains error transactions and the number of the nodes participating in confirmation in the class does not exceed a set value, judging that the management node is not honest, punishing the management node of the class, specifically, not receiving the honesty of the dishonest management node, paying the honesty again, executing a management node replacement process, and after the management node is replaced, drawing up a consensus block again by a new management node.
Preferably, the above set value may be set to 60%, 65%, or 70%.
Preferably, for a non-repudiation credit, the management node on the interaction chain that found the error is allocated in proportion to the repudiation credit.
In the second level consensus, because only the management node can participate in the allocation of the confident pre-loyalty money, more managed nodes are willing to participate in the competition of the management node by increasing the amount of the pre-loyalty money. Furthermore, only the trustworthy nodes that found the error may be allocated. Therefore, the system provided by the invention can guide the management node to keep integrity to participate in the distribution of the confident pre-integrity money, and avoids the high pre-integrity money from being confident due to the dishonest.
Example 8:
in order to fully utilize the advantages of the two management node generation methods in embodiment 6 and embodiment 7, the present embodiment combines the features of the two methods to provide a hybrid management node generation method.
Preferably, the workflow of the first-level consensus of the hybrid-based management node generation method is the same as that of embodiment 6.
Preferably, in a punishment of the dishonest node in the step (4) of the primary consensus working process, if a problem is considered and the problem is caused by dishonest of a managed node, a negative information is sent to the management node and indicates the managed node as a dishonest node, and when the received instruction for the certain node reaches a set value, the managed node is determined to be dishonest. At this time, the pre-loyalty points of the dishonest managed nodes are not collected, the pre-loyalty points are re-collected, the corresponding credit scores are deducted, the corrected transaction is required to be submitted, the management nodes draft the consensus blocks again, and primary consensus is started again. And correspondingly increasing credit scoring operation for all nodes which send negative information to the management node and indicate the dishonest nodes. And when the negative confirmation information is sent to the management node and the node of the dishonest node does not reach the set value, namely the instruction control is proved to be wrong, deducting the node credit score which sends the negative confirmation information and requires to replace the management node. For the non-acceptable pre-loyalty money, all the nodes which send negative information to the management node and indicate the malicious node are distributed according to the proportion of paying the loyalty money.
Preferably, the set value in the previous paragraph may be set to 60%, 65% or 70%.
Preferably, in a punishment of the dishonest node in the step (4) of the primary consensus working process, if a problem is considered and the problem is caused by dishonest of the management node, sending denial information to other nodes in the class and requiring replacement of the management node, and when the information requiring replacement of the management node reaches a set value, determining that the management node is dishonest. At the moment, the pre-integrity fund of the dishonest management node is not collected, the dishonest management node is required to pay the integrity fund again, the corresponding credit score of the dishonest management node is deducted, the management node replacement process is executed, and after the management node is replaced, a consensus block is drawn up again by a new management node and primary consensus begins again. And performing corresponding credit score increasing operation on all nodes which send the negative acknowledgement information and require to replace the management node. And when the information of the management node required to be replaced does not reach the set value, namely the instruction control is proved to be wrong, deducting the node credit score which sends the denial information and requires to replace the management node. For the non-acceptable pre-loyalty money, all the nodes which send the negative information and require to replace the management node are distributed according to the proportion of the loyalty money.
Preferably, the set value in the previous paragraph may be set to 60%, 65% or 70%.
Preferably, the second-level consensus workflow is that, after the interaction chain receives the new blocks formed by each class, the management node on the interaction chain checks whether the blocks submitted by each block are correct, sends a confirmation message if the blocks submitted by each block are correct, and sends a negative confirmation message if errors are found. If the management node sending the confirmation message reaches the designated value, the interaction chain links the blocks of all classes together at one time to form a new block of the interaction chain, broadcasts the finally formed block, and starts the next consensus period.
Preferably, if the management node that sent the confirmation message does not reach the specified value, the processing is performed in one of the following two ways: (1) When a block submitted by a class contains error transactions and the number of nodes participating in confirmation in the class exceeds a set value, punishment is carried out on the class, specifically, integrity of the nodes participating in confirmation in the class is not received, the nodes participating in confirmation are required to pay the integrity again, credit scores of the nodes participating in confirmation in the class are deducted, and a management node is informed to submit the corrected block. (2) When a block submitted by a class contains error transactions and the number of nodes participating in confirmation in the class does not exceed a set value, the management node is judged to be dishonest, the management node of the class is punished, specifically, the dishonest management node is not paid with the dishonest gold, the dishonest management node is required to pay the dishonest gold again, the credit score of the management node in the class is deducted, a management node replacement process is executed, and after the management node is replaced, a new management node is used for drawing up a consensus block again.
Preferably, the set value in the previous paragraph may be set to 60%, 65% or 70%.
Preferably, the method of generating a management node according to a credit score includes the steps of: (1) determining the election authority of each node according to the scores; (2) Determining a management node in the nodes with the elected right according to the node pre-loyalty money amount; (3) And adjusting the credit scores of the nodes according to the situation during management.
Preferably, the step (1) of generating the hybrid management node includes the steps of sorting the credit scores of all the nodes in the class to form a sorting table, and ranking the top 0% -b 1 The node(s) of (2) is considered as a high-credit node and can participate in election as a preliminary management node, wherein 0 percent<b 1 <100％。
Preferably, in the hybrid management node generating step (2), the credit score is ranked first 0% -b 1 The nodes in (2) are sorted according to the amount of the pre-loyalty money, and the electing management node with the highest amount of the pre-loyalty money is selected.
Preferably, the score adjustment method in the hybrid management node generation step (3) is the same as that in embodiment 6.
Preferably, a default score is given to the newly added node, which may be set to 50, 60, or 70.
By adopting the management node generation method provided by the embodiment, the waste of time and calculation power caused by organizing voting can be avoided, and a new management node can be determined through sequencing. In addition, the method provided in this embodiment ensures that the node serving as the management node has a higher trust score, that is, a higher reliability; on the other hand, the node with the highest integrity money amount can serve as the management node to ensure that the management node pays the maximum cost once the management node performs the dishonest action, so that the conversion from the integrity node to the dishonest node is further prevented.
Example 9
In order to fully utilize the advantages of the two management node generation methods in embodiment 6 and embodiment 7, the present embodiment combines the features of the two methods to provide a hybrid management node generation method.
Preferably, the workflow of the first-level consensus of the hybrid-based management node generation method is the same as that of embodiment 8.
Preferably, the punishment of the dishonest node in step (4) of the one-stage consensus operation process is the same as that of embodiment 8.
Preferably, the workflow of the second-level consensus is the same as in example 8.
Preferably, the generation step of the hybrid management node is as follows: (1) determining the election authority of each node according to the scores; (2) Determining a management node in the nodes with the election right according to the node pre-loyalty money amount and the credit score; (3) And adjusting the credit scores of the nodes according to the situation during management.
Preferably, the step (1) of generating the hybrid management node includes the steps of sorting the credit scores of all the nodes in the class to form a sorting table, and ranking the top 0% -c 1 The node(s) of (1) is identified as a high-credit node and can participate in elections as a preliminary management node, wherein 0 percent of the total<c 1 <100％。
Preferably, in the step (2) of generating the hybrid management node, assuming that there are V nodes with credit scores ranked first 0% -c1, firstly, a credit score ranking list a of the V nodes is obtained, and secondly, a honest money payment ranking list B of the V nodes is obtained, then the comprehensive score of the node W is as follows:
Z＝s 1 *A W +s 2 *B W
wherein: s 1 、s 2 For credit scoring coefficient, loyalty factor, s 1 >0，s 2 >0，s 1 +s 2 ＝1；
A W The score corresponding to the ranking rank in the credit scores of the node W is the score corresponding to the 1 st ranking rank, and the score corresponding to the 1 st ranking rank is the highest, and is sequentially reduced by 1, for example: the score corresponding to the 1 st name is V, the score corresponding to the 2 nd name is V-1, the score corresponding to the 3 rd name is V-2, and the rest can be done in the same way;
B W the score corresponding to the rank ranking rank of the node W in the honest amount is the 1 st score, and is sequentially subtracted by 1, for example: the score corresponding to the 1 st name is V, the score corresponding to the 2 nd name is V-1, the score corresponding to the 3 rd name is V-2, and the rest can be done in the same way;
and sorting according to the magnitude of the comprehensive score Z value, and selecting the node with the maximum comprehensive score Z value as the selected management node.
Preferably, s can be used in the case of low mutual trust between nodes 1 The value is set to be small, s 2 The value is set to be larger. For example, mixing s 1 The value is set to 0.2 and the s2 value is set to 0.8. Preferably, s can be assigned to the node in case of complete distrust between the nodes 1 The value is set to 0.1,s 2 Set the value to 0.9, even s 1 The value is set to 0,s 2 The value is set to 1.
Preferably, s can be used under the condition of high mutual trust degree between nodes 1 The value is set to be small, s 2 The value is set to be larger. For example, mixing s 1 The value is set to 0.8,s 2 The value is set to 0.2.
Preferably, the adjustment method of credit score in the hybrid management node generation step (3) is the same as that in embodiment 8.
Preferably, a default score is given to the newly added node, which may be set to 50, 60, or 70.
By adopting the technical scheme in the embodiment, the corresponding credit scoring coefficient and the corresponding payment honest coefficient can be dynamically adjusted according to the trust condition between the nodes so as to meet the requirement of risk control. Specifically, in the case where the degree of mutual trust is low, s is increased 2 Value, guarantee the amount of honest money as the guideThe management node elects a policy. Correspondingly, under the condition of higher mutual trust degree, s is increased 1 The method has the advantages that the selection strategy of the management node with the credibility as the guide is ensured, and the fund pressure of the high-integrity money on the node can be reduced under the condition of ensuring the integrity of the management node.
The above embodiments are only used to illustrate the present invention and not to limit the technical solutions described in the present invention, and although the present invention has been described in detail in the present specification with reference to the above embodiments, the present invention is not limited to the above specific embodiments, and therefore, any modifications or equivalents of the present invention may be made; but all technical solutions and modifications thereof without departing from the spirit and scope of the present invention are encompassed in the claims of the present invention.

Claims (5)

1. An electronic device wide area management system based on block chain technology is characterized in that: the system comprises an interaction chain, wherein nodes of the interaction chain consist of management equipment of each equipment management chain, cloud storage equipment of electronic equipment and equipment for providing various services;
the management of the nodes is realized by adopting a classified management mode; determining a management node in each class of nodes, wherein the management node is used for managing transactions in the class; the management nodes are dynamically changing;
within the management period, the management node will end the management period in advance when: the management node is failed and cannot continuously perform management responsibilities; judging the management process to be dishonest, and entering a new round of election process of the management node when the management period is finished in advance;
the consensus is completed by adopting a two-stage consensus mode, wherein the two-stage consensus comprises a first-stage consensus and a second-stage consensus; in the first-level consensus, each class processes the transaction in the class and forms a new block; each class sends the formed new block to an interaction chain through a management node so as to carry out secondary consensus;
the first-level consensus work flow comprises the following steps that (1) the management node connects the transactions of all nodes in the managed classes to form a block to be subjected to consensus; (2) The management node sends a block to be identified to the managed node; (3) Checking whether the block to be identified is correct or not by other nodes in the same class, wherein the checked contents comprise whether the contents of each transaction are correct or not and whether the hash value of each transaction is correct or not; (4) If the management node is confirmed to be correct, sending a confirmation message to the management node; if the error is confirmed, entering punishment of the dishonest node; (5) When the confirmation information received by the management node reaches a set value, the management node submits the block in the step (1) to an interaction chain;
in punishment of the dishonest node in the step (4) of the primary consensus working process, if a problem is considered to exist and the problem is caused by dishonest of a managed node, transmitting denial information to the management node and indicating the managed node as a rogue node, and when the received instruction control aiming at a certain node reaches a set value, judging that the managed node is dishonest; at the moment, after deducting the program score, the management node is required to submit the corrected transaction, and the management node replans the consensus block and restarts primary consensus; performing corresponding credit score increasing operation on all nodes which send negative information and indicate the dishonest nodes to the management node; when negative information is sent to the management node and the node of the dishonest node does not reach a set value, namely the instruction control is proved to be wrong, deducting the node credit score which sends the negative information and requires to replace the management node;
in punishment of the dishonest node in the step (4) of the primary consensus working process, if a problem is considered to exist and the problem is caused by dishonest of the management node, sending denial information to other nodes in the class and requiring to replace the management node, and when the information requiring to replace the management node reaches a set value, judging that the management node is dishonest; at the moment, deducting the corresponding credit score of the dishonest management node, executing a management node replacement process, and after the management node is replaced, drawing up a consensus block by a new management node again and starting primary consensus again; performing corresponding credit score increasing operation on all nodes which send the denial information and require to replace the management node; when the information of the management node required to be replaced does not reach a set value, namely the instruction control is proved to be wrong, deducting the node credit score which sends the denial information and requires to replace the management node;
the second-level consensus work flow is that after the interaction chain receives new blocks formed by various classes, the management node on the interaction chain checks whether the blocks submitted by the various blocks are correct, if yes, a confirmation message is sent, and if errors are found, a denial message is sent; if the management node sending the confirmation message reaches the designated value, the interaction chain links the blocks of all classes together at one time to form a new block of the interaction chain, broadcasts the finally formed block and starts the next consensus period;
if the management node sending the confirmation message does not reach the specified value, the processing is carried out according to one of the following two modes: (1) When the block submitted by one class contains error transaction and the number of the nodes participating in confirmation in the class exceeds a set value, punishing the class, specifically, deducting credit scores of the nodes participating in confirmation in the class and informing the management node of submitting the corrected block; (2) When a block submitted by a class contains error transactions and the number of nodes participating in confirmation in the class does not exceed a set value, judging that a management node is not honest, punishing the management node of the class, specifically, deducting credit scores of the management node in the class, executing a management node replacement process, and after the management node is replaced, drawing up a consensus block again by a new management node;
the management node is generated by adopting the following method: generating a management node according to the credit score;
the method for generating the management node according to the credit score comprises the following steps: (1) determining the election authority of each node according to the scores; (2) electing to generate a new management node; (3) Adjusting credit scores of all nodes according to the condition in the management period;
the step (1) of the process of generating the management nodes according to the credit scores comprises the following steps of sequencing the credit scores of all nodes in the class to form a sequencing table, wherein the node with the 0% -a1 highest ranking is regarded as a high credit node and is used as a preparation management node to participate in election, and the node has the right of election and the right of election at the same time; the nodes with the ranks a1-a2 are considered as common nodes and have election rights, but not have election rights; nodes with the rank of a2-100% are considered as low-credit nodes, and have no election right, and no election right, namely, the nodes cannot participate in election; wherein 0% < a1< a2<100%;
in the step (2) of the process of generating the management nodes according to the credit scores, selecting a new management node from the front 0% -a1 nodes in a voting mode, and obtaining a node electing management node with the most votes; the nodes with the right voting can vote for approval, disapproval and abandon the right;
in the step (3) of the process of generating the management node according to the credit score, the credit score of the node is adjusted according to the following method: (1) If the elected management node keeps integrity in the management period, after the management period is finished, adding 1 minute of credit score to the node which approves the ticket by the management node, deducting 0.5 minute of credit score from the node which approves the ticket by the management node, and not deducting and not adding a score when the right is abandoned; (2) When the elected management node is not honest in the management period, after the management period is finished, deducting credit score of 0.5 minutes from the node which submits the vote to the management node, adding credit score of 1 minute to the node which submits the vote to the management node, and not deducting or not deducting the right; (3) If the elected management node is not honest in the management period, deducting 5 points of credit score from the management node after the management period is finished; adding 1 point to all nodes which send negative information in the primary consensus and require to replace the management node; (4) The managed node is not honest in a management period, after the dishonest behavior is confirmed, credit score is deducted for 2 points from the managed node, and denial information is sent to the management node and 0.5 point is added to the node indicating the dishonest node; (5) In the first-level consensus, when negative information is sent to the management node and the node indicating the dishonest node does not reach a set value, the negative information is sent to the management node and the node indicating the dishonest node is deducted for 0.5 min; (6) In the first-level consensus, when the information of the management node required to be replaced does not reach a set value, 1 point is deducted from the node required to be replaced; (7) And when punishment is carried out on the class in the second-level consensus, the credit score of the node participating in the confirmation in the class is deducted by 1.
2. The wide area management system for electronic devices based on blockchain technology as claimed in claim 1, wherein: each node is provided with a permission management list which records node details capable of initiating transactions to the node; each class is provided with a permission management list set which is a set of all permission management lists in the class; each node can add, delete and modify the content related to the self transaction authority part in the authority management list set; when a management node receives a transaction, firstly, whether a transaction receiver of the transaction is in the managed node is confirmed, and if not, the transaction is sent to other management nodes in other classes on the chain; when a management node receives a transaction, firstly, whether a transaction receiver of the transaction is in a node managed by the management node is confirmed, if so, whether an initiator of the transaction is in a right management list set of the node is checked, if so, the transaction is sent to the transaction receiver and other management nodes on a chain are informed that the transaction is accepted, if not, the transaction is processed, and the processing result is rejection and other management nodes on the chain are informed that the transaction is processed; all received transactions will be stored by the management node, which integrates all transactions within one management period and organizes the creation of new tiles.
3. The wide area management system for electronic devices based on blockchain technology as claimed in claim 2, wherein: the following transaction types are included in the interaction chain: archiving transactions, parameter request transactions.
4. The wide area management system for electronic devices based on blockchain technology as claimed in claim 3, wherein: the archiving transaction is used for storing relevant data in the electronic equipment at a specified storage position, and the workflow of the archiving transaction is as follows: the method comprises the following steps that an archiving request device initiates an archiving request transaction and sends the archiving request transaction to a management device of the archiving request device, and the management device confirms and converts the format of the archiving request transaction and then sends the archiving request transaction to a management node of the archiving request device; after receiving the transaction of the archiving request, the management node of the node where the archiving request equipment is located broadcasts the transaction; after receiving the archiving request transaction, the management node on the chain firstly confirms whether a transaction receiver of the archiving request transaction is in the node managed by the management node, and if not, the archiving request transaction is sent to other management nodes on the chain; if the transaction is in the authority management list, checking whether the archiving request device of the transaction is in the authority management list, if so, sending the transaction to the management device of the storage device, signing the archiving request transaction by the management device of the storage device, and sending the signed transaction to the management node of the storage device so as to store the transaction in an interaction chain; at this time, the management device of the filing request device stores the parameters to be stored into the specified storage device through a data transmission protocol;
the parameter request transaction is used for acquiring parameters acquired by the electronic equipment, and the workflow of the parameter request transaction is as follows: the parameter request equipment initiates a parameter request transaction and sends the parameter request transaction to the management equipment of the request equipment, and after the management equipment of the parameter request equipment confirms and converts the format of the transaction, the transaction is sent to the management node of the parameter request equipment; after receiving the transaction, the management node of the node where the parameter request equipment is located broadcasts the transaction; after receiving the parameter request transaction, the management node on the chain firstly confirms whether the requested equipment of the transaction of the parameter request transaction is in the nodes managed by the management node, and if not, the management node sends the parameter request transaction to other management nodes on the chain; if the transaction is in the authority management list, whether the parameter request equipment of the transaction is in the authority management list is checked, if the transaction is in the authority management list, the transaction is sent to the management equipment of the node, the requested node management equipment signs the parameter request transaction, and sends the signed transaction to the management node of the requested node management equipment so as to store the transaction in an interaction chain, at the moment, the management equipment of the requested electronic equipment acquires the parameters from the requested electronic equipment and then sends the acquired parameters to the parameter request equipment through a data transmission protocol.
5. An electronic device management system based on block chain technology is characterized in that: an electronic device wide area management system based on block chain technology according to any one of claims 1 to 4, wherein the nodes on the wide area network are managed.
CN202010398269.5A 2020-05-12 2020-05-12 Electronic equipment wide area management system based on block chain technology Active CN111741061B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010398269.5A CN111741061B (en) 2020-05-12 2020-05-12 Electronic equipment wide area management system based on block chain technology

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010398269.5A CN111741061B (en) 2020-05-12 2020-05-12 Electronic equipment wide area management system based on block chain technology

Publications (2)

Publication Number Publication Date
CN111741061A CN111741061A (en) 2020-10-02
CN111741061B true CN111741061B (en) 2023-03-28

Family

ID=72647150

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010398269.5A Active CN111741061B (en) 2020-05-12 2020-05-12 Electronic equipment wide area management system based on block chain technology

Country Status (1)

Country Link
CN (1) CN111741061B (en)

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109766673A (en) * 2019-01-18 2019-05-17 四川大学 A kind of alliance's formula audio-video copyright block catenary system and audio-video copyright cochain method
CN109785136A (en) * 2019-01-30 2019-05-21 北京京东尚科信息技术有限公司 A kind of transaction processing method of block chain, client and block chain network
CN110266655A (en) * 2019-05-30 2019-09-20 中国工商银行股份有限公司 A kind of across chain interconnected method, equipment and system based on block chain
CN110633142A (en) * 2019-07-30 2019-12-31 思力科（深圳）电子科技有限公司 Block chain consensus method, management node, electronic device, and storage medium
CN110677485A (en) * 2019-09-30 2020-01-10 大连理工大学 Dynamic layered Byzantine fault-tolerant consensus method based on credit
CN110945853A (en) * 2018-12-07 2020-03-31 北京大学深圳研究生院 Method for generating and managing multimode identification network based on alliance chain voting consensus algorithm

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US11146380B2 (en) * 2017-08-03 2021-10-12 Parity Technologies Ltd. Methods and systems for a heterogeneous multi-chain framework

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110945853A (en) * 2018-12-07 2020-03-31 北京大学深圳研究生院 Method for generating and managing multimode identification network based on alliance chain voting consensus algorithm
CN109766673A (en) * 2019-01-18 2019-05-17 四川大学 A kind of alliance's formula audio-video copyright block catenary system and audio-video copyright cochain method
CN109785136A (en) * 2019-01-30 2019-05-21 北京京东尚科信息技术有限公司 A kind of transaction processing method of block chain, client and block chain network
CN110266655A (en) * 2019-05-30 2019-09-20 中国工商银行股份有限公司 A kind of across chain interconnected method, equipment and system based on block chain
CN110633142A (en) * 2019-07-30 2019-12-31 思力科（深圳）电子科技有限公司 Block chain consensus method, management node, electronic device, and storage medium
CN110677485A (en) * 2019-09-30 2020-01-10 大连理工大学 Dynamic layered Byzantine fault-tolerant consensus method based on credit

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
一种基于分组的区块链共识算法;张思贤等;《计算机应用与软件》;20200331(第03期);第1-6页 *
许可链多中心动态共识机制;闵新平等;《计算机学报》;20180531(第05期);第1-16页 *

Also Published As

Publication number Publication date
CN111741061A (en) 2020-10-02

Similar Documents

Publication Publication Date Title
CN111695994B (en) Block chain consensus method and system based on credit score
AU2022202133B2 (en) Systems and methods for creating a universal record
CN109214818B (en) Cross-chain transaction method and device
US10230711B2 (en) System and methods for enhancing authentication procedures in an anti-fraud environment
US9858574B2 (en) Verification methods for fraud prevention in money transfer receive transactions
JP6075153B2 (en) Processing server and transfer management method
CN109325848B (en) Debt collection urging method and device based on block chain and computer readable storage medium
CN106845210A (en) Event authentication method and apparatus
US20120030115A1 (en) Systems and methods for preventing fraudulent banking transactions
CN108769230A (en) Transaction data storage method, device, server and storage medium
CN105590215A (en) Device and method for data processing on-line processing of date mistakes between mechanisms
CN109347877B (en) Block chain structure storage controlling method
US20050075912A1 (en) Computerized settlement method
CN111695997B (en) Block chain consensus method and system based on node credit scoring and pre-cross loyalty
CN111741061B (en) Electronic equipment wide area management system based on block chain technology
CN110930158A (en) Block chain DPoS common recognition method based on reward and punishment mechanism
CN110599384A (en) Organization relation transfer method, device, equipment and storage medium
CN111741062B (en) Electronic equipment local area management system based on block chain technology
CN111695996B (en) Block chain consensus method and system based on pre-crossing honest gold
CN111695995B (en) Electronic equipment management system based on block chain technology
CN111899094A (en) Block chain consensus method and system based on node credit scoring and pre-loyalty points
CN112235251A (en) Block chain management method and device, computer equipment and storage medium
KR20210109767A (en) A method for providing asset backup services based on blockchain monitoring
CN111815175B (en) Five-layer structure XML language interactive application method in nested list form
CN107424067A (en) One kind holds collection of letters breath Online Processing System and method

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
TA01 Transfer of patent application right
TA01 Transfer of patent application right

Effective date of registration: 20230117

Address after: 424, Qingfeng Rongsheng Venture Capital Building, 88-8 Baguasan Road, Shanglin Community, Yuanling Street, Futian District, Shenzhen, Guangdong 518000

Applicant after: Shenzhen Zhengneng Information Technology Co.,Ltd.

Address before: 610000 Shunsheng Road, Zhengxing Street, Tianfu New District, Chengdu City, Sichuan Province

Applicant before: Chengdu Xinyu Matrix Technology Co.,Ltd.

GR01 Patent grant
GR01 Patent grant