Blockchain Papers

Kaiyu Wang, Zhiying Tu, Zhenzhou Ji, Shufan He

No abstract is available for this record.

Mohammad Nassar, Ori Rottenstreich, Ariel Orda

Blockchain leader-based protocols elect leaders for proposing the next block of transactions. Proposed blocks need to pass a validation routine in order to be added to the blockchain. Proposers may prioritize certain transactions based on their fees or accounts, which enables attackers to gain profits through block building, while simultaneously causing negative impacts on other users. A fair block selection follows a random selection of pending transactions among those that a proposer is aware of. We propose CFTO, a protocol that aims at encouraging fair block selection in a leader-based blockchain network while taking into account real network conditions, such as the network’s topology structure and the forwarding protocol. CFTO offers two main contributions. First, it provides incentives for acting honestly and diminishing malicious and dishonest nodes. To accomplish this, we use a reputation system, whereby each node is given a reputation score based on its actions. Second, it consists of an algorithm that evaluates the proposed blocks based on the zone structure of the network. Furthermore, we adapt the evaluation algorithm to fit the additional order constraints implied in Ethereum transaction ordering. We demonstrate the improved accuracy of CFTO in detecting fair blocks, in terms of increasing the probability of approving fair blocks and decreasing the probability of approving unfair blocks, by implementing experiments and comparing them with Helix (Yakira et al., 2021), a previously proposed consensus algorithm for fair block selection. As part of our experiments, we also compare certain features with those of previous studies.

Amane Yamamoto, Shin-ichi Yamashita

Ethereum has established itself as a highly decentralized and reliable blockchain network and serves as the de facto standard. However, using public blockchains in enterprise applications can be challenging due to concerns about confidentiality and transaction finality. As a result, consortium and private blockchains, which limit participation to specific nodes, are also commonly used. But these consortium blockchains also have limitations, such as limited node participation due to performance constraints imposed by the consensus algorithm. In this study, by using ZK-rollups as a messaging means, we would connect consortium blockchains via public Ethereum as a hub. We examined a mechanism to balance both mathematically reliable interoperability and maintaining the secrecy of the information and the finality. The concept was actually implemented, to confirm the interoperability of simple money transfer transactions. And also, the way to handle secret information and the finality was theoretically organized.

Alavieh Sadat Alavizadeh, Seyed Hossein Erfani, Meghdad Mirabi, Amir Sahafi

No abstract is available for this record.

Zheng Wang

The consensus algorithm of Bitcoin, namely proof-of-work (PoW), has been criticized for its high energy consumption and centralization of mining power. PoW needs a lot of processing power to execute cryptographic problems and verify network transactions. In contrast, Chia's consensus mechanism is based on proofs-of-space (PoSpace), which utilizes disk space rather than computing power. PoSpace involves generating a large amount of verifiable storage space on the network and requires less energy consumption than PoW. This paper presents a comparative analysis of the algorithms used by Bitcoin, Ethereum, and Chia. The paper simulates the PoW and PoSpace processes by Java and compares both mechanisms' memory, CPU usage, and time consumption using VisualVM. The experiment results show that PoSpace costs less space and time resources than PoW. The former is more energy-efficient and decentralized.

Jongho Seol, Nohpill Park

This paper proposes a, namely, asynchronous chain and presents a Variable Bulk Arrival and Asynchronous Bulk Service (VBAABS) model of the type in order to provide a quantitative method to design an asynchronous chain as a basis in its initial theoretical design stage. Note that the proposed chain is precisely and namely asynchronous along with adaptive-sized blocks in a proactive manner versus the conventional chain that controls the block posting in a strictly synchronous manner to the fixed-sized blocks. The model of the type (i.e., VBAVBS) is considered as the theoretical and quantitative baseline model for the proposed model, namely, an adaptive chain model, yet with a rather reactively dynamic size of blocks, while the proposed asynchronous model carries a proactively dynamic (or adaptive) size of blocks. The proposed asynchronous chain model assumes variable bulk arrivals of transactions in Poisson distribution, i.e., , where represents the number of slots across all the mined transactions, and variable asynchronous services of transactions, each of which applies to a block potentially of different capacity in terms of the number of slots in it, in exponential time, i.e., , for being posted in the current block, namely, VBAABS. The major quantitative distinction between the adaptive model, i.e., VBAVBS, and the asynchronous model, i.e., VBAABS, is that in VBAVBS, every state , where , transitions back into while in VBAABS, every state , where , transitions back into , where , as well as back into , and is the state in which the transaction up in execution is to be discarded, in other words, that the current block capacity is in excess of the required capacity for the transaction in execution to result in a potentially excessive delay as much as than an otherwise ordinarily fully synchronous block posting delay that is as much as . VBAABS will reveal the performance advantages of the asynchronous chain versus the baseline chain, i.e., VBASBS [30] and the adaptive chain, i.e., VBAVBS, with respect to the average time for a slot to wait in the block and the average spatial requirement by the slots in the block, in a quantitative manner. Extensive numerical simulations are conducted on Matlab. Further, for feasibility validation purpose, an asynchronous chain algorithm will be developed and implemented by redesigning the Ethereum open source and analyzed.

