Abstract:
PBFT’s many benefits make it popular. Due to its high communication complexity and poor fault tolerance, PBFT is unsuitable for large-scale node scenarios. PBFT algorithms reduce communication complexity but reduce system security and fault tolerance. This paper proposes Dual-Primary-Node derived Practical Byzantine Fault Tolerance (DPNPBFT) to optimize the above three performances. DPNPBFT first chooses power-separated dual master nodes. To prevent centralization, the two master nodes balance and supervise each other. It simplifies the replica node’s master-only communication. DPNPBFT’s architecture achieves a practical 49% fault tolerance rate and is close to mainstream Proof of Work and Proof of Stake algorithms. Experimental results show DPNPBFT has O(N) communication complexity and excellent anti-host node malicious performance. DPNPBFT maintains 1700 Transactions Per Second. DPNPBFT has the best performance balance and comprehensive performance for large-scale Internet of Things applications.
Note: Please discuss with our team before submitting this abstract to the college. This Abstract or Synopsis varies based on student project requirements.
Did you like this final year project?
To download this project Code with thesis report and project training... Click Here
