CN110913501A - Consensus method suitable for wireless block chain network - Google Patents
Consensus method suitable for wireless block chain network Download PDFInfo
- Publication number
- CN110913501A CN110913501A CN201911087282.2A CN201911087282A CN110913501A CN 110913501 A CN110913501 A CN 110913501A CN 201911087282 A CN201911087282 A CN 201911087282A CN 110913501 A CN110913501 A CN 110913501A
- Authority
- CN
- China
- Prior art keywords
- node
- leader
- miner
- network
- nodes
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 25
- 238000012795 verification Methods 0.000 claims abstract description 28
- 238000005065 mining Methods 0.000 claims description 4
- 230000002238 attenuated effect Effects 0.000 claims description 3
- 238000012544 monitoring process Methods 0.000 claims description 3
- 230000005540 biological transmission Effects 0.000 abstract description 8
- 238000005516 engineering process Methods 0.000 description 7
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0808—Non-scheduled access, e.g. ALOHA using carrier sensing, e.g. carrier sense multiple access [CSMA]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/12—Applying verification of the received information
-
- 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
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Security & Cryptography (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a consensus method applicable to a wireless block chain network, which comprises the following steps: (1) a leader election stage: selecting only one leader miner node in a wireless block chain network; (2) a block proposing stage: generating and broadcasting a new block by a leader miner node generated in the election stage; (3) a block verification stage: other miners verify the new block and feed back the verification result to the leader miner node; (4) block chain updating stage: and the leader miner node determines whether to update the local block chain according to the verification information of other nodes to achieve consensus. The method can ensure that all nodes in the whole block chain network achieve consensus in the optimal running round number and avoid the bifurcation problem in the block chain network to a certain extent by methods of workload certification calculation, physical carrier sensing, node transmission rule setting and the like under the conditions that the information transmitted among the miners nodes is uncertain and the transmission channel is unstable.
Description
Technical Field
The invention belongs to the technical field of distributed networks, and particularly relates to a consensus method applicable to a wireless block chain network.
Background
Since the birth of the 2008 bottom bitcoin, cryptocurrency and related blockchain techniques have attracted increasing interest in academia and industry. As the underlying technology behind bitcoin, a blockchain is essentially a distributed database system that tracks all transactions that occur in the network and replicates at each participating complete node in the blockchain network. The core technology of the blockchain is a distributed consensus protocol.
Although the block chain is widely applied in the fields of finance, logistics and the like, the application of the block chain in the field of mobile service is quite limited. This is because two major challenges need to be addressed in a wireless network environment, one being that solving the workload justification problem in a wireless blockchain network requires the mobile device to have high computing power, which is relatively difficult for lightweight mobile devices; secondly, in a wireless network environment, the success rate of information transmission between nodes cannot be determined and the channel cannot be kept stable for a long time, so that the realization of consensus in a blockchain network becomes more difficult.
At present, under the drive of the development of the internet of things, the block chain technology has a considerable application prospect in the field of mobile services, such as smart homes, smart agriculture, automobile communication and the like. Most of the existing research is to solve how to implement or replace the workload proof calculation on the mobile device, and there are few methods to design the consensus protocol of the wireless block-chain network from the wireless network characteristics.
The consensus problem is the core problem of the blockchain technology, and no method for achieving consensus of nodes under the conditions that the transmission information between the miner nodes in the wireless blockchain network is uncertain and the channel is unstable exists in the prior art.
Disclosure of Invention
In order to solve the above technical problems, the present invention provides a consensus method suitable for use in a wireless block chain network, which utilizes the characteristics and technologies of the bottom layer of a wireless channel to achieve consensus and avoids the bifurcation problem in the block chain network to a certain extent.
In order to achieve the purpose, the technical scheme of the invention is as follows:
a consensus method applicable in a wireless block chain network, comprising the steps of:
(1) a leader election stage: the workload of a miner node is used for proving calculation competition and carrying out physical carrier sensing on a channel, and only one leader miner node in a wireless block chain network is selected through an O (log) round;
(2) a block proposing stage: generating and broadcasting a new block by a leader miner node generated in the election stage;
(3) a block verification stage: other miners verify the new block and feed back the verification result to the leader miner node;
(4) block chain updating stage: and the leader miner node determines whether to update the local block chain according to the verification information of other nodes, and informs other miner nodes to finish updating of the corresponding block chain, so as to achieve consensus.
In the above scheme, the step (1) is specifically as follows:
(1.1) initializing State values State of all miners nodes in the wireless block chain network to mining, namely starting workload certification calculation and being in a channel monitoring State;
(1.2) after t rounds, after a part of miner nodes calculate to obtain a solution of a Hash puzzle for the first time, the State values State of the miner nodes are set as candidate, and the candidate miner nodes can send 1-bit non-coding information M according to a random probability p;
(1.3) the node with the State value of minus and other candidate miners nodes which do not send information are in the channel State of interception, if the node in the channel is intercepted to transmit information, the State value State of the node is set as silent, and the State value of the node cannot be changed in the subsequent rounds until the node is reinitialized;
and (1.4) after the O (log) round, the method can ensure that the state value of only one node in all the miner nodes in the network is leader with high probability.
In a further technical scheme, the step (2) is specifically as follows:
(2.1) the leader miner node in the network packs the generated new block B and the position information D thereof and broadcasts the new block B and the position information D to the whole wireless block chain network;
(2.2) the silent miner node in the network receives the position information D of the new block B and the leader node, and verifies the transaction information and the solution of the Hash puzzle in the new block B;
(2.3) if the new block B is verified to be valid, the silent miner node sets the verification value C to 0, and if the new block B is not verified, C is set to 1.
In a further technical scheme, the step (3) is specifically as follows:
(3.1) all silent mineworker nodes in the network will simultaneously have power P ═ k × d (u, v)αSending information M, wherein d (u, v) is the distance from each point to a leader node, k is a constant, the information can be ensured to be detected by the leader node after all the silent miner nodes in the network send messages by power P, the detected signal power value P is attenuated to k, α is a path attenuation index in a wireless network signal-to-noise ratio model, and the miner node with the status value of leader detects the total signal power value of a channel to be S1Then the total number n of the miner nodes in the network can be calculated through a signal-to-noise ratio model1；
(3.2) all silent miners nodes in the network with a verification value C of 1 will again have power P ═ k × d (u, v)αSending 1bit non-coding information M; the leader miner node monitors the total signal power value of the channel as S2Then, the number n of nodes with invalid verification result of the new block B by the miner node in the network can be obtained through calculation2；
(3.3) leader miners node will be according to n2/n1Is compared to a preset threshold η, e.g., n2/n1If the value is less than η, the verification parameter C of the leader node is 0, otherwise, the value is 1.
In a further technical scheme, the step (4) is specifically as follows:
(4.1) if the verification parameter C value of the leader miner node in the network is 0, writing the generated new block B into a local block chain of the leader node and sending 1bit of non-coding information M;
(4.2) if the silent miner node in the network monitors that the node in the channel transmits information, writing the generated new block B into the local block chain of the node, otherwise, discarding the block;
(4.3) all nodes in the network reset their State value State, verification parameter C and running round counter to initial values.
Through the technical scheme, compared with the prior art, the consensus method applicable to the wireless block chain network provided by the invention has the following technical characteristics and effects:
(1) the invention considers the uncertainty of information transmission between nodes and the instability of the channel in the wireless block chain network, namely the information transmission is not always successful every time, and the channel can not ensure that the information can be transmitted efficiently for a long time. The physical bearer interception technology of a Medium Access Control (MAC) layer in the IEEE 802.11 standard is used, and some transmission rules are set, so that the common recognition of all miners in the network at the optimal round number can be realized.
(2) The invention ensures the uniqueness of the account book in the wireless block chain network by the election of the unique leader miner node, thereby avoiding the branching of the link, being very beneficial to expanding to the actual wireless block chain network, saving the computing resource and accelerating the accounting speed.
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 description of the embodiments or the prior art will be briefly described below.
Fig. 1 is a schematic diagram of a phase of a consensus method applicable in a wireless block chain network according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a consensus method applied in a wireless block chain network according to an embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
The invention provides a consensus method suitable for a wireless block chain network, which can achieve consensus of all nodes in the whole block chain network in the optimal round number by methods of workload certification calculation, physical carrier sensing, node transmission rule setting and the like under the conditions that the information transmitted between the mining nodes in the wireless block chain network is uncertain and the channel is unstable, as shown in figure 1. The technology solves the problem of node consensus in a wireless block chain network, and avoids the problem of bifurcation in the block chain network to a certain extent.
As shown in fig. 2, the specific embodiment is as follows:
a consensus method applicable in a wireless block chain network, comprising the steps of:
(1) a leader election stage:
(1.1) initializing State values State of all miners nodes in the wireless block chain network to mining, namely starting workload certification calculation and being in a channel monitoring State;
(1.2) after t rounds, after a part of miner nodes calculate to obtain a solution of a Hash puzzle for the first time, the State values State of the miner nodes are set as candidate, and the candidate miner nodes can send 1-bit non-coding information M according to a random probability p;
(1.3) the node with the State value of minus and other candidate miners nodes which do not send information are in the channel State of interception, if the node in the channel is intercepted to transmit information, the State value State of the node is set as silent, and the State value of the node cannot be changed in the subsequent rounds until the node is reinitialized;
and (1.4) after the O (log) round, the method can ensure that the state value of only one node in all the miner nodes in the network is leader with high probability.
(2) A block proposing stage:
(2.1) the leader miner node in the network packs the generated new block B and the position information D thereof and broadcasts the new block B and the position information D to the whole wireless block chain network;
(2.2) the silent miner node in the network receives the position information D of the new block B and the leader node, and verifies the information such as the transaction information, the solution of the Hash puzzle and the like in the new block B;
(2.3) if the new block B is verified to be valid, the silent miner node sets the verification value C to 0, and if the new block B is not verified, C is set to 1.
A block verification stage:
(3.1) all silent mineworker nodes in the network will simultaneously have power P ═ k × d (u, v)αSending information M, wherein d (u, v) is the distance from each point to a leader node, k is a constant large enough to ensure that the information can be listened by the leader node after all the silent miner nodes in the network send the information with power P, the intercepted signal power value P is attenuated to k, α is a path attenuation index in a wireless network signal-to-noise ratio model, and the miner node with the leader intercepts the total signal power value of a channel to be S1Then the total number n of the miner nodes in the network can be calculated through a signal-to-noise ratio model1；
(3.2) all silent miners nodes in the network with a verification value C of 1 will again have power P ═ k × d (u, v)αSending 1bit non-coding information M; the leader miner node monitors the total signal power value of the channel as S2Then, the number n of nodes with invalid verification result of the new block B by the miner node in the network can be obtained through calculation2；
(3.3) leader miners node will be according to n2/n1Is compared to a preset threshold η, e.g., n2/n1If the value is less than η, the verification parameter C of the leader node is 0, otherwise, the value is 1.
(4) Block chain updating stage:
(4.1) if the verification parameter C value of the leader miner node in the network is 0, writing the generated new block B into a local block chain of the leader node and sending 1bit of non-coding information M;
(4.2) if the silent miner node in the network monitors that the node in the channel transmits information, writing the generated new block B into the local block chain of the node, otherwise, discarding the block;
(4.3) all nodes in the network reset their State value State, verification parameter C and running round counter to initial values.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (5)
1. A consensus method applicable in a wireless block chain network, comprising:
(1) a leader election stage: the workload of a miner node is used for proving calculation competition and carrying out physical carrier sensing on a channel, and only one leader miner node in a wireless block chain network is selected through an O (log) round;
(2) a block proposing stage: generating and broadcasting a new block by a leader miner node generated in the election stage;
(3) a block verification stage: other miners verify the new block and feed back the verification result to the leader miner node;
(4) block chain updating stage: and the leader miner node determines whether to update the local block chain according to the verification information of other nodes, and informs other miner nodes to finish updating of the corresponding block chain, so as to achieve consensus.
2. The method of claim 1, wherein the step (1) is as follows:
(1.1) initializing State values State of all miners nodes in the wireless block chain network to mining, namely starting workload certification calculation and being in a channel monitoring State;
(1.2) after t rounds, after a part of miner nodes calculate to obtain a solution of a Hash puzzle for the first time, the State values State of the miner nodes are set as candidate, and the candidate miner nodes can send 1-bit non-coding information M according to a random probability p;
(1.3) the node with the State value of minus and other candidate miners nodes which do not send information are in the channel State of interception, if the node in the channel is intercepted to transmit information, the State value State of the node is set as silent, and the State value of the node cannot be changed in the subsequent rounds until the node is reinitialized;
and (1.4) after the O (log) round, the method can ensure that the state value of only one node in all the miner nodes in the network is leader with high probability.
3. The consensus method as claimed in claim 2, wherein the step (2) is as follows:
(2.1) the leader miner node in the network packs the generated new block B and the position information D thereof and broadcasts the new block B and the position information D to the whole wireless block chain network;
(2.2) the silent miner node in the network receives the position information D of the new block B and the leader node, and verifies the transaction information and the solution of the Hash puzzle in the new block B;
(2.3) if the new block B is verified to be valid, the silent miner node sets the verification value C to 0, and if the new block B is not verified, C is set to 1.
4. The consensus method as claimed in claim 3, wherein the step (3) is as follows:
(3.1) all silent mineworker nodes in the network will simultaneously have power P ═ k × d (u, v)αSending information M, wherein d (u, v) is the distance from each point to the leader node, k is a constant, the information can be ensured to be detected by the leader node after all the silent miner nodes in the network send messages by power P, the detected signal power value P is attenuated to k, α is a transmitted signal in a wireless network signal-to-noise ratio modelAn input path attenuation exponent; the miner node with the state value of leader monitors the total signal power value of the channel to be S1Then the total number n of the miner nodes in the network can be calculated through a signal-to-noise ratio model1；
(3.2) all silent miners nodes in the network with a verification value C of 1 will again have power P ═ k × d (u, v)αSending 1bit non-coding information M; the leader miner node monitors the total signal power value of the channel as S2Then, the number n of nodes with invalid verification result of the new block B by the miner node in the network can be obtained through calculation2；
(3.3) leader miners node will be according to n2/n1Is compared to a preset threshold η, e.g., n2/n1If the value is less than η, the verification parameter C of the leader node is 0, otherwise, the value is 1.
5. The consensus method as claimed in claim 4, wherein the step (4) is as follows:
(4.1) if the verification parameter C value of the leader miner node in the network is 0, writing the generated new block B into a local block chain of the leader node and sending 1bit of non-coding information M;
(4.2) if the silent miner node in the network monitors that the node in the channel transmits information, writing the generated new block B into the local block chain of the node, otherwise, discarding the block;
(4.3) all nodes in the network reset their State value State, verification parameter C and running round counter to initial values.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911087282.2A CN110913501B (en) | 2019-11-08 | 2019-11-08 | Consensus method suitable for wireless block chain network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911087282.2A CN110913501B (en) | 2019-11-08 | 2019-11-08 | Consensus method suitable for wireless block chain network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110913501A true CN110913501A (en) | 2020-03-24 |
| CN110913501B CN110913501B (en) | 2023-04-21 |
Family
ID=69816951
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911087282.2A Active CN110913501B (en) | 2019-11-08 | 2019-11-08 | Consensus method suitable for wireless block chain network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110913501B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111818152A (en) * | 2020-07-02 | 2020-10-23 | 电子科技大学 | Leader election consensus method based on distributed network |
| CN112187866A (en) * | 2020-09-03 | 2021-01-05 | 山东大学 | Novel block chain consensus method based on shared storage |
| CN112202868A (en) * | 2020-09-27 | 2021-01-08 | 上海交通大学 | Method for realizing block chain consensus protocol based on wireless air calculation |
| CN112822013A (en) * | 2021-04-16 | 2021-05-18 | 卓尔智联(武汉)研究院有限公司 | Block chain consensus method, device and storage medium |
| CN112860807A (en) * | 2021-04-08 | 2021-05-28 | 山东大学 | Fault-tolerant consensus method suitable for wireless block chain network |
| CN113645692A (en) * | 2021-08-05 | 2021-11-12 | 赵庆林 | Efficient competition consensus method based on multiple carriers under scene of Internet of things |
| CN113873023A (en) * | 2021-09-23 | 2021-12-31 | 北京新华夏信息技术有限公司 | Leader node election method, device, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106445711A (en) * | 2016-08-28 | 2017-02-22 | 杭州云象网络技术有限公司 | Byzantine-fault-tolerant consensus method applied to block chain |
| CN109639430A (en) * | 2018-11-09 | 2019-04-16 | 北京航空航天大学 | The block catenary system and method for safety high speed lightweight |
| CN109685502A (en) * | 2018-12-06 | 2019-04-26 | 成都佰纳瑞信息技术有限公司 | A kind of acceleration common recognition method suitable for block chain network |
| CN109726887A (en) * | 2018-10-12 | 2019-05-07 | 西安电子科技大学 | The acquisition of mobile crowdsourcing Data Data and processing system and method based on block chain |
-
2019
- 2019-11-08 CN CN201911087282.2A patent/CN110913501B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106445711A (en) * | 2016-08-28 | 2017-02-22 | 杭州云象网络技术有限公司 | Byzantine-fault-tolerant consensus method applied to block chain |
| CN109726887A (en) * | 2018-10-12 | 2019-05-07 | 西安电子科技大学 | The acquisition of mobile crowdsourcing Data Data and processing system and method based on block chain |
| CN109639430A (en) * | 2018-11-09 | 2019-04-16 | 北京航空航天大学 | The block catenary system and method for safety high speed lightweight |
| CN109685502A (en) * | 2018-12-06 | 2019-04-26 | 成都佰纳瑞信息技术有限公司 | A kind of acceleration common recognition method suitable for block chain network |
Non-Patent Citations (2)
| Title |
|---|
| WENBO WANG; DINH THAI HOANG; PEIZHAO HU: "《A Survey on Consensus Mechanisms and Mining Strategy Management in Blockchain Networks》" * |
| 金颖彤，李晨旭，田妹，齐兵: "《大观区块链技术的共识机制及发展》" * |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111818152A (en) * | 2020-07-02 | 2020-10-23 | 电子科技大学 | Leader election consensus method based on distributed network |
| CN111818152B (en) * | 2020-07-02 | 2021-04-30 | 电子科技大学 | Leader election consensus method based on distributed network |
| CN112187866B (en) * | 2020-09-03 | 2021-10-15 | 山东大学 | Novel block chain consensus method based on shared storage |
| CN112187866A (en) * | 2020-09-03 | 2021-01-05 | 山东大学 | Novel block chain consensus method based on shared storage |
| CN112202868B (en) * | 2020-09-27 | 2021-11-30 | 上海交通大学 | Method for realizing block chain consensus protocol based on wireless air calculation |
| CN112202868A (en) * | 2020-09-27 | 2021-01-08 | 上海交通大学 | Method for realizing block chain consensus protocol based on wireless air calculation |
| CN112860807A (en) * | 2021-04-08 | 2021-05-28 | 山东大学 | Fault-tolerant consensus method suitable for wireless block chain network |
| CN112860807B (en) * | 2021-04-08 | 2022-04-12 | 山东大学 | Fault-tolerant consensus method suitable for wireless block chain network |
| CN112822013B (en) * | 2021-04-16 | 2021-07-23 | 卓尔智联(武汉)研究院有限公司 | Block chain consensus method, device and storage medium |
| CN112822013A (en) * | 2021-04-16 | 2021-05-18 | 卓尔智联(武汉)研究院有限公司 | Block chain consensus method, device and storage medium |
| CN113645692A (en) * | 2021-08-05 | 2021-11-12 | 赵庆林 | Efficient competition consensus method based on multiple carriers under scene of Internet of things |
| CN113645692B (en) * | 2021-08-05 | 2024-04-02 | 赵庆林 | Efficient competition consensus method based on multiple carriers in Internet of things scenario |
| CN113873023A (en) * | 2021-09-23 | 2021-12-31 | 北京新华夏信息技术有限公司 | Leader node election method, device, equipment and storage medium |
| CN113873023B (en) * | 2021-09-23 | 2024-04-02 | 北京新华夏信息技术有限公司 | Leader node election method, leader node election device, leader node election equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110913501B (en) | 2023-04-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110913501A (en) | Consensus method suitable for wireless block chain network | |
| Zhao et al. | A reinforcement learning method for joint mode selection and power adaptation in the V2V communication network in 5G | |
| CN111406396B (en) | Computer-implemented system and method for data propagation and communication in a network, such as a blockchain network | |
| CN107197036A (en) | A kind of consistent processing method of information based on block chain and terminal | |
| Yu et al. | Localized and distributed link scheduling algorithms in IoT under Rayleigh fading | |
| CN112737770B (en) | Network bidirectional authentication and key agreement method and device based on PUF | |
| CN112217683A (en) | Cross-heterogeneous-chain data reachability processing method, system, medium, device and terminal | |
| Yu et al. | Competitive age of information in dynamic IoT networks | |
| CN111431802A (en) | Block chain node communication optimization system and method | |
| Zou et al. | A fast consensus for permissioned wireless blockchains | |
| CN114358307A (en) | Federal learning method and device based on differential privacy law | |
| WO2022218516A1 (en) | Devices and methods for collaborative learning of a transmission policy in wireless networks | |
| CN111798234B (en) | Lightweight block chain system and construction method | |
| Yu et al. | Implementing the abstract MAC layer via inductive coloring under the Rayleigh-fading model | |
| CN114826699B (en) | Byzantine attack resisting method in decentralized federal learning based on block chain | |
| Zhang et al. | An efficient and reliable byzantine fault tolerant blockchain consensus protocol for single-hop wireless networks | |
| CN114760135B (en) | Optimization method of block chain fault-tolerant consensus scheme | |
| CN113923217B (en) | Asynchronous Bayesian-busy family consensus method and system based on DAG | |
| CN109496407B (en) | Message transmission method, device and storage medium in block chain system | |
| Yang et al. | Distributed age-of-information optimization in edge computing for internet of vehicles | |
| CN112860807B (en) | Fault-tolerant consensus method suitable for wireless block chain network | |
| Peng et al. | Energy‐Efficient Transmission Strategy by Using Optimal Stopping Approach for Mobile Networks | |
| CN114386107A (en) | MuSig 2-based multiple data signature acceleration method and system | |
| CN113988856A (en) | Block header propagation method and storage medium | |
| Meseguer et al. | Reducing energy consumption in human-centric wireless sensor networks |
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 |