Research Article
Improved Byzantine Fault-Tolerant Algorithm Based on Alliance Chain
Algorithm 1
Byzantine node detection algorithm.
Input:Node feedback consistency table FT, client received information table RE | Output:True/false (true: Byzantine node exists; false: No byzantine node) | //determine the consistency of feedback messages | 1 for i = 0: N-1 | 3 if (!fi == fi+1) | 4 return true; | 5 end if | 6 end for | //determines whether the client has received node information for all nodes | 8if (RE.Length!=N) | 9 return true; | 10 end if |
|