Search Results (3)

This study evaluates leadership uniformity—the degree to which the proposer role is evenly distributed among validator nodes over time—in Quorum-based Byzantine Fault Tolerance (QBFT), a Byzantine Fault-Tolerant (BFT) consensus algorithm used in permissioned blockchain networks. By introducing simulated follower timeouts derived from uniform, normal, lognormal, and Weibull distributions, it models a range of network conditions and latency patterns across nodes. This approach integrates Raft-inspired timeout mechanisms into the QBFT framework, enabling a more detailed analysis of leader selection under different network conditions. Three leader selection strategies are tested: Direct selection of the node with the shortest timeout, and two quorum-based approaches selecting from the top 20% and 30% of nodes with the shortest timeouts. Simulations were conducted over 200 rounds in a 10-node network. Results show that leader selection was most equitable under the Weibull distribution with shape $k=0.5$, which captures delay behavior observed in real-world networks. In contrast, the uniform distribution did not consistently yield the most balanced outcomes. The findings also highlight the effectiveness of quorum-based selection: While choosing the node with the lowest timeout ensures responsiveness in each round, it does not guarantee uniform leadership over time. In low-variability distributions, certain nodes may be repeatedly selected by chance, as similar timeout values increase the likelihood of the same nodes appearing among the fastest. Incorporating controlled randomness through quorum-based voting improves rotation consistency and promotes fairer leader distribution, especially under heavy-tailed latency conditions. However, expanding the candidate pool beyond 30% (e.g., to 40% or 50%) introduced vote fragmentation, which complicated quorum formation in small networks and led to consensus failure. Overall, the study demonstrates the potential of timeout-aware, quorum-based leader selection as a more adaptive and equitable alternative to round-robin approaches, and provides a foundation for developing more sophisticated QBFT variants tailored to latency-sensitive networks. Full article

The Internet of Things has transformed industries, cities, and homes through a vast network of interconnected devices. As the IoT expands, the number of devices is projected to reach tens of billions, generating massive amounts of data. This growth presents significant data storage, management, and security challenges, especially in large-scale deployments such as smart cities and industrial operations. Traditional centralized solutions struggle to handle the high data volume and heterogeneity of IoT data, while ensuring real-time processing and interoperability. This paper presents the design, development, and evaluation of a blockchain framework tailored for the secure storage and management of data generated by IoT devices. Our framework introduces efficient methods for managing, transmitting, and securing data packets within a blockchain-enabled IoT network. The proposed framework uses a gateway node to aggregate multiple data packets into single transactions, increasing throughput, optimizing network bandwidth, reducing latency, simplifying data retrieval, and improving scalability. The results obtained from rigorous analysis and testing of the evaluated scenarios show that the proposed blockchain framework achieves a high level of performance, scalability, and efficiency while ensuring robust security being able to integrate a large number of IoT devices in a flexible manner. Full article

This work introduces a blockchain-based secure medical prescription-management system seamlessly integrated with a dynamic Internet of Things (IoT) framework. Notably, this integration constitutes a pivotal challenge in the arena of resource-constrained IoT devices: energy consumption. The choice of a suitable blockchain consensus mechanism emerges as the linchpin in surmounting this hurdle. Thus, this paper conducts a comprehensive comparison of energy consumption between two distinct consensus mechanisms: Proof of Work (PoW) and Quorum-based Byzantine fault tolerance (QBFT). Furthermore, an assessment of the most energy-efficient algorithm is performed across multiple networks and various parameters. This approach ensures the acquisition of reliable and statistically significant data, enabling meaningful conclusions to be drawn about the system’s performance in real-world scenarios. The experimental results show that, compared to the PoW, the QBFT consensus mechanism reduced the energy consumption by an average of 5%. This finding underscores the significant advantage of QBFT in addressing the energy consumption challenges posed by resource-constrained IoT devices. In addition to its inherent benefits of privacy and block time efficiency, the Quorum blockchain emerges as a more sustainable choice for IoT applications due to its lower power consumption. Full article