Abstract:When applying blockchain in the Internet of things with mobile nodes, these nodes are called blockchain mobile nodes. Blockchain mobile nodes have problems such as short communication connection time, insufficient computing power and storage capacity, resulting in low security and throughput when the network reaches a consensus. To tackle these drawbacks, a trusted incentive algorithm is proposed to optimize the consensus process. First the blockchain mobile node receives the information required by the consensus and completes the initialization. Secondly, each blockchain mobile node generates a decision block, which contains the voting result of the verification message, its own credibility factor and the generation time of the decision block. A relay node is selected from the cluster composed of adjacent blockchain mobile nodes by the decision block. The relay node propagates the verification message to the next cluster and the generated blocks are stored in the edge server. One relay is one hop, the consensus is completed when the number of hops is greater than the network threshold number of hops. Finally, the network rewards or punishes the nodes according to the incentive mechanism, and updates the behavior identifications of the nodes according to the incentive situation, the behavior identifications is then fed back to the consensus. The simulation results show that compared with the POET and POS algorithms applied in the same network, the trusted incentive algorithm can effectively reduce the verification failure rate of verification messages and improve the consensus security under the condition of ensuring a certain throughput. It is more suitable for the Internet of things with mobile nodes.
ICP: