浏览全部资源
扫码关注微信
国防科技大学信息通信学院,湖北 武汉 430073
[ "陈宇(1990- ),男,湖北武汉人,博士,国防科技大学讲师,主要研究方向为区块链应用、图像视频处理等" ]
[ "贾连兴(1963- ),男,河南浚县人,博士,国防科技大学教授、博士生导师,主要研究方向为区块链应用、系统建模仿真等" ]
网络出版日期:2022-01,
纸质出版日期:2022-01-25
移动端阅览
陈宇, 贾连兴. 面向无人机集群的双层分组拜占庭容错算法[J]. 通信学报, 2022,43(1):96-103.
Yu CHEN, Lianxing JIA. Two-layer grouped Byzantine fault tolerance algorithm for UAV swarm[J]. Journal on communications, 2022, 43(1): 96-103.
陈宇, 贾连兴. 面向无人机集群的双层分组拜占庭容错算法[J]. 通信学报, 2022,43(1):96-103. DOI: 10.11959/j.issn.1000-436x.2022021.
Yu CHEN, Lianxing JIA. Two-layer grouped Byzantine fault tolerance algorithm for UAV swarm[J]. Journal on communications, 2022, 43(1): 96-103. DOI: 10.11959/j.issn.1000-436x.2022021.
针对区块链技术应用于无人机集群通信时存在的通信复杂度高、稳健性差等问题,提出了一种双层分组拜占庭容错算法。根据无人机的编队结果对节点进行分组,并从每组选取一部分高信誉节点组成委员会,其他节点作为共用节点,形成双层分组共识结构。使用门限签名技术降低通信复杂度,仅通过委员会节点与其他分组节点通信,减少分组间通信次数,使平均通信时延大幅度减小。分层结构使主节点身份隐匿于委员会之中,降低了主节点被敌方自适应攻击的风险,提升了系统的稳健性。实验结果表明,所提算法相比于对比算法,共识过程的时延显著降低,同时能够有效保证系统的活性。
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.
LI R , MA H Z . Research on UAV swarm cooperative reconnaissance and combat technology [C ] // Proceedings of 2020 3rd International Conference on Unmanned Systems (ICUS) . Piscataway:IEEE Press , 2020 : 996 - 999 .
未央 . 无人机漏洞繁多渐成黑客“帮凶” [J ] . 信息安全与通信保密 , 2016 , 14 ( 2 ): 72 - 73 .
WEI Y . UAVs have many vulnerabilities and gradually become hackers' accomplices [J ] . Information Security and Communication Secrecy , 2016 , 14 ( 2 ): 72 - 73 .
MERMER G B , ZEYDAN E , ARSLAN S S . An overview of blockchain technologies:Principles,opportunities and challenges [C ] // Proceedings of 2018 26th Signal Processing and Communications Applications Conference (SIU) . Piscataway:IEEE Press , 2018 : 1 - 4 .
LUCAS B , PÁEZ R V ,, . Consensus algorithm for a private blockchain [C ] // Proceedings of 2019 IEEE 9th International Conference on Electronics Information and Emergency Communication . Piscataway:IEEE Press , 2019 : 264 - 271 .
刘懿中 , 刘建伟 , 张宗洋 , 等 . 区块链共识机制研究综述 [J ] . 密码学报 , 2019 , 6 ( 4 ): 395 - 432 .
LIU Y Z , LIU J W , ZHANG Z Y , et al . Overview on blockchain consensus mechanisms [J ] . Journal of Cryptologic Research , 2019 , 6 ( 4 ): 395 - 432 .
PASS R , SHI E . FruitChains:a fair blockchain [C ] // Proceedings of the ACM Symposium on Principles of Distributed Computing . New York:ACM Press , 2017 : 315 - 324 .
KIAYIAS A , RUSSELL A , DAVID B , et al . Ouroboros:a provably secure proof-of-stake blockchain protocol [C ] // Advances in Cryptology 2017 . Berlin:Springer , 2017 : 357 - 388 .
FAN X X , CHAI Q . Roll-DPoS:a randomized delegated proof of stake scheme for scalable blockchain-based Internet of things systems [C ] // Proceedings of the 15th EAI International Conference on Mobile and Ubiquitous Systems:Computing,Networking and Services . New York:ACM Press , 2018 : 482 - 484 .
ABRAHAM I , MALKHI D , NAYAK K , et al . Solida:a blockchain protocol based on reconfigurable Byzantine consensus [J ] . arXiv Preprint,arXiv:1612.02916 , 2016 .
PASS R , SHI E . Hybrid consensus:efficient consensus in the permissionless model [C ] // Proceedings of 31st International Symposium on Distributed Computing . Piscataway:IEEE Press , 2017 : 1 - 16 .
LUU L , NARAYANAN V , ZHENG C D , et al . A secure sharding protocol for open blockchains [C ] // Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security . New York:ACM Press , 2016 : 17 - 30 .
LAMPORT L , SHOSTAK R , PEASE M . The Byzantine generals problem [J ] . ACM Transactions on Programming Languages and Systems , 1982 , 4 ( 3 ): 382 - 401 .
GOLAN G G , ABRAHAM I , GROSSMAN S , et al . SBFT:a scalable and decentralized trust infrastructure [C ] // Proceedings of 2019 49th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN) . Piscataway:IEEE Press , 2019 : 568 - 580 .
YIN M F , MALKHI D , REITER M K , et al . HotStuff:BFT consensus with linearity and responsiveness [C ] // Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing . New York:ACM Press , 2019 : 347 - 356 .
孙海锋 , 张文芳 , 王小敏 , 等 . 基于门限和环签名的抗自适应攻击拜占庭容错共识算法 [J ] . 自动化学报 , 2021 , PP ( 99 ): 1 - 12 .
SUN H F , ZHANG W F , WANG X M , et al . A robust Byzantine fault-tolerant consensus algorithm against adaptive attack based on ring signature and threshold signature [J ] . Acta Automatica Sinica , 2021 , PP ( 99 ): 1 - 12 .
黄冬艳 , 李浪 , 陈斌 , 等 . RBFT:基于Raft集群的拜占庭容错共识机制 [J ] . 通信学报 , 2021 , 42 ( 3 ): 209 - 219 .
HUANG D Y , LI L , CHEN B , et al . RBFT:a new Byzantine fault-tolerant consensus mechanism based on Raft cluster [J ] . Journal on Communications , 2021 , 42 ( 3 ): 209 - 219 .
WIENER M J . Cryptanalysis of short RSA secret exponents [J ] . IEEE Transactions on Information Theory , 1990 , 36 ( 3 ): 553 - 558 .
SHOUP V , . Practical threshold signatures [C ] // International Conference on the Theory and Applications of Cryptographic Techniques . Berlin:Springer , 2000 : 207 - 220 .
WANG Y , SONG Z , CHENG T . Improvement research of PBFT consensus algorithm based on credit [C ] // International Conference on Blockchain and Trustworthy Systems . Berlin:Springer , 2019 : 47 - 59 .
0
浏览量
748
下载量
0
CSCD
关联资源
相关文章
相关作者
相关机构