CN110557455A - block link point excitation method based on online time - Google Patents
block link point excitation method based on online time Download PDFInfo
- Publication number
- CN110557455A CN110557455A CN201910853708.4A CN201910853708A CN110557455A CN 110557455 A CN110557455 A CN 110557455A CN 201910853708 A CN201910853708 A CN 201910853708A CN 110557455 A CN110557455 A CN 110557455A
- Authority
- CN
- China
- Prior art keywords
- node
- online time
- data set
- bucket
- local
- 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
Classifications
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0208—Trade or exchange of goods or services in exchange for incentives or rewards
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0207—Discounts or incentives, e.g. coupons or rebates
- G06Q30/0215—Including financial accounts
- G06Q30/0216—Investment accounts
-
- 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
-
- 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/1095—Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
Abstract
the invention discloses a block chain link point excitation method based on online time, which is characterized in that a public link maintains an online time statistical data set of a node through a P2P network in real time, and provides a scientific and accurate basis for a data node excitation mechanism, so that the final reward required by the node can be dynamically adjusted according to the online time factor of the data node, the excitation of the node in a block chain network is realized, the distribution range of the block chain network is expanded, and the resource utilization rate is improved.
Description
Technical Field
The invention belongs to the technical field of computer networks, and relates to a block link point excitation method, in particular to a block link point excitation method based on online time.
background
the blockchain network is a distributed decentralized data network, information is stored in all nodes added to the blockchain network, and data of all the nodes are synchronous. Each node in the block chain network realizes specific operation based on the agreed specification and protocol, and strange nodes in the block chain network can realize trust communication without a third party center as credit support.
The node excitation method commonly used in the block chain network includes: the node under the workload certification mechanism obtains block generation right through spelling computing power and obtains reward after the block authentication is passed; a rights and interests certification mechanism which distributes block generation rights by evaluating the number of assets owned by the nodes, wherein the nodes with larger asset ownership numbers are easier to obtain block generation rights and rewards; and the stock authorization certification mechanism selects a certain number of representative nodes to generate blocks in a voting mode, and all the representative nodes equally distribute the obtained reward. The above various node excitation methods cannot ensure that the node sufficiently participates in the generation of the block, and the reward distribution method representing the node is poor.
Disclosure of Invention
The invention aims to provide a block link point excitation method based on online time, which is characterized in that a public link maintains an online time statistical data set of a node through a P2P network in real time, and the final reward required by the node is dynamically adjusted according to the online time factor of the data node.
the purpose of the invention can be realized by the following technical scheme:
A block link point excitation method based on online time maintains a statistical data set of the online time of a node through a P2P network by a public link in real time according to the online time factor of the data node, and dynamically adjusts the final reward required by the node.
Further, the method specifically comprises the following steps:
step S1, the system is started for the first time, a local node is generated, NodeID is recorded as LocalID, and the local node initializes an online time statistical data set;
Step S2, the system reads the public node information, writes the public node information into a K bucket after the ping-pong handshake is completed, and synchronizes the local node online time statistical data set with the nodes in the K bucket;
Step S3, the system refreshes the K barrels at preset time intervals;
Step S4, synchronizing the online time statistical data set of the local node with the refreshed K barrel node;
Step S5, calculating the online time of the computer and updating the online time statistical data set;
step S6, finding out the node closer to the TargetID, and sending a synchronization instruction;
in step S7, the node that received the instruction updates the local online time statistics data set.
Further, the step S3 includes the following steps:
step S31, the system randomly generates a target node ID, and records the target node ID as a targetID;
step S32, calculating the distance between the TargetID and the LocalID, and recording the distance as Dlt;
step S33, marking the NodeID of the node in the K bucket as KadID, calculating the distance between KadID and targetID, and marking the distance as Dkt;
Step S34, finding out the nodes with Dlt larger than Dkt in the K bucket, and sending FindNode commands to the nodes;
In step S35, after receiving the FindNode command, the node also executes the processes of step S32-step S34, and sends the node found in the K bucket back to the local node using the Neighbours command.
And step S36, after receiving the neighbor nodes, the local node writes the received nodes into the K bucket and then keeps connection.
The invention has the beneficial effects that: according to the block chain link point excitation method based on the online time, the public link maintains an online time statistical data set of a node through a P2P network in real time, and a scientific and accurate basis is provided for a data node excitation mechanism, so that the final reward required by the node can be dynamically adjusted according to the online time factor of the data node, the excitation of the node in the block chain network is realized, the distribution range of the block chain network is expanded, and the resource utilization rate is improved.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the description of the present invention, it is to be understood that the terms "opening," "upper," "lower," "thickness," "top," "middle," "length," "inner," "peripheral," and the like are used in an orientation or positional relationship that is merely for convenience in describing and simplifying the description, and do not indicate or imply that the referenced component or element must have a particular orientation, be constructed and operated in a particular orientation, and thus should not be considered as limiting the present invention.
The invention provides a block link point excitation method based on online time, which is characterized in that a public link maintains a statistical data set of the online time of a node through a P2P network in real time according to the online time factor of the data node, and the final reward which should be paid to the node is dynamically adjusted, and the method specifically comprises the following steps:
Step S1, the system is started for the first time, a local node is generated, NodeID is recorded as LocalID, and the local node initializes the online time statistical data set.
And step S2, the system reads the public node information, writes the public node information into a K bucket after the ping-pong handshake is completed, and synchronizes the online time statistical data set of the local node with the node in the K bucket.
in step S3, the system refreshes K buckets once every preset time.
Specifically, step S3 includes the steps of:
In step S31, the system randomly generates a target node ID, which is recorded as TargetID, and records the number of discovery times and the refresh time from 1.
in step S32, the distance between TargetID and localcid is calculated and recorded as Dlt.
Step S33, the NodeID of the node in the K bucket is recorded as KadID, and the distance between KadID and TargetID is calculated and recorded as Dkt.
In step S34, find out nodes in the K bucket whose Dlt (Dlt is the distance between KadID and locaidid, because any distance from locaidid is called Dlt) is greater than Dkt, and send FindNode command to these nodes, where FindNode command includes TargetID.
In step S35, after the above node receives the FindNode command, it also executes the process from step S32 to step S34 (at this time, the last KadID becomes the new locald), and sends the node found in the K bucket back to the local node using the neighborirs command.
And step S36, after receiving the neighbor nodes, the local node writes the received nodes into the K bucket and then keeps connection.
And step S4, synchronizing the online time statistical data set of the local node with the refreshed K barrel node.
step S5, calculate the local online time and update the online time statistics data set.
in step S6, a node closer to the TargetID is found and a synchronization command is sent.
In step S7, the node that received the instruction updates the local online time statistics data set.
And step S8, acquiring the online time statistical data set and calculating the RMB with the amount corresponding to the online time.
According to the block chain link point excitation method based on the online time, the public link maintains an online time statistical data set of a node through a P2P network in real time, and a scientific and accurate basis is provided for a data node excitation mechanism, so that the final reward required by the node can be dynamically adjusted according to the online time factor of the data node, the excitation of the node in the block chain network is realized, the distribution range of the block chain network is expanded, and the resource utilization rate is improved.
in the description herein, references to the description of "one embodiment," "an example," "a specific example" or the like are intended to mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples.
The foregoing is merely exemplary and illustrative of the present invention and various modifications, additions and substitutions may be made by those skilled in the art to the specific embodiments described without departing from the scope of the invention as defined in the following claims.
Claims (3)
1. A block link point excitation method based on online time is characterized in that a public link maintains a statistical data set of the online time of a node through a P2P network in real time according to the online time factor of the data node, and the final reward required by the node is dynamically adjusted.
2. The method of claim 1, comprising the steps of:
step S1, the system is started for the first time, a Local node is generated, the NodeID is recorded as the Local ID, and the Local node initializes the online time statistical data set;
Step S2, the system reads the public node information, writes the public node information into a K bucket after the ping-pong handshake is completed, and synchronizes the local node online time statistical data set with the nodes in the K bucket;
Step S3, the system refreshes the K barrels at preset time intervals;
step S4, synchronizing the online time statistical data set of the local node with the refreshed K barrel node;
step S5, calculating the online time of the computer and updating the online time statistical data set;
in step S6, a node closer to the TargetID is found and a synchronization command is sent.
In step S7, the node that received the instruction updates the local online time statistics data set.
3. The online time-based block link point excitation method according to claim 2, wherein the step S3 comprises the steps of:
step S31, the system randomly generates a target node ID, and records the target node ID as a targetID;
step S32, calculating the distance between the TargetID and the LocalID, and recording the distance as Dlt;
Step S33, marking the NodeID of the node in the K bucket as KadID, calculating the distance between KadID and targetID, and marking the distance as Dkt;
Step S34, finding out the nodes with Dlt larger than Dkt in the K bucket, and sending FindNode commands to the nodes;
in step S35, after receiving the FindNode command, the node also executes the processes of step S32-step S34, and sends the node found in the K bucket back to the local node using the Neighbours command.
And step S36, after receiving the neighbor nodes, the local node writes the received nodes into the K bucket and then keeps connection.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910853708.4A CN110557455A (en) | 2019-09-10 | 2019-09-10 | block link point excitation method based on online time |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910853708.4A CN110557455A (en) | 2019-09-10 | 2019-09-10 | block link point excitation method based on online time |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110557455A true CN110557455A (en) | 2019-12-10 |
Family
ID=68739602
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910853708.4A Pending CN110557455A (en) | 2019-09-10 | 2019-09-10 | block link point excitation method based on online time |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110557455A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101330440A (en) * | 2007-06-18 | 2008-12-24 | 中国电信股份有限公司 | Method for regulating telecommunication stage P2P network resources distribution based on consumer behaviors |
| CN108712487A (en) * | 2018-05-11 | 2018-10-26 | 北京奇虎科技有限公司 | Logical card distribution method, device and equipment based on block chain |
| CN108768787A (en) * | 2018-06-25 | 2018-11-06 | 中国联合网络通信集团有限公司 | A kind of block chain node motivational techniques and device |
| CN110024352A (en) * | 2016-12-30 | 2019-07-16 | 英特尔公司 | Decentralized data for IOT device stores and processs |
-
2019
- 2019-09-10 CN CN201910853708.4A patent/CN110557455A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101330440A (en) * | 2007-06-18 | 2008-12-24 | 中国电信股份有限公司 | Method for regulating telecommunication stage P2P network resources distribution based on consumer behaviors |
| CN110024352A (en) * | 2016-12-30 | 2019-07-16 | 英特尔公司 | Decentralized data for IOT device stores and processs |
| CN108712487A (en) * | 2018-05-11 | 2018-10-26 | 北京奇虎科技有限公司 | Logical card distribution method, device and equipment based on block chain |
| CN108768787A (en) * | 2018-06-25 | 2018-11-06 | 中国联合网络通信集团有限公司 | A kind of block chain node motivational techniques and device |
Non-Patent Citations (2)
| Title |
|---|
| 古则: "以太坊p2p之网络及节点发现机制", 《HTTPS://WWW.JIANSHU.COM/P/CB2708F04068》 * |
| 马永仁: "《区块链技术原理及应用》", 31 March 2019 * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Aoki et al. | Simblock: A blockchain network simulator | |
| US20230006846A1 (en) | Data processing method and apparatus based on blockchain network | |
| Tong et al. | Trust-pbft: A peertrust-based practical byzantine consensus algorithm | |
| CN101714996B (en) | Authentication system and method based on peer-to-peer computing network | |
| KR102337760B1 (en) | Apparatus and method for adaptively managing sharded blockchain network based on Deep Q Network | |
| CN108282334A (en) | It is a kind of based on the multi-party key agreement device of block chain, method and system | |
| CN112995211B (en) | Data processing method, device and equipment based on block chain network and storage medium | |
| CN102045353A (en) | Distributed network security control method of public cloud service | |
| CN109685504A (en) | It is a kind of that economic bookkeeping methods is shared based on block chain | |
| CN112152778B (en) | Node management method and device and electronic equipment | |
| CN112417001B (en) | Data processing method based on block chain network and related equipment | |
| JP2022523447A (en) | How to elect a leader node using a role-based consensus protocol in a blockchain network | |
| CN112200681A (en) | Service processing method, information processing method and node equipment of block chain network | |
| CN112636989A (en) | Method and device for federated learning communication | |
| JP2020516217A (en) | How to operate a power grid | |
| CN115552933A (en) | Federal learning in a telecommunications system | |
| Tong et al. | BC-RAN: Cloud radio access network enabled by blockchain for 5G | |
| Fu et al. | Resource allocation for blockchain-enabled distributed network function virtualization (NFV) with mobile edge cloud (MEC) | |
| Fan et al. | Secure time synchronization scheme in iot based on blockchain | |
| Motlagh et al. | An analytical model for churn process in Bitcoin network with ordinary and relay nodes | |
| CN112862607A (en) | Method, device, equipment and storage medium for realizing block chain consensus mechanism | |
| CN110557455A (en) | block link point excitation method based on online time | |
| WO2023065467A1 (en) | Method for collaborative work between blockchain and internet of things | |
| CN111917748A (en) | Intelligent laser remote control system and method based on IPFS + alliance chain | |
| CN110868466A (en) | Storage method, system and equipment for distributed storage network |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191210 |
|
| RJ01 | Rejection of invention patent application after publication |