z-logo
open-access-imgOpen Access
Distributed Incentive Mechanism Based on Hyperledger Fabric
Author(s) -
Baohui Li,
Yadong Fang,
Xu Wang,
Jiaxing Wang,
Lanlan Rui,
Liu M
Publication year - 2022
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2224/1/012130
Subject(s) - credibility , computer science , incentive , reputation , anomaly detection , data mining , outlier , realization (probability) , distributed computing , artificial intelligence , social science , sociology , political science , law , economics , microeconomics , statistics , mathematics
Crowd sensing is a new type of data acquisition method that can efficiently and diversify the realization of sensing tasks. However, this method currently has some problems, such as data storage being overly dependent on third-party platforms, and there is a lack of reliable data credible evaluation methods. To solve this problem, our paper proposes a distributed incentive mechanism based on Hyperledger Fabric (HF-DIM) in the Crowd sensing scenario. In particular, the following questions are studied: How to achieve distributed incentive to solve the traditional incentive that relies on a centralized platform? How to evaluate the credibility of the sensing data provided by the users? To the former question, we implement a multi-attribute auction algorithm based on smart contracts, and distributed incentives are implemented using blockchain deployed contracts. To the latter question, We propose a K-nearest neighbor outlier detection algorithm based on geographic location and similarity to evaluate the credibility of the data and establish a reputation index based on the credibility of the data. Through simulation experiments using real data set, the feasibility and effectiveness of the proposed framework and algorithm are verified.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here