Journal on Communications ›› 2022, Vol. 43 ›› Issue (1): 96-103.doi: 10.11959/j.issn.1000-436x.2022021

• Papers • Previous Articles     Next Articles

Two-layer grouped Byzantine fault tolerance algorithm for UAV swarm

Yu CHEN, Lianxing JIA   

  1. College of Information and Communication, National University of Defense Technology, Wuhan 430073, China
  • Revised:2021-11-01 Online:2022-01-25 Published:2022-01-01
  • Supported by:
    The National Natural Science Foundation of China(62102423)

Abstract:

To reduce the communication complexity and improve the robustness of blockchain network, a two-layer grouped Byzantine fault tolerance algorithm for unmanned ariel vehicle (UAV) swarm was proposed.First, nodes were divided into several groups according to the formation results of UAV swarm.A portion of high-reputation nodes were selected from each group to form a committee, and other nodes were used as shared nodes.Threshold signature techniques were employed to reduce communication complexity.In that way, nodes from other groups only needed to communicate with the committee nodes of the current group, thus greatly reducing the average communication delay.In addition, the hierarchical structure, which made the identity of the primary node hidden in the committee, reduced the risk of being adaptively attacked by the Byzantine nodes and improves the robustness of the system.Experimental results demonstrates that the proposed algorithm significantly reduces the delay of the consensus process and can effectively ensure the aliveness of the system compared with the comparison algorithm.

Key words: UAV swarm, Byzantine fault tolerance, consensus algorithm, two-layer grouped structure

CLC Number: 

No Suggested Reading articles found!