HN-mPBFT: A Healthy Node based Modified Secure and Fast Consensus Mechanisms for Internet of Vehicles
Amritesh Kumar,Lokendra Vishwakarma,Debasis Das +2 more
- pp 1638-1643
Reads0
Chats0
TLDR
Wang et al. as mentioned in this paper proposed a new consensus algorithm, named HN-mPBFT (Healthy Node based Modified PBFT), specifically designed for Internet of Vehicles (IoV), which reduces message overhead and transaction delay by reducing PBFT consensus phases while achieving consensus among healthy nodes.Abstract:
The Internet of Vehicles (IoV) enables vehicles and Road-Side-Unit to communicate and exchange data, promising to improve transportation safety, efficiency, and convenience. However, to realize the full potential of IoV, secure and fast traffic accident information (TAI) communication among IoV nodes are essential. The Practical Byzantine Fault Tolerance (PBFT)-based blockchain for IoV secures TAI; it is prone to high message overhead and transaction latency, which causes TAI transmission between IoV nodes to be delayed. This paper proposes a new consensus algorithm, named HN-mPBFT (Healthy Node based Modified PBFT), specifically designed for IoV. The HN-mPBFT consensus method reduces message overhead and transaction delay by reducing PBFT consensus phases while achieving consensus among healthy nodes. According to security analysis, HN-mPBFT is secure from Sybil and DDoS attacks. Performance analysis shows that HN-mPBFT reduces transaction latency by 50%.read more
References
More filters
Proceedings ArticleDOI
Practical Byzantine fault tolerance
Miguel Castro,Barbara Liskov +1 more
TL;DR: A new replication algorithm that is able to tolerate Byzantine faults that works in asynchronous environments like the Internet and incorporates several important optimizations that improve the response time of previous algorithms by more than an order of magnitude.
Posted Content
Estimating Continuous Distributions in Bayesian Classifiers
George H. John,Pat Langley +1 more
TL;DR: This paper abandon the normality assumption and instead use statistical methods for nonparametric density estimation for kernel estimation, which suggests that kernel estimation is a useful tool for learning Bayesian models.
Proceedings Article
Bitcoin-NG: a scalable blockchain protocol
TL;DR: This paper implements Bitcoin-NG, a new blockchain protocol designed to scale, which is Byzantine fault tolerant, is robust to extreme churn, and shares the same trust model obviating qualitative changes to the ecosystem.
Journal ArticleDOI
CreditCoin: A Privacy-Preserving Blockchain-Based Incentive Announcement Network for Communications of Smart Vehicles
TL;DR: This paper proposes an effective announcement network called CreditCoin, a novel privacy-preserving incentive announcement network based on Blockchain via an efficient anonymous vehicular announcement aggregation protocol, and shows that CreditCoin is efficient and practical in simulations of smart transportation.
Posted Content
Algorand: Scaling Byzantine Agreements for Cryptocurrencies.
TL;DR: Experimental results show that Algorand confirms transactions in under a minute, achieves 125x Bitcoin's throughput, and incurs almost no penalty for scaling to more users.