File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/TCCN.2024.3522977
- Scopus: eid_2-s2.0-85213716600
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Article: Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0
| Title | Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0 |
|---|---|
| Authors | |
| Keywords | age of information block propagation evolutionary game Web 3.0 wireless networks |
| Issue Date | 2024 |
| Citation | IEEE Transactions on Cognitive Communications and Networking, 2024 How to Cite? |
| Abstract | 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, blockchain-based Web 3.0 is still in its infancy, such as ensuring block freshness and optimizing block propagation to improve 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. |
| Persistent Identifier | http://hdl.handle.net/10722/353257 |
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Wen, Jinbo | - |
| dc.contributor.author | Kang, Jiawen | - |
| dc.contributor.author | Xiong, Zehui | - |
| dc.contributor.author | Du, Hongyang | - |
| dc.contributor.author | Yang, Zhaohui | - |
| dc.contributor.author | Niyato, Dusit | - |
| dc.contributor.author | Shen, Meng | - |
| dc.contributor.author | Jiao, Yutao | - |
| dc.contributor.author | Zhang, Yang | - |
| dc.date.accessioned | 2025-01-13T03:02:54Z | - |
| dc.date.available | 2025-01-13T03:02:54Z | - |
| dc.date.issued | 2024 | - |
| dc.identifier.citation | IEEE Transactions on Cognitive Communications and Networking, 2024 | - |
| dc.identifier.uri | http://hdl.handle.net/10722/353257 | - |
| dc.description.abstract | 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, blockchain-based Web 3.0 is still in its infancy, such as ensuring block freshness and optimizing block propagation to improve 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. | - |
| dc.language | eng | - |
| dc.relation.ispartof | IEEE Transactions on Cognitive Communications and Networking | - |
| dc.subject | age of information | - |
| dc.subject | block propagation | - |
| dc.subject | evolutionary game | - |
| dc.subject | Web 3.0 | - |
| dc.subject | wireless networks | - |
| dc.title | Optimal AoI-based Block Propagation and Incentive Mechanism for Blockchain Networks in Web 3.0 | - |
| dc.type | Article | - |
| dc.description.nature | link_to_subscribed_fulltext | - |
| dc.identifier.doi | 10.1109/TCCN.2024.3522977 | - |
| dc.identifier.scopus | eid_2-s2.0-85213716600 | - |
| dc.identifier.eissn | 2332-7731 | - |
