A blockchain transaction information adaptive routing method for a wireless communication network

Abstract

This invention discloses an adaptive routing method for blockchain transaction information in wireless communication networks. Unlike traditional flooding forwarding for wired communication, in this adaptive routing method, after receiving transaction information, the routing node decides whether to forward the transaction based on its forwarding probability to the source node, thereby reducing the bandwidth consumption of the wireless node. When receiving new block information, the routing node uses a no-regret learning algorithm based on the transaction confirmation results to adjust the transaction information and forwarding probability to each source node, avoiding the forwarding of invalid transaction information and improving forwarding efficiency. This invention effectively reduces the wireless communication bandwidth overhead during transaction routing while ensuring that transactions can quickly reach miner nodes, significantly improving the resource utilization efficiency of wireless blockchains.

Description

Technical Field

[0001] This invention belongs to the field of cross-technology of wireless communication networks and blockchain, and in particular relates to an adaptive routing method for blockchain transaction information in wireless communication networks. Background Technology

[0002] Blockchain is considered the foundation of its decentralization and trustworthiness. It is widely used in various fields, including finance, healthcare, and logistics. Recent research has focused on combining blockchain with wireless networks to leverage its trustworthiness in the Internet of Things (IoT) and ensure privacy and security in data interactions (J. Wang, X. Ling, Y. Le, Y. Huang, and X. You, “Blockchain-enabled wireless communications: a new paradigm towards 6g,” National Science Review, vol. 8, no. 9, p. nwab069, 2021).

[0003] Compared to traditional blockchain networks, information decoding in wireless networks is affected by bandwidth resources and the uncertainty and latency of unstable communication links. Previous work has mainly focused on optimizing computational resources for public blockchains. However, the communication capabilities of nodes have a significant impact on the consensus efficiency of wireless blockchains. Research shows that the interconnectivity advantage of nodes can accelerate block propagation, thereby winning fork competition (Y. Xiao, N. Zhang, W. Lou, and Y. T. Hou, “Modeling the impact of network connectivity on consensus security of proof-of-work blockchain,” IEEE INFOCOM 2020-IEEE Conference on Computer Communications, pp. 1648–1657, 2020.). Furthermore, the transmission capacity and connectivity of nodes affect block confirmation (W. Wang, J. Chen, Y. Jiao, J. Kang, W. Dai, and Y. Xu, “Connectivity-aware contract for incentivizing iot devices in complex wireless blockchain,” IEEE Internet of Things Journal, 2023.). Due to resource constraints, it is difficult for wireless nodes to improve their communication capabilities. Therefore, optimizing the utilization of currently available node resources is both important and feasible for the external communication performance of a secure and sustainable wireless blockchain network.

[0004] In a blockchain network, transactions are expected to be propagated to miners for verification and packaged into a block. Once the block is confirmed, the transaction is considered complete. Unlike general routing protocols, the source node in a blockchain cannot determine the destination miner. On one hand, the source node lacks specific location information about the miner. On the other hand, due to the competitive mining mechanism of the blockchain, a miner cannot guarantee that they will be able to propose the next block. Therefore, routing protocols for wireless blockchain transactions must not only ensure efficient information propagation but also provide redundant paths to increase the probability of successful confirmation.

[0005] In traditional blockchain networks, nodes utilize flooding protocols to route transactions. While flooding enhances the robustness of routing, it also leads to significant bandwidth waste, contradicting the scarcity of bandwidth in wireless blockchain networks. Studies have investigated the consumption of communication resources in blockchains under various consensus protocols, showing that communication resources grow exponentially with network size (L. Zhang, H. Xu, O. Onireti, MAImran, and B. Cao, "How much communication resource is needed to run a wireless blockchain network?" IEEE Network, vol. 36, pp. 128–135, 2021). Related research discusses the performance of blockchains in wireless networks. Simulation results show that while flooding improves network connectivity, it causes severe interference (S. Kim, "Is wireless bad for consensus in blockchain?" arXiv preprint arXiv:2403.10186, 2024). Therefore, flooding protocols are unsuitable for bandwidth-constrained wireless networks, necessitating the design of an efficient blockchain transaction routing protocol adaptable to wireless networks. Summary of the Invention