Rabeb Ben Othmen, Wassim Abbessi, Sofiane Ouni, Wafa Badreddine · 5 authors

Recently, blockchain technology has emerged as a revolutionary innovation with its distributed ledger feature that allows applications to store and transmit data in a secure, transparent, and immutable manner. One of the main ideas of blockchain technology is the consensus mechanism for reaching an agreement on the state of the distributed ledger. In this context, Practical Byzantine Fault Tolerance (PBFT) is one of the most popular algorithms. However, it has a high communication overhead and poor scalability. To overcome these limits, this paper presents the effectiveness of our algorithm Random Cluster PBFT (RC-PBFT) through an evaluation of its performance under various network conditions. Our algorithm runs on randomly selected clusters, and the results are then broadcast on the blockchain network. The effectiveness of RC-PBFT is demonstrated by implementations on the NS-3 network simulator, and the tests performed show that our approach achieves significant improvements compared to the original PBFT algorithm.

Muhammed F. Esgin, Oğuzhan Ersoy, Veronika Kuchta, Julian Loss · 8 authors

In this work, we study the blockchain leader election problem. The purpose of such protocols is to elect a leader who decides on the next block to be appended to the blockchain, for each block proposal round. Solutions to this problem are vital for the security of blockchain systems. We introduce an efficient blockchain leader election method with security based solely on standard assumptions for cryptographic hash functions (rather than public-key cryptographic assumptions) and that does not involve a racing condition as in Proof-of-Work based approaches. Thanks to the former feature, our solution provides the highest confidence in security, even in the post-quantum era. A particularly scalable application of our solution is in the Proof-of-Stake setting, and we investigate our solution in the Algorand blockchain system. We believe our leader election approach can be easily adapted to a range of other blockchain settings.

Daniël Reijsbergen, Aung Htein Maw, Jingchi Zhang, Tien Tuan Anh Dinh · 5 authors

A plethora of different blockchain platforms have emerged in recent years, but many of them operate in silos. As such, there is a need for reliable cross-chain communication to enable blockchain interoperability. Blockchain interoperability is challenging because transactions can typically not be reverted – as such, if one transaction is committed then the protocol must ensure that all related transactions are committed as well. Existing interoperability approaches, e.g., Cosmos and Polkadot, are limited in the sense that they only support interoperability between their own subchains, or require intrusive changes to existing blockchains. To overcome this limitation, we propose PIEChain, a general, Kafka-based cross-chain communication framework. We utilize PIEChain for a practical case study: a cross-chain auction in which users who hold tokens on multiple chains bid for a ticket sold on another chain. PIEChain is the first publicly available, practical implementation of a general framework for cross-chain communication.

Ahmad J. Alkhodair

The original FlexiChain and its descendants are a revolutionary distributed ledger technology (DLT) for cyber-physical systems (CPS) and their embedded systems (ES). FlexiChain, a DLT implementation, uses cryptography, distributed ledgers, peer-to-peer communications, scalable networks, and consensus. FlexiChain facilitates data structure agreements. This thesis offers a Block Directed Acyclic Graph (BDAG) architecture to link blocks to their forerunners to speed up validation. These data blocks are securely linked. This dissertation introduces Proof of Rapid Authentication, a novel consensus algorithm. This innovative method uses a distributed file to safely store a unique identifier (UID) based on node attributes to verify two blocks faster. This study also addresses CPS hardware security. A system of interconnected, user-unique identifiers allows each block's history to be monitored. This maintains each transaction and the validators who checked the block to ensure trustworthiness and honesty. We constructed a digital version that stays in sync with the distributed ledger as all nodes are linked by a NodeChain. The ledger is distributed without compromising node autonomy. Moreover, FlexiChain Layer 0 distributed ledger is also introduced and can connect and validate Layer 1 blockchains. This project produced a DAG-based blockchain integration platform with hardware security. The results illustrate a practical technique for creating a system depending on diverse applications' needs. This research's design and execution showed faster authentication, less cost, less complexity, greater scalability, higher interoperability, and reduced power consumption.

