Direct Acyclic Graph-Based Ledger for Internet of Things: Performance and Security Analysis
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Direct Acyclic Graph (DAG)-based ledger and the corresponding consensus algorithm has been identified as a promising technology for Internet of Things (IoT). Compared with Proof-of-Work (PoW) and Proof-of-Stake (PoS) that have been widely used in blockchain, the consensus mechanism designed on DAG structure (simply called as DAG consensus) can overcome some shortcomings such as high resource consumption, high transaction fee, low transaction throughput and long confirmation delay. However, the theoretic analysis on the DAG consensus is an untapped venue to be explored. To this end, based on one of the most typical DAG consensuses, Tangle, we investigate the impact of network load on the performance and security of the DAG-based ledger. Considering unsteady network load, we first propose a Markov chain model to capture the behavior of DAG consensus process under dynamic load conditions. The key performance metrics, i.e., cumulative weight and confirmation delay are analysed based on the proposed model. Then, we leverage a stochastic model to analyse the probability of a successful double-spending attack in different network load regimes. The results can provide an insightful understanding of DAG consensus process, e.g., how the network load affects the confirmation delay and the probability of a successful attack. Meanwhile, we also demonstrate the trade-off between security level and confirmation delay, which can act as a guidance for practical deployment of DAG-based ledgers.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Consortium Blockchain for Secure Energy Trading in Industrial Internet of Things
Li, Z., Kang, J., Yu, R., Ye, D., Deng, Q., & Zhang, Y. (2017) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2017.2786307 · Cited by 1,103
BlockChain: A Distributed Solution to Automotive Security and Privacy
Dorri, A., Steger, M., Kanhere, S. S., & Jurdak, R. (2017) · IEEE Communications Magazine · doi:10.1109/mcom.2017.1700879 · Cited by 807
Cited by
Blockchain Intelligence for Internet of Vehicles: Challenges and Solutions
Wang, X., Zhu, H., Ning, Z., Guo, L., & Zhang, Y. (2023) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2023.3305312 · Cited by 131
Jiang, W., Tao, J., & Guan, Z. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3492031 · Cited by 9
Metadata
- Authors
- Li, Y., Cao, B., Peng, M., Zhang, L., Zhang, L., Feng, D., & Yu, J.
- Venue
- IEEE/ACM Transactions on Networking
- Published
- 2020-08
- Volume
- 28
- Issue
- 4
- Pages
- 1643-1656
- ISSN
- 1063-6692 (ISSN-L)
- 1558-2566
- OpenAlex
- W2945287947
- Cited by
- 175
- References
- 2
- FWCI
- 25.10
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.