Design of UAV swarm identity authentication based on lightweight blockchain

Blockchain technology has several characteristics, including decentralisation, non-tampering, and cryptographic algorithms. These characteristics are the focus of research for distributed group network authentication. However, the existing blockchain has high arithmetic requirements and low efficiency, which limits its application in UAV swarm group networks. Therefore, a lightweight blockchain UAV swarm identity authentication system has been designed. A model for a blockchain-based authentication system for UAV swarms is constructed. The system’s blockchain consensus algorithm, Practical Byzantine Fault Tolerance (PBFT), has been improved. A new lightweight trusted PBFT consensus algorithm, Lightweight Trusted PBFT (LTPBFT), has been proposed. This algorithm reduces the reputation reward and punishment mechanism and the voting mechanism by introducing the probability of Byzantine nodes acting as master nodes. The algorithm achieves this by introducing a reputation reward and punishment mechanism and a voting mechanism. The consistency protocol process has been optimised to simplify both its Prepare and Commit phases. This reduces communication complexity and achieves a lightweight authentication system. Simulation results demonstrate that the LTPBFT consensus algorithm is more efficient and stable than PBFT in terms of communication overhead, throughput, consensus delay and security.

Publication Details

Journal
SHILAP Revista de lepidopterología
Published
2024-10-01
DOI
https://doi.org/10.3969/j.issn.1673-3819.2024.05.005
Primary Topic
Skin and Cellular Biology Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Design of UAV swarm identity authentication based on lightweight blockchain

SHILAP Revista de lepidopterología
Skin and Cellular Biology Research
article

Design of UAV swarm identity authentication based on lightweight blockchain

article en

Abstract

Blockchain technology has several characteristics, including decentralisation, non-tampering, and cryptographic algorithms. These characteristics are the focus of research for distributed group network authentication. However, the existing blockchain has high arithmetic requirements and low efficiency, which limits its application in UAV swarm group networks. Therefore, a lightweight blockchain UAV swarm identity authentication system has been designed. A model for a blockchain-based authentication system for UAV swarms is constructed. The system’s blockchain consensus algorithm, Practical Byzantine Fault Tolerance (PBFT), has been improved. A new lightweight trusted PBFT consensus algorithm, Lightweight Trusted PBFT (LTPBFT), has been proposed. This algorithm reduces the reputation reward and punishment mechanism and the voting mechanism by introducing the probability of Byzantine nodes acting as master nodes. The algorithm achieves this by introducing a reputation reward and punishment mechanism and a voting mechanism. The consistency protocol process has been optimised to simplify both its Prepare and Commit phases. This reduces communication complexity and achieves a lightweight authentication system. Simulation results demonstrate that the LTPBFT consensus algorithm is more efficient and stable than PBFT in terms of communication overhead, throughput, consensus delay and security.

SHILAP Revista de lepidopterología
Peace, Justice and strong institutions
Openalex Percentile: Top 64%
Skin and Cellular Biology Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.