Andreas Erwig, Sebastian Faust, Siavash Riahi, Tobias Stöcker

Permissionless blockchain systems such as Bitcoin or Ethereum are slow and expensive, since transactions are processed in a distributed network by a large set of parties. To improve on these shortcomings, a prominent approach is given by so-called 2nd-layer protocols. In these protocols parties process transactions off-chain directly between each other, thereby drastically reducing the costly and slow interaction with the blockchain. In particular, in the optimistic case, when parties behave honestly, no interaction with the blockchain is needed. One of the most popular off-chain solutions are Plasma protocols (often also called commit-chains). These protocols are orchestrated by a so-called operator that maintains the system and processes transactions between parties. Importantly, the operator is trustless, i.e., even if it is malicious users of the system are guaranteed to not lose funds. To achieve this guarantee, Plasma protocols are highly complex and rely on involved and expensive dispute resolution processes. This has significantly slowed down development and deployment of these systems.In this work we propose CommiTEE – a simple and efficient Plasma system leveraging the power of trusted execution environments (TEE). Besides its simplicity, our protocol requires minimal interaction with the blockchain, thereby drastically reducing costs and improving efficiency. An additional benefit of our solution is that it allows for switching between operators, in case the main operator goes offline due to system failure, or behaving maliciously. We implemented and evaluated our system over Ethereum and show that it is at least 2 times (and in some cases more than 16 times) cheaper in terms of communication complexity when compared to existing Plasma implementations. Moreover, for protocols using zero-knowledge proofs (like NOCUST-ZKP), CommiTEE decreases the on-chain gas cost by a factor ≈ 19 compared to prior solution.

Xiaodong Qi, Jiao Jiao, Yi Li

As various optimizations being proposed recently, the performance of blockchains is no longer limited by the consensus protocols, successfully scaling to thousands of transactions per second. To further improve blockchains' throughput, exploiting the parallelism in smart contract executions becomes a clear solution to resolve the new performance bottleneck. The existing techniques perform concurrency control on smart contract transactions based on pre-determined read/write sets, which can hardly be calculated precisely. As a result, many parallelization opportunities are missed in order to maintain the correctness of transaction executions. In this paper, we propose a novel execution scheduling framework, DMVCC, to further increase the parallelism in smart contract executions, via more fine-grained control on state accesses. DMVCC improves over existing techniques with two key features: (1) write versioning, eliminating the write-write conflicts between transactions, and (2) early-write visibility, enabling other transactions to read the writes from a transaction earlier, before it being committed. We integrated DMVCC into the Ethereum Virtual Machine, to evaluate its performance in real-world blockchain environments. The experimental results show that DMVCC doubles the parallel speedup achievable to a 20 x overall speedup, compared with the serial execution baseline, approaching the theoretical optimum.

Mohammad Kowshik Alam, Md Sabbir Hossen Shuvo, Md Lutfur Rahman Fahad

