Abstract
An UAV network performing missions in complex environments is an Ad hoc network of a set of lightweight nodes that is not only exposed to external physical interference and network attacks, but also to the problem of dynamically generated error nodes within the network. The UAV network is essentially an asynchronous Byzantine distributed system. Completing the mission relies on the trustworthiness of the participating UAVs. The timely identification and isolation of errant nodes is necessary to ensure the overall performance of the UAV network during the mission. Assessing the latest status of UAVs and reaching consensus across the network is the key to solving the trust problem. It is a major challenge to break through the limitation of insufficient resources of UAV networks to achieve efficient consensus and accurate evaluation of UAV trusted status. The approach proposed in this paper is lightweight and asynchronous provable Byzantine fault-tolerant consensus algorithm that achieves global trusted state evaluation by obtaining an asynchronous generic subset by consensus on the local status data of nodes. It effectively reduces the communication and computational overhead. Through QualNet UAV network simulation experiments, comparing existing asynchronous consensus algorithms with better practicality, the recommended lightweight asynchronous provable consensus algorithm has better performance in terms of consensus latency and energy consumption rate.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alhaddad, N., Duan, S., Varia, M., Zhang, H.: Practical and improved Byzantine reliable broadcast and asynchronous verifiable information dispersal from hash functions. IACR Cryptolology ePrint Archive, p. 171 (2022). https://eprint.iacr.org/2022/171
Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Anderson, J.H., Peleg, D., Borowsky, E. (eds.) Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14–17, 1994. pp. 183–192. ACM (1994). https://doi.org/10.1145/197917.198088
Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 503–504. Springer, Heidelberg (2005). https://doi.org/10.1007/11561927_42
Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, 22–25 February 1999, pp. 173–186. USENIX Association (1999), https://dl.acm.org/citation.cfm?id=296824
Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. IACR Cryptology ePrint Archive, p. 841 (2020). https://eprint.iacr.org/2020/841
Kashyap, R., Arora, K., Sharma, M., Aazam, A.: Security-aware GA based practical Byzantine fault tolerance for permissioned blockchain. In: 4th International Conference on Control, Robotics and Cybernetics, CRC 2019, Tokyo, Japan, 27–30 September 2019, pp. 162–168. IEEE (2019). https://doi.org/10.1109/CRC.2019.00041
Li, B., Liang, R., Zhu, D.: Blockchain-based trust management model for location privacy preserving in VANET. IEEE Trans. Intell. Transp. Syst. 22(6), 3765–3775 (2021)
Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous Byzantine agreement, revisited. IACR Cryptology ePrint Archive, p. 842 (2020). https://eprint.iacr.org/2020/842
Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. IACR Cryptology ePrint Archive, p. 199 (2016). https://eprint.iacr.org/2016/199
Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2), 335–348 (1989). https://doi.org/10.1145/62044.62050
Xu, X., Zhu, D., Yang, X., Wang, S., Qi, L., Dou, W.: Concurrent practical Byzantine fault tolerance for integration of blockchain and supply chain. ACM Trans. Internet Tech. 21(1), 7:1–7:17 (2021). https://doi.org/10.1145/3395331
Zhang, Z., Zhu, D., Fan, W.: QPBFT: practical byzantine fault tolerance consensus algorithm based on quantified-role. In: Wang, G., Ko, R.K.L., Bhuiyan, M.Z.A., Pan, Y. (eds.) 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2020, Guangzhou, China, 29 December 2020–1 January 2021, pp. 991–997. IEEE (2020). https://doi.org/10.1109/TrustCom50675.2020.00132
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Kong, L., Chen, B., Hu, F. (2023). LAP-BFT: Lightweight Asynchronous Provable Byzantine Fault-Tolerant Consensus Mechanism for UAV Network Trusted Systems. In: Li, B., Yue, L., Tao, C., Han, X., Calvanese, D., Amagasa, T. (eds) Web and Big Data. APWeb-WAIM 2022. Lecture Notes in Computer Science, vol 13423. Springer, Cham. https://doi.org/10.1007/978-3-031-25201-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-031-25201-3_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-25200-6
Online ISBN: 978-3-031-25201-3
eBook Packages: Computer ScienceComputer Science (R0)