Distributed Algorithm for Making Scale-free Network by Preferential Rewiring without Growth
- Authors
- Park, J.-H.
- Issue Date
- Jun-2019
- Publisher
- IEEE Computer Society
- Keywords
- and Peer-to-peer network; Distributed algorithm; Network modeling; Scale-free network
- Citation
- IEEE Transactions on Industrial Informatics, v.15, no.6, pp 3125 - 3132
- Pages
- 8
- Journal Title
- IEEE Transactions on Industrial Informatics
- Volume
- 15
- Number
- 6
- Start Page
- 3125
- End Page
- 3132
- URI
- https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/3347
- DOI
- 10.1109/TII.2018.2879663
- ISSN
- 1551-3203
1941-0050
- Abstract
- The digital payment system that uses cryptocurrency, such as Bitcoin, is a distributed ledger working on a peer-to-peer network. We present a method to make a scale-free network for such applications. Using some biased physical quantities that are observable in sites, we can make the scale-free network through processes of cooperating distributed sites. Each node only proposes connecting to the more attractive node among randomly known nodes. The candidate node that is found by each node agrees to set two-way links if the requesting node is more attractive than the old node that already connected. Once they establish the new bidirectional relationship, they respectively remove the outgoing link to the less attractive node. We analytically calculate the connectivity distribution and show the scaling exponent is 2.5. By Monte Carlo simulations, we confirm that a power law distribution of the scaling exponent 2.5 describes the degree distribution of the topology. IEEE
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Software > School of Computer Science and Engineering > 1. Journal Articles
![qrcode](https://api.qrserver.com/v1/create-qr-code/?size=55x55&data=https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/3347)
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.