Ilmu Komputer & AI editorial
Open AccessOA2026
Improving Directed Acyclic Graph-Based IoT Consensus through a Hybrid Stake-Weighted Fast Probabilistic Consensus Framework
A PoS-FPC hybrid protocol for DAG-based IoT ledgers, evaluated on 20,000 transactions under adversarial conditions
Basil Q. Abdulkareem; Suad A. Alasadi· Journal of Trends in Computer Science and Smart Technology· 2026· DOI 10.36548/jtcsst.2026.3.012
The core problem
The Internet of Things (IoT) has created a growing need for distributed, secure, and scalable consensus protocols that can validate transactions in volatile and resource-limited environments. Directed Acyclic Graph (DAG)-based ledger systems, combined with Fast Probabilistic Consensus (FPC), offer high throughput with minimal communication cost for conflict resolution. However, traditional FPC lacks a logical means of assigning weight to different validators in an adversarial setting. This article presents a hybrid Proof-of-Stake and Fast Probabilistic Consensus (PoS-FPC) protocol for DAG-based IoT systems. The proposed framework addresses the gap by introducing stake-weighted FPC for conflict resolution, adaptive validator weighting, and reward/penalty mechanisms to ensure honest participation and prevent malicious attacks.
Innovation
Experimental evaluation yielded a throughput of 5,128 transactions per second, a decision accuracy of 99.6%, adversary resistance of 97.81%, a quorum latency of 69.782 ms, FPC conflict latency of 690 ms, and an average convergence time of 3.73 rounds of the FPC algorithm. When compared to a mana-based DAG-FPC framework under the same simulation setup, the proposed framework outperformed it in terms of decision accuracy, conflict latency, faster convergence, and robustness to adversarial participation of up to 40%.
The Internet of Things (IoT) has created a growing need for distributed, secure, and scalable consensus protocols that can validate transactions in volatile and resource-limited environments. Directed Acyclic Graph (DAG)-based ledger systems, combined with Fast Probabilistic Consensus (FPC), offer high throughput with minimal communication cost for conflict resolution. However, traditional FPC lacks a logical means of assigning weight to different validators in an adversarial setting. This article presents a hybrid Proof-of-Stake and Fast Probabilistic Consensus (PoS-FPC) protocol for DAG-based IoT systems. The proposed framework addresses the gap by introducing stake-weighted FPC for conflict resolution, adaptive validator weighting, and reward/penalty mechanisms to ensure honest participation and prevent malicious attacks.
The proposed framework consists of transaction attachments on a DAG graph, Ed25519 signatures, BLAKE2b-256 hashing, a weighted quorum for non-conflicting transactions, and a stake-weighted FPC algorithm for resolving conflicting transactions. Validator weight is computed using an adaptive weighting scheme that combines the normalized weight of stake and mana, dynamically tunes their relative weights based on network traffic, and applies reward and penalty mechanisms. The framework was evaluated through discrete event simulations of 20,000 transactions under different adversarial scenarios. The simulation setup compared the proposed PoS-FPC against a mana-based DAG-FPC framework under identical conditions.
Why it matters
The results demonstrate that incorporating stake-weighted FPC and adaptive weighting significantly improves consensus performance in DAG-based IoT systems. The high decision accuracy (99.6%) and adversary resistance (97.81%) indicate that the reward and penalty mechanisms effectively deter malicious behavior. The low quorum latency (69.782 ms) and FPC conflict latency (690 ms) suggest suitability for time-sensitive IoT applications. The average convergence of 3.73 rounds shows efficient conflict resolution. The framework's robustness up to 40% adversarial participation is a notable improvement over the mana-based baseline. However, the study is limited to simulation; real-world deployments may introduce additional challenges such as network partitions and varying device capabilities. Future work could explore integration with lightweight cryptographic primitives and cross-chain interoperability.
Who should read this
CS practitioners and researchers
Opening member content…