[0006] The purpose of this invention is to address the problems mentioned in the background art by providing an adaptive routing method for blockchain transaction information in wireless communication networks. This protocol allows nodes to adjust their forwarding probabilities online based on the transaction confirmation results. By introducing forwarding probabilities, nodes are more inclined to forward transactions that will eventually be confirmed. The invented routing method maintains bandwidth efficiency while enabling transactions to reach the miner who proposed the block via the shortest path.

[0007] To achieve the objectives of this invention, an adaptive routing method for blockchain transaction information in wireless communication networks is disclosed, comprising the following steps:

[0008] Step 1: A wireless blockchain network is formed by N transaction nodes and M miner nodes; transaction nodes are responsible for generating and routing transactions; miner nodes are responsible for verifying transactions and packaging transactions to generate blocks; all nodes are connected through wireless links and forward blocks, and the nodes communicate with each other using the gossip protocol.

[0009] Step 2, forwarding node n i Generate transaction information τ i The transaction τ is broadcast through a broadcast mechanism. i Propagate to its neighboring nodes;

[0010] Step 3, Routing node n jReceived transaction information τ i An adaptive routing method is used to determine whether to forward transaction τ. i ;

[0011] Step 4, when miner node m l Received transaction τ i At that time, the transaction is verified, and the verified transaction is packaged into a block. When the hash problem is successfully solved, miner m l Broadcast the block;

[0012] Step 5: When a routing node receives a new block, it determines whether the block is valid. If valid, the block is added to the chain, and its forwarding probability matrix is ​​adjusted according to the no-regret learning algorithm before the block is broadcast.

[0013] Step 6: When a miner node receives a new block, it determines whether the block is valid. If valid, the block is added to the chain, broadcast, and the block height is updated to begin building a new block.

[0014] Step 7: After the new block is confirmed by the entire network and added to the main chain, the transactions in the block are considered to have reached the confirmed state, and the transactions are completed;

[0015] Repeat steps 1 through 7 to complete the entire process of generating, routing, verifying, and confirming transactions in the wireless blockchain network.

[0016] Furthermore, in step 1, nodes in the wireless blockchain network communicate using the gossip protocol, specifically: each message has...<ttl,fanout> The format is as follows: ttl represents the remaining number of times the message can be forwarded, and fanout represents the number of neighbors to choose for forwarding. Each time, the routing node randomly selects fanout neighbors for forwarding. Each time the message is forwarded, the remaining number of times it can be forwarded is reduced by 1. Once ttl becomes 0, the message will no longer be forwarded.

[0017] Furthermore, in step 3, an adaptive routing method is used to determine whether to forward transaction τ. i Specifically, when routing node n j Received transaction information τ i First, node n j Determine if a transaction has been received. i If the transaction has already been received, then discard it. i Otherwise, node n j Generate a random number r between 0 and 1; secondly, node n j Compare r with node n i Forwarding probability p ji Size; if the forwarding probability p ji If the value is greater than the random number r, then node n jRandomly select fanout neighbor nodes to route transactions τ i Otherwise, node n j Discard Transaction τ i .

[0018] Furthermore, in step 4, the transaction is verified, and the verified transaction is packaged into a block. Specifically, when miner m... l Received transaction τ i Next, it first checks whether the same transaction has been received from other nodes. If so, the transaction is discarded. i Otherwise, miner m l Verify the transaction. i First, verified legitimate transactions are placed into the transaction pool; second, miner m l Transactions are selected from the transaction pool to build a block; finally, when the block meets the hash requirements, miner m... l Broadcast the new block.