With the rise of Artificial Intelligence and the autonomous digital ecosystem, the M2M financial systems that can make transactions without human intervention have been developed rapidly. AASI helps intelligent agents, IoT devices, and AI applications to facilitate efficient digital payments exchange in real-time. In the decentralized finance sector, smart commerce, cloud computing, and automated services, these systems are being more and more adopted. But keeping a high transaction efficiency, low transaction execution delay, and ensuring transaction consistency and reliability across different workloads is still difficult. This study analyzes the operational performance of the autonomous payment infrastructure in AI systems by calculating transaction throughput, transaction execution latency, and transaction execution consistency in machine to machine finance systems. The study employs the PaySim financial transaction dataset, in conjunction with automated rule-based financial transaction software agents, to emulate autonomous financial transactions. Fixed periods of machine-to-machine transactions are initiated between the intelligent agents, forming a credible autonomous financial system. Throughput of the research is the number of completed transactions per time unit and execution latency is the time elapsed between the initiation and completion of a transaction. The ratio of successful transaction executions in comparison with failed transaction executions is used to evaluate execution consistency. The experimental analysis is done for low, medium and high transaction loads to study the behavior of the infrastructure and its scalability under different loads. The experimental results confirm the efficiency of the autonomous payment infrastructure with moderate workloads, in particular, high throughput and low latency. If the volume of transactions increases dramatically, however, it impacts on the performance of the system in a negative way, by adding to processing delay and also decreasing execution consistency. As the workload increases, the number of transactions increases, the likelihood of error rises, and transaction congestion and computational bottlenecks occur. The results of the research enable us to practically define the assessment criteria of autonomous financial infrastructures based on measurable criteria. This research helps propel the growth of AI systems to enable the design of scalable, reliable and efficient autonomous payment systems for future machine-to-machine economies.

Mustafa Doger, Şennur Ulukuş

We improve security-latency bounds of Nakamoto consensus by analyzing the race between adversarial and honest chains in three different phases: pre-mining, confirmation and post-confirmation. We find the probability distribution of the length of the adversarial chain and the rigged adversarial chain under jumper models during the confirmation interval. We analyze certain properties of this race to model pre-mining and post-confirmation phases with random walks that provide tighter bounds than existing results. Combining all three phases provides novel upper and lower bounds for blockchains with small λΔ.

Vincent Gramoli, Qiang Tang

No abstract available.

Dipen Bhuva, Sathish Kumar

Cognitive communication helps track active and inactive resident space objects, which is part of Space Situation Awareness (SSA). Gathering and analyzing SSA sensor data helps evaluate the space environment, which maintains and enhances Space Traffic Management (STM) coordination and accommodation. Securing cognitive communication is required to protect the accuracy of transmitted data and provide authorized entities access privileges to data and services. It is difficult to create a reliable centralized Identity authentication and access control (AC) system because of the decentralization and heterogeneity of space systems, which can either be a performance bottleneck or a single point of failure. Blockchain technology holds enormous potential for securing cognitive communication-based space networks. We introduce blockchain-enabled, capability-based access control, decentralized authentication, and an automatic vulnerability correction algorithm to help smart contract administrators patch problems and enable efficient protection for devices, services, and information in space networks. A proof-of-concept prototype will be developed and tested on an Ethereum version 2 which uses proof of stake (PoS) blockchain network using both resource-constrained devices (such as Raspberry Pi nodes simulating as satellites with sensor observations) and more powerful computing devices (such as laptops simulating as ground network). The experimentation will be evaluated with computation overhead, latency, anomaly detection contract, and processing overhead. The outcomes of the experiments will demonstrate our objective to provide a decentralized, scalable, lightweight, and fine-grained blockchain solution for securing space communication networks.

Huawei Huang, Yetong Zhao, Zibin Zheng

Sharding is one of the most promising techniques that can improve the scalability and storage issues of blockchain systems. In the past few years, many sharding protocols have been proposed to contribute to the technique matrix of blockchain sharding such as the coordination mechanisms of blockchain shards, the handling of cross-shard transactions, the security guarantee of blockchain shards, etc. Although those previous solutions are crucial for sharded blockchains, we still have not found any systematic implementation of shard reconfiguration, which determines the security of a sharded blockchain because the shuffling of blockchain nodes could prevent malicious nodes from corrupting a shard. However, the implementation of shard reconfiguration is not easy. When reallocating blockchain nodes to designated shards, typical challenges include the following: i) how to synchronize a large size of state data for a newly arrived node, and ii) how to mitigate the large reconfiguration latency of blockchain shards while keeping the liveness and consistency properties of a blockchain system. To overcome those challenges, we propose a dedicated protocol for shard reconfiguration in blockchain sharding using trimmed Merkle Patricia Trie (tMPT). The proposed tMPT-based protocol is designed to guarantee the high efficiency of the reconfiguration of blockchain shards while ensuring the uninterrupted services of the sharded blockchain. We implement the proposed tMPT-based reconfiguration protocol in a prototype, which enables the functionality of blockchain sharding. We then deploy our prototype in Alibaba Cloud. The experimental results show that the proposed tMPT-based protocol outperforms the existing methods in terms of reconfiguration efficiency. For example, the throughput of the proposed protocol shows 198% higher than Ethereum's full sync method.

