Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929472045842432 |
|---|---|
| author | Wen, Jinbo Kang, Jiawen Xiong, Zehui Du, Hongyang Yang, Zhaohui Niyato, Dusit Shen, Meng Jiao, Yutao Zhang, Yang |
| author_facet | Wen, Jinbo Kang, Jiawen Xiong, Zehui Du, Hongyang Yang, Zhaohui Niyato, Dusit Shen, Meng Jiao, Yutao Zhang, Yang |
| contents | Web 3.0 is regarded as a revolutionary paradigm that enables users to securely manage data without a centralized authority. Blockchains, which enable data to be managed in a decentralized and transparent manner, are key technologies for achieving Web 3.0 goals. However, Web 3.0 based on blockchains is still in its infancy, such as ensuring block freshness and optimizing block propagation for improving blockchain performance. In this paper, we develop a freshness-aware block propagation optimization framework for Web 3.0. We first propose a novel metric called Age of Block Information (AoBI) based on the concept of age of information to quantify block freshness. AoBI measures the time elapsed from the freshest transaction generation to the completion of block consensus. To make block propagation optimization tractable, we classify miners into five different states and propose a block propagation model for public blockchains inspired by epidemic models. Moreover, considering that the miners are bounded rational, we propose an incentive mechanism based on the evolutionary game for block propagation to improve block propagation efficiency. Numerical results demonstrate that compared with other block propagation mechanisms in public blockchains, the proposed scheme has a higher block forwarding probability, which improves block propagation efficiency and decreases the minimum value of average AoBI. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2403_12807 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0 Wen, Jinbo Kang, Jiawen Xiong, Zehui Du, Hongyang Yang, Zhaohui Niyato, Dusit Shen, Meng Jiao, Yutao Zhang, Yang Computer Science and Game Theory Web 3.0 is regarded as a revolutionary paradigm that enables users to securely manage data without a centralized authority. Blockchains, which enable data to be managed in a decentralized and transparent manner, are key technologies for achieving Web 3.0 goals. However, Web 3.0 based on blockchains is still in its infancy, such as ensuring block freshness and optimizing block propagation for improving blockchain performance. In this paper, we develop a freshness-aware block propagation optimization framework for Web 3.0. We first propose a novel metric called Age of Block Information (AoBI) based on the concept of age of information to quantify block freshness. AoBI measures the time elapsed from the freshest transaction generation to the completion of block consensus. To make block propagation optimization tractable, we classify miners into five different states and propose a block propagation model for public blockchains inspired by epidemic models. Moreover, considering that the miners are bounded rational, we propose an incentive mechanism based on the evolutionary game for block propagation to improve block propagation efficiency. Numerical results demonstrate that compared with other block propagation mechanisms in public blockchains, the proposed scheme has a higher block forwarding probability, which improves block propagation efficiency and decreases the minimum value of average AoBI. |
| title | Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0 |
| topic | Computer Science and Game Theory |
| url | https://arxiv.org/abs/2403.12807 |