[0019] Furthermore, in step 5, the forwarding probability matrix is ​​adjusted according to the no-regret learning algorithm, specifically as follows:

[0020] When routing node n j After receiving a new block, determine if any of the transactions contained in the block are ones that the user has routed but not yet mined by miners. l Once the transaction is confirmed and uploaded to the blockchain, the probabilities of each action in strategy set 'a' are adjusted based on the judgment result; because for the received transaction τ i Forwarding nodes only have two actions: routing and discarding. Therefore, a = {a0, a1}, where a0 represents discarded transactions and a1 represents routed transactions.

[0021] First, the forwarding node calculates the cost function for each action. The cost of a node not routing is...

[0022] The cost of node routing for c(a0)=0(1) is

[0023]

[0024] in, The communication overhead of routing a transaction is represented by the time interval between the generation of the transaction and its confirmation on the chain, T represents the expected confirmation delay of the transaction, t represents the actual confirmation delay of the transaction, and α and γ are coefficients. In formula (2), the first term represents the transaction information forwarded by the routing node being discarded by the miner node, and the second term represents the transaction forwarded by the routing node being successfully verified by the miner node and packaged on the chain.

[0025] Based on each calculated cost function, the forwarding node adjusts its forwarding probability, as shown in the following formula:

[0026]

[0027] Where k represents the number of adjustment rounds, c represents the weight of the action in round k; k (a) The cost of action a in round k, Γ k+1 p represents the sum of action weights in round k+1; k+1 (a) represents the probability of action a in the (k+1)th round.

[0028] Compared with the prior art, the significant advancements of this invention are: 1) To address the problem of limited node resources in wireless blockchain networks, an efficient adaptive transaction routing method is studied. Nodes select transactions for routing by adjusting probabilities, which significantly reduces bandwidth overhead while ensuring rapid confirmation of transaction information; 2) In the adaptive routing method of the invention, nodes adjust probabilities based on the confirmation results of transactions, at the cost of their actual resource expenditure, using a no-regret learning algorithm to achieve efficient routing planning in dynamic wireless environments.

[0029] To more clearly illustrate the functional characteristics and structural parameters of the present invention, further explanation is provided below in conjunction with the accompanying drawings and specific embodiments. Attached Figure Description

[0030] The accompanying drawings, which are included to provide a further understanding of the invention and form part of this application, illustrate exemplary embodiments of the invention and, together with their description, serve to explain the invention and do not constitute an undue limitation thereof. In the drawings:

[0031] Figure 1 This is a system model diagram of an adaptive routing method for blockchain transaction information in wireless communication networks according to the present invention.

[0032] Figure 2 This is a schematic diagram of the wireless blockchain network topology in Embodiment 1 of the present invention;

[0033] Figure 3 This is a schematic diagram of the forwarding probability distribution in Embodiment 1 of the present invention;

[0034] Figure 4 This is a schematic diagram of transaction confirmation delay in Embodiment 1 of the present invention;

[0035] Figure 5 This is a schematic diagram comparing the bandwidth consumption of the mechanism proposed in Embodiment 2 of the present invention with that of the flooding method;

[0036] Figure 6 This is a schematic diagram comparing the confirmation delay of the mechanism proposed in Embodiment 2 of the present invention with that of the flooding method;

[0037] Figure 7 This is a schematic diagram comparing the network utility of the mechanism proposed in Embodiment 2 of the present invention with that of the flooding method. Detailed Implementation

[0038] The technical solutions of the present invention will be clearly and completely described below with reference to the accompanying drawings of the embodiments of the present invention. Obviously, the described embodiments are only some embodiments of the present invention, and not all embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of the present invention.

[0039] The proposed routing method is compared with the gossip protocol in Bitcoin (S. Nakamoto and A. Bitcoin, “A peer-to-peer electronic cash system,” URL: https: / / bitcoin.org / bitcoin.pdf, 2008). We compare the proposed method in terms of bandwidth consumption, confirmation latency, fastest routing, and wireless blockchain utility to verify its effectiveness.

