Safeguarding Cooperative Maneuver Information with Practical Byzantine Fault Tolerance

被引:1
|
作者
Vieira, Emanuel [1 ]
Almeida, Joao [2 ]
Ferreira, Joaquim [3 ]
Bartolomeu, Paulo C. [1 ]
机构
[1] Univ Aveiro, Dept Eletron Telecomunicacoes & Informat, Inst Telecomunicacoes, Campus Univ Santiago, P-3810193 Aveiro, Portugal
[2] Univ Aveiro, Inst Telecomunicacoes, Campus Univ Santiago, P-3810193 Aveiro, Portugal
[3] Univ Aveiro, Inst Telecomunicacoes, Escola Super Tecnol & Gestao Agueda, Campus Univ Santiago, P-3810193 Aveiro, Portugal
关键词
cooperative maneuvers; PBFT; consensus; data security; distributed ledger; blockchain;
D O I
10.1109/DSN-W58399.2023.00038
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Vehicular communications play a critical role in facilitating cooperative behavior among vehicles, leading to improved road safety and traffic efficiency. By sharing information such as speed, position, and trajectory, vehicles can collaborate to execute complex maneuvers like platooning, intersection crossing, and lane merging. In addition to coordinating maneuvers, vehicles can also communicate to identify critical information associated with a maneuver that needs to be saved for future analysis, particularly in case of accidents. To analyze the feasibility of such scenarios using a classical consensus algorithm, we implemented the PBFT protocol using short-range vehicular communications. Vehicles employ this protocol to agree on which maneuver data is critical, then registered securely using distributed ledger-based techniques. PBFT is combined with a maneuver coordination protocol similar to current standardization efforts by ETSI. The proposed system was tested using hardware-in-the-loop simulations using vehicles' onboard units equipped with ITS-G5 radio communications. Performance results show the feasibility of the proposed system for sufficiently high packet delivery rates.
引用
收藏
页码:108 / 115
页数:8
相关论文
共 50 条
  • [1] Practical Byzantine fault tolerance
    Castro, M
    Liskov, B
    USENIX ASSOCIATION PROCEEDINGS OF THE THIRD SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION (OSDI '99), 1999, : 173 - 186
  • [2] Dynamic Practical Byzantine Fault Tolerance
    Xu Hao
    Long Yu
    Liu Zhiqiang
    Liu Zhen
    Gu Dawu
    2018 IEEE CONFERENCE ON COMMUNICATIONS AND NETWORK SECURITY (CNS), 2018,
  • [3] Practical byzantine fault tolerance and proactive recovery
    Castro, M
    Liskov, B
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2002, 20 (04): : 398 - 461
  • [4] Towards a practical approach to confidential Byzantine fault tolerance
    Yin, J
    Martin, JP
    Venkataramani, A
    FUTURE DIRECTIONS IN DISTRIBUTED COMPUTING: RESEARCH AND POSITION PAPERS, 2003, 2584 : 51 - 56
  • [5] Grouped Multilayer Practical Byzantine Fault Tolerance Algorithm: A Practical Byzantine Fault Tolerance Consensus Algorithm Optimized for Digital Asset Trading Scenarios
    Liu, Jian
    Feng, Wenlong
    Huang, Mengxing
    Feng, Siling
    Zhang, Yu
    SENSORS, 2023, 23 (21)
  • [6] Practical Byzantine fault tolerance consensus based on comprehensive reputation
    Qi, Jiamou
    Guan, Yepeng
    PEER-TO-PEER NETWORKING AND APPLICATIONS, 2023, 16 (01) : 420 - 430
  • [7] Implementing Practical Byzantine Fault Tolerance Over Cellular Networks
    Zhou, Ziyi
    Onireti, Oluwakayode
    Lin, Xinyi
    Zhang, Lei
    Imran, Muhammad Ali
    IEEE OPEN JOURNAL OF THE COMMUNICATIONS SOCIETY, 2024, 5 : 6546 - 6560
  • [8] Practical Byzantine fault tolerance consensus based on comprehensive reputation
    Jiamou Qi
    Yepeng Guan
    Peer-to-Peer Networking and Applications, 2023, 16 : 420 - 430
  • [9] Research on Consensus Efficiency Based on Practical Byzantine Fault Tolerance
    Zhang, Li
    Li, Qinwei
    PROCEEDINGS OF 2018 10TH INTERNATIONAL CONFERENCE ON MODELLING, IDENTIFICATION AND CONTROL (ICMIC), 2018,
  • [10] Stochastic performance modeling for practical byzantine fault tolerance consensus in the blockchain
    Fan-Qi Ma
    Quan-Lin Li
    Yi-Han Liu
    Yan-Xia Chang
    Peer-to-Peer Networking and Applications, 2022, 15 : 2516 - 2528