Abstract: In the Internet of Vehicles,the sharing and interaction of traffic information is required between vehicle nodes.How-ever,at present,there are still problems such as the difficulty in efficiently updating traffic data information between vehicle nodes and the dissemination of false information by malicious vehicle nodes.Aiming at the above problems,this paper proposes a Raft consensus algorithm based on credit evaluation model(CE-Raft).First,the credit evaluation model is constructed,and Byzantine vehicle nodes are detected and eliminated based on the isolated forest anomaly detection algorithm,and then an honest node number table is generated.Then the leader election is performed,and the honest node is elected as the leader by modifying the voting process of the follower node.Finally,log replication is performed,the leader node send an information synchronization request according to the honest node number table to ensure that the correct message reaches a consensus among the nodes.Experimental results show that the CE-Raft algorithm can effectively exclude Byzantine nodes,improve the prediction accuracy of honest nodes,and has lower latency and higher throughput,so that the Internet of Vehicles can still complete data sharing safely and efficiently in the presence of malicious nodes.

Key words: Blockchain, Raft, Isolated forest, Byzantine fault tolerance