Author
Listed:
- Basil Q. Abdulkareem
- Suad A. Alasadi
Abstract
The emergence and expansion of the Internet of Things (IoT) have created an increasing need for distributed, secure, and scalable consensus protocols that can validate transactions in such volatile and resource-limited environments. DAG-based ledger systems, in combination with Fast Probabilistic Consensus (FPC) offer high throughput with minimal communication cost for conflict resolution. However, traditional FPC does not have any logical means of assigning weight to different validators in an adversarial setting. In this context, this article attempts to present a hybrid Proof-of-Stake and Fast Probabilistic Consensus (PoS-FPC) protocol for DAG-based IoT systems. 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 the resolution of conflicting transactions. The weight of validators in the proposed framework is computed based on an adaptive weighting scheme that uses the normalized weight of stake and mana, dynamically tunes their weights depending on network traffic, and implements reward and penalty mechanisms to ensure honest participation and prevent malicious attacks. The proposed framework was tested by conducting discrete event simulations of 20,000 transactions in different adversarial situations. The 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 average convergence time of 3.73 rounds of the FPC algorithm. When compared to a mana-based DAG-FPC framework that was evaluated under the same simulation setup, the proposed framework outperforms it in terms of decision accuracy, conflict latency, faster convergence, and robustness to adversarial participation of up to 40%.
Suggested Citation
Handle:
RePEc:gvu:tcsst0:v:8:y:2026:i:3:id:2330
DOI: 10.36548/jtcsst.2026.3.012
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gvu:tcsst0:v:8:y:2026:i:3:id:2330. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Manager (email available below). General contact details of provider: https://irojournals.com/tcsst .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.