Omar Hasan

Decentralized distributed systems can provide certain advantages over their centralized counterparts. These include improved fault tolerance and attack resistance due to the elimination of a single point of failure, better censorship resistance and openness because of the absence of a central authority, as well as higher autonomy of the nodes due to self-governance of resources. Distributed ledger and blockchain technologies have played a key role in the increasing adoption of decentralized systems. One of the notable contributions of blockchains to decentralized systems is that they are able to ensure properties such as integrity, immutability, and verifiability even in trust-deficient environments where nodes lack trust in each other. However, ensuring the privacy of users still remains a challenge in decentralized systems where the application requires users to contribute confidential or identifiable information. Privacy is particularly challenging to achieve in trust-deficient environments due to the nodes not being able to rely on fellow nodes for privacy guarantees. My work addresses privacy preservation in trust-deficient decentralized systems. In this habilitation thesis, we include some selected contributions from our work in three broad areas: privacy-preserving decentralized reputation systems, privacy-preserving message routing in decentralized networks, and privacy preservation in decentralized financial networks.The reputation of a user in a distributed system may be computed as an aggregate of the feedback provided by fellow users. Privacy-preserving reputation systems enable users to provide feedback in a private and thus uninhibited manner. We present several contributions in this area, which include a decentralized privacy-preserving reputation protocol based on the computation of mean that is secure under the malicious adversarial model. The protocol offers significant improvement in performance as compared to earlier protocols in the literature. Additionally, we define an attack called Reputation-based Re-identification (RR attack), which can link successive contributions provided by a participant in participatory sensing applications and subsequently re-identify them. We then propose PrivaSense, a privacy-preserving reputation system that defends against this attack. Experiments on a real dataset demonstrate that PrivaSense is successful in decreasing the number of contributions linked to their providers. Furthermore, we propose a voting protocol (as a generalized instance of a privacy-preserving reputation protocol) that ensures transparency, confidentiality, and integrity in a decentralized trust-deficient setup. The persistence and immutability of the protocol's communication allow verifiability of the outcome by the voters themselves. Our contribution on secure voting is further extended by our work on collusion-resistant worker set selection. We propose protocols that select a subset of workers (who process data during the protocol execution) from the set of participants such that the risk of collusion between workers is minimized.Mobile Delay Tolerant Networks (MDTNs) are composed of mobile devices that communicate in a decentralized manner without the help of fixed infrastructure. A prediction-based routing protocol for MDTNs functions by forwarding a message from one intermediate node to another if the latter has higher probability of encountering the destination node. However, this process compromises the privacy of the nodes by revealing their mobility patterns. We propose the Privacy-Preserving Probabilistic Prediction-based Routing (4PR) protocol that forwards messages by comparing information about communities of nodes instead of individual nodes in order to protect their privacy. The protocol computes a probability function in a decentralized privacy-preserving manner. Simulations on a community-based mobility model demonstrate that our protocol is able to preserve privacy while offering performance comparable to protocols that do not protect privacy.Many Decentralized Finance (DeFi) Peer-to-Peer (P2P) lending platforms offer users to obtain a loan by committing a collateral or by calculating a credit score. However, the requirements of collateral and credit history are quite burdensome for certain groups of users. We propose to use a social trustworthiness score drawn from users' social interactions as an alternative risk mitigator for lending instead of collateral. Privacy considerations are taken into account in order to protect the borrower's privacy despite the use of social interaction data. Another application that we address is Supplier Impersonation Fraud (SIF) detection in the Business-to-Business (B2B) context. This type of fraud occurs when a company supplying goods and services to another company is impersonated by a fraudster in order to trigger a payment to an illegitimate bank account. We introduce GraphSIF, a SIF detection system that aims to infer knowledge from the relational properties created by the transactions of a company. GraphSIF analyzes data that has been heavily anonymized in order to preserve the privacy of the participating companies. The classification of a targeted transaction is performed by first clustering the graphs, and then comparing the similarity between the targeted transaction's graph with the other graphs of its cluster. The model shows good efficiency in terms of computational time needed to create the behavior sequence and to classify the transactions.

Rafael Belchior, Jan Süßenguth, Qi Feng, Thomas Hardjono · 6 authors

Blockchain interoperability conflates the need for distributed systems to communicate with third- party systems without the existence of a canonical chain or orchestration layer. As there is not “a chain to rule them all” (due to reasons such as performance, privacy, and market forces), these distributed systems rely on exchanging data and value across network boundaries. Interconnected systems achieve a higher value than the sum of their parts, similar to how the Internet emerged as a set of isolated Local Area Networks (LANs) - and, by force of surprising synergies, such networks fundamentally transformed society, forever. Concurrently, in the last decade, we have witnessed the astonishing development of blockchain technologies, which seem more connected than ever: via bridges [13, 15, 16, 31], oracles [45], and other interoperability mechanisms [4, 9, 17, 48, 89]. These recent developments have, slowly but steadily, contributed to the improvement of the scalability of blockchain networks, as well as providing new functionality and use cases [66], but there is still a long way to go until mass adoption. In this paper, we will dive into the rabbit hole of blockchain interoperability and explain why it is needed, what has been done in the last decade, and where it is going.

Cynthia Jayapal, Arunmadhavan Evr, G. S. Ajay Adithya, R Raajakishore · 5 authors

Digitization has been an important driver of change and has influenced the mode of operation of universities. However, the certificates of graduates are still paper-based and do not fit into the employer’s digitized recruitment process. The digitization of certificates has long been postponed and has not adopted to the digitized process of employers and universities. Further research on this topic shows that multiple industries will benefit from a digitized process that prevents forged certificates from degrading the value of legitimate recipients and issuing institutions. This paper aims to present a systematic literature review of current distributed ledger technology-based solutions and propose a new type of digital certificate that is hashgraph based to prevent fraud and counterfeiting.

Harvey G. Reed, Nathaniel Dailey

Decentralized approaches play an increasingly critical role in multi-stakeholder activities which require (a) shared situational awareness, (b) shared coordination points, and (c) historical record of activities, in disperse and distributed activities, such as manufacturing supply chains, space, and national security. These activities require stakeholders to mutually coordinate and cooperate by sharing information with each other. The common modes of information sharing are bi-lateral exchanges, and ‘walled garden’ sharing among a subset of stakeholders. Problems arise due to incomplete information sharing and lack of trust among stakeholders. The origins of mistrust are: (a) stakeholders may not trust (political, technical, risk) a single stakeholder to be fully in control of information flow and storage; (b) risk of central-point-of-failure is too high; (c) uncertain data integrity between stakeholders where all stakeholders do not trust each other. Multi-stakeholder data sharing challenges can be addressed with decentralized approaches and associated decentralized data technology such as ledgers and blockchain. Decentralized data technology includes decentralized identity (e.g., W3C DID), decentralized file storage, and blockchain/ledgers to provide cryptographically provable data integrity properties (e.g., tamper evident), as well as increased resilience to accident and attack. Fortunately, the decentralized data technology sector is maturing, and entering a phase of wider adoption in industry, pursuing decentralized data technologies at an increasing rate. This paper starts with a brief review of decentralized data technology, then describes multi-stakeholder examples in space sensor tasking and manufacturing supply chain where decentralized approaches and data technologies can improve coordination and cooperation.

Fei Song, Yuyin Ma, Zhenhui Yuan, Ilsun You · 6 authors

The Internet of Things (IoT) is supposed to bridge diversiform service functions and heterogeneous network components. Although the Web3 and blockchain have been regarded as pioneers to retrieve the power and rights from current and future Internet giants, there are still many serious integration issues if information centric mechanisms are enabled. In this article, we establish a system for Reliable Decentralized Networks (RDN) to enhance the capability of content privacy protection based on smart collaborative theory. Possible solutions are explored to create compatible IoT environment when massive data packets have been exposed and shared in complex scenarios. Specifically, we first present common cyberattack approaches inspired by well-known service patterns and typical network characteristics. The information centric requirements are investigated to reduce the leakage risk of existing procedures, which provides necessary repertoire for implementations. The details of RDN design and deployment include target content classifications, representative combination analysis, caching pattern identifications, and so on. Finally, we validate the RDN prototype to illustrate endogenous advantages and potential utilities.

Tao Shen, Tianyu Li, Zhuo Yu, Fenhua Bai · 5 authors

No abstract is available for this record.

Emanuel Vieira, João Almeida, Joaquim Ferreira, Paulo Bartolomeu

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.