Abstract
Unreachable nodes refer to nodes that don't accept connection requests in the Bitcoin network, which are difficult to detect and verify. The existing studies mostly focused on the reachable nodes, but less on the unreachable nodes. A new approach is proposed to find the unreachable nodes based on a decision tree model, which can automatically classify unreachable nodes from a large numberof Bitcoin addresses. The results show that the proposed approach got an accuracy of 95.73% and a recall of 91.97% on the experimental dataset. The author applied the approach to the real dataset and verified it by the cyberspace search engines. The proposed approach’s accuracy was 53.75% and the recall was about 76.86%. The distribution of network providers, geographical areas, and the overall number of Unreachable nodes were discussed, which provided technical support for Bitcoin supervision.
| Translated title of the contribution | A decision tree-based discovery method for Bitcoin unreachable nodes |
|---|---|
| Original language | Chinese (Traditional) |
| Pages (from-to) | 1861-1867 |
| Number of pages | 7 |
| Journal | Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics |
| Volume | 50 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - Jun 2024 |