CN115733841A - Block chain dynamic fragmentation expansion method based on image flow segmentation - Google Patents
Block chain dynamic fragmentation expansion method based on image flow segmentation Download PDFInfo
- Publication number
- CN115733841A CN115733841A CN202211424549.4A CN202211424549A CN115733841A CN 115733841 A CN115733841 A CN 115733841A CN 202211424549 A CN202211424549 A CN 202211424549A CN 115733841 A CN115733841 A CN 115733841A
- Authority
- CN
- China
- Prior art keywords
- transaction
- nodes
- node
- graph
- epoch
- 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.)
- Pending
Links
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a block chain dynamic fragmentation expansion method based on graph flow segmentation, wherein the dynamic fragmentation expansion is that a block chain dynamically updates the fragmentation state according to the current network condition; the graph flow segmentation is to segment the whole transaction state graph, namely the block chain node network according to a graph data flow segmentation algorithm so as to achieve the purpose of segmentation, wherein the graph data flow is formed by taking an input party and an output party of each transaction as two end nodes of one edge, and all generated transactions; the method is carried out according to epoch (generation) periods, each epoch period comprises a transaction packing and state updating process, and after one epoch, the fragmentation state changes according to a transaction diagram, so that the problems of low efficiency, large security challenge, more fragment-spanning transactions, low fragment-spanning processing efficiency and the like in the conventional block chain scheme are solved; the invention improves the block chain service throughput, reduces the chain-crossing proportion and balances the load as much as possible on the premise of ensuring the safety.
Description
Technical Field
The invention belongs to the field of block chain technology and distributed storage, and particularly relates to a block chain dynamic fragmentation expanding method based on graph flow segmentation.
Background
The blockchain technology is based on peer-to-peer networks, but the performance improvement in the blockchain is seriously affected by the weak scalability. The fragmentation technology is a practical block chain horizontal expansion scheme. By dividing the block chain network into a plurality of fragments and processing transactions among different fragments in parallel, the overall transaction throughput and processing rate of the system can be improved; the Byzantine consensus usually needs multiple rounds of message transmission and return, the complexity of the Byzantine consensus exponentially rises with the number of nodes in the network, the number of nodes in each sub-slice is smaller than that of the nodes in the whole, and the consensus speed can be greatly improved.
However, the number of fragments is not much and good, and the number of nodes in each fragment and the security are in an inverse exponential relationship under the condition that the probability of malicious nodes is equal. In addition, in an actual system, a node is not stable and does not always remain in a fragmentation state in a dynamic node in and out state. The change of the slicing state is accompanied with the copying and the transfer of the data, and it is expected that nodes which frequently trade with each other can be in the same slicing more, so as to achieve the effects of reducing cross-slicing trading and load balancing.
Currently, the processing of cross-piece transactions in block chain fragmentation by mainstream generally comprises client active maintenance, trace labeling, transaction splitting and the like; the most typical transaction splitting scheme represented by Ethereum cuts the transfer process of a transaction, divides the transfer process into a sending process and a receiving process, and completes the two processes in different consensus periods, but the method destroys the atomicity of the transaction and is not mature at present.
Disclosure of Invention
The invention provides a block chain dynamic fragmentation expansion method based on graph flow segmentation, which aims to solve the problems of low efficiency, large security challenge, more cross-chip transactions, low cross-chip processing efficiency and the like in the existing block chain scheme; the invention improves the block chain service throughput, reduces the chain-crossing proportion and balances the load as much as possible on the premise of ensuring the safety.
In order to solve the technical problems, the technical scheme of the invention is as follows:
a block chain dynamic fragmentation expanding method based on image flow segmentation comprises the steps that dynamic fragmentation expansion is carried out, namely, a block chain dynamically updates a fragmentation state according to the current network condition; the graph flow segmentation is to segment the whole transaction state graph, namely the block chain node network according to a graph data flow segmentation algorithm so as to achieve the purpose of segmentation, wherein the graph data flow is formed by taking an input party and an output party of each transaction as two end nodes of one edge, and all generated transactions; the method is carried out according to epoch (generation) periods, each epoch period comprises transaction packaging and state updating processes, and after one epoch, the fragmentation state changes according to a transaction diagram, so that the effects of load balancing and safety risk reduction are achieved. Specifically, the method comprises the following steps:
the method comprises the following steps: the node calculates a Target Nonce value according with the current Target by operating a hash function, and performs modular operation according to the current fragment number, the obtained result is the serial number of the fragment to which the node belongs, the node needs to initiate an admission transaction, and the node can initiate a formal transaction at the next epoch after the transaction is successfully packed into a block;
step two: in the transaction process, each fragment packs transaction data in the fragment transaction pool and generates a block, the front of the first transaction block of each epoch is a state block of the previous epoch, the block structure of the whole system is in a topological graph structure, and each epoch converges to one state block;
step three: performing graph flow partitioning algorithms
Each node continuously reads transaction information from a newly generated block and updates the state diagrams of all the current nodes, when the epoch is finished, the state diagrams can be determined at the same time, the transaction information is used as the input of a graph flow segmentation algorithm, and the transaction information comprises the state diagrams and transaction accounts;
step four: after the image state and the account are divided in the third step, the block chain system achieves consensus on the division result, the consensus at the stage adopts a PBFT algorithm, and a state block is generated and used as a convergence block of all current fragments to represent the end of the current epoch;
step five: after the status blocks of the current epoch agree, the associated segment changes after status transition according to the block content, so as to start a new round of transaction.
Preferably, the nodes include a common node and a committee node, the common node is used for initiating a transaction node, and the committee node constitutes a committee which is respectively used for processing the calculation of cross-piece transaction and slice state reconstruction.
Preferably, in the second step, the PBFT consensus algorithm is used for sorting the blocks in the topological graph-like structure, and the number of blocks generated in an epoch depends on the current network status.
Preferably, in the second step, for the cross-slice transaction, the committee node is used as an intermediary to combine the transaction locking and the double confirmation mechanism to ensure the atomicity of the cross-slice transaction.
Preferably, the committee nodes are formed by pledging a specified number of tokens to qualify for election, and the remaining nodes may vote to elect committees, each shard including at least one committee member.
Preferably, in the second step, the basis for executing the graph flow segmentation algorithm is as follows: load balancing between fragments, security of the blockchain system, and communication cost of replication between fragments.
Preferably, an HDRF-P graph flow segmentation algorithm is adopted, the sub-graph (sub-segment) to which the associated edge is divided is judged according to the degree information of the node, the optimization process of segmentation is the minimum segmentation of the trading graph, the minimum segmentation can reduce the communication cost among the nodes, the load of a plurality of nodes and the load of the nodes in the distributed system can be balanced, and overheating caused by too high load of a few nodes and the segment is avoided. In the process of optimizing the optimal solution according to the transaction flow, a boundary condition, namely security guarantee, is also considered, the number of each fragment cannot be lower than a threshold, otherwise, the fragments are controlled to generate a security problem.
Preferably, the HDRF-P algorithm is based on an HDRF stream segmentation algorithm
Input v of the algorithm 1 ,v 2 N represents two points of an edge, respectively, the total number of nodes, the number of nodes and the PBFT algorithm are based on the number of nodes since the HDRF algorithm needs to give the number of divisionsAnd (4) safety guarantee:
n＝3f+1
wherein n represents the total number of nodes, and f represents the number of Byzantine nodes;
a number of divisions k may be found, where N represents the total number of nodes and μ represents the proportion of malicious nodes:
when one edge is allocated, calculating an objective function value for each subgraph, selecting the subgraph with the highest value to be allocated, wherein the objective function consists of two parts,
first part
The weight of the punishment item for the size of the subgraph is controlled by a coefficient lambda;
the second part
Showing the subgraph versus two points v 1 ,v 2 If either is not included, it is 0, if one is included, within the interval (1, 2), if both are included, it is maximum 3, and if only one is included, the calculation method g (v) according to is 1 I) points with a lower degree have a higher value, so as to realize the preferential division of points with a higher degree,
in addition, a constraint is additionally added to the segmentation to which the selection edge belongs:
the invention has the following characteristics and beneficial effects:
by adopting the technical scheme, the dynamic fragmentation expansion is that the fragmentation state can be dynamically adjusted according to the transaction density of the current system, the total node number and the load balancing strategy; the common recognition of parallelization is carried out through the segmentation so as to improve the transaction processing peak value performance of the system; the dynamic fragmentation state adjustment can ensure that the safety of the block chain is kept in an allowable range, and meanwhile, the balance of the replication cost and load balance among the fragments is pursued; the cross-piece transaction is that the pieces of an account related to one transaction in the block chain system belong to different pieces, and when the cross-piece problem is processed, a committee is adopted as a middle person, and the efficiency is improved by combining the modes of account locking and the like through a method of changing space and time; the fragmentation of the system is realized by a graph data flow segmentation algorithm, each transaction is used as one edge of a global transaction graph and input into the graph flow segmentation algorithm, the conversion of the fragmentation state is realized, the performance, the throughput and the safety of the whole system can be effectively improved, in addition, the processing is carried out according to an epoch period, each epoch period comprises a transaction packing and state updating process, and after one epoch, the fragmentation state can change according to the transaction graph, so that the effects of load balancing and safety enhancement are achieved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the description of the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a global architecture diagram according to an embodiment of the present invention.
FIG. 2 is a flow chart of a graph partitioning algorithm applied in an embodiment of the present invention.
Detailed Description
It should be noted that the embodiments and features of the embodiments of the present invention may be combined with each other without conflict.
In the description of the present invention, it is to be understood that the terms "center", "longitudinal", "lateral", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inner", "outer", and the like, indicate orientations or positional relationships based on those shown in the drawings, and are used only for convenience in describing the present invention and for simplicity in description, and do not indicate or imply that the referenced devices or elements must have a particular orientation, be constructed and operated in a particular orientation, and thus, are not to be construed as limiting the present invention. Furthermore, the terms "first", "second", etc. are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first," "second," etc. may explicitly or implicitly include one or more of that feature. In the description of the present invention, "a plurality" means two or more unless otherwise specified.
In the description of the present invention, it should be noted that, unless otherwise explicitly specified or limited, the terms "mounted," "connected," and "connected" are to be construed broadly, e.g., as meaning either a fixed connection, a removable connection, or an integral connection; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood by those of ordinary skill in the art through specific situations.
The invention provides a block chain dynamic slicing expansion method based on a graph flow slicing algorithm, as shown in figure 1, the system is divided into a common node and a committee node, the common node is a node for initiating a transaction, the committee node forms a committee, and the committee has two functions, namely, the calculation for processing cross-piece transactions and slicing state reconstruction. The system takes an epoch as a period, and the fragmentation state can be dynamically changed in each period; at each epoch, committee elections, transaction packaging (including cross-slice transactions), graph partitioning, and slice state transitions are involved.
The committee elects to compete for nodes that become committees by pledging certain tokens to obtain the right to be elected, and the rest of the common nodes select committee members by election, the committee requiring that each segment contains at least one committee member.
And the transaction packing is also the process that miners in the segments sort and block the transactions in the current epoch transaction pool, the consensus is based on the PBFT algorithm, for the cross-segment transaction in the transaction, the committee node generates and locks the certification, and then the certification is sent to another segment to realize the step-by-step cross-segment.
And the graph is divided, in the process of packaging the transactions in all the fragments, the generated confirmed transactions are used as the edge generation graph flow input of the transaction graph, and according to a graph flow division algorithm: the load of the fragments with overheating transaction is balanced to the fragments with lower heat, the transaction is kept in the fragments as much as possible according to the locality principle, so that the cross-fragment transaction is reduced, and the number of nodes of each fragment cannot be lower than a safety threshold. After segmentation, the status block for the next epoch is generated and broadcast to all slices.
And the state conversion is to update the state according to the new state diagram, so as to obtain the slicing state and committee of the next round.
The specific implementation steps are as follows:
the method comprises the following steps: the node obtains a legal Nonce by operating the POW algorithm, the result is added into a transaction pool as a transaction, the admission information is packaged when the epoch generates a block and takes effect in the next epoch, the segment to which the node belongs is obtained by taking the current segment number according to the Nonce result, and the node can normally conduct transaction behaviors.
Step two: nodes that want to compete for committee members by pledging a specified number of tokens to qualify for election, the remaining nodes can vote for the committee, each segment containing at least one committee member.
Step three: each fragment is provided with an independent transaction pool, block-out operation is carried out by taking the fragment as a unit, specifically, miners pack and sort transactions, and then a PBFT consensus algorithm is operated to obtain consensus on a sorting result; the first transaction block of each epoch is preceded by a status block, which not only maintains the linear structure of the block chain, but also increases the cost of tampering.
For cross-chapter transactions, in particular, in terms of transactions: transferring the money of the account in the first segment to the account in the second segment for example, the method comprises the following three steps:
the transaction output party initiates a transaction, and if the transaction is cross-slice transaction, the transaction output party routes the transaction to a committee node in the sub-slice;
the transaction exporter committee node generates a signature for proving that money is actually available in its account and locks the money;
the committee node of the transaction output party routes the certificate to the committee node of the transaction input party, the signature is verified, if the verification is successful, the transaction is completed, and the cross-chip transaction is written into the transaction pools of the input party and the output party respectively; if the verification fails, the balance of the transaction output party is insufficient, the transaction fails, failure information is returned to the committee node of the transaction output party, and unlocking operation is executed.
Step four: after the transaction is completed, all transactions are used as the edges of the graph, and the account is used as the point, so that a transaction graph is formed; here, the whole transaction graph needs to be divided into a plurality of segments, an HDRF-P graph flow division algorithm is adopted, and the sub-graph (sub-segment) to which the associated edge is divided is judged according to the degree information of the node, and the optimization process of the division is to obtain the minimum division of the transaction graph, so that the minimum division can reduce the communication cost among the nodes, balance the load of a plurality of nodes and the load of the nodes in the distributed system, and avoid overheating caused by too high load of a few nodes and the segments. In the process of optimizing the optimal solution according to the transaction flow, a boundary condition, namely security guarantee, is also considered, the number of each fragment cannot be lower than a threshold value, otherwise, the fragments are controlled to generate a security problem.
The complete HDRF-P algorithm is improved based on an HDRF image flow segmentation algorithm as shown in FIG. 2, and the HDRF algorithm is mainly applied to the field of big data and distributed storage.
Input v of the algorithm 1 ,v 2 N represents two points of an edge, the total number of nodes, respectively, and the root is the number of divisions that the HDRF algorithm needs to giveData node number and security guarantee of PBFT algorithm:
n＝3f+1
wherein n represents the total number of nodes and f represents the number of byzantine nodes;
a number of divisions k may be found, where N represents the total number of nodes and μ represents the proportion of malicious nodes:
when one edge is distributed, calculating an objective function value for each subgraph, selecting the subgraph with the highest value to be distributed, wherein the objective function consists of two parts,
first part
The weight of the punishment item for the size of the subgraph is controlled by a coefficient lambda;
the second part
Showing the subgraph versus two points v 1 ,v 2 If either is not included, then 0, if one is included, then within the interval (1, 2), if both are included, then the maximum value 3, and if only one is included, then the calculation method g (v) according to 1 I) points with a lower degree have a higher value, so as to realize the preferential division of points with a higher degree,
in addition, a constraint is additionally added to the segmentation to which the selected edge belongs:
the security is preferentially ensured when the segmentation is selected under the constraint, and the weight of the edge is considered, so that each segmentation cannot be infinite or too small and is always within the security range of the PBFT algorithm.
Step five: after the network is fragmented, the system needs to achieve consensus on the fragmentation results, the system runs a PBFT consensus algorithm, the fragmentation results are used as consensus content, a state block is generated, and the state block is broadcasted to all the fragments; the block is a convergence block of the current epoch transaction block and is also used as a preamble block of the next epoch, and the block structure is in a dynamic expansion state.
Step six: and after receiving the broadcasted fragments, the nodes carry out state conversion, namely, the fragments are scattered and then recombined, and the steps are repeated.
The embodiments of the present invention have been described in detail with reference to the accompanying drawings, but the present invention is not limited to the described embodiments. It will be apparent to those skilled in the art that various changes, modifications, substitutions and alterations can be made in these embodiments, including the components, without departing from the principles and spirit of the invention, and still fall within the scope of the invention.
Claims (8)
1. A block chain dynamic slicing expansion method based on graph flow segmentation is characterized by comprising the following steps:
the method comprises the following steps: the node calculates a Target Nonce value according with the current Target by operating a hash function, and performs modular operation according to the current number of fragments, the obtained result is the serial number of the fragment to which the node belongs, the node needs to initiate an admission transaction, and after the transaction is successfully packed out, the node can initiate a formal transaction at the next epoch;
step two: in the transaction process, each fragment packs transaction data in the fragment transaction pool and generates a block, the front of the first transaction block of each epoch is a state block of the previous epoch, the block structure of the whole system is in a topological graph structure, and each epoch converges to one state block;
step three: performing graph flow segmentation algorithms
Each node continuously reads transaction information from a newly generated block and updates the state diagrams of all the current nodes, when the epoch is finished, the state diagrams can be determined at the same time, the transaction information is used as the input of a graph flow segmentation algorithm, and the transaction information comprises the state diagrams and transaction accounts;
step four: after the image state and the account are divided in the third step, the block chain system achieves consensus on the division result, the consensus at the stage adopts a PBFT algorithm, and a state block is generated and used as a convergence block of all current fragments to represent the end of the current epoch;
step five: after the status blocks of the current epoch have agreed, the associated segment is changed after status transition according to the contents of the blocks, so as to start a new round of transaction.
2. The method according to claim 1, wherein the nodes include a common node and a committee node, the common node is used for a node initiating a transaction, and the committee node constitutes a committee for processing calculations for cross-segment transactions and segment state reconstruction, respectively.
3. The method according to claim 1, wherein in the second step, the PBFT consensus algorithm is adopted to sort the blocks in the topological graph-like structure, and the number of blocks generated within an epoch depends on the current network status.
4. The method according to claim 2, wherein in the second step, for cross-slice transactions, the atomicity of cross-slice transactions is ensured through a committee node as an intermediary in combination with transaction locking and double confirmation mechanisms.
5. The method of claim 4, wherein the committee node formation is qualified by voting on a specified number of tokens, and the rest of the nodes can vote to vote on the committee, each slice comprising at least one committee member.
6. The method according to claim 1, wherein in the second step, the basis for executing the graph flow partitioning algorithm is: load balancing between fragments, security of the blockchain system, and communication costs of replication between fragments.
7. The method for dynamically slicing block chain based on graph flow segmentation according to claim 1, wherein an HDRF-P graph flow segmentation algorithm is adopted, and which sub-graph the associated edge is divided into is determined according to the degree information of the node, the optimization process of the segmentation is to obtain the minimum segmentation of the transaction graph, the minimum segmentation can reduce the communication cost between nodes, and can balance the load of a plurality of nodes and nodes in the distributed system, thereby avoiding overheating caused by too high load of a few nodes and slices, and in the process of optimizing the optimal solution according to the transaction flow, a boundary condition is also considered, that is, security guarantee is also considered, the number of each slice cannot be lower than a threshold, otherwise, the slices are manipulated to generate security problems.
8. The method of claim 7, wherein the HDRF-P algorithm is based on an HDRF image flow division algorithm
Input v of the algorithm 1 ,v 2 N respectively represents two points of one edge, the total number of nodes, and the HDRF algorithm needs to give the division number, so the safety of the node number and the PBFT algorithm is ensured:
n＝3f+1
wherein n represents the total number of nodes, and f represents the number of Byzantine nodes;
a number of divisions k may be found, where N represents the total number of nodes and μ represents the proportion of malicious nodes:
when one edge is allocated, calculating an objective function value for each subgraph, selecting the subgraph with the highest value to be allocated, wherein the objective function consists of two parts,
first part
Controlling the weight of the subgraph by a coefficient lambda as a penalty term for the size of the subgraph;
the second part
Showing the subgraph versus two points v 1 ,v 2 If either is not included, then 0, if one is included, then within the interval (1, 2), if both are included, then the maximum value 3, and if only one is included, then the calculation method g (v) according to 1 I) points with a lower degree have a higher value, so as to realize the preferential division of points with a higher degree,
in addition, a constraint is additionally added to the segmentation to which the selected edge belongs:
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211424549.4A CN115733841A (en) | 2022-11-15 | 2022-11-15 | Block chain dynamic fragmentation expansion method based on image flow segmentation |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211424549.4A CN115733841A (en) | 2022-11-15 | 2022-11-15 | Block chain dynamic fragmentation expansion method based on image flow segmentation |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115733841A true CN115733841A (en) | 2023-03-03 |
Family
ID=85296527
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211424549.4A Pending CN115733841A (en) | 2022-11-15 | 2022-11-15 | Block chain dynamic fragmentation expansion method based on image flow segmentation |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115733841A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117808467A (en) * | 2024-02-28 | 2024-04-02 | 中国信息通信研究院 | Cross-fragment transaction method, device, equipment and medium based on blockchain network |
-
2022
- 2022-11-15 CN CN202211424549.4A patent/CN115733841A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN117808467A (en) * | 2024-02-28 | 2024-04-02 | 中国信息通信研究院 | Cross-fragment transaction method, device, equipment and medium based on blockchain network |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Sompolinsky et al. | Phantom | |
| CN110868434B (en) | Block chain consensus method and system of multilayer fragment architecture | |
| CN111371905B (en) | Block chain layering consensus proving system and method based on cloud computing | |
| CN112511590A (en) | Efficient storage reconfiguration method for block chain fragmentation | |
| CN115665170B (en) | Block chain consensus method based on reputation and node compression mechanism | |
| CN111130790A (en) | Block co-recognition method based on block chain node network | |
| CN115733841A (en) | Block chain dynamic fragmentation expansion method based on image flow segmentation | |
| US20230017790A1 (en) | Graphic-blockchain-orientated hybrid consensus implementation apparatus and implementation method thereof | |
| CN113626875A (en) | Knowledge graph file storage method for block chain fragment enabling | |
| Li et al. | Enhancing the efficiency and scalability of blockchain through probabilistic verification and clustering | |
| CN114938292B (en) | Multi-level optimization PBFT consensus method based on node credibility | |
| CN114219477B (en) | Block chain data storage expansion method based on-chain storage | |
| CN116707759B (en) | Lightweight alliance chain consensus method for high concurrency scene of data flow | |
| CN116389483A (en) | Method and system for dynamic segmentation design of block chain capable of being supervised | |
| Li et al. | EBFT: A hierarchical and group-based byzantine fault tolerant consensus algorithm | |
| CN116032465A (en) | Entrusted workload evidence sharing method | |
| CN115208578A (en) | Unmanned aerial vehicle cluster information consistency sharing method based on block chain | |
| CN114791788A (en) | Data storage method and device based on block chain | |
| KR102668468B1 (en) | Method and apparatus for distributed consensus in consideration of share proportions of nodes and method of generating block chain using the same | |
| CN115102899B (en) | Block link point tree form fragmentation method based on load balancing | |
| Tian et al. | SLChain: A secure and low‐storage pressure sharding blockchain | |
| KR20240043645A (en) | Method and apparatus of adding additional chain to blockchain, and method and apparatus of generating shard for the same | |
| Jing et al. | Enhancing Soft AC Based Reliable Offloading for IoV with Edge Computing | |
| Yu et al. | Byzantine Fault Tolerant Consensus Algorithm Based on Credit Model and Verifiable Random Function | |
| Chen et al. | DT-PBFT: A Double-Layer Group Consensus Algorithm of Credibility for IoT Blockchain |
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 |