Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Liao, Jiana, Wen, Jinbo, Kang, Jiawen, Yi, Changyan, Zhang, Yang, Jiao, Yutao, Niyato, Dusit, Kim, Dong In, Xie, Shengli
Format: Preprint
Veröffentlicht: 2024
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866910437844451328
author Liao, Jiana
Wen, Jinbo
Kang, Jiawen
Yi, Changyan
Zhang, Yang
Jiao, Yutao
Niyato, Dusit
Kim, Dong In
Xie, Shengli
author_facet Liao, Jiana
Wen, Jinbo
Kang, Jiawen
Yi, Changyan
Zhang, Yang
Jiao, Yutao
Niyato, Dusit
Kim, Dong In
Xie, Shengli
contents Web 3.0 is recognized as a pioneering paradigm that empowers users to securely oversee data without reliance on a centralized authority. Blockchains, as a core technology to realize Web 3.0, can facilitate decentralized and transparent data management. Nevertheless, the evolution of blockchain-enabled Web 3.0 is still in its nascent phase, grappling with challenges such as ensuring efficiency and reliability to enhance block propagation performance. In this paper, we design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. We first innovatively apply a data-freshness metric called age of block to measure block propagation efficiency in public blockchains. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model, including the local and recommended opinions to calculate the miner reputation value. Moreover, considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory. Numerical results demonstrate that the proposed scheme exhibits the most outstanding block propagation efficiency and reliability compared with traditional routing mechanisms.
format Preprint
id arxiv_https___arxiv_org_abs_2403_13237
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0
Liao, Jiana
Wen, Jinbo
Kang, Jiawen
Yi, Changyan
Zhang, Yang
Jiao, Yutao
Niyato, Dusit
Kim, Dong In
Xie, Shengli
Cryptography and Security
Optimization and Control
Web 3.0 is recognized as a pioneering paradigm that empowers users to securely oversee data without reliance on a centralized authority. Blockchains, as a core technology to realize Web 3.0, can facilitate decentralized and transparent data management. Nevertheless, the evolution of blockchain-enabled Web 3.0 is still in its nascent phase, grappling with challenges such as ensuring efficiency and reliability to enhance block propagation performance. In this paper, we design a Graph Attention Network (GAT)-based reliable block propagation optimization framework for blockchain-enabled Web 3.0. We first innovatively apply a data-freshness metric called age of block to measure block propagation efficiency in public blockchains. To achieve the reliability of block propagation, we introduce a reputation mechanism based on the subjective logic model, including the local and recommended opinions to calculate the miner reputation value. Moreover, considering that the GAT possesses the excellent ability to process graph-structured data, we utilize the GAT with reinforcement learning to obtain the optimal block propagation trajectory. Numerical results demonstrate that the proposed scheme exhibits the most outstanding block propagation efficiency and reliability compared with traditional routing mechanisms.
title Graph Attention Network-based Block Propagation with Optimal AoI and Reputation in Web 3.0
topic Cryptography and Security
Optimization and Control
url https://arxiv.org/abs/2403.13237