A Leader Election Method Based on ε-greedy Strategy
With the widespread deployment of blockchain,latency-sensitive applications such as unmanned collaboration have increasing demands for low latency of blockchain.In collaborative scenarios,blockchain nodes are usually highly heterogeneous and deployed across regions.In leader-based Byzantine Fault Tolerant(BFT)consensus protocols,a weak and unstable leader will lead to unnecessarily high latency and reduce the availability of blockchain,especially under resource-limited mobile or sensor networks.To solve the problem,ε-LE,a leader election method with latency awareness,is proposed.Based on the measured communication delay from the node to the leader,this method uses an s-greedy strategy to select the leader.As a result,there will be a higher probability for stable nodes in critical positions to become the leader,thus optimizing the consensus latency.Compared with methods such as AWARE,ε-LE achieves O(N)communication complexity and is more suitable for consensus protocols with linear communication complexity.The experiment shows that the critical replica that may optimize consensus latency will be selected by ε-LE as the leader,and an approximately 21％throughput improvement in a linear topology network is achieved.
国家科技期刊平台
NSTL
万方数据
