What question did this study set out to answer?

This research aims to develop a robust consensus protocol, Proof of Reward (PoR), for blockchain applications in smart cities that ensures high data integrity and throughput.

July 6, 2026Open Access

Proof of reward (PoR): a light weight consensus protocol for blockchain networks adopted in smart cities

Key Points

This research aims to develop a robust consensus protocol, Proof of Reward (PoR), for blockchain applications in smart cities that ensures high data integrity and throughput.
Developed a novel consensus algorithm, Proof of Reward (PoR), for use in blockchain networks.
Conducted comparative analysis of PoR with existing consensus mechanisms like PBFT and IBFT.
Evaluated communication overhead and network throughput improvements under simulated adversarial conditions.
PoR reduces communication overhead by 34.78% compared to PBFT and 18.55% compared to IBFT.
Significantly enhances resilience against Byzantine failures in distributed networks.
Increases overall network throughput by optimizing node response processes.

Abstract

Abstract In recent times, industries are expanding globally to meet the needs of growing population. Government and other regulatory bodies monitor industries to ensure compliance with standards particularly discharges that may pose threat to nearby residents. However, regulatory bodies often struggle with limited human resources that hinder the effectiveness of audit. This issue can be addressed by installing Internet of Things (IoT) devices in the industry to collect the data and store it on the servers, enabling regulatory bodies to review it remotely and conduct onsite inspection when anomalies detected. The challenging aspect is that the centrally stored data are vulnerable to cyberattacks and it can be tampered. Blockchain technology can provide a promising solution as it stores the data in the distributed ledger that is inherently tamper proof. However, using blockchain to store the data collected by IoT devices face challenges related to scalability. Further, latency will be also a concern due to the time taken by the consensus mechanism to validate the blocks and add them to the chain. To address these challenges, we introduce a novel consensus algorithm named Proof of Reward (PoR) tailored for applications demanding high throughput. The PoR consensus mechanism is designed to improve resilience against Byzantine failures by enabling reliable pairwise decision making under distributed adversarial environments. Further, the proposed consensus minimizes communication overhead during the block finalization by considering first two third of node responses, thereby enhancing the overall network throughput. The communication overhead of the proposed consensus is 34.78% lesser compared to Practical Byzantine Fault Tolerance (PBFT) and 18.55% lesser compared to Istanbul Byzantine Fault Tolerant (IBFT). The obtained results highlight the effectiveness of the proposed consensus algorithm.

AI से पूछें

Bookmark

View Full Paper