跳到主要导航 跳到搜索 跳到主要内容

Incentive for Historical Block Data Sharing in Blockchain

  • Beihang University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In blockchain, delivering block data, especially delivering all historical blocks to a new node, will cost lots of bandwidth consumption. This cost may dissuade nodes from sharing their blocks to new or rejoined peer. In this paper, we present some incentive schemes for this kind of data sharing behaviour. In our design, node participating in delivering their storage data to their peers can get some rewards from the node who request the data. We adopt coin-locking strategy to discourage dishonest behaviour in the sharing process. Nodes need not put a large deposit to big data sharing since the data sharing process can be divided into smaller ones, and micropayment channel is set to accelerate the speed of during each small transmitting process. We give a theoretical analysis of our mechanism and discuss its practical application of data sharing in some mainstream cryptocurrencies and blockchains in IoT industry.

源语言英语
主期刊名2019 IEEE 10th Annual Information Technology, Electronics and Mobile Communication Conference, IEMCON 2019
编辑Satyajit Chakrabarti, Himadri Nath Saha
出版商Institute of Electrical and Electronics Engineers Inc.
913-919
页数7
ISBN(电子版)9781728125305
DOI
出版状态已出版 - 10月 2019
活动10th IEEE Annual Information Technology, Electronics and Mobile Communication Conference, IEMCON 2019 - Vancouver, 加拿大
期限: 17 10月 201919 10月 2019

出版系列

姓名2019 IEEE 10th Annual Information Technology, Electronics and Mobile Communication Conference, IEMCON 2019

会议

会议10th IEEE Annual Information Technology, Electronics and Mobile Communication Conference, IEMCON 2019
国家/地区加拿大
Vancouver
时期17/10/1919/10/19

指纹

探究 'Incentive for Historical Block Data Sharing in Blockchain' 的科研主题。它们共同构成独一无二的指纹。

引用此