[0040] like Figure 1 As shown, Figure 1 This is a system model diagram of an adaptive routing method for blockchain transaction information in wireless communication networks, as proposed in this invention. Routing nodes adjust their forwarding probabilities online based on transaction confirmation results. By introducing forwarding probabilities, nodes are more inclined to route transactions that will eventually be confirmed. The invented mechanism maintains bandwidth efficiency while enabling transactions to reach the miner who proposed the block via the shortest path.

[0041] This invention proposes an adaptive routing method for transaction information in a wireless blockchain network, comprising the following steps:

[0042] Step 1: A wireless blockchain network is formed by N transaction nodes and M miner nodes; transaction nodes are responsible for generating and routing transactions; miner nodes are responsible for verifying transactions and packaging transactions to generate blocks; all nodes are connected through wireless links and forward blocks, and the nodes communicate with each other using the gossip protocol.

[0043] Step 2, forwarding node n i Generate transaction information τ i The transaction τ is broadcast through a broadcast mechanism. i Propagate to its neighboring nodes;

[0044] Step 3, routing node n j Received transaction information τ i An adaptive routing method is used to determine whether to forward transaction τ. i ;

[0045] Step 4, when miner node m lReceived transaction τ i At that time, the transaction is verified, and the verified transaction is packaged into a block. When the hash problem is successfully solved, miner m l Broadcast the block;

[0046] Step 5: When a routing node receives a new block, it determines whether the block is valid. If valid, the block is added to the chain, and its forwarding probability matrix is ​​adjusted according to the no-regret learning algorithm before the block is broadcast.

[0047] Step 6: When a miner node receives a new block, it determines whether the block is valid. If valid, the block is added to the chain and broadcast. At the same time, the block height is updated, and a new block construction begins.

[0048] Step 7: After the new block is confirmed by the entire network and added to the main chain, the transactions in the block are considered to have reached the confirmed state, and the transactions are completed;

[0049] Repeat steps 1 through 7 to complete the entire process of transaction generation, routing, verification, and confirmation in the wireless blockchain network. The specific implementation of this invention is as follows:

[0050] In step 1, nodes in the wireless blockchain network communicate using the gossip protocol, specifically as follows:

[0051] Each piece of information has<ttl,fanout> The format is as follows: ttl represents the remaining number of times the message can be forwarded, and fanout represents the number of neighbors to choose for forwarding. Each time, the routing node randomly selects fanout neighbors for forwarding. Each time the message is forwarded, the remaining number of times it can be forwarded is reduced by 1. Once ttl becomes 0, the message will no longer be forwarded.

[0052] In step 3, an adaptive routing method is used to determine whether to forward transaction τ. i Specifically:

[0053] When routing node n j Received transaction information τ i First, node n j Determine if a transaction has been received. i If the transaction has already been received, then discard it. i Otherwise, node n j Generate a random number r between 0 and 1; secondly, node n j Compare r with node n i Forwarding probability p ji Size; if the forwarding probability p ji If the value is greater than the random number r, then node n j Randomly select fanout neighbor nodes to route transactions τ i Otherwise, node n jDiscard Transaction τ i .

[0054] In step 4, the transactions are verified, and the verified transactions are packaged into blocks, specifically as follows:

[0055] When miner m l Received transaction τ i Next, it first checks whether the same transaction has been received from other nodes. If so, the transaction is discarded. i Otherwise, miner m l Verify the transaction. i First, verified legitimate transactions are placed into the transaction pool. Second, miner m... l Transactions are selected from the transaction pool to build a block. Finally, when the block meets the hash requirements, miner m... l Broadcast the new block.

[0056] In step 5, the forwarding probability matrix is ​​adjusted according to the no-regret learning algorithm, specifically as follows:

[0057] When routing node n j After receiving a new block, determine if any of the transactions contained in the block are ones that the user has routed but not yet mined by miners. l Once the transaction is confirmed and uploaded to the blockchain, the probabilities of each action in strategy set 'a' are adjusted based on the judgment result; because for the received transaction τ i Forwarding nodes only have two actions: routing and discarding. Therefore, a = {a0, a1}, where a0 represents discarded transactions and a1 represents routed transactions.

[0058] First, the forwarding node calculates the cost function for each action. The cost of a node not routing is...

[0059] The cost of node routing for c(a0)=0(1) is

[0060]

[0061] in, The communication overhead of routing a transaction is represented by the time interval between the generation of the transaction and its confirmation on the chain, T represents the expected confirmation delay of the transaction, t represents the actual confirmation delay of the transaction, and α and γ are coefficients. In formula (2), the first term represents the transaction information forwarded by the routing node being discarded by the miner node, and the second term represents the transaction forwarded by the routing node being successfully verified by the miner node and packaged on the chain.

[0062] Based on each calculated cost function, the forwarding node adjusts its forwarding probability, as shown in the following formula:

[0063]

[0064] Where k represents the number of adjustment rounds, c represents the weight of the action in round k; k (a) The cost of action a in round k, Γ k+1 p represents the sum of action weights in round k+1; k+1 (a) represents the probability of action a in the (k+1)th round.

[0065] Example 1

[0066] The first embodiment of this invention is described in detail below. The system simulation uses Python, and the parameter settings do not affect the generality. This embodiment verifies the effectiveness of the proposed routing method. For ease of analysis, the network size is set to 10. On average, each transaction node generates a transaction within 3 seconds, and the block interval is 5 seconds. We assume that all miners have the same computing power. Nodes set the forwarding probability of their own transactions to 1, and the initial forwarding probability of other source node transactions to 0.5. The minimum forwarding probability is set to 0.1 to improve the robustness of transaction routing and enable it to adapt to dynamic wireless environments.

[0067] like Figure 2 As shown, Figure 2 This is a schematic diagram of the wireless blockchain network topology in Embodiment 1 of the invention. Numbers 1 to 7 are transaction nodes (represented by circles), and numbers 8 to 10 are miner nodes (represented by triangles).

[0068] like Figure 3 As shown, Figure 3 This is a schematic diagram of the forwarding probability distribution in Embodiment 1 of the present invention. A total of 225 blocks were generated, with miners 8, 9, and 10 accounting for 28.5%, 15.1%, and 56.4%, respectively. From the wireless blockchain topology, we observe that all transactions reaching miner 10 must pass through node 1. Therefore, node 1 has a high forwarding probability to all source nodes because it does not perform invalid forwarding. Conversely, due to the position of node 6, it has the lowest forwarding probability to all source nodes. Regardless of which miner proposes the block, other source nodes have faster transaction routing without having to pass through node 6. Node 6 does not need to forward transactions from other source nodes. Figure 3 This demonstrates that our routing method effectively guides transaction nodes to adjust their forwarding probabilities.

[0069] like Figure 4 As shown, Figure 4 This is a schematic diagram of transaction confirmation latency in Embodiment 1 of the present invention. We illustrate the transaction confirmation latency between different source nodes. Intuitively, nodes 1, 5, and 7 have lower confirmation latency because they are directly connected to miners, resulting in less propagation latency. Miner 10 proposes the most blocks, which benefits nodes 1 and 7. Although node 6 is connected to miner 9, miner 9's block proportion is only 15.1%. This is why node 6 has higher confirmation latency.

[0070] Example 2

[0071] The second embodiment of the present invention is described in detail below. The system simulation is performed using Python, and the parameter settings do not affect the generality. This embodiment verifies the effectiveness of the proposed method. The parameters are set to consider that transaction nodes account for 70% and miner nodes account for 30% in the entire wireless blockchain. Each transaction node generates a transaction within 3 seconds, and the block interval is 5 seconds. Each node establishes a connection with other nodes with a probability of 0.2, and the network topology is an Erdos-Renyi (ER) random network model.

[0072] like Figure 5 As shown, Figure 5 This diagram illustrates a comparison of bandwidth consumption between the mechanism proposed in Embodiment 2 of this invention and the flooding method. The comparison algorithm is the flooding routing protocol in the Bitcoin network, and the performance metric is the bandwidth consumption of the routing nodes. As the network size increases, the number of transactions and the resulting bandwidth consumption also increase. Compared to the flooding protocol, our routing method significantly reduces bandwidth consumption. Bandwidth efficiency is significantly improved at larger network sizes, making it suitable for resource-constrained wireless blockchain networks.

[0073] like Figure 6 As shown, Figure 6 This is a schematic diagram comparing the confirmation latency of the mechanism proposed in Embodiment 2 of this invention with that of the flooding method. The comparison algorithm is the flooding routing protocol in the Bitcoin network, and the performance metric is the transaction confirmation revenue of the node. We use... The value represents the transaction confirmation benefit, where B is the main blockchain. The proposed routing method improves transaction confirmation efficiency by 50%, which translates to lower latency. Flooding protocols introduce significant information redundancy, slowing down transaction verification.

[0074] like Figure 7 As shown, Figure 7 This is a schematic diagram comparing the network utility of the mechanism proposed in Embodiment 2 of this invention with that of the flooding method. The comparison algorithm is the flooding routing protocol in the Bitcoin network, and the performance metric is the overall utility of the wireless blockchain network. We assume that the wireless blockchain increases the utility per unit when confirming a transaction, and sets the forwarding cost to the transaction size (KB). Figure 7 It can be seen that the flooding protocol incurs negative utility due to its significant bandwidth overhead. The proposed routing method improves bandwidth utilization by controlling the forwarding probability, bringing positive utility to the wireless blockchain network. Furthermore, we note that the utility of the wireless blockchain decreases slightly at a network size of 50. While a larger network size leads to higher throughput, it also consumes more bandwidth.

[0075] Comparative analysis reveals that the adaptive routing method for transaction information in the wireless blockchain network proposed in this invention filters transactions before forwarding and uses a no-regret learning algorithm to adjust the forwarding probability based on the confirmation results, thereby reducing unnecessary transaction routing and improving the overall network efficiency.

[0076] In summary, the adaptive routing method for transaction information in wireless blockchain networks proposed in this invention can achieve adaptive adjustment of node forwarding probability and optimization of transaction routing process, effectively improving the efficiency of transaction routing, verification and confirmation in wireless blockchain scenarios, and enhancing the utility of wireless blockchain networks.

[0077] It should be noted that, in this document, relational terms such as "first" and "second" are used only to distinguish one entity or operation from another, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Furthermore, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such process, method, article, or apparatus.

[0078] Although embodiments of the invention have been shown and described, it will be understood by those skilled in the art that various changes, modifications, substitutions and alterations can be made to these embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the appended claims and their equivalents.

Claims

1. An adaptive routing method for blockchain transaction information in wireless communication networks, characterized in that, Includes the following steps: Step 1: A wireless blockchain network is formed by N transaction nodes and M miner nodes; transaction nodes are responsible for generating and routing transactions; miner nodes are responsible for verifying transactions and packaging transactions to generate blocks; all nodes are connected through wireless links and forward blocks, and the nodes communicate with each other using the gossip protocol. Step 2, forwarding node n i Generate transaction information τ i The transaction τ is broadcast through a broadcast mechanism. i Propagate to its neighboring nodes; Step 3, Routing node n j Received transaction information τ i An adaptive routing method is used to determine whether to forward transaction τ. i ; Step 4, when miner node m l Received transaction τ i At that time, the transaction is verified, and the verified transaction is packaged into a block. When the hash problem is successfully solved, miner m l Broadcast the block; Step 5: When a routing node receives a new block, it determines whether the block is valid. If valid, the block is added to the chain, and its forwarding probability matrix is ​​adjusted according to the no-regret learning algorithm before the block is broadcast. Step 6: When a miner node receives a new block, it determines whether the block is valid. If valid, the block is added to the chain, broadcast, and the block height is updated to begin building a new block. Step 7: After the new block is confirmed by the entire network and added to the main chain, the transactions in the block are considered to have reached the confirmed state, and the transactions are completed; Repeat steps 1 through 7 to complete the entire process of transaction generation, routing, verification, and confirmation in the wireless blockchain network. In step 5, the forwarding probability matrix is ​​adjusted according to the no-regret learning algorithm, specifically as follows: When routing node n j After receiving a new block, determine if any of the transactions contained in the block are ones that the user has routed but not yet mined by miners. l Once the transaction is confirmed and uploaded to the blockchain, the probabilities of each action in strategy set 'a' are adjusted based on the judgment result; because for the received transaction τ i Forwarding nodes only have two actions: routing and discarding. Therefore, a = {a0, a1}, where a0 represents discarded transactions and a1 represents routed transactions. First, the forwarding node calculates the cost function for each action. The cost for a node not to route is c(a0) = 0 (1). The cost of node routing is in, The communication overhead of routing a transaction is represented by the time interval between the generation of the transaction and its confirmation on the chain, T represents the expected confirmation delay of the transaction, t represents the actual confirmation delay of the transaction, and α and γ are coefficients. In formula (2), the first term represents the transaction information forwarded by the routing node being discarded by the miner node, and the second term represents the transaction forwarded by the routing node being successfully verified by the miner node and packaged on the chain. Based on each calculated cost function, the forwarding node adjusts its forwarding probability, as shown in the following formula: Where k represents the number of adjustment rounds, c represents the weight of the action in round k; k (a) The cost of action a in round k, Γ k+1 p represents the sum of action weights in round k+1; k+1 (a) represents the probability of action a in the (k+1)th round.

2. The adaptive routing method for blockchain transaction information in wireless communication networks according to claim 1, characterized in that, In step 1, nodes in the wireless blockchain network communicate using the gossip protocol, specifically: each message has...<ttl,fanout> The format is as follows: ttl represents the remaining number of times the message can be forwarded, and fanout represents the number of neighbors to choose for forwarding. Each time, the routing node randomly selects fanout neighbors for forwarding. Each time the message is forwarded, the remaining number of times it can be forwarded is reduced by 1. Once ttl becomes 0, the message will no longer be forwarded.

3. The adaptive routing method for blockchain transaction information in a wireless communication network according to claim 2, characterized in that, In step 3, an adaptive routing method is used to determine whether to forward transaction τ. i Specifically, when routing node n j Received transaction information τ i First, node n j Determine if a transaction τ has been received i If the transaction has already been received, then discard it. i Otherwise, node n j Generate a random number r between 0 and 1; secondly, node n j Compare r with node n i Forwarding probability p ji Size; if the forwarding probability p ji If the value is greater than the random number r, then node n j Randomly select fanout neighbor nodes to route transactions τ i Otherwise, node n j Discard Transaction τ i .

4. The adaptive routing method for blockchain transaction information in a wireless communication network according to claim 3, characterized in that, In step 4, the transactions are verified, and the verified transactions are packaged into blocks. Specifically, when miner m... l Received transaction τ i Next, it first checks whether the same transaction has been received from other nodes. If so, the transaction is discarded. i Otherwise, miner m l Verify the transaction. i First, verified legitimate transactions are placed into the transaction pool; second, miner m l Transactions are selected from the transaction pool to build a block; finally, when the block meets the hash requirements, miner m... l Broadcast the new block.

Images