CN109040305A - Block chained record method based on heterogeneous hierarchical dynamic topology fragment - Google Patents
Block chained record method based on heterogeneous hierarchical dynamic topology fragment Download PDFInfo
- Publication number
- CN109040305A CN109040305A CN201811052005.3A CN201811052005A CN109040305A CN 109040305 A CN109040305 A CN 109040305A CN 201811052005 A CN201811052005 A CN 201811052005A CN 109040305 A CN109040305 A CN 109040305A
- Authority
- CN
- China
- Prior art keywords
- node
- piece
- network
- network node
- fragment
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
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/104—Peer-to-peer [P2P] networks
- H04L67/1044—Group management mechanisms
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- 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/104—Peer-to-peer [P2P] networks
- H04L67/1042—Peer-to-peer [P2P] networks using topology management mechanisms
-
- 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/104—Peer-to-peer [P2P] networks
- H04L67/1059—Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
Abstract
The invention discloses a kind of block chained record methods based on heterogeneous hierarchical dynamic topology fragment, this method is by utilizing the data record that plant growth simulation algorithm (PGSA) is block chain each time to construct heterogeneous hierarchical dynamic topology fragment in the home network, the constructed double-deck isomery dynamic topology fragment is made of public chain piece and major network piece two parts, and public chain piece undertakes the record weight no more than node total number 49%, major network piece undertakes the record weight not less than node total number 51%；The node of major network piece is used to distributed storage data, and the node of public chain piece is for recording 256 hash values after specific encryption method (such as MD5, SHA-256, SHA-512)；The present invention combines heterogeneous hierarchical dynamic topology slicing algorithm with block chained record, under the premise of guaranteeing block chain technology for realizing existing distributed recording technology, can also effectively solve the problems, such as " trilemma " that block chain data record generally faces.
Description
Technical field
The present invention relates to block chain technical fields, are related to a kind of block chained record based on heterogeneous hierarchical dynamic topology fragment
Method.
Background technique
Block chain technology, also known as " distributed account book technology " are that a kind of decentralization, collective safeguard distributed account book
Technical solution, block chain technology is by Encryption Algorithm, common recognition mechanism, the chain type block structure storing data of timestamp, to be
Data increase time dimension, realize in a distributed system the point-to-point transaction dependent on some trust center, coordination and
Cooperation means reach efficient, safe, anti-tamper, and have the characteristics such as extremely strong verifiability and trackability.
Block chain technology is virtual digit currency using bit coin as representative and grows up all the time, digital cash
Using being a set of account book system and note issuance mechanism, but there are problems that very serious " trilemma ": digital cash application
Generally pursued in decentralization and safety ultimate attainment, then each node will store whole transaction data, a large amount of to calculate power wave
Expense is during reaching common understanding, for example bit coin is exactly averagely to generate one on all nodes all storage to public chain
The time of block has reached 10 minutes, sacrifices high efficiency；
There are some digital cash in order to realize high efficiency, using privately owned chain, privately owned chain is by resting in a reality for block
On hand, the node that lets on is limited and controllable for body, realizes the transactions velocity being exceedingly fast and better secret protection, it will be clear that this is
Technology through almost a kind of " centralization "；
When block chain technical application to one can free uploaded videos decentralization network, with upload and playback volume
More and more, in order to guarantee that operational efficiency, system must give up some secondary datas, this just compromises in " safety ".
It is unacceptable in the system high to security request data such as finance.
Meanwhile before this although the network node of application block chain technology has reached decentralization, but these nodes are opened up
Flutter structure all and be it is identical, it is still not safe enough when in face of with the ultra-large attack for calculating power；
1. so for how to solve the problems, such as that current block chain technology faces: (1) realizing high efficiency；(2) it realizes in going
The heart；(3) reach higher safety；(4) each network node is allowed to be owned by different topological structures etc.；The invention proposes
A kind of block chained record method based on heterogeneous hierarchical dynamic topology slicing algorithm, this method is heterogeneous hierarchical dynamic topology fragment
Algorithm is in conjunction with block chained record, under the premise of guaranteeing block chain technology for realizing existing distributed recording technology, greatly
Solve the problems, such as that data record records " trilemma " faced at the very start in degree, i.e., height can be achieved at the same time in the method for the present invention
Imitate these three requirements of low energy, decentralization and safety.
Summary of the invention
In view of the deficiencies of the prior art, the block chain note based on heterogeneous hierarchical dynamic topology fragment that the invention proposes a kind of
Recording method, for solve it is of the existing technology be difficult to simultaneously (1) realize high efficiency；(2) decentralization is realized；(3) reach compared with
High safety；(3) the problems such as allowing each network node to be owned by different topological structures.
To solve the above-mentioned problems, a kind of block chained record side based on heterogeneous hierarchical dynamic topology fragment of the invention
Method is by utilizing the data record building point that plant growth simulation algorithm (PGSA) is block chain each time in the home network
Layer isomery dynamic topology fragment；The constructed double-deck isomery dynamic topology fragment is made of public chain piece and major network piece two parts,
And public chain piece undertakes the record weight α no more than node total number 49%, major network piece undertakes the record not less than node total number 51%
Weight beta；Node in major network piece is used to distributed storage data, and the node effect in public chain piece is record specific encryption method
256 hash values after (such as MD5, SHA-256, HMAC)；Meanwhile the node between major network piece and the record node of public chain piece
Coincidence factor is not more than the 26% of major network piece, as security mechanism.
The natural growth mechanism of plant growth simulation algorithm is used to construct in heterogeneous hierarchical topology fragment by the present invention, used
Plant growth simulation algorithm belong to a kind of optimization random algorithm, it is the shape of growing tips of the plant that this algorithm, which has several key points respectively,
State element, the phototropism of plant and growing point stop growing criterion etc.；Utilize plant growth simulation algorithm building heterogeneous hierarchical topology
Fragment, improves the random topologies of each node of network, dynamically ensure that the stability of each node of network, specific building step
It is rapid as follows:
S1, initialization local network node
(1) it selects and has configured corresponding local network node as original plant growing point；
(2) local network node reads in the parameters such as network performance, the memory space needed；
(3) number, that is, network node number of growing point required for constructing, the address ip of network node, topological fragment piece
Number, topological fragment cut the parameters such as ratio value and set of random numbers and import in local network；
The data that S2, input block chain encapsulate are recorded in local network；
S3, local network node create task according to topological fragment demand, as the original plant growing point direction of growth；
(1) topological fragment is divided into two layers by local network node；
There are three different weight tasks altogether for (2) two etale topology fragments, the major network for being not less than 51% weight including accounting for total node
The network node that network node growth task, the public chain piece network node growth task weight of piece are 49% grows task and in public affairs
Path node between chain piece and major network piece and no more than major network piece weight 26% grows task；
S4, local network node select one of direction in three directions of growth to be grown；
S5, objective function and history optimal network node is calculated
(1) the network node parameter grown as needed obtains the objective function f of egress comprehensive performance superposition, and formula is such as
Under,
F=is superimposed (network performance, free memory, network line duration, ttl value etc.)
In the formula, " superposition " expression stacks up multiple performances of node, is the integrated performance index of node, node
The network performance of each performance such as node, the free memory of node, the network line duration of node, ttl value of node etc.；
(2) global optimum's network node and global minima network node, global optimum's network section are determined according to objective function
It puts and global minima network node is i.e. two minimum and maximum nodes of functional value, and general from being calculated by objective function f
The addition of the two networks can grow set；
S6, objective function filter out most suboptimum network node
(1) network node that can be grown is added to S5 step is obtained grows in node set；
(2) objective function calculates separately out the functional value that can grow network node in network node；
(3) functional value of previous step is ranked up, screening obtain most suboptimum network node as target growth point, it is worst
Excellent network node is the network node that objective function f function value is only smaller than global optimum's network node functional value；
S7, the growing points grown all before are counted, judges whether the weight for reaching current task, if reaching,
Terminate current task, S4 is jumped to if not up to and continues iteration generation target growth point, the weight until reaching current task；
S8, local network can send the order for judging whether to complete to three different weight tasks, terminate to give birth to if completing
It is long, S4 is jumped to if not completing to be continued to grow.
Further, the method for the present invention further includes a judgment mechanism, i.e., local network node can be in major network piece network section
Point storage complete data after to the all-network node of major network piece send judgement order, major network piece node after receiving order can will
The content feeds such as size of data, state data memory, the storage location of transmission can be incited somebody to action to local network node, local network node
The content fed back to transmit before data content compare, check whether it is identical, thus complete integrality judgement.
Further, the method for the present invention further includes a kind of dynamic growth mechanism, i.e., the block chain in major network piece node and
It, can be to local network if normally can be read or extract when block chain in public chain piece node is read or extracts every time
Normal online signal is fed back, if cannot be read, this node can feed back improper online signal, local network to major network piece
After receiving the signal of feedback, above-mentioned plant growth simulation algorithm can be re-used immediately and is regrowed a new node
Completion is carried out, to guarantee the integrality and Information Security of node, to reach dynamic characteristic proposed by the present invention.
The topological structure of network node is all different in all major network pieces grown in the present invention, this is also simulating plant
The growth characteristic of growth algorithm.
Three different weight tasks, respective function are as follows: account for network of total node not less than the major network piece of 51% weight
Node is mainly responsible for storing data, and the network node for accounting for public chain piece of total node no more than 49% is mainly responsible for record particular encryption
Encrypted 256 hash values of method (such as MD5), between public chain piece and major network piece and no more than major network piece weight 26%
Path node is mainly responsible for data transmission, at the same make in whole network so public chain piece be it is disclosed, major network piece is concealment,
In addition each network node of major network piece is different, the probability that data are illegally distorted is greatly reduced.
When major network piece and public chain piece carry out data transmission, it can repeatedly pass through some nodes, the very high point of these coincidence factors
It is to prevent the data on block chain from illegally being distorted, public chain piece and the big node of major network piece coincidence factor undertake no more than major network piece
26% weight of weight beta, thus the path node of this 26% weight can storing data and hash value, it is excellent to play one layer of safety
Machining function.
Public chain piece only accounts for 49% weight of the whole network, rather than has accounted for 100% as digital cash application, reaches raising effect
Rate effect, major network piece account for 51% weight of the whole network, and each node stores same data, has reached decentralization effect, simultaneously
26% weight path node collective effect between public chain piece and major network piece is in solving safety problem, so the present invention is for solving
Conventional digital currency plays the role of very big using long-standing " trilemma " problem, and the specific weight that acts on can be referring to
Following table 1:
Table 1
When the weighted of data record, the node number of distribution is not also identical, i.e., if block chain needs the number encapsulated
It is important according to recording, then more nodes are distributed, otherwise, distribute default node number, such as 100 nodes.
The beneficial effects of the present invention are:
The present invention solves building isomery dynamic topology separation problem using plant growth simulation algorithm, compared to using other
Optimization algorithm, with outstanding advantage: first, which is provided with stronger dependence to parameter unlike other optimization algorithms
Property, parameter setting it is appropriate whether will have a direct impact on the quality of optimum results；Second, which has Growable, there is one
The directionality and the comparatively ideal search mechanisms of randomness equilibrium ratio that a morphactin determines, and be in entire growing space according to
The mode of global optimum carries out growth operation, therefore can guarantee to obtain globally optimal solution；Third, the algorithm search for institute each time
Obtained result is all to bear branch by seed by nearest from light source limb growth gained, branch bear it is dry, repeatedly, until
Search entirely can growing space, search speed is stronger extensive particularly with solving system, complexity there has also been raising
Problem has a clear superiority than other algorithms.
In addition, the present invention combines heterogeneous hierarchical dynamic topology fragment with block chained record, guaranteeing block chain technology
Under the premise of existing distributed recording technology, largely solve what data record record faced at the very start
" trilemma " problem, i.e., invention achieves three efficient low energy, decentralization and safety requirements.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, below by embodiment or existing
Attached drawing needed in technical description is briefly described, it should be apparent that, the accompanying drawings in the following description is only this Shen
Some embodiments please without creative efforts, may be used also for the common invoice technical staff of this field
To obtain other drawings based on these drawings.
Fig. 1 is the method for the present invention overall flow figure；
Fig. 2 is the detail flowchart of plant growth simulation algorithm building lamination mechanism topology Slicing procedure；
The instance graph that Fig. 3 summary journal node is 100；
Specific embodiment
In order to keep technical characterstic and effect of the invention more obvious, example is to technical side of the invention with reference to the accompanying drawing
Case illustrates, all features disclosed in this specification or disclosed all methods or in the process the step of, in addition to mutual
Other than the feature and/or step of repulsion, it can combine in any way.
The natural growth mechanism of plant growth simulation algorithm is used to construct in heterogeneous hierarchical topology fragment, simulation used
Plant growth algorithm belongs to a kind of optimization random algorithm, this algorithm have several key points respectively and be the morphactin of growing tips of the plant,
The phototropism and growing point of plant stop growing criterion etc.；The present invention utilizes plant growth simulation algorithm building heterogeneous hierarchical topology
Fragment, improves the random topologies of each node of network, dynamically ensure that the stability of each node of network, specific building step
It is rapid as follows:
S1, initialization local network node
(1) it selects and has configured corresponding local network node as original plant growing point；
(2) local network node reads in the parameters such as network performance, the memory space needed；
(3) number, that is, network node number of growing point required for constructing, the address ip of network node, topological fragment piece
Number, topological fragment cut the parameters such as ratio value and set of random numbers and import in local network；
The data that S2, input block chain encapsulate are recorded in local network；
S3, local network node create task according to topological fragment demand, as the original plant growing point direction of growth；
(1) topological fragment is divided into two layers by local network node；
There are three different weight tasks altogether for (2) two etale topology fragments, the major network for being not less than 51% weight including accounting for total node
The network node that network node growth task, the public chain piece network node growth task weight of piece are 49% grows task and in public affairs
Path node between chain piece and major network piece and no more than major network piece weight 26% grows task；
S4, local network node select one of direction in three directions of growth to be grown；
S5, objective function and history optimal network node is calculated
(1) the network node parameter grown as needed, the objective function f of node comprehensive performance superposition, formula is as follows,
F=is superimposed (network performance, free memory, network line duration, ttl value etc.)
In the formula, " superposition " expression stacks up multiple performances of node；For the integrated performance index of node, node
Each performance just like the network performance of node, the free memory of node, the network line duration of node, node ttl value
Deng, the function can self-defining, weight is such as accompanied by according to the importance of each joint behavior, to node performance give a mark multiplied by
All properties data are added obtain comprehensive performance score again by weight shared by the performance.
(2) global optimum's network node and global minima network node, global optimum's network section are determined according to objective function
It puts and global minima network node is i.e. two minimum and maximum nodes of functional value, and general from being calculated by objective function f
The two networks are put into growth point set；
S6, objective function filter out most suboptimum network node
(1) network node that can be grown is added to S5 step is obtained grows in node set；
(2) objective function calculates separately out the functional value that can grow network node in network node；
(3) functional value of previous step is ranked up, screening obtain most suboptimum network node as target growth point, it is worst
Excellent network node is the network node that functional value is only smaller than global optimum's network node functional value；
S7, the growing points grown all before are counted, judges whether the weight for reaching current task, if reaching,
Terminate current task, S4 is jumped to if not up to and continues iteration generation target growth point, the weight until reaching current task；
S8, local network can send the order for judging whether to complete to three different weight tasks, terminate to give birth to if completing
It is long, S4 is jumped to if not completing to be continued to grow.
The topological structure of network node is all different in all major network pieces grown in the above method, this is also that simulation is planted
The growth characteristic of object growth algorithm.
Three different weight tasks, respective function are as follows: account for network of total node not less than the major network piece of 51% weight
Node is mainly responsible for storing data, and the network node for accounting for public chain piece of total node no more than 49% is mainly responsible for record particular encryption
Encrypted 256 hash values of method (such as MD5), the road between public chain piece and major network piece and no more than major network piece weight 26%
Diameter node is mainly responsible for data transmission, at the same make in whole network so public chain piece be it is disclosed, major network piece is concealment, is added
Upper each network node of major network piece is different, and greatly reduces the probability that data are illegally distorted.
This method further includes a judgment mechanism, i.e., local network node can store in major network piece network node and complete data
Judgement order is sent to the all-network node of major network piece afterwards, carries out data transmission integrality judgment mechanism.
Meanwhile further including a kind of dynamic growth mechanism, i.e., in the block chain and public chain piece node in major network piece node
When block chain is read or extracts every time, if normally can be read or extract, normal online letter can be fed back to local network
Number, if cannot be read, this node can feed back improper online signal to major network piece, and local network is receiving feedback
After signal, the above-mentioned plant growth simulation algorithm new node that regrows can be re-used immediately and carries out completion, to protect
The integrality and Information Security for demonstrate,proving node, to reach dynamic characteristic proposed by the present invention.
When major network piece and public chain piece carry out data transmission, it can repeatedly pass through some nodes, the very high point of these coincidence factors
It is that path node to prevent the data on block chain from illegally being distorted, between public chain piece and major network piece undertakes no more than major network piece
26% weight of weight beta, thus the path node of this 26% weight can storing data and hash value, and play one layer of safety
Machining function.
Public chain piece only accounts for 49% weight of the whole network, rather than has accounted for 100% as digital cash application, reaches raising effect
Rate effect, major network piece account for 51% weight of the whole network, and each node stores same data, has reached decentralization effect, simultaneously
Between public chain piece and major network piece there are also 26% weight path node collective effect in solve safety problem, so the present invention for
It is very big to solve the problems, such as that conventional digital currency plays the role of using long-standing " trilemma ", specific effect weight can
Referring to following table 1:
Table 1
When the weighted of data record, the node number of distribution is not also identical, i.e., if block chain needs the number encapsulated
It is important according to recording, then more nodes are distributed, otherwise, distribute default node number, such as 100 nodes.
To further facilitate explanation, as shown in figure 3, being illustrated by taking 100 node demands as an example to method of the invention
It is as follows:
Step 1: the local network node for selecting Fig. 3 rightmost to mark first is as just according to the demand of 100 nodes
Begin growth node；
Step 2: local network node is online；
Step 3: obtain Fig. 3 rightmost local network node parameter, as network performance, stand-by time, cpu performance,
Memory space etc.:
Step 4: user is according to its data weighting difference, i.e. data importance is different, and selection needs to be used to record data
Interstitial content (default is 100), network performance (network speed that default is not less than existing national regulation), memory space are (silent
Recognize not less than the record size after block chain encapsulated user data) etc. parameters used if these parameters user does not have customized
Default parameters；
Step 5: local network node is broadcast to the whole network publication formula of flooding is ready to provide 100 networks for calculating power service
Node obtains the network node for meeting the Parameter Conditions of user's needs；
Step 6: this 100 network nodes after the signal for receiving local network publication, are returned to local network node
The address ip and various call parameters such as network performance, stand-by time, cpu performance, memory space, are currently located service type, machine
Device type etc.；
Step 7: the parameter that 100 nodes return is imported into local network node；
Step 8: the parameter that local network is returned according to the data of user's selection and 100 network nodes, demand is appointed
Business is divided into three directions of growth: public chain piece network node≤100*49%=49, major network piece network node >=100*51%=
It is used to transmit the path node of data≤100*51%*26%=13.26 ≈ 14 between 51, public chain piece and major network piece；
Step 9: progress explanation in Fig. 3 step 8: be largely divided into two layers, for visualization description, the dotted line left side is first
Layer major network piece, the right are that the second layer is public chain piece, this two layers is really overlying relation；
Step 10: local network node is carried out while being grown along upper layer and lower layer；
Step 11: this 100 nodes are all put into and can grow in node set, and selects and go through according to objective function f
History optimal network node and minimal network node；
It calculates, obtains each step 12: using objective function these can be grown with the network node in collection of network
From functional value；
Step 13: being ranked up to obtained functional value, most suboptimum network node is obtained as target growth node；
Step 14: utilizing corresponding 51%, 49%, 26% weight of three tasks, then to verify whether three tasks
All growth is defeated completely, if growth is completed, is terminated to grow, if not having, is repeated above-mentioned growth step；
Step 15: the network node that local network can be sent to major network piece and public chain piece judge the life of integrality
It enables, if having met its weight, stops growing, if continuing without if according to the tenth step to the 14th step continued growth,
Know until meeting respective weight；
Step 16: the data that user provides can be carried out block encapsulation by local network after stopping growing, passing through spy
After fixed decipherment algorithm encryption, 256 hash values can be obtained, are stored in the network node of public chain piece；
Step 17: being then transferred to the network of major network piece by the complete data of a part of network node of public chain piece
In node, and each node deposits data once, achievees the purpose that decentralization；
Step 18: local network can to the all-network node of major network piece send verify data whether the life of full storage
It enables, to guarantee the function of data full storage；
Step 19: the block chain in the block chain and public chain piece node in major network piece node is read or extracts every time
When, if normally can be read or extract, normal online signal can be fed back to local network, if cannot be read, this
Node can feed back improper online signal to major network piece, and local network can re-use immediately after receiving the signal of feedback
The above-mentioned plant growth simulation algorithm new node that regrows carries out completion, to guarantee the integrality and data peace of node
Quan Xing, to reach dynamic characteristic proposed by the present invention；
Step 20: simultaneously, in the method as proposed in the present invention, public chain piece only stores 256 hash values, in open
State, and major network piece is dormant, when there is network illegal invasion, can only invade public chain piece first, even if the 49 of public chain piece
After a node has been invaded, discovery can not still modify data, because the content of modification does not reach 50 or more of the whole network, need
The node for modifying major network piece, when having modified in major network piece present node, present node can be sent out to local network simultaneously
Abnormal signal out when local network detects the network node abnormality of major network piece, can regrow into again one not using algorithm
The node of homeomorphism structure, so the node of previous modification has been replaced with one newly when next node is modified
Node, can not be modified so as to cause nodes data, reach very high security performance.
So public affairs chain piece proposed according to the present invention only accounts for 49% weight of the whole network, rather than as digital cash application
100% has been accounted for, the effect of improving efficiency is reached, major network piece accounts for 51% weight of the whole network, and each node stores same data, reaches
Decentralization effect is arrived, while the path node collective effect between public chain piece and major network piece there are also 26% weight is in solution
Safety problem, so the present invention can effectively solve the problems, such as conventional digital currency using long-standing " trilemma ".
Claims (5)
1. a kind of block chained record method based on heterogeneous hierarchical dynamic topology fragment, which is characterized in that this method be by
Heterogeneous hierarchical dynamic is constructed using the data record that plant growth simulation algorithm (PGSA) is block chain each time in local network
Topological fragment；The constructed double-deck isomery dynamic topology fragment is made of public chain piece and major network piece two parts, and public chain piece is held
Load is not more than the record weight α of node total number 49%, and major network piece undertakes the record weight beta not less than node total number 51%；Major network
Node in piece is used to distributed storage data, and the node in public chain piece is for recording 256 hash values after particular encryption；This
Outside, the path node between major network piece and the record node of public chain piece accounts for 26% no more than major network piece number of nodes.
2. the block chained record method according to claim 1 based on heterogeneous hierarchical dynamic topology fragment, which is characterized in that
The building heterogeneous hierarchical dynamic topology fragment, specific construction step are as follows:
S1, initialization local network node
(1) it selects and has configured corresponding local network node as original plant growing point；
(2) local network node reads in the parameters such as network performance, the memory space needed；
(3) number, that is, network node number of growing point required for constructing, the address ip of network node, topological fragment the piece number,
Topological fragment cuts the parameters such as ratio value and set of random numbers and imports in local network；
The data that S2, input block chain encapsulate are recorded in local network；
S3, local network node create task according to topological fragment demand, as the original plant growing point direction of growth；
(1) topological fragment is divided into two layers by local network node；
(2) two etale topology fragments are altogether there are three different weight tasks, including accounting for major network piece of total node not less than 51% weight
The network node that network node grows task, public chain piece network node growth task weight is 49% grows task and in public chain piece
Path node between major network piece and no more than major network piece weight 26% grows task；
S4, local network node carry out simultaneously in growth above three task, each direction in three directions of growth
It is grown in the following manner；
S5, objective function and history optimal network node is calculated
(1) the network node parameter grown as needed obtains the objective function f of egress comprehensive performance superposition, and formula is as follows,
F=is superimposed (network performance, free memory, network line duration, ttl value etc.)
In the formula, " superposition " expression stacks up multiple performances of node, i.e. the integrated performance index of node；
(2) global optimum's network node and global minima network node are determined according to objective function, global optimum's network node and
Global minima network node is being calculated by objective function f, i.e. two minimum and maximum nodes of functional value, and by this two
A network node, which is put into, to be grown in node set；
S6, objective function filter out most suboptimum network node
(1) network node that can be grown is added to S5 step is obtained to be grown in node set；
(2) objective function calculates separately out the functional value that can grow all-network node in node set；
(3) functional value of previous step is ranked up, screening obtains most suboptimum network node as target growth point, most suboptimum net
Network node is the network node that objective function f function value is only smaller than global optimum's network node functional value；
S7, the growing points grown all before are counted, judges whether the weight for reaching current task, if reaching, terminates
Current task jumps to step S4 if not up to and continues iteration generation target growth point, the weight until reaching current task；
S8, local network send the order for judging whether to complete to three different weight tasks, terminate to grow if completing, if not having
There is completion then to jump to step S4 to continue to grow.
3. the block chained record method according to claim 1 based on heterogeneous hierarchical dynamic topology fragment, which is characterized in that
This method further includes a judgment mechanism, i.e., local network node can be after major network piece network node stores completion data to major network
The all-network node transmission of piece judge integrality order, major network piece node understand after receiving order by the size of data of transmission,
The content feeds such as state data memory, storage location to local network node, local network node can by the content fed back to
Transmit before data content compare, check whether it is identical, thus complete integrality judgement.
4. the block chained record method according to claim 1 based on heterogeneous hierarchical dynamic topology fragment, which is characterized in that
This method further includes a kind of dynamic growth mechanism, i.e., the block chain in the block chain and public chain piece node in major network piece node is every
It is secondary when being read or extracting, if normally can be read or extract, normal online signal can be fed back to local network, if not
It can be read, then this node can feed back improper online signal to major network piece, and local network is after receiving the signal of feedback, meeting
Re-use the plant growth simulation algorithm new node that regrows immediately and carry out completion, with guarantee node integrality and
Information Security.
5. the block chained record method according to claim 1 based on heterogeneous hierarchical dynamic topology fragment, which is characterized in that
The particular encryption refers to MD5, SHA-256 or HMAC etc..
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811052005.3A CN109040305B (en) | 2018-09-10 | 2018-09-10 | Block chain recording method based on hierarchical heterogeneous dynamic topological fragments |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811052005.3A CN109040305B (en) | 2018-09-10 | 2018-09-10 | Block chain recording method based on hierarchical heterogeneous dynamic topological fragments |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109040305A true CN109040305A (en) | 2018-12-18 |
| CN109040305B CN109040305B (en) | 2021-06-04 |
Family
ID=64621117
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811052005.3A Active CN109040305B (en) | 2018-09-10 | 2018-09-10 | Block chain recording method based on hierarchical heterogeneous dynamic topological fragments |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109040305B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112001730A (en) * | 2020-08-25 | 2020-11-27 | 徐鹏飞 | Data security detection method based on block chain and digital currency and cloud computing center |
| CN112528276A (en) * | 2020-11-23 | 2021-03-19 | 中国联合网络通信集团有限公司 | Block chain-based distributed storage tamper-proof method and system |
| CN112565448A (en) * | 2020-12-16 | 2021-03-26 | 宁波云麟信息科技有限公司 | Block chain-based electronic evidence storage node selection method and electronic equipment |
| CN114356937A (en) * | 2022-01-09 | 2022-04-15 | 广州聚高信息科技有限公司 | Financial information management system based on block chain and big data |
| CN115174565A (en) * | 2022-05-18 | 2022-10-11 | 国网河南省电力公司信息通信公司 | Consensus method and device based on block chain fragmentation technology |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104821605A (en) * | 2015-04-13 | 2015-08-05 | 国家电网公司 | Active safety correction method based on improved particle swarm optimization algorithm |
| US20170076286A1 (en) * | 2015-09-11 | 2017-03-16 | Bank Of America Corporation | Controlling access to data |
| CN107591841A (en) * | 2017-09-26 | 2018-01-16 | 清华大学 | Power network Evolution Simulation method under being accessed on a large scale suitable for new energy |
| CN108323232A (en) * | 2017-05-16 | 2018-07-24 | 北京大学深圳研究生院 | The maintaining method of index and chain topological structure between a kind of multi-layer block catenary system |
-
2018
- 2018-09-10 CN CN201811052005.3A patent/CN109040305B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104821605A (en) * | 2015-04-13 | 2015-08-05 | 国家电网公司 | Active safety correction method based on improved particle swarm optimization algorithm |
| US20170076286A1 (en) * | 2015-09-11 | 2017-03-16 | Bank Of America Corporation | Controlling access to data |
| CN108323232A (en) * | 2017-05-16 | 2018-07-24 | 北京大学深圳研究生院 | The maintaining method of index and chain topological structure between a kind of multi-layer block catenary system |
| CN107591841A (en) * | 2017-09-26 | 2018-01-16 | 清华大学 | Power network Evolution Simulation method under being accessed on a large scale suitable for new energy |
Non-Patent Citations (1)
| Title |
|---|
| 武勇，李斌: "区块链安全技术体系研究", 《信息安全与通信保密》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112001730A (en) * | 2020-08-25 | 2020-11-27 | 徐鹏飞 | Data security detection method based on block chain and digital currency and cloud computing center |
| CN112001730B (en) * | 2020-08-25 | 2021-10-22 | 徐鹏飞 | Data security detection method based on block chain and digital currency and cloud computing center |
| CN112528276A (en) * | 2020-11-23 | 2021-03-19 | 中国联合网络通信集团有限公司 | Block chain-based distributed storage tamper-proof method and system |
| CN112528276B (en) * | 2020-11-23 | 2023-06-09 | 中国联合网络通信集团有限公司 | Distributed storage tamper-proof method and system based on block chain |
| CN112565448A (en) * | 2020-12-16 | 2021-03-26 | 宁波云麟信息科技有限公司 | Block chain-based electronic evidence storage node selection method and electronic equipment |
| CN114356937A (en) * | 2022-01-09 | 2022-04-15 | 广州聚高信息科技有限公司 | Financial information management system based on block chain and big data |
| CN115174565A (en) * | 2022-05-18 | 2022-10-11 | 国网河南省电力公司信息通信公司 | Consensus method and device based on block chain fragmentation technology |
| CN115174565B (en) * | 2022-05-18 | 2023-08-15 | 国网河南省电力公司信息通信公司 | Consensus method and device based on block chain slicing technology |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109040305B (en) | 2021-06-04 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109040305A (en) | Block chained record method based on heterogeneous hierarchical dynamic topology fragment | |
| CN108985089B (en) | Internet data sharing system | |
| Jogenfors | Quantum bitcoin: an anonymous, distributed, and secure currency secured by the no-cloning theorem of quantum mechanics | |
| CN103116720B (en) | A kind of USB Key device and account management thereof and checking using method | |
| CN108389047A (en) | The method and block chain network of fundamental chain and subchain transaction in block chain | |
| CN107688944A (en) | A kind of power system method of commerce based on block chain | |
| CN109583885A (en) | Bout controls rewritable block chain | |
| CN108681966A (en) | A kind of information monitoring method and device based on block chain | |
| CN109165190A (en) | A kind of electronic data based on block chain intelligence contract deposits card method | |
| CN109635165A (en) | Data summarization method, device, equipment and medium based on tree-like block chain network | |
| CN109101572A (en) | Card method, apparatus and server, storage medium are deposited based on block chain | |
| CN106528775A (en) | Private block chain operation support system that supports logical multi-chain, and working method thereof | |
| CN108494581A (en) | The controller distributed information log generation method and device of SDN network | |
| CN109241087A (en) | A kind of data processing method and terminal of alliance's chain | |
| CN109985389A (en) | Cards game anti-cheating method and its system based on block chain intelligence contract | |
| CN107819753A (en) | Not exclusively anonymous block chain transaction system and method | |
| CN108462785A (en) | A kind of processing method and processing device of malicious call phone | |
| CN111353172B (en) | Hadoop cluster big data access method and system based on block chain | |
| CN110414270A (en) | A kind of personal data protection system and method based on block chain | |
| CN109428892A (en) | Multistage rewritable block chain | |
| CN110413652A (en) | A kind of big data privacy search method based on edge calculations | |
| CN110324358A (en) | Video data manages authentication method, module, equipment and platform | |
| CN111489143A (en) | Auditable encrypted digital currency supervision method based on alliance side chain | |
| Hu et al. | Securing the private key in your blockchain wallet: a continuous authentication approach based on behavioral biometric | |
| CN111597167A (en) | Big data management system and method applying block chain technology |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230707 Address after: No. A910, Building A, Three Gorges Mall, No. 52 Jiefang Road, Xiling District, Yichang City, Hubei Province, 443099 Patentee after: Hubei Yuancun Technology Co.,Ltd. Address before: Room 205, block C, National Science and Technology Park, Zhejiang University, No. 525, Xixi Road, Xihu District, Hangzhou City, Zhejiang Province, 310012 Patentee before: ZHEJIANG TIANMAI FIELD TECHNOLOGY Co.,Ltd. |
|
| TR01 | Transfer of patent right |