ISSN: 2685-9572 Buletin Ilmiah Sarjana Teknik Elektro
Vol. 8, No. 2, April 2026, pp. 435-450
Implementation of Vehicle Ad Hoc Networks for TPBFT on Latency and Fault Tolerance in Blockchain Systems
Liqaa Saadi Mezher 1,2, Ayam Mohsen Abbass 2, Muna Hadi Saleh 1
1 Department of Electrical Engineering, College of Engineering, University of Baghdad, Baghdad, Iraq
2 Department of Computer Engineering, College of Engineering, Al-Mustansiriyah University, Baghdad, Iraq
ARTICLE INFORMATION | ABSTRACT | |
Article History: Received 06 November 2025 Revised 23 January 2026 Accepted 13 April 2026 | In this paper, examines the combination of Vehicle Ad hoc Networks (VANETs) and a new consensus mechanism called Trust Practical Byzantine Fault Tolerance (TPBFT) that is aimed at improving latency and fault tolerance of decentralized vehicular networks. The VANETs are described by dynamic topology and mobile node and pose special security as well as reliability issues especially in scalable networks. The conventional Byzantine Fault Tolerance (BFT) protocols are ineffective because they incur communication overhead and scaling problems. This paper suggests TPBFT as a powerful consensus mechanism that is suitable to use in vehicular networks and is effective even when malicious or malfunctioning nodes are involved. To model real-life traffic patterns and communication scenarios, the research methodology presupposes extensive simulations based on Simulation of Urban Mobility (SUMO) tool and real-world Open Street Map (OSM) data with the help of the Python program. The performance of TPBFT is strictly tested and compared to the classic Practical Byzantine Fault Tolerance (PBFT) protocol through the analysis of the consensus latency, system throughput, and fault tolerance resilience. The findings indicate TPBFT has a shorter consensus latency (16 to 28 ms) and a greater throughput compared to PBFT and was more effective in time-constrained vehicular usage. The present work makes TPBFT an effective decentralized mechanism that allows achieving low latency, high throughput, and high resistance to Byzantine failures, offering a safe platform to deploy the blockchain technology in smart transportation systems. The optimization of the energy consumption profile of network nodes, as well as the refinement of the consensus process on the application of blockchain-based VANET architecture into practice, will be the subject of future research. | |
Keywords: VANET; TPBFT; Latency; Throughput; Blockchain | ||
Corresponding Author: Liqaa Saadi Mezher, Department of Computer Engineering, College of Engineering, Al-Mustansiriyah University, Baghdad, Iraq Email: iqa35@uomustansiriyah.edu.iq | ||
This work is open access under a Creative Commons Attribution-Share Alike 4.0 | ||
Document Citation: L. S. Mezher, A. M. Abbas, and M. H. Saleh, “Implementation of Vehicle Ad Hoc Networks for TPBFT on Latency and Fault Tolerance in Blockchain Systems,” Buletin Ilmiah Sarjana Teknik Elektro, vol. 8, no. 2, pp. 435-450, 2026, DOI: 10.12928/biste.v8i2.15227. | ||
The development of the Internet of Vehicles (IoV) and the transition to the autonomous transportation system has brought a new era when vehicles are not only the means of transportation but intelligent and communicative units of a large, dynamic network [1]. These Vehicle Ad hoc Networks (VANETs) are the promise of revolution in the road safety, traffic efficiency, and in-vehicle services due to machine-to-machine real-time communication [2]. Nonetheless, the same features which make VANETs highly mobile, temporary connected, and decentralized, also make them incredibly susceptible [3]. The security, trust, and reliable data transfer in such a dynamic setting is a daunting challenge that has proven to be very difficult to overcome and which poses a risk to the safety critical base of the next-generation transportation [4].
While traditional cryptographic authentication methods offer a baseline, they often rely on centralized authorities or pre-shared infrastructures, creating single points of failure and scalability bottlenecks in widely distributed vehicular ecosystems [5]. Blockchain technology has therefore come to play as a paradigm change contender to inject decentralization, transparency, and auditability in the VANETs. The blockchain can be utilized to support trustless co-operation between the unknown vehicles by providing a tamper-proof distributed registry of events and transactions [6]. However, the integration is not that simple. It is largely because, the consensus mechanisms underlying blockchain, the fundamental protocols that make possible decentralized agreement, are designed to operate in stable and resource-rich network settings. When deployed on the volatile and delay-sensitive environment of VANETs, these mechanisms, even classical PBFT, have fatal drawbacks: too much latency, unsustainability at communication overhead, and inadequate response to realistic failure modes of intermittent connectivity and malicious node behavior [7].
This is the critical misfit in this paper. Previous studies have partially examined the performance limits of Byzantine Fault Tolerance variants in real world-constrained, large-scale vehicular simulation, actually dynamic, that can be directly compared to the real world [8]. It is not just that VANETs require a blockchain layer over the top, but that a new consensus protocol that adheres to first principle and is sensitive to vehicles network kinetics is needed. We in turn suggest and analyze TPBFT, an original consensus mechanism optimistically designed to suit the VANET context. The following are the key contributions of our work [9]-[11]:
The rest of this paper is organized in such a way that our work is presented systematically. Section 2 provides essential background on blockchain and consensus protocols. Section 3 details the architecture of VANETs and the specific challenges they pose. Section 4 introduces the design and mechanics of our proposed TPBFT protocol. Section 5 describes the experimental setup and simulation methodology. Section 6 presents and discusses the results of our performance evaluation. Finally, Section 7 concludes the paper and outlines directions for future research.
Vehicular networks have the potential to provide a large amount of valuable data that can facilitate the operation of many applications, such as automatic parking, collaborative intersection management, road prediction, accident reconstruction, road-space management, traffic flow prediction, cooperative lane change, automatic overtaking, and collaborative maneuvering [12][13]. The characteristics of latency, workload, determinism, limited battery, and so on need to be taken into consideration. Most important of all is understanding the reasons for supportive data sharing. The transaction details of blockchain in the operation of vehicular networks can constitute all the nodes, so using blockchain to construct a trustworthy car-assisted cooperation system has its unique advantages [14][15].
However, in the context of blockchain, practical integrity cannot be based on majority decisions since the proof-of-work’s relaxed anonymity may allow the majority of attackers to be generated [16][17]. Trust Practical Byzantine Fault Tolerance (TPBFT) proves that it can quickly reach consensus among all parties (as long as there are 3f + 1 nodes in the system, where (f) is fault nodes, even with f Byzantine nodes to ensure that they see the same control of the blockchain), but the number of communications grows in a quadratic fashion as the number of Byzantine-party nodes increases linearly [18]. We found that even in the case of electromagnetic communication, the excessive demand on the network can lead to a significant surge in faults due to various reasons [19]. The feature of synchronous group failure leads to a cold fault period in the theory of blockchain’s latency, workload, and fault tolerance trade-offs among PBFT, which in turn affects the practicality of vehicular networks for many applications [20]. We must consider significant latency, throughput, and redundancy tolerance issues when improving determinism and developing a distributed-consensus blockchain for vehicular networks [21].
The security of the blockchain system would be impossible to comprehend without revising the technology underpinning the setup, i.e., blockchain technology. The Bitcoin cryptocurrency is the earliest and best-known application of blockchain technology [22]. At first glance, blockchain could be perceived as a distributed database. Each block is a data structure used to store transactions, and the transactions of a block are hashed. Each block's hash is stored in the next block, forming a chain known as the blockchain [23]. The blockchain is extended by creating new blocks linked to the previous blocks. In the implementation of a blockchain, two types of blockchains can be noted: public, open to any node, and private, where only approved nodes are designated to add new blocks to the blockchain [24]. No single entity controls the blockchain, as anyone within the network can utilize it, as shown in Figure 1. Since the blockchain blocks are chained and linked in a way that makes attempts at spoofing detectable, the data stored on the blockchain is immutable and regarded as non-forgeable [25].
TBFT is recognized as the consensus algorithm in the field of Trust Practical Byzantine Fault Tolerance. In fault-tolerant distributed computing, a validator group of n nodes (one-third or more of which are malicious) utilizes the TPBFT consensus model to maintain data on the blockchain network [26]. On the downside, TPBFT's competitors require a significant number of resources if they achieve a consensus mechanism on TPBFT for a large number of transactions. Commonly, validators join compared to permissionless chains, which reduces the number of validator nodes compared to permissionless chains [27].
Figure 1. Structure of Blockchain
The traditional centralized data flow sequence is in the order of the message producer and the structure of the messages [28]. In the current age of information, providing a strictly ordered centralized sequence of responsibility is expensive and inefficient. Therefore, concerns exist about the fairness and consistency of challenges to the central authority. In order to solve this problem, blockchain provides a decentralized structure. As a result, trust mechanisms affect areas that require security, such as identity certification, centralized authorization, and information sources [29]. The significant features of centralized systems, such as the integrity, stability, and the risk protection, are also inherited in a decentralized systems [30]. However, these advantages underscore the importance of incorporating specific characteristics, notably the complexity of making changes, the inescapability of record history, and the uniqueness of individuals and logical behavior [31]. Open membership for documentation, the necessity to guarantee the protocol's efficacy, a token-creation incentives agreement, and the implementation of verification processes diminish entrance costs by increasing opposing behaviors [32].
Consensus mechanisms play a crucial role in blockchain systems. They resolve errors and enhance reliability by achieving consensus through a distributed system [33]. One of the consensus mechanisms is the blockchain consensus mechanism. The blockchain consensus mechanism involves several parties in the system, who agree on a settlement rule and agree on the sequence of transaction processing to resolve disputes that occur in practice. In recent years, several mature blockchain consensus mechanisms have been proposed, including Proof of Work (PoW), Proof of Stake (PoS), and TPBFT [13]. Among them, PoW is the first consensus mechanism developed. It is very popular in the virtual currency market. However, PoW has the disadvantage of consuming a large amount of energy. TPBFT is a widely accepted consensus mechanism that offers low latency and high fault tolerance. It is not suitable for large-scale public blockchains. Fabric introduced the TPBFT consensus mechanism. Fabric is a practical, open-source blockchain platform and is easy to access for business applications [18].
In 2015, TPBFT appeared. TPBFT is an improved Practical Byzantine Fault Tolerance consensus mechanism (PBFT). TPBFT considers malicious behavior in cases of poor network conditions. It achieves slower internal voting in blockchain [34]. The results show that the proposed mechanism can provide better maximum TPS for different network sizes and can be used to determine the percentage of malicious nodes. In the future, the proposed TPBFT consensus mechanism can apply to private and non-private blockchains. The implementation of the VAC and TXP mechanisms is shown. Furthermore, it is also possible to compare the latency and fault tolerance between PBFT and TPBFT by constraining the consistency in both mechanisms to ensure the fastest execution speed allowed by the underlying network [35]. As an open public blockchain, the consensus mechanism must provide greater tolerance while handling a different range of transaction volumes. The goals are to implement an ad hoc vehicle network consisting of several connecting vehicles to be loaded into the PBFT and TPBFT algorithms and propose a supporting mechanism for preventing repeating taxes. That makes rare and illegal transactions useful.
By enhancing fault-tolerant strategies, the large number of tasks on blockchain systems can be resolved. One of the fault-tolerant techniques used in blockchain systems to provide high service quality is trust-based Byzantine fault tolerance. Intelligent fault-tolerant approaches, combined with VANET use, consider latency, bandwidth, jitter, and average traffic in network layers. Considering the especially critical nature of blockchain technology in VANET, this paper focuses on the GF and TE layers. To make the comparison useful, two crucial messages regarding the validity and correctness of VANET testing are also considered as test benchmarks [36].
The transaction total execution latency periods for both PBFT and TPBFT are as follows. However, the average processing latency period for the same number of transactions for both consensus mechanisms is, and the latency for the processing blocks is. The research outcome can also assist developers in autonomous techniques for developing their systems, and the latency experiment can be further expanded to include system scalability [37]. Furthermore, the implementation of TPBFT can likely improve the traditional PBFT problems if blockchain systems are studied, given its potentially excellent results. Additionally, TPBFT has the potential to be implemented in VANET at the researchers' next stage of development [38].
VANETs are promising in addressing the blockchain problems of latency and fault tolerance. The ad hoc network can transmit new blocks to neighboring nodes through regular broadcasting, thereby reducing the network complexity of the entire vehicle network [39]. This study introduces a block vote algorithm, in which the leader distributes the vote information to all previously defined service nodes and allows vehicles to vote on the new block. In the TBFT, a subset of the MNs voted to decide the order of the new block in the current block generation [40]. The primary chain selection strategy of typical blockchain, proof of work, is replaced by the zero-knowledge proof in which the other participant in the V2V contact can be used to supplement the operation of packet broadcasting so that the vehicle network can still sync with new blocks and achieve the self-organizing feature of the ad hoc network in a specific time range, as shown in Figure 2 [13]. The overall BCT block voting cycle is effectively shortened, allowing it to operate as either a full node, a light node, or an SPV.
Based on the existing proven V2V intercommunication and the existing floating key to achieve trust management, the service node is designed to play an essential role in the blockchain V2X network. In this work, the BCT datagram header has been optimized for the datagram identifier and provided for the winner list of vehicles, which records the vehicles whose intersection datagrams have been received [41]. The one with the most significant number of votes is defined as the leader to construct the winner list. This study introduces a block vote algorithm for TPBFT, and two types of service nodes are defined, which determine the state and voting role of these nodes when the vehicle becomes the new leader. Secondly, the process of vehicle transfer and the credit management mechanism for service nodes are introduced, as grouping vehicles and joining the blockchain architecture will influence the generation performance, which in turn affects the efficiency and effectiveness of BCT [42]. The blockchain-based architecture has been explained. Furthermore, it was applicable in various testing scenarios, including centralized, decentralized, and permissionless blockchains. As shown in the results section, the block interval and transmission delay exhibited a significant reduction in the system, both with and without incentives, which was faster than that of traditional blockchain systems [43].
Figure 2. Architecture of VANET
Research into the latency and fault tolerance of blockchain, within the domain of consensus, considers the communication system in place and the transaction delay of the consensus protocol. TPBFT is unsuitable for latency in the context of consensus protocols; currently, microsecond- and millisecond-level PBFTs are a hot topic of pursuit. A thorough exploration of the consensus protocol may influence the communication system and transaction delay of PBFT. In the context of traditional PBFT systems, vehicle ad hoc networks can enhance the PBFT process [44].
The relevance of vehicle ad hoc networks prompts us to research VANETs. Our contributions are summarized as follows. The characteristics of VANETs, TPBFT, and the consensus process are illustrated. A framework for the TPBFT system of VANETs is implemented in a simulator [45]. The actual situation of VANETs is observed, and the step-by-step improvement of a consensus protocol is predicted in future work. In the research section, systems for managing director-level responsibilities are being developed, commensurate with the actual state of VANETs and node roles throughout the consensus protocol [46].
In this section, divide the existing literature into four categories according to the server that stores the blockchain: centralized, distributed, semi-distributed storage, and light nodes. Each of these has its own perspective on the VANETs and blockchain integration, and they offer different degrees of fault tolerance, efficiency, and security. From the LAN level to the VANETs, every node is connected through LAN, which forms star-type communication. The road nodes exchange messages with the main server through the base station or the access point. Once the message forwarding succeeds, the main server will send the final result to the corresponding vehicle [47].
The advantages of centralized storage are as follows: high resource utilization, easy management and operation, and low investment costs. However, the existence of the central server may cause performance bottlenecks and a single point of failure in the entire VANET system [48]. Most VANET implementations based on the blockchain adopt centralized storage. Due to the rapid growth of blockchain storage, most distributed nodes cannot host blockchain data, which can lead to serious declining performance when exploring distributed storage, which requires homogeneous, trusted agents and a long initial sync time. However, the performance overhead may be significant. In semi-distributed storage, a small portion of full nodes is selected to store the newly generated data. This greatly reduces the storage and access cost of light nodes. A semi-distributed approach, wherein a small portion of RSU is selected as anchor nodes, allows the selected node to mine credible blocks and resolve the missing transactions in time [49].
Although VANETs have some differences compared to other types of ad hoc network environments, they also share the same problems related to ad hoc communication, such as the challenges of unique identity, network connection, and reappointment of network addresses. Maintaining a unique identity, network connection, and reappointment of network addresses is only a problem during topological changes in static ad hoc network environments because the vehicle’s network addresses and identities are not static and frequently change in VANETs due to high mobility [50]. Developing a VANET-unique vehicular communication environment that guarantees seamless, uninterrupted, secure communication is a bottleneck in VANET evolution and the main focus of many research topics on VANET security. Although the Certificate Authority System model briefly resolves the issues of identification and network connection in VANET, it has inevitable disadvantages when adopted in a practical VANET environment, namely a single point of failure, its cost, and other operational shortcomings. A better solution to the problems of VANET environments is to provide an authentication and agreement mechanism using blockchain [51].
However, the essential features of blockchain decentralization, fault-tolerant properties, consensus mechanisms, and decentralized power are not a good fit for energy-constrained, dynamic intermittent communication, which is characteristic of the VANET ad hoc environment. Researchers, by designing many unique applications to make VANETs more versatile, expect improvements in the V2V ad hoc environment, but implementing existing blockchain consensus mechanisms is not satisfactory for VANETs due to their associated consensus and performance problems [52]. The consensus mechanisms often consume several levels of communication messages to reach decisions in most existing blockchain systems in different VANET environments. The latency and performance issues across different consensus mechanisms can be addressed by several steps, such as optimizing the consensus thresholds depending on the emergency level, reducing communication protocols between the blockchain and drivers, switching between different consensus mechanisms in the blockchain based on vehicle density, or using a prediction-based consensus model [53]. Again, each of these newly developed solutions must choose several consensus mechanisms and their trade-offs based on the type of public blockchain [54].
The VANETs are implemented using a SUMO simulator tool, and the mobility model is obtained from Open Street Map (OSM) traffic simulator with a protocol for V2I communication, as shown in Figure 3. The continuous network architecture protocol is used as a network enhancement for vehicle networks. The blockchain system is implemented using a distributed open-source framework.
Figure 3: OSM Web Wizard
In this section, the simulation tools and environments employed are presented. The SUMO simulator is utilized to simulate connected vehicle environments and cover a variety of parameters and features, as shown in Figure 4. We have chosen to use the Python-based network simulator to perform simulations. It is a simulator for students and researchers in the field of vehicular communication networks, enabling them to implement their own settings and environmental conditions. The paper is a source code that is based on Python, and it provides guidelines for other researchers to modify or create new scenarios. It is composed of a large set of elements that comprise the simulator, such as Mobility Trace, Field, Vehicle, and Applications.
The core simulator allows researchers to model, simulate, analyze, design, and prototype vehicular ad-hoc networks environments with a high degree of customizability and performance constraints. The simulator is designed to be open, to be used with standard programming tools, and to facilitate reusability. The simulator is highly significant, used by students and researchers to model, prototype, simulate, and provide a reference implementation to analyze and to provide guidelines on how to create new environments. In addition, the simulator can test research initiatives before actual deployment. The simulation platform's dominant performance involves gathering critical performance metrics and profiling algorithms to determine their suitability for specific requirements.
Figure 4. Data Extraction in SUMO of Area (100*100) km²
Performance metrics play a crucial role in blockchain for its efficient working across the network and the applications. The major metrics that determine the performance of the blockchain system are the number of consensuses reached, the number of blocks generated, the transactions occurring across the network, and the maximum latency of the network for reaching the consensus decision. The more consensus and blocks handled, the faster the blockchain system works in terms of providing the transactions. Reduction in consensus and block generation, with increased throughput and decreased latency, has been significantly contributed to by the literature. These performance metrics can be defined as: The number of consensuses reached Number of blocks generated the overall number of transactions occurring across the network The maximum latency of the network in reaching the consensus decision, as shown in Figure 5.
Figure 5. Consensus TPBFT of 1000 Vehicle Nodes
Latency and throughput are the main performance parameters for VANET applications. Therefore, the main goal of this study was to find the latency associated with each of the consensus mechanisms when BAS was applied as the blockchain system. The results of this study are discussed in the following section. The latency measurement of the systems is described in this section. The implementation and result analysis of both protocols are discussed in the next section as well. Latency measurement is an important aspect to consider at all levels of implementation. Every slight difference in the response time can cause a delay in this kind of communication, and for any vehicle network including critical data, that could be very crucial. It is not necessary for ships, trains, or other VANETs, but for the intelligent driving of the vehicle, latency must be less, and the correct information must be received by all connected vehicles over various distances. All of the consensus times for latency on each protocol are used, with time to block generation, then capturing the receiving time of the ledger, and a combined time difference measure for a single block of the whole number. Different data are used to compare the different consensus protocols, as well as provide different fault tolerance and throughput measurements, as shown in Figure 6.
Figure 6. TPBFT Consensus Process
Autonomous vehicles are expected to form a network to share information about the external environment in real time. A network of autonomous vehicles is a VANET, which is a temporal network with restricted mobility, where the vehicles gather during the journey. Various efforts have been made to address this challenge based on the distributed autonomous vehicle network. In the case of actual applied systems, a consensus algorithm is required that is tolerant to mobile network faults. This text combines the V2I communications technology, which has been actively studied as a communication method for autonomous vehicles, and the blockchain-based consensus algorithm that does not depend on the frequency or quality of communication with the vehicle, and it presents and compares the results of evaluations of real-time performance and fault tolerance.
The text combines the autonomous vehicle communication method, where quality is not guaranteed and the frequency of communication is limited, with the autonomous vehicle consensus algorithm, targeting both blockchain projects and many ongoing projects for autonomous vehicles. We present autonomous vehicle models that cover the common TPBFT consensus algorithm. When combined with VANET, the typical autonomous vehicle experience blockchain disadvantages, such as latency and lack of fault tolerance, provide significant efficiency performance and more reliability in terms of disaster prevention. The advantages of the two combined systems are compared and limit latency to blockchain transactions while maintaining fault tolerance.
This study analyzed the performance of VANET, which uses the transaction division hierarchical ECDS blockless algorithm, and compared the performance of TPBFT consensus algorithms in this context. In addition, a comparison with other systems of blockchain in VANET was also carried out. Our analysis showed that one algorithm achieves less latency than another as the number of companies increases or decreases. Conversely, the latency of the alternative algorithm tends to increase with the number of transactions. For the TPBFT algorithm performed over VANET, satisfactory fault tolerance results were presented, as long as the established computational power for each company is respected. Finally, the division of the transaction key block type used in this study to decide which company retains the committed transaction is a good choice since it presents the best results when compared to the division into sub-blocks and the verification of dependencies on the blockchain. The average latency of the transaction approval methods in the VANET achieved 28 and 16 milliseconds, respectively, of correct vehicle nodes, as shown in Figure 7.
Figure 8 represents the average latency of TPBFT phases in VANET, which contains 333 faulty vehicle nodes from 1000 vehicle nodes. The graph compares how latency varies during each phase with fluctuating numbers of correct nodes, illustrating that latency values generally range between 0.0032 and 0.0064 seconds. The network delay varied according to the structure of the network; the delay in approving transactions was directly influenced by the number of nodes in the transportation network. With the quantification of computing blocks per network context in VANETs, this study collates barriers that were focused only on hardware applications used for attack mitigation in the VANET, ensuring the trust of the blockchain.
Figure 7. Average Latency of 667 Correct Vehicle Nodes of All TPBFT Phases
Figure 8. Average Latency of 333 Faulty Vehicle Nodes of All TPBFT Phases
In the following graphs, we summarize the effect of adopting TPBFT on the latency. To get a visualized and rough understanding of the performance gap, we present the data of an empty blockchain in our graphs. To have an in-depth investigation of the LTP between different blockchains under different settings, we randomly take 1000 generated nodes from the two selected blockchains and compute the median; the median is the point in the distribution of the blocks. The parent of a randomly generated block and its presentation time will effectively decrease the computational cost. Also, the bottleneck is how to get the mean and variance of the block interval and sustain the high performance of the realization. Figure 9 represents the average throughput of TPBFT phases in VANET, which contains 667 correct vehicle nodes from 1000 vehicle nodes. The graph compares how throughput varies during each phase with fluctuating numbers of correct nodes, illustrating that throughput values generally range between 0.8 and 1.4 seconds, with some spikes and dips throughout.
Figure 9. Average Throughput of 667 Correct Vehicle Nodes of All TPBFT Phases
Figure 10 represents the average latency of TPBFT phases in VANET, which contains 333 faulty vehicle nodes from 1000 vehicle nodes. The graph compares how latency varies during each phase with fluctuating numbers of correct nodes, illustrating that latency values generally range between 0.0032 and 0.0064 seconds. As the number of rounds in the consensus state diagram is 3 and the time spent measured by the real transaction is far from being 0, we only include priority of error (Pe) as shown in Figure 11 and priority of censuses (Pc) in this diagram. It is observed that the VANET network has a Pe, which is a priority of error, of less than multiple seconds; however, it should be noted that some outliers even have a transaction time much greater than one minute. Since Litecoin has a large block size, the rate of a new block is very good; the rate is only lower in an interval from 6.5 to 10 minutes. For the two blockchains, TPBFT leads to a significant increase in the block rate. From the perspective of latency, the distribution time in adopting the same consensus mechanism will improve if the number of rounds is smaller, and the time to finish consensus will also decrease. The big O time of TPBFT depends on the number of rounds, representatives, and other settings.
Figure 10. Average Throughput of 333 Faulty Vehicle Nodes of All TPBFT Phases
Figure 11. Priority of Error Nodes from 1000 Vehicle Nodes
In case of a protocol failure, the network self-heals between two conflicting rounds of the protocol. A newly connected node experiencing a protocol failure would, when choosing from different known peers to connect to, pick similarly behaving nodes. The network would then heal, declaring the unknown link bandwidth performance peer node as a malicious misbehaving node, hence limiting its ability to participate in the protocol consensus. This means that if a known peer is trying to sybil attack a node, it would do so with already known misbehaving sybil nodes, being unable to mask its capabilities. Upon being flooded with vote messages showing the Byzantine misbehaving node signature for a consensus slot, previously known settled and accepted messages showing a different signature by a majority are validated as correct, and this can happen locally. Newly connected nodes should be untrusted until discovered as not being Sybil partners of a peer-connected node.
However, during the presence of the adversary’s conflicting vote broadcast, some unknown remote nodes may open connections that ask for part of an attacker’s signed vote. If the nodes identify signature misuse by the possible Byzantine adversaries, they receive votes from, they can quickly declare the newly connected nodes as attackers, hence dropping them as connected peers. During this broadcast, connected peers can locate other malicious peers since there will not be agreement with their view over the decision that has been settled and accepted. It is only because the unknown connected nodes may behave without knowing current vote round results, which in some cases can be valid syntactic actions that cost bandwidth over the network. With only broadcast messages from nodes in the view, only two-thirds of nodes need to receive vote messages to achieve the topology convergence of interconnected peers, ensuring the success of the protocol, as shown in Figure 12.
Figure 12. The Total TPBFT Verification of 1000 Vehicle Nodes
Discussions on the findings are followed by potential ideas for future work in this chapter. This chapter concludes with a summary of the relation of each research objective to the findings and a forecast about the development of the AVs and VANET environment.
The implementations simulated that as VANET was applied, the security and reliability of the PBFT and TBFT systems were enhanced. We projected that the nodes for keeping and protecting the blockchain technology would move and develop along with the AVs, reflecting the result of our research on SMC. Additionally, numerous vehicles would host their copies of the blockchain technology before the wave of AVs shows up on the road. The capability of two-way communication among civilian cars would both increase trust in traffic safety and promote the public adoption of the AVs. More extensive data in VANET systems and security and reliability in VANET systems may upgrade the effectiveness of blockchain technology. After the wave of AVs we projected, numerous vehicles would host their copies of the blockchain technology. Therefore, the capability of two-way communication among civilian cars would both increase trust in traffic safety and promote the public adoption of the AVs. More extensive data in VANET systems and security and reliability in VANET systems may upgrade the effectiveness of blockchain technology.
We developed a VANET system-based VANT and blockchain. We presented two methods that the VANET system can benefit a blockchain system. As to the first method, the PBFT or TBFT algorithm is used to construct and maintain the blockchain system in each vehicle at every time period; as a result, they can achieve a faster consensus. As to the second method, the PBFT or TBFT algorithm is used to construct the blockchain system when some vehicles arrive at the destination. Making use of both of them should be a better choice than using the singular.
Although our proposal showed the advantages, it still has some limitations that are waiting for improvement. We plan to improve the following areas in the future: a) Set the electric device in the vehicle on/off. After the engine is ignited, electricity is available; otherwise, it is not available. We will utilize private vehicle owners to maintain their own blockchain system because the power supply of each vehicle connected to the public service is very limited. There could be a huge obstacle if the current is used to maintain the blockchain system. Also, in fact, the RID of each vehicle is a unique code, which has a relationship with the initialization function and cannot be 0. That is to say, the vehicle communicates with its destination at any time. The decision-making function of the vehicle must be started at any moment. However, whether it is started or not has nothing to do with whether the engine is on or not. The function is constant.
This research presented a comprehensive investigation into enhancing Vehicular Ad hoc Networks (VANETs) through the integration of an improved consensus mechanism tailored for dynamic, adversarial environments. Our work centered on the design, implementation, and evaluation of a **Trust Practical Byzantine Fault Tolerance (TPBFT)** protocol, specifically engineered to address the critical challenges of latency and fault tolerance in blockchain-based vehicular systems.
Research Summary
Through realistic simulations employing the SUMO traffic simulator and OpenStreetMap data, we demonstrated that TPBFT significantly outperforms traditional PBFT within VANET contexts. The proposed mechanism achieved a marked reduction in consensus latency, reaching as low as 16-28 milliseconds, while maintaining robust operation in the presence of malicious nodes. These results validate TPBFT as a viable and efficient consensus layer for secure, decentralized communication in intelligent transportation systems.
Key Contributions
The primary contributions of this paper are threefold:
Limitations and Future Work
Despite promising results, our study acknowledges certain limitations. The simulations, while realistic, operate under controlled network assumptions and idealized traffic models. Furthermore, the energy consumption associated with continuous consensus operations and the scalability of the protocol in ultra-dense vehicular scenarios require deeper exploration.
Our future research will focus on the following directions:
In summary, this work provides a foundational step toward secure, low-latency, and trustworthy cooperative systems for the future of intelligent transportation. By bridging the gap between robust blockchain consensus and the demanding environment of VANETs, our TPBFT protocol paves the way for the reliable and large-scale deployment of decentralized automotive applications.
REFERENCES
Liqaa Saadi Mezher (Implementation of Vehicle Ad Hoc Networks for TPBFT on Latency and Fault Tolerance in Blockchain Systems)