Advanced DAG-Based Ranking (ADR) Protocol for Blockchain Scalability
Tayyaba Noreen, Qiufen Xia, Muhammad Zeeshan Haider

TL;DR
The paper introduces the ADR protocol, a DAG-based blockchain solution that significantly improves scalability and throughput, making it suitable for IoT applications by ranking nodes and filtering malicious actors.
Contribution
It presents a novel ADR protocol that employs a DAG structure with a ranking algorithm to enhance blockchain scalability and security against malicious nodes.
Findings
ADR outperforms IOTA and ByteBall in throughput
The protocol maintains high network liveness with malicious nodes present
Simulation on EC2 shows significant scalability improvements
Abstract
In the past decade, blockchain has emerged as a promising solution for building secure distributed ledgers and has attracted significant attention. However, current blockchain systems suffer from limited throughput, poor scalability, and high latency. Due to limitations in consensus mechanisms, especially in managing node identities, blockchain is often considered unsuitable for applications such as the Internet of Things (IoT). This paper proposes the Advanced DAG-based Ranking (ADR) protocol to enhance blockchain scalability and throughput. ADR employs a directed acyclic graph (DAG) structure where nodes are positioned based on their rankings. Unlike traditional chains, ADR allows honest nodes to write blocks and verify transactions using a DAG-based topology. The protocol follows a three-step approach to secure the network against double-spending and enhance performance. First